[{"quality_controlled":"1","year":"2022","external_id":{"isi":["000860924200005"]},"article_type":"original","keyword":["General Mathematics"],"file":[{"date_created":"2023-02-02T07:39:09Z","success":1,"relation":"main_file","creator":"dernst","file_name":"2022_AdvancesMathematics_Drach.pdf","checksum":"2710e6f5820f8c20a676ddcbb30f0e8d","access_level":"open_access","file_id":"12474","file_size":2164036,"content_type":"application/pdf","date_updated":"2023-02-02T07:39:09Z"}],"oa":1,"date_published":"2022-10-29T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1016/j.aim.2022.108591","publisher":"Elsevier","issue":"Part A","publication_status":"published","citation":{"short":"K. Drach, D. Schleicher, Advances in Mathematics 408 (2022).","ista":"Drach K, Schleicher D. 2022. Rigidity of Newton dynamics. Advances in Mathematics. 408(Part A), 108591.","chicago":"Drach, Kostiantyn, and Dierk Schleicher. “Rigidity of Newton Dynamics.” <i>Advances in Mathematics</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.aim.2022.108591\">https://doi.org/10.1016/j.aim.2022.108591</a>.","mla":"Drach, Kostiantyn, and Dierk Schleicher. “Rigidity of Newton Dynamics.” <i>Advances in Mathematics</i>, vol. 408, no. Part A, 108591, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.aim.2022.108591\">10.1016/j.aim.2022.108591</a>.","ieee":"K. Drach and D. Schleicher, “Rigidity of Newton dynamics,” <i>Advances in Mathematics</i>, vol. 408, no. Part A. Elsevier, 2022.","ama":"Drach K, Schleicher D. Rigidity of Newton dynamics. <i>Advances in Mathematics</i>. 2022;408(Part A). doi:<a href=\"https://doi.org/10.1016/j.aim.2022.108591\">10.1016/j.aim.2022.108591</a>","apa":"Drach, K., &#38; Schleicher, D. (2022). Rigidity of Newton dynamics. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2022.108591\">https://doi.org/10.1016/j.aim.2022.108591</a>"},"volume":408,"type":"journal_article","corr_author":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"11717","scopus_import":"1","month":"10","publication":"Advances in Mathematics","ec_funded":1,"publication_identifier":{"issn":["0001-8708"]},"article_processing_charge":"Yes (via OA deal)","date_created":"2022-08-01T17:08:16Z","file_date_updated":"2023-02-02T07:39:09Z","status":"public","acknowledgement":"We are grateful to a number of colleagues for helpful and inspiring discussions during the time when we worked on this project, in particular Dima Dudko, Misha Hlushchanka, John Hubbard, Misha Lyubich, Oleg Kozlovski, and Sebastian van Strien. Finally, we would like to thank our dynamics research group for numerous helpful and enjoyable discussions: Konstantin Bogdanov, Roman Chernov, Russell Lodge, Steffen Maaß, David Pfrang, Bernhard Reinke, Sergey Shemyakov, and Maik Sowinski. We gratefully acknowledge support by the Advanced Grant “HOLOGRAM” (#695 621) of the European Research Council (ERC), as well as hospitality of Cornell University in the spring of 2018 while much of this work was prepared. The first-named author also acknowledges the support of the ERC Advanced Grant “SPERIG” (#885 707).","article_number":"108591","oa_version":"Published Version","date_updated":"2025-04-14T07:53:45Z","intvolume":"       408","abstract":[{"text":"We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit can be distinguished in combinatorial terms from all other orbits), or the orbit of this point eventually lands in the filled-in Julia set of a polynomial-like restriction of the original map. As a corollary, we show that the Julia sets of Newton maps in many non-trivial cases are locally connected; in particular, every cubic Newton map without Siegel points has locally connected Julia set.\r\nIn the parameter space of Newton maps of arbitrary degree we obtain the following rigidity result: any two combinatorially equivalent Newton maps are quasiconformally conjugate in a neighborhood of their Julia sets provided that they either non-renormalizable, or they are both renormalizable “in the same way”.\r\nOur main tool is a generalized renormalization concept called “complex box mappings” for which we extend a dynamical rigidity result by Kozlovski and van Strien so as to include irrationally indifferent and renormalizable situations.","lang":"eng"}],"author":[{"orcid":"0000-0002-9156-8616","first_name":"Kostiantyn","id":"fe8209e2-906f-11eb-847d-950f8fc09115","full_name":"Drach, Kostiantyn","last_name":"Drach"},{"first_name":"Dierk","last_name":"Schleicher","full_name":"Schleicher, Dierk"}],"isi":1,"has_accepted_license":"1","department":[{"_id":"VaKa"}],"project":[{"grant_number":"885707","call_identifier":"H2020","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","name":"Spectral rigidity and integrability for billiards and geodesic flows"}],"title":"Rigidity of Newton dynamics","ddc":["510"],"day":"29"},{"external_id":{"isi":["000881496900002"],"pmid":["35878023"]},"year":"2022","quality_controlled":"1","issue":"31","publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"doi":"10.1073/pnas.2121058119","date_published":"2022-07-25T00:00:00Z","oa":1,"file":[{"date_created":"2022-08-08T07:42:09Z","success":1,"creator":"dernst","relation":"main_file","file_name":"2022_PNAS_Li.pdf","access_level":"open_access","checksum":"ae6f19b0d9efba6687f9e4dc1bab1d6e","file_id":"11747","file_size":2506262,"content_type":"application/pdf","date_updated":"2022-08-08T07:42:09Z"}],"keyword":["Multidisciplinary"],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":119,"type":"journal_article","corr_author":"1","citation":{"ieee":"L. Li <i>et al.</i>, “RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. National Academy of Sciences, 2022.","apa":"Li, L., Chen, H., Alotaibi, S. S., Pěnčík, A., Adamowski, M., Novák, O., &#38; Friml, J. (2022). RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2121058119\">https://doi.org/10.1073/pnas.2121058119</a>","ama":"Li L, Chen H, Alotaibi SS, et al. RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2121058119\">10.1073/pnas.2121058119</a>","short":"L. Li, H. Chen, S.S. Alotaibi, A. Pěnčík, M. Adamowski, O. Novák, J. Friml, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","chicago":"Li, Lanxin, Huihuang Chen, Saqer S. Alotaibi, Aleš Pěnčík, Maciek Adamowski, Ondřej Novák, and Jiří Friml. “RALF1 Peptide Triggers Biphasic Root Growth Inhibition Upstream of Auxin Biosynthesis.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2121058119\">https://doi.org/10.1073/pnas.2121058119</a>.","mla":"Li, Lanxin, et al. “RALF1 Peptide Triggers Biphasic Root Growth Inhibition Upstream of Auxin Biosynthesis.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2121058119, National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2121058119\">10.1073/pnas.2121058119</a>.","ista":"Li L, Chen H, Alotaibi SS, Pěnčík A, Adamowski M, Novák O, Friml J. 2022. RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2121058119."},"publication_status":"published","scopus_import":"1","month":"07","pmid":1,"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"_id":"11723","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"publication":"Proceedings of the National Academy of Sciences of the United States of America","acknowledgement":"We thank Sarah M. Assmann, Kris Vissenberg, and Nadine Paris for kindly sharing seeds; Matyáš Fendrych for initiating this project and providing constant support; Lukas Fiedler for revising the manuscript; and Huibin Han and Arseny Savin for contributing to genotyping. This work was supported by the Austrian Science Fund (FWF) I 3630-B25 (to J.F.) and the Doctoral Fellowship Progrmme of the Austrian Academy of Sciences (to L.L.) We also acknowledge Taif University Researchers Supporting Project TURSP-HC2021/02 and funding “Plants as a tool for sustainable global development (no. CZ.02.1.01/0.0/0.0/16_019/0000827).”","status":"public","file_date_updated":"2022-08-08T07:42:09Z","date_created":"2022-08-04T20:06:49Z","article_processing_charge":"No","author":[{"last_name":"Li","full_name":"Li, Lanxin","first_name":"Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5607-272X"},{"full_name":"Chen, Huihuang","last_name":"Chen","first_name":"Huihuang","id":"83c96512-15b2-11ec-abd3-b7eede36184f"},{"first_name":"Saqer S.","full_name":"Alotaibi, Saqer S.","last_name":"Alotaibi"},{"full_name":"Pěnčík, Aleš","last_name":"Pěnčík","first_name":"Aleš"},{"last_name":"Adamowski","full_name":"Adamowski, Maciek","first_name":"Maciek","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6463-5257"},{"last_name":"Novák","full_name":"Novák, Ondřej","first_name":"Ondřej"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","full_name":"Friml, Jiří","last_name":"Friml"}],"abstract":[{"text":"Plant cell growth responds rapidly to various stimuli, adapting architecture to environmental changes. Two major endogenous signals regulating growth are the phytohormone auxin and the secreted peptides rapid alkalinization factors (RALFs). Both trigger very rapid cellular responses and also exert long-term effects [Du et al., Annu. Rev. Plant Biol. 71, 379–402 (2020); Blackburn et al., Plant Physiol. 182, 1657–1666 (2020)]. However, the way, in which these distinct signaling pathways converge to regulate growth, remains unknown. Here, using vertical confocal microscopy combined with a microfluidic chip, we addressed the mechanism of RALF action on growth. We observed correlation between RALF1-induced rapid Arabidopsis thaliana root growth inhibition and apoplast alkalinization during the initial phase of the response, and revealed that RALF1 reversibly inhibits primary root growth through apoplast alkalinization faster than within 1 min. This rapid apoplast alkalinization was the result of RALF1-induced net H+ influx and was mediated by the receptor FERONIA (FER). Furthermore, we investigated the cross-talk between RALF1 and the auxin signaling pathways during root growth regulation. The results showed that RALF-FER signaling triggered auxin signaling with a delay of approximately 1 h by up-regulating auxin biosynthesis, thus contributing to sustained RALF1-induced growth inhibition. This biphasic RALF1 action on growth allows plants to respond rapidly to environmental stimuli and also reprogram growth and development in the long term.","lang":"eng"}],"intvolume":"       119","date_updated":"2025-05-14T11:01:00Z","article_number":"e2121058119","oa_version":"Published Version","day":"25","ddc":["580"],"title":"RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis","project":[{"name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630","call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425"},{"name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root","_id":"26B4D67E-B435-11E9-9278-68D0E5697425","grant_number":"25351"}],"department":[{"_id":"GradSch"},{"_id":"JiFr"}],"has_accepted_license":"1","isi":1},{"publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"ec_funded":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19540"},{"id":"18135","relation":"dissertation_contains","status":"public"}]},"publication":"Journal of Statistical Physics","acknowledgement":"We are grateful to Robert Seiringer for helpful discussions and many valuable comments\r\non an earlier version of the manuscript. J.H. acknowledges partial financial support by the ERC Advanced Grant “RMTBeyond’ No. 101020331. Open access funding provided by Institute of Science and Technology (IST Austria)","date_created":"2022-08-05T11:36:56Z","file_date_updated":"2022-08-08T07:36:34Z","status":"public","article_processing_charge":"Yes (via OA deal)","author":[{"id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","first_name":"Sven Joscha","orcid":"0000-0003-1106-327X","last_name":"Henheik","full_name":"Henheik, Sven Joscha"},{"first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","orcid":"0000-0003-4476-2288","last_name":"Lauritsen","full_name":"Lauritsen, Asbjørn Bækgaard"}],"abstract":[{"lang":"eng","text":"We study the BCS energy gap Ξ in the high–density limit and derive an asymptotic formula, which strongly depends on the strength of the interaction potential V on the Fermi surface. In combination with the recent result by one of us (Math. Phys. Anal. Geom. 25, 3, 2022) on the critical temperature Tc at high densities, we prove the universality of the ratio of the energy gap and the critical temperature."}],"article_number":"5","oa_version":"Published Version","date_updated":"2026-04-07T13:01:40Z","intvolume":"       189","ddc":["530"],"day":"29","title":"The BCS energy gap at high density","department":[{"_id":"GradSch"},{"_id":"LaEr"},{"_id":"RoSe"}],"project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020"}],"isi":1,"has_accepted_license":"1","external_id":{"isi":["000833007200002"]},"quality_controlled":"1","year":"2022","publisher":"Springer Nature","doi":"10.1007/s10955-022-02965-9","date_published":"2022-07-29T00:00:00Z","language":[{"iso":"eng"}],"file":[{"file_size":419563,"date_updated":"2022-08-08T07:36:34Z","content_type":"application/pdf","checksum":"b398c4dbf65f71d417981d6e366427e9","access_level":"open_access","file_name":"2022_JourStatisticalPhysics_Henheik.pdf","file_id":"11746","success":1,"relation":"main_file","creator":"dernst","date_created":"2022-08-08T07:36:34Z"}],"oa":1,"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"article_type":"original","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","corr_author":"1","type":"journal_article","volume":189,"publication_status":"published","citation":{"chicago":"Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “The BCS Energy Gap at High Density.” <i>Journal of Statistical Physics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10955-022-02965-9\">https://doi.org/10.1007/s10955-022-02965-9</a>.","mla":"Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “The BCS Energy Gap at High Density.” <i>Journal of Statistical Physics</i>, vol. 189, 5, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s10955-022-02965-9\">10.1007/s10955-022-02965-9</a>.","ista":"Henheik SJ, Lauritsen AB. 2022. The BCS energy gap at high density. Journal of Statistical Physics. 189, 5.","short":"S.J. Henheik, A.B. Lauritsen, Journal of Statistical Physics 189 (2022).","apa":"Henheik, S. J., &#38; Lauritsen, A. B. (2022). The BCS energy gap at high density. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-022-02965-9\">https://doi.org/10.1007/s10955-022-02965-9</a>","ama":"Henheik SJ, Lauritsen AB. The BCS energy gap at high density. <i>Journal of Statistical Physics</i>. 2022;189. doi:<a href=\"https://doi.org/10.1007/s10955-022-02965-9\">10.1007/s10955-022-02965-9</a>","ieee":"S. J. Henheik and A. B. Lauritsen, “The BCS energy gap at high density,” <i>Journal of Statistical Physics</i>, vol. 189. Springer Nature, 2022."},"scopus_import":"1","month":"07","_id":"11732","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"}},{"day":"29","ddc":["570"],"title":"Improving GWAS discovery and genomic prediction accuracy in biobank data","department":[{"_id":"MaRo"}],"has_accepted_license":"1","isi":1,"author":[{"first_name":"Etienne J.","full_name":"Orliac, Etienne J.","last_name":"Orliac"},{"full_name":"Trejo Banos, Daniel","last_name":"Trejo Banos","first_name":"Daniel"},{"first_name":"Sven E.","last_name":"Ojavee","full_name":"Ojavee, Sven E."},{"first_name":"Kristi","full_name":"Läll, Kristi","last_name":"Läll"},{"full_name":"Mägi, Reedik","last_name":"Mägi","first_name":"Reedik"},{"last_name":"Visscher","full_name":"Visscher, Peter M.","first_name":"Peter M."},{"first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","last_name":"Robinson","full_name":"Robinson, Matthew Richard"}],"abstract":[{"lang":"eng","text":"Genetically informed, deep-phenotyped biobanks are an important research resource and it is imperative that the most powerful, versatile, and efficient analysis approaches are used. Here, we apply our recently developed Bayesian grouped mixture of regressions model (GMRM) in the UK and Estonian Biobanks and obtain the highest genomic prediction accuracy reported to date across 21 heritable traits. When compared to other approaches, GMRM accuracy was greater than annotation prediction models run in the LDAK or LDPred-funct software by 15% (SE 7%) and 14% (SE 2%), respectively, and was 18% (SE 3%) greater than a baseline BayesR model without single-nucleotide polymorphism (SNP) markers grouped into minor allele frequency–linkage disequilibrium (MAF-LD) annotation categories. For height, the prediction accuracy R2 was 47% in a UK Biobank holdout sample, which was 76% of the estimated h2SNP. We then extend our GMRM prediction model to provide mixed-linear model association (MLMA) SNP marker estimates for genome-wide association (GWAS) discovery, which increased the independent loci detected to 16,162 in unrelated UK Biobank individuals, compared to 10,550 from BoltLMM and 10,095 from Regenie, a 62 and 65% increase, respectively. The average χ2 value of the leading markers increased by 15.24 (SE 0.41) for every 1% increase in prediction accuracy gained over a baseline BayesR model across the traits. Thus, we show that modeling genetic associations accounting for MAF and LD differences among SNP markers, and incorporating prior knowledge of genomic function, is important for both genomic prediction and discovery in large-scale individual-level studies."}],"date_updated":"2025-06-12T06:22:37Z","intvolume":"       119","oa_version":"Published Version","article_number":"e2121279119","acknowledgement":"This project was funded by Swiss National Science Foundation Eccellenza Grant PCEGP3-181181(toM.R.R.) and by core funding from the Institute of Science and Technology Austria. P.M.V. acknowledges funding from the Australian National Health and Medical Research Council (1113400) and the Australian Research Council (FL180100072). K.L. and R.M. were supported by the Estonian Research Council Grant PRG687. Estonian Biobank computations were performed in the High-Performance Computing Centre, University of Tartu.","file_date_updated":"2022-08-08T07:31:19Z","status":"public","date_created":"2022-08-07T22:01:56Z","article_processing_charge":"No","publication_identifier":{"eissn":["1091-6490"]},"publication":"Proceedings of the National Academy of Sciences of the United States of America","related_material":{"record":[{"status":"public","id":"13064","relation":"research_data"}]},"scopus_import":"1","month":"07","pmid":1,"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"_id":"11733","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","type":"journal_article","volume":119,"citation":{"mla":"Orliac, Etienne J., et al. “Improving GWAS Discovery and Genomic Prediction Accuracy in Biobank Data.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2121279119, National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2121279119\">10.1073/pnas.2121279119</a>.","chicago":"Orliac, Etienne J., Daniel Trejo Banos, Sven E. Ojavee, Kristi Läll, Reedik Mägi, Peter M. Visscher, and Matthew Richard Robinson. “Improving GWAS Discovery and Genomic Prediction Accuracy in Biobank Data.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2121279119\">https://doi.org/10.1073/pnas.2121279119</a>.","ista":"Orliac EJ, Trejo Banos D, Ojavee SE, Läll K, Mägi R, Visscher PM, Robinson MR. 2022. Improving GWAS discovery and genomic prediction accuracy in biobank data. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2121279119.","short":"E.J. Orliac, D. Trejo Banos, S.E. Ojavee, K. Läll, R. Mägi, P.M. Visscher, M.R. Robinson, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","ama":"Orliac EJ, Trejo Banos D, Ojavee SE, et al. Improving GWAS discovery and genomic prediction accuracy in biobank data. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2121279119\">10.1073/pnas.2121279119</a>","apa":"Orliac, E. J., Trejo Banos, D., Ojavee, S. E., Läll, K., Mägi, R., Visscher, P. M., &#38; Robinson, M. R. (2022). Improving GWAS discovery and genomic prediction accuracy in biobank data. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2121279119\">https://doi.org/10.1073/pnas.2121279119</a>","ieee":"E. J. Orliac <i>et al.</i>, “Improving GWAS discovery and genomic prediction accuracy in biobank data,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. National Academy of Sciences, 2022."},"publication_status":"published","issue":"31","language":[{"iso":"eng"}],"date_published":"2022-07-29T00:00:00Z","publisher":"National Academy of Sciences","doi":"10.1073/pnas.2121279119","oa":1,"file":[{"file_name":"2022_PNAS_Orliac.pdf","checksum":"b5d2024e19fbad6f85a5e384e44d0f3b","access_level":"open_access","file_id":"11745","file_size":1001164,"content_type":"application/pdf","date_updated":"2022-08-08T07:31:19Z","date_created":"2022-08-08T07:31:19Z","success":1,"relation":"main_file","creator":"dernst"}],"article_type":"original","external_id":{"pmid":["35905320"],"isi":["000881496900003"]},"year":"2022","quality_controlled":"1"},{"issue":"31","date_published":"2022-07-25T00:00:00Z","language":[{"iso":"eng"}],"publisher":"National Academy of Sciences","doi":"10.1073/pnas.2122460119","oa":1,"file":[{"file_size":3092330,"date_updated":"2022-08-08T07:09:58Z","content_type":"application/pdf","checksum":"6e97dedc281247fc3fe238a209f14af0","access_level":"open_access","file_name":"2022_PNAS_Abualia.pdf","file_id":"11744","success":1,"relation":"main_file","creator":"dernst","date_created":"2022-08-08T07:09:58Z"}],"article_type":"original","external_id":{"isi":["000881496900007"],"pmid":["35878040"]},"year":"2022","quality_controlled":"1","scopus_import":"1","month":"07","pmid":1,"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"_id":"11734","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","type":"journal_article","volume":119,"citation":{"short":"R. Abualia, K. Ötvös, O. Novák, E. Bouguyon, K. Domanegg, A. Krapp, P. Nacry, A. Gojon, B. Lacombe, E. Benková, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","chicago":"Abualia, Rashed, Krisztina Ötvös, Ondřej Novák, Eleonore Bouguyon, Kevin Domanegg, Anne Krapp, Philip Nacry, Alain Gojon, Benoit Lacombe, and Eva Benková. “Molecular Framework Integrating Nitrate Sensing in Root and Auxin-Guided Shoot Adaptive Responses.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2122460119\">https://doi.org/10.1073/pnas.2122460119</a>.","ista":"Abualia R, Ötvös K, Novák O, Bouguyon E, Domanegg K, Krapp A, Nacry P, Gojon A, Lacombe B, Benková E. 2022. Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2122460119.","mla":"Abualia, Rashed, et al. “Molecular Framework Integrating Nitrate Sensing in Root and Auxin-Guided Shoot Adaptive Responses.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2122460119, National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2122460119\">10.1073/pnas.2122460119</a>.","ieee":"R. Abualia <i>et al.</i>, “Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. National Academy of Sciences, 2022.","ama":"Abualia R, Ötvös K, Novák O, et al. Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2122460119\">10.1073/pnas.2122460119</a>","apa":"Abualia, R., Ötvös, K., Novák, O., Bouguyon, E., Domanegg, K., Krapp, A., … Benková, E. (2022). Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2122460119\">https://doi.org/10.1073/pnas.2122460119</a>"},"publication_status":"published","acknowledgement":"We acknowledge Hana Semeradova, Juan Carlos Montesinos, Nicola Cavallari, Marc¸al Gallem\u0003ı, Kaori Tabata, Andrej Hurn\u0003y, and Sascha Waidmann for sharing materials; and Marina Borges Osorio for critical reading of the manuscript. Work in the E. Benkova laboratory was supported by the Austrian Science Fund (FWF01_I1774S) to K.O., R.A., and E. Benkova. We acknowledge the Bioimaging Facility and Life Science Facilities of the Institute of Science\r\nand Technology Austria. We give sincere thanks to Hana Martınkova and Petra Amakorova for their help with cytokinin analyses. This work was funded by the Czech Science Foundation (Project No. 19-00973S).","file_date_updated":"2022-08-08T07:09:58Z","status":"public","date_created":"2022-08-07T22:01:57Z","article_processing_charge":"No","publication_identifier":{"eissn":["1091-6490"]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"publication":"Proceedings of the National Academy of Sciences of the United States of America","day":"25","ddc":["570"],"title":"Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses","project":[{"_id":"2542D156-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I 1774-B16","name":"Hormone cross-talk drives nutrient dependent plant development"}],"department":[{"_id":"EvBe"}],"has_accepted_license":"1","isi":1,"author":[{"orcid":"0000-0002-9357-9415","first_name":"Rashed","id":"4827E134-F248-11E8-B48F-1D18A9856A87","full_name":"Abualia, Rashed","last_name":"Abualia"},{"last_name":"Ötvös","full_name":"Ötvös, Krisztina","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","first_name":"Krisztina","orcid":"0000-0002-5503-4983"},{"full_name":"Novák, Ondřej","last_name":"Novák","first_name":"Ondřej"},{"last_name":"Bouguyon","full_name":"Bouguyon, Eleonore","first_name":"Eleonore"},{"last_name":"Domanegg","full_name":"Domanegg, Kevin","first_name":"Kevin","id":"a24c7829-16e8-11ed-8527-c4d36ffb7539","orcid":"0000-0002-1215-4264"},{"last_name":"Krapp","full_name":"Krapp, Anne","first_name":"Anne"},{"first_name":"Philip","full_name":"Nacry, Philip","last_name":"Nacry"},{"last_name":"Gojon","full_name":"Gojon, Alain","first_name":"Alain"},{"first_name":"Benoit","last_name":"Lacombe","full_name":"Lacombe, Benoit"},{"last_name":"Benková","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","orcid":"0000-0002-8510-9739"}],"abstract":[{"text":"Mineral nutrition is one of the key environmental factors determining plant development and growth. Nitrate is the major form of macronutrient nitrogen that plants take up from the soil. Fluctuating availability or deficiency of this element severely limits plant growth and negatively affects crop production in the agricultural system. To cope with the heterogeneity of nitrate distribution in soil, plants evolved a complex regulatory mechanism that allows rapid adjustment of physiological and developmental processes to the status of this nutrient. The root, as a major exploitation organ that controls the uptake of nitrate to the plant body, acts as a regulatory hub that, according to nitrate availability, coordinates the growth and development of other plant organs. Here, we identified a regulatory framework, where cytokinin response factors (CRFs) play a central role as a molecular readout of the nitrate status in roots to guide shoot adaptive developmental response. We show that nitrate-driven activation of NLP7, a master regulator of nitrate response in plants, fine tunes biosynthesis of cytokinin in roots and its translocation to shoots where it enhances expression of CRFs. CRFs, through direct transcriptional regulation of PIN auxin transporters, promote the flow of auxin and thereby stimulate the development of shoot organs.","lang":"eng"}],"intvolume":"       119","date_updated":"2025-05-14T11:00:29Z","article_number":"e2122460119","oa_version":"Published Version"},{"year":"2022","quality_controlled":"1","external_id":{"isi":["000830989200018"]},"article_type":"original","issue":"4","publisher":"Association for Computing Machinery","date_published":"2022-07-22T00:00:00Z","doi":"10.1145/3528223.3530071","language":[{"iso":"eng"}],"oa":1,"file":[{"date_updated":"2022-08-28T07:56:19Z","content_type":"application/pdf","file_size":16896871,"file_id":"11992","checksum":"0b51651be45b1b33f2072bd5d2686c69","access_level":"open_access","file_name":"Chen-2022-High-LevelPuzzle_authorVersion.pdf","creator":"bbickel","relation":"main_file","success":1,"date_created":"2022-08-28T07:56:19Z"}],"type":"journal_article","volume":41,"citation":{"short":"R. Chen, Z. Wang, P. Song, B. Bickel, ACM Transactions on Graphics 41 (2022).","mla":"Chen, Rulin, et al. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 150, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>.","ista":"Chen R, Wang Z, Song P, Bickel B. 2022. Computational design of high-level interlocking puzzles. ACM Transactions on Graphics. 41(4), 150.","chicago":"Chen, Rulin, Ziqi Wang, Peng Song, and Bernd Bickel. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>.","ieee":"R. Chen, Z. Wang, P. Song, and B. Bickel, “Computational design of high-level interlocking puzzles,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","apa":"Chen, R., Wang, Z., Song, P., &#38; Bickel, B. (2022). Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>","ama":"Chen R, Wang Z, Song P, Bickel B. Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>"},"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"11735","scopus_import":"1","month":"07","related_material":{"link":[{"relation":"press_release","description":"News on ISTA website","url":"https://ista.ac.at/en/news/unlocking-interlocking-riddles/"}]},"publication":"ACM Transactions on Graphics","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"ec_funded":1,"article_processing_charge":"No","acknowledgement":"We thank the reviewers for the valuable comments, David Gontier for sharing the source code of the baseline design approach, Christian Hafner for proofreading the paper, Keenan Crane for the 3D model of Cow, and Thingiverse for the 3D models of Moai and Owl. This work was supported by the SUTD Start-up Research Grant (Number: SRG ISTD 2019 148), the Swiss National Science Foundation (NCCR Digital Fabrication Agreement #51NF40-141853), and\r\nthe European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No 715767 – MATERIALIZABLE).","file_date_updated":"2022-08-28T07:56:19Z","status":"public","date_created":"2022-08-07T22:01:57Z","abstract":[{"text":"Interlocking puzzles are intriguing geometric games where the puzzle pieces are held together based on their geometric arrangement, preventing the puzzle from falling apart. High-level-of-difficulty, or simply high-level, interlocking puzzles are a subclass of interlocking puzzles that require multiple moves to take out the first subassembly from the puzzle. Solving a high-level interlocking puzzle is a challenging task since one has to explore many different configurations of the puzzle pieces until reaching a configuration where the first subassembly can be taken out. Designing a high-level interlocking puzzle with a user-specified level of difficulty is even harder since the puzzle pieces have to be interlocking in all the configurations before the first subassembly is taken out.\r\n\r\nIn this paper, we present a computational approach to design high-level interlocking puzzles. The core idea is to represent all possible configurations of an interlocking puzzle as well as transitions among these configurations using a rooted, undirected graph called a disassembly graph and leverage this graph to find a disassembly plan that requires a minimal number of moves to take out the first subassembly from the puzzle. At the design stage, our algorithm iteratively constructs the geometry of each puzzle piece to expand the disassembly graph incrementally, aiming to achieve a user-specified level of difficulty. We show that our approach allows efficient generation of high-level interlocking puzzles of various shape complexities, including new solutions not attainable by state-of-the-art approaches.","lang":"eng"}],"date_updated":"2025-04-14T07:28:57Z","intvolume":"        41","oa_version":"Submitted Version","article_number":"150","author":[{"first_name":"Rulin","full_name":"Chen, Rulin","last_name":"Chen"},{"first_name":"Ziqi","full_name":"Wang, Ziqi","last_name":"Wang"},{"first_name":"Peng","last_name":"Song","full_name":"Song, Peng"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bickel, Bernd"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767"}],"department":[{"_id":"BeBi"}],"has_accepted_license":"1","isi":1,"day":"22","ddc":["000"],"title":"Computational design of high-level interlocking puzzles"},{"title":"Estimation of yarn-level simulation models for production fabrics","day":"22","ddc":["000"],"isi":1,"department":[{"_id":"ChWo"}],"author":[{"id":"4DD40360-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","full_name":"Sperl, Georg","last_name":"Sperl"},{"first_name":"Rosa M.","full_name":"Sánchez-Banderas, Rosa M.","last_name":"Sánchez-Banderas"},{"full_name":"Li, Manwen","last_name":"Li","first_name":"Manwen"},{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","last_name":"Wojtan"},{"first_name":"Miguel A.","full_name":"Otaduy, Miguel A.","last_name":"Otaduy"}],"intvolume":"        41","date_updated":"2026-06-18T17:20:41Z","article_number":"65","oa_version":"Published Version","abstract":[{"text":"This paper introduces a methodology for inverse-modeling of yarn-level mechanics of cloth, based on the mechanical response of fabrics in the real world. We compiled a database from physical tests of several different knitted fabrics used in the textile industry. These data span different types of complex knit patterns, yarn compositions, and fabric finishes, and the results demonstrate diverse physical properties like stiffness, nonlinearity, and anisotropy.\r\n\r\nWe then develop a system for approximating these mechanical responses with yarn-level cloth simulation. To do so, we introduce an efficient pipeline for converting between fabric-level data and yarn-level simulation, including a novel swatch-level approximation for speeding up computation, and some small-but-necessary extensions to yarn-level models used in computer graphics. The dataset used for this paper can be found at http://mslab.es/projects/YarnLevelFabrics.","lang":"eng"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3528223.3530167"}],"date_created":"2022-08-07T22:01:58Z","acknowledgement":"We wish to thank the anonymous reviewers for their helpful comments. To develop this project, we were helped by many people both at Under Armour (Clay Dean, Randall Harward, Kyle Blakely, Craig Simile, Michael Seiz, Brooke Malone, Brittainy McFarland, Emilie Phan, Lindsey Kern, Courtney Oswald, Haley Barkley, Bob Chin, Adam Bayer, Connie Kwok, Marielle Newman, Nick Pence, Allison Hicks, Allison White, Candace Rubenstein, Jeremy Stangland, Fred Fagergren, Michael Mazzoleni, Nathaniel Berry, Manuel Frank) and SEDDI (Gabriel Cirio, Alejandro Rodríguez, Sofía Dominguez, Alicia Nicas, Elena Garcés, Daniel Rodríguez, David Pascual, Manuel Godoy, Sergio Suja, Sergio Ruiz, Roberto Condori, Alberto Martín, Graham Sullivan). We also thank the members of the Visual Computing Group at IST Austria and the Multimodal Simulation Lab at URJC for their feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing, and it was funded in part by the European Research Council (ERC Consolidator Grant 772738 TouchDesign).","article_processing_charge":"No","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"publication":"ACM Transactions on Graphics","related_material":{"link":[{"url":"https://ista.ac.at/en/news/digital-yarn-real-socks/","relation":"press_release","description":"News on the ISTA website"}],"record":[{"relation":"dissertation_contains","id":"12358","status":"public"}]},"acknowledged_ssus":[{"_id":"ScienComp"}],"scopus_import":"1","month":"07","_id":"11736","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"G. Sperl, R.M. Sánchez-Banderas, M. Li, C. Wojtan, M.A. Otaduy, ACM Transactions on Graphics 41 (2022).","ista":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. 2022. Estimation of yarn-level simulation models for production fabrics. ACM Transactions on Graphics. 41(4), 65.","mla":"Sperl, Georg, et al. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 65, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>.","chicago":"Sperl, Georg, Rosa M. Sánchez-Banderas, Manwen Li, Chris Wojtan, and Miguel A. Otaduy. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>.","ieee":"G. Sperl, R. M. Sánchez-Banderas, M. Li, C. Wojtan, and M. A. Otaduy, “Estimation of yarn-level simulation models for production fabrics,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","ama":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>","apa":"Sperl, G., Sánchez-Banderas, R. M., Li, M., Wojtan, C., &#38; Otaduy, M. A. (2022). Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>"},"publication_status":"published","volume":41,"type":"journal_article","oa":1,"issue":"4","language":[{"iso":"eng"}],"doi":"10.1145/3528223.3530167","date_published":"2022-07-22T00:00:00Z","publisher":"Association for Computing Machinery","article_type":"original","external_id":{"isi":["000830989200114"]},"year":"2022","quality_controlled":"1"},{"quality_controlled":"1","year":"2022","external_id":{"isi":["000834349200010"]},"article_type":"original","doi":"10.1103/PhysRevB.106.045302","publisher":"American Physical Society","language":[{"iso":"eng"}],"date_published":"2022-07-15T00:00:00Z","issue":"4","file":[{"date_updated":"2022-08-08T06:58:22Z","content_type":"application/pdf","file_size":774455,"file_id":"11743","checksum":"115aff9e0cde2f806cb26953d7262791","access_level":"open_access","file_name":"2022_PhysRevB_Dziom.pdf","creator":"dernst","relation":"main_file","success":1,"date_created":"2022-08-08T06:58:22Z"}],"oa":1,"type":"journal_article","volume":106,"publication_status":"published","citation":{"ieee":"U. Dziom <i>et al.</i>, “Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells,” <i>Physical Review B</i>, vol. 106, no. 4. American Physical Society, 2022.","apa":"Dziom, U., Shuvaev, A., Gospodarič, J., Novik, E. G., Dobretsova, A. A., Mikhailov, N. N., … Pimenov, A. (2022). Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">https://doi.org/10.1103/PhysRevB.106.045302</a>","ama":"Dziom U, Shuvaev A, Gospodarič J, et al. Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. <i>Physical Review B</i>. 2022;106(4). doi:<a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">10.1103/PhysRevB.106.045302</a>","ista":"Dziom U, Shuvaev A, Gospodarič J, Novik EG, Dobretsova AA, Mikhailov NN, Kvon ZD, Alpichshev Z, Pimenov A. 2022. Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. Physical Review B. 106(4), 045302.","chicago":"Dziom, Uladzislau, A. Shuvaev, J. Gospodarič, E. G. Novik, A. A. Dobretsova, N. N. Mikhailov, Z. D. Kvon, Zhanybek Alpichshev, and A. Pimenov. “Universal Transparency and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” <i>Physical Review B</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">https://doi.org/10.1103/PhysRevB.106.045302</a>.","mla":"Dziom, Uladzislau, et al. “Universal Transparency and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” <i>Physical Review B</i>, vol. 106, no. 4, 045302, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">10.1103/PhysRevB.106.045302</a>.","short":"U. Dziom, A. Shuvaev, J. Gospodarič, E.G. Novik, A.A. Dobretsova, N.N. Mikhailov, Z.D. Kvon, Z. Alpichshev, A. Pimenov, Physical Review B 106 (2022)."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"11737","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"scopus_import":"1","month":"07","publication":"Physical Review B","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"article_processing_charge":"No","acknowledgement":"This work was supported by the Austrian Science Funds (W 1243, I 3456-N27, I 5539-N).","date_created":"2022-08-07T22:01:58Z","file_date_updated":"2022-08-08T06:58:22Z","status":"public","abstract":[{"lang":"eng","text":"Spin-orbit coupling in thin HgTe quantum wells results in a relativistic-like electron band structure, making it a versatile solid state platform to observe and control nontrivial electrodynamic phenomena. Here we report an observation of universal terahertz (THz) transparency determined by fine-structure constant α≈1/137 in 6.5-nm-thick HgTe layer, close to the critical thickness separating phases with topologically different electronic band structure. Using THz spectroscopy in a magnetic field we obtain direct evidence of asymmetric spin splitting of the Dirac cone. This particle-hole asymmetry facilitates optical control of edge spin currents in the quantum wells."}],"oa_version":"Published Version","article_number":"045302","date_updated":"2023-08-03T12:38:57Z","intvolume":"       106","author":[{"id":"6A9A37C2-8C5C-11E9-AE53-F2FDE5697425","first_name":"Uladzislau","orcid":"0000-0002-1648-0999","last_name":"Dziom","full_name":"Dziom, Uladzislau"},{"first_name":"A.","last_name":"Shuvaev","full_name":"Shuvaev, A."},{"first_name":"J.","last_name":"Gospodarič","full_name":"Gospodarič, J."},{"full_name":"Novik, E. G.","last_name":"Novik","first_name":"E. G."},{"first_name":"A. A.","last_name":"Dobretsova","full_name":"Dobretsova, A. A."},{"full_name":"Mikhailov, N. N.","last_name":"Mikhailov","first_name":"N. N."},{"full_name":"Kvon, Z. D.","last_name":"Kvon","first_name":"Z. D."},{"id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","first_name":"Zhanybek","orcid":"0000-0002-7183-5203","last_name":"Alpichshev","full_name":"Alpichshev, Zhanybek"},{"last_name":"Pimenov","full_name":"Pimenov, A.","first_name":"A."}],"department":[{"_id":"ZhAl"}],"isi":1,"has_accepted_license":"1","ddc":["530"],"day":"15","title":"Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells"},{"issue":"4","language":[{"iso":"eng"}],"publisher":"Society for Industrial and Applied Mathematics","date_published":"2022-07-18T00:00:00Z","doi":"10.1137/21M1410968","oa":1,"keyword":["Fokker--Planck equation","gradient flow","evolutionary $\\Gamma$-convergence"],"article_type":"original","page":"4297-4333","external_id":{"isi":["000889274600001"],"arxiv":["2008.10962"]},"year":"2022","quality_controlled":"1","scopus_import":"1","month":"07","arxiv":1,"_id":"11739","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","corr_author":"1","type":"journal_article","volume":54,"citation":{"chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>.","mla":"Forkert, Dominik L., et al. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4, Society for Industrial and Applied Mathematics, 2022, pp. 4297–333, doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>.","ista":"Forkert DL, Maas J, Portinale L. 2022. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. SIAM Journal on Mathematical Analysis. 54(4), 4297–4333.","short":"D.L. Forkert, J. Maas, L. Portinale, SIAM Journal on Mathematical Analysis 54 (2022) 4297–4333.","ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4. Society for Industrial and Applied Mathematics, pp. 4297–4333, 2022.","ama":"Forkert DL, Maas J, Portinale L. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. 2022;54(4):4297-4333. doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>","apa":"Forkert, D. L., Maas, J., &#38; Portinale, L. (2022). Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>"},"publication_status":"published","acknowledgement":"This work was supported by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme grant 716117 and by the AustrianScience Fund (FWF) through grants F65 and W1245.","status":"public","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2008.10962"}],"date_created":"2022-08-07T22:01:59Z","article_processing_charge":"No","publication_identifier":{"issn":["0036-1410"],"eissn":["1095-7154"]},"ec_funded":1,"publication":"SIAM Journal on Mathematical Analysis","related_material":{"record":[{"status":"public","id":"10022","relation":"earlier_version"}]},"day":"18","title":"Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","project":[{"name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"716117"},{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"},{"name":"Dissipation and dispersion in nonlinear partial differential equations","grant_number":"W1245","call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"JaMa"}],"isi":1,"author":[{"full_name":"Forkert, Dominik L","last_name":"Forkert","first_name":"Dominik L","id":"35C79D68-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas"},{"last_name":"Portinale","full_name":"Portinale, Lorenzo","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"We consider finite-volume approximations of Fokker--Planck equations on bounded convex domains in $\\mathbb{R}^d$ and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker--Planck equation via the method of evolutionary $\\Gamma$-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalizing the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.","lang":"eng"}],"date_updated":"2025-04-15T08:31:31Z","intvolume":"        54","oa_version":"Preprint"},{"title":"Phase transition in cohomology groups of non-uniform random simplicial complexes","day":"29","ddc":["510"],"has_accepted_license":"1","isi":1,"department":[{"_id":"MaKw"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","author":[{"full_name":"Cooley, Oliver","last_name":"Cooley","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","first_name":"Oliver"},{"last_name":"Del Giudice","full_name":"Del Giudice, Nicola","first_name":"Nicola"},{"last_name":"Kang","full_name":"Kang, Mihyun","first_name":"Mihyun"},{"first_name":"Philipp","last_name":"Sprüssel","full_name":"Sprüssel, Philipp"}],"intvolume":"        29","date_updated":"2024-10-09T21:03:03Z","article_number":"P3.27","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each k, each set of k+1 vertices forms an edge with some probability pk independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417].\r\nWe consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group R. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition."}],"status":"public","file_date_updated":"2022-08-08T06:28:52Z","date_created":"2022-08-07T22:01:59Z","acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","article_processing_charge":"No","publication_identifier":{"eissn":["1077-8926"]},"publication":"Electronic Journal of Combinatorics","arxiv":1,"scopus_import":"1","month":"07","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"_id":"11740","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. 2022;29(3). doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>","apa":"Cooley, O., Del Giudice, N., Kang, M., &#38; Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>","ieee":"O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.","short":"O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022).","mla":"Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3, P3.27, Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>.","chicago":"Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>.","ista":"Cooley O, Del Giudice N, Kang M, Sprüssel P. 2022. Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. 29(3), P3.27."},"publication_status":"published","corr_author":"1","type":"journal_article","volume":29,"oa":1,"file":[{"file_id":"11742","access_level":"open_access","checksum":"057c676dcee70236aa234d4ce6138c69","file_name":"2022_ElecJournCombinatorics_Cooley.pdf","date_updated":"2022-08-08T06:28:52Z","content_type":"application/pdf","file_size":1768663,"date_created":"2022-08-08T06:28:52Z","creator":"dernst","relation":"main_file","success":1}],"issue":"3","publisher":"Electronic Journal of Combinatorics","language":[{"iso":"eng"}],"date_published":"2022-07-29T00:00:00Z","doi":"10.37236/10607","article_type":"original","external_id":{"arxiv":["2005.07103"],"isi":["000836200300001"]},"year":"2022","quality_controlled":"1"},{"year":"2022","quality_controlled":"1","external_id":{"isi":["000866539700011"]},"page":"200-220","oa":1,"file":[{"access_level":"open_access","checksum":"05c7dcfbb9053a98f46441fb2eccb213","file_name":"2022_LNCS_RV_Henzinger.pdf","file_id":"12317","file_size":477110,"date_updated":"2023-01-20T07:34:50Z","content_type":"application/pdf","date_created":"2023-01-20T07:34:50Z","success":1,"relation":"main_file","creator":"dernst"}],"date_published":"2022-09-23T00:00:00Z","publisher":"Springer Nature","doi":"10.1007/978-3-031-17196-3_11","language":[{"iso":"eng"}],"citation":{"apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2022). Abstract monitors for quantitative specifications. In <i>22nd International Conference on Runtime Verification</i> (Vol. 13498, pp. 200–220). Tbilisi, Georgia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Abstract monitors for quantitative specifications. In: <i>22nd International Conference on Runtime Verification</i>. Vol 13498. Springer Nature; 2022:200-220. doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in <i>22nd International Conference on Runtime Verification</i>, Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2022. Abstract monitors for quantitative specifications. 22nd International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 13498, 200–220.","mla":"Henzinger, Thomas A., et al. “Abstract Monitors for Quantitative Specifications.” <i>22nd International Conference on Runtime Verification</i>, vol. 13498, Springer Nature, 2022, pp. 200–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Abstract Monitors for Quantitative Specifications.” In <i>22nd International Conference on Runtime Verification</i>, 13498:200–220. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 22nd International Conference on Runtime Verification, Springer Nature, 2022, pp. 200–220."},"publication_status":"published","corr_author":"1","type":"conference","volume":13498,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"11775","scopus_import":"1","month":"09","publication":"22nd International Conference on Runtime Verification","related_material":{"record":[{"status":"public","id":"20147","relation":"dissertation_contains"}]},"conference":{"name":"RV: Runtime Verification","end_date":"2022-09-30","location":"Tbilisi, Georgia","start_date":"2022-09-28"},"ec_funded":1,"publication_identifier":{"issn":["0302-9743"]},"article_processing_charge":"Yes","file_date_updated":"2023-01-20T07:34:50Z","status":"public","date_created":"2022-08-08T17:09:09Z","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","date_updated":"2026-04-07T12:02:56Z","intvolume":"     13498","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number n, the aggregate semantics of a monitor at time n is an equivalence relation over all sequences of at most n observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or “resource use”) that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time. "}],"author":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi"},{"last_name":"Sarac","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"isi":1,"has_accepted_license":"1","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"Abstract monitors for quantitative specifications","alternative_title":["LNCS"],"day":"23","ddc":["000"]},{"article_processing_charge":"No","date_created":"2022-08-10T15:51:19Z","file_date_updated":"2022-08-11T16:09:19Z","status":"public","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-021-3"]},"ec_funded":1,"department":[{"_id":"GradSch"},{"_id":"UlWa"}],"project":[{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"has_accepted_license":"1","ddc":["500","516","514"],"alternative_title":["ISTA Thesis"],"day":"11","title":"High-dimensional expansion and crossing numbers of simplicial complexes","abstract":[{"lang":"eng","text":"In this dissertation we study coboundary expansion of simplicial complex with a view of giving geometric applications.\r\nOur main novel tool is an equivariant version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological overlap theorem leads to various geometric applications including a quantitative non-embeddability result for sufficiently thick buildings (which partially resolves a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing number of (bounded degree) expander graphs. Additionally, we will give new proofs for several known lower bounds for geometric problems such as the number of Tverberg partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned applications one is naturally lead to study expansion properties of joins of simplicial complexes. In the presence of a special certificate for expansion (as it is the case, e.g., for spherical buildings), the join of two expanders is an expander. On the flip-side, we report quite some evidence that coboundary expansion exhibits very non-product-like behaviour under taking joins. For instance, we exhibit infinite families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$ whose join $G_n*H_n$ has expansion of lower order than the product of the expansion constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the normalized coboundary expansion constants for the complete multipartite complex $[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$ on the coboundary expansion constant of the spherical building associated with $\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we make further progress towards closing the gap between the known lower and upper bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements we achieve using computer-aided proofs and flag algebras. The exact value even for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown but we are happy to conjecture a precise value for every $n$. %Moreover, we show that a previously shown lower bound on the expansion constant of the spherical building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn a loosely structured, last chapter of this thesis we collect further smaller observations related to expansion. We point out a link between discrete Morse theory and a technique for showing coboundary expansion, elaborate a bit on the hardness of computing coboundary expansion constants, propose a new criterion for coboundary expansion (in a very dense setting) and give one way of making the folklore result that expansion of links is a necessary condition for a simplicial complex to be an expander precise."}],"oa_version":"Published Version","date_updated":"2026-04-07T14:18:26Z","author":[{"last_name":"Wild","full_name":"Wild, Pascal","first_name":"Pascal","id":"4C20D868-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.15479/at:ista:11777","language":[{"iso":"eng"}],"date_published":"2022-08-11T00:00:00Z","publisher":"Institute of Science and Technology Austria","file":[{"date_created":"2022-08-10T15:34:04Z","description":"Code for computer-assisted proofs in Section 8.4.7 in Thesis","relation":"supplementary_material","creator":"pwild","access_level":"open_access","checksum":"f5f3af1fb7c8a24b71ddc88ad7f7c5b4","file_name":"flags.py","file_id":"11780","file_size":16828,"date_updated":"2022-08-10T15:34:04Z","content_type":"text/x-python"},{"file_name":"lowerbound.cpp","checksum":"1f7c12dfe3bdaa9b147e4fbc3d34e3d5","access_level":"open_access","file_id":"11781","file_size":12226,"content_type":"text/x-c++src","date_updated":"2022-08-10T15:34:10Z","date_created":"2022-08-10T15:34:10Z","description":"Code for proof of Lemma 8.20 in Thesis","relation":"supplementary_material","creator":"pwild"},{"content_type":"text/x-python","date_updated":"2022-08-10T15:34:17Z","file_size":3240,"file_id":"11782","file_name":"upperbound.py","checksum":"4cf81455c49e5dec3b9b2e3980137eeb","access_level":"open_access","creator":"pwild","relation":"supplementary_material","description":"Code for proof of Proposition 7.9 in Thesis","date_created":"2022-08-10T15:34:17Z"},{"date_updated":"2022-08-11T16:08:33Z","content_type":"application/pdf","file_size":5086282,"file_id":"11809","checksum":"4e96575b10cbe4e0d0db2045b2847774","access_level":"open_access","file_name":"finalthesisPascalWildPDFA.pdf","relation":"main_file","creator":"pwild","title":"High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes","date_created":"2022-08-11T16:08:33Z"},{"file_name":"ThesisSubmission.zip","access_level":"closed","checksum":"92d94842a1fb6dca5808448137573b2e","file_id":"11810","file_size":18150068,"content_type":"application/zip","date_updated":"2022-08-11T16:09:19Z","date_created":"2022-08-11T16:09:19Z","creator":"pwild","relation":"source_file"}],"oa":1,"year":"2022","page":"170","_id":"11777","month":"08","degree_awarded":"PhD","type":"dissertation","corr_author":"1","publication_status":"published","citation":{"chicago":"Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>.","mla":"Wild, Pascal. <i>High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>.","ista":"Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology Austria.","short":"P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology Austria, 2022.","ieee":"P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,” Institute of Science and Technology Austria, 2022.","ama":"Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>","apa":"Wild, P. (2022). <i>High-dimensional expansion and crossing numbers of simplicial complexes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>"},"supervisor":[{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","last_name":"Wagner","full_name":"Wagner, Uli"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher"},{"publication_identifier":{"issn":["0022-2488"],"eissn":["1089-7658"]},"ec_funded":1,"publication":"Journal of Mathematical Physics","acknowledgement":"The author thanks Nataˇsa Pavlovic, Sören Petrat, Peter Pickl, Robert Seiringer, and Avy Soffer for the collaboration on Refs. 1, 2 and 21. Funding from the European Union’s Horizon 2020 Research and Innovation Programme under Marie Skℓodowska-Curie Grant Agreement\r\nNo. 754411 is gratefully acknowledged.","status":"public","file_date_updated":"2022-08-11T07:03:02Z","date_created":"2022-08-11T06:37:52Z","article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Bossmann","full_name":"Bossmann, Lea","id":"A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425","first_name":"Lea","orcid":"0000-0002-6854-1343"}],"abstract":[{"lang":"eng","text":"We consider a gas of N bosons with interactions in the mean-field scaling regime. We review the proof of an asymptotic expansion of its low-energy spectrum, eigenstates, and dynamics, which provides corrections to Bogoliubov theory to all orders in 1/ N. This is based on joint works with Petrat, Pickl, Seiringer, and Soffer. In addition, we derive a full asymptotic expansion of the ground state one-body reduced density matrix."}],"intvolume":"        63","date_updated":"2025-04-14T07:43:58Z","article_number":"061102","oa_version":"Published Version","day":"10","ddc":["530"],"title":"Low-energy spectrum and dynamics of the weakly interacting Bose gas","project":[{"grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"department":[{"_id":"RoSe"}],"has_accepted_license":"1","isi":1,"external_id":{"isi":["000809648100002"],"arxiv":["2203.00730"]},"year":"2022","quality_controlled":"1","issue":"6","language":[{"iso":"eng"}],"date_published":"2022-06-10T00:00:00Z","doi":"10.1063/5.0089983","publisher":"AIP Publishing","oa":1,"file":[{"relation":"main_file","creator":"dernst","success":1,"date_created":"2022-08-11T07:03:02Z","date_updated":"2022-08-11T07:03:02Z","content_type":"application/pdf","file_size":5957888,"file_id":"11784","access_level":"open_access","checksum":"d0d32c338c1896680174be88c70968fa","file_name":"2022_JourMathPhysics_Bossmann.pdf"}],"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","corr_author":"1","type":"journal_article","volume":63,"citation":{"chicago":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2022. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>.","mla":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6, 061102, AIP Publishing, 2022, doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>.","ista":"Bossmann L. 2022. Low-energy spectrum and dynamics of the weakly interacting Bose gas. Journal of Mathematical Physics. 63(6), 061102.","short":"L. Bossmann, Journal of Mathematical Physics 63 (2022).","ieee":"L. Bossmann, “Low-energy spectrum and dynamics of the weakly interacting Bose gas,” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6. AIP Publishing, 2022.","apa":"Bossmann, L. (2022). Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>","ama":"Bossmann L. Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. 2022;63(6). doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>"},"publication_status":"published","scopus_import":"1","month":"06","arxiv":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"11783"},{"arxiv":1,"month":"04","scopus_import":"1","_id":"11808","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Hanauer, M. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Virtual, 2022, vol. 221.","ama":"Hanauer K, Henzinger M, Schulz C. Recent advances in fully dynamic graph algorithms. In: <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>","apa":"Hanauer, K., Henzinger, M., &#38; Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>","mla":"Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>.","ista":"Hanauer K, Henzinger M, Schulz C. 2022. Recent advances in fully dynamic graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 1.","chicago":"Hanauer, Kathrin, Monika Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>.","short":"K. Hanauer, M. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"publication_status":"published","type":"conference","volume":221,"oa":1,"date_published":"2022-04-29T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SAND.2022.1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","extern":"1","external_id":{"arxiv":["2102.11169"]},"year":"2022","quality_controlled":"1","title":"Recent advances in fully dynamic graph algorithms","day":"29","alternative_title":["LIPIcs"],"author":[{"first_name":"Kathrin","last_name":"Hanauer","full_name":"Hanauer, Kathrin"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"last_name":"Schulz","full_name":"Schulz, Christian","first_name":"Christian"}],"date_updated":"2024-11-06T08:23:49Z","intvolume":"       221","oa_version":"Published Version","article_number":"1","abstract":[{"text":"In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.","lang":"eng"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.SAND.2022.1"}],"date_created":"2022-08-11T14:35:52Z","article_processing_charge":"No","conference":{"end_date":"2022-03-30","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks","start_date":"2022-03-28","location":"Virtual"},"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772242"]},"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks"},{"publication_status":"published","citation":{"short":"K. Hanauer, M. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 221, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">10.4230/LIPIcs.SAND.2022.18</a>.","chicago":"Hanauer, Kathrin, Monika Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">https://doi.org/10.4230/LIPIcs.SAND.2022.18</a>.","ista":"Hanauer K, Henzinger M, Hua QC. 2022. Fully dynamic four-vertex subgraph counting. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 18.","apa":"Hanauer, K., Henzinger, M., &#38; Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">https://doi.org/10.4230/LIPIcs.SAND.2022.18</a>","ama":"Hanauer K, Henzinger M, Hua QC. Fully dynamic four-vertex subgraph counting. In: <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">10.4230/LIPIcs.SAND.2022.18</a>","ieee":"K. Hanauer, M. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Virtual, 2022, vol. 221."},"type":"conference","volume":221,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11812","arxiv":1,"month":"04","scopus_import":"1","quality_controlled":"1","year":"2022","external_id":{"arxiv":["2106.15524"]},"extern":"1","oa":1,"language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2022-04-29T00:00:00Z","doi":"10.4230/LIPIcs.SAND.2022.18","oa_version":"Published Version","article_number":"18","intvolume":"       221","date_updated":"2024-11-06T08:22:47Z","abstract":[{"text":"This paper presents a comprehensive study of algorithms for maintaining the number of all connected four-vertex subgraphs in a dynamic graph. Specifically, our algorithms maintain the number of paths of length three in deterministic amortized O(m^{1/2}) update time, and any other connected four-vertex subgraph which is not a clique in deterministic amortized update time O(m^{2/3}). Queries can be answered in constant time. We also study the query times for subgraphs containing an arbitrary edge that is supplied only with the query as well as the case where only subgraphs containing a vertex s that is fixed beforehand are considered. For length-3 paths, paws, 4-cycles, and diamonds our bounds match or are not far from (conditional) lower bounds: Based on the OMv conjecture we show that any dynamic algorithm that detects the existence of paws, diamonds, or 4-cycles or that counts length-3 paths takes update time Ω(m^{1/2-δ}).\r\nAdditionally, for 4-cliques and all connected induced subgraphs, we show a lower bound of Ω(m^{1-δ}) for any small constant δ > 0 for the amortized update time, assuming the static combinatorial 4-clique conjecture holds. This shows that the O(m) algorithm by Eppstein et al. [David Eppstein et al., 2012] for these subgraphs cannot be improved by a polynomial factor.","lang":"eng"}],"author":[{"first_name":"Kathrin","full_name":"Hanauer, Kathrin","last_name":"Hanauer"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Hua, Qi Cheng","last_name":"Hua","first_name":"Qi Cheng"}],"title":"Fully dynamic four-vertex subgraph counting","day":"29","alternative_title":["LIPIcs"],"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks","conference":{"start_date":"2022-04-28","location":"Virtual","end_date":"2022-04-30","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772242"]},"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.SAND.2022.18","open_access":"1"}],"date_created":"2022-08-12T06:57:55Z","status":"public"},{"abstract":[{"lang":"eng","text":"It is a highly desirable property for deep networks to be robust against\r\nsmall input changes. One popular way to achieve this property is by designing\r\nnetworks with a small Lipschitz constant. In this work, we propose a new\r\ntechnique for constructing such Lipschitz networks that has a number of\r\ndesirable properties: it can be applied to any linear network layer\r\n(fully-connected or convolutional), it provides formal guarantees on the\r\nLipschitz constant, it is easy to implement and efficient to run, and it can be\r\ncombined with any training objective and optimization method. In fact, our\r\ntechnique is the first one in the literature that achieves all of these\r\nproperties simultaneously. Our main contribution is a rescaling-based weight\r\nmatrix parametrization that guarantees each network layer to have a Lipschitz\r\nconstant of at most 1 and results in the learned weight matrices to be close to\r\northogonal. Hence we call such layers almost-orthogonal Lipschitz (AOL).\r\nExperiments and ablation studies in the context of image classification with\r\ncertified robust accuracy confirm that AOL layers achieve results that are on\r\npar with most existing methods. Yet, they are simpler to implement and more\r\nbroadly applicable, because they do not require computationally expensive\r\nmatrix orthogonalization or inversion steps as part of the network\r\narchitecture. We provide code at https://github.com/berndprach/AOL."}],"intvolume":"     13681","date_updated":"2026-04-07T11:49:51Z","oa_version":"Preprint","author":[{"full_name":"Prach, Bernd","last_name":"Prach","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd"},{"last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"isi":1,"alternative_title":["LNCS"],"day":"23","title":"Almost-orthogonal layers for efficient general-purpose Lipschitz networks","publication":"Computer Vision – ECCV 2022","related_material":{"record":[{"relation":"dissertation_contains","id":"19759","status":"public"}]},"publication_identifier":{"eisbn":["9783031198038"],"isbn":["9783031198021"]},"conference":{"name":"ECCV: European Conference on Computer Vision","end_date":"2022-10-27","start_date":"2022-10-23","location":"Tel Aviv, Israel"},"article_processing_charge":"No","status":"public","date_created":"2022-08-12T15:09:47Z","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2208.03160"}],"corr_author":"1","type":"conference","volume":13681,"citation":{"apa":"Prach, B., &#38; Lampert, C. (2022). Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In <i>Computer Vision – ECCV 2022</i> (Vol. 13681, pp. 350–365). Tel Aviv, Israel: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">https://doi.org/10.1007/978-3-031-19803-8_21</a>","ama":"Prach B, Lampert C. Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In: <i>Computer Vision – ECCV 2022</i>. Vol 13681. Springer Nature; 2022:350-365. doi:<a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">10.1007/978-3-031-19803-8_21</a>","ieee":"B. Prach and C. Lampert, “Almost-orthogonal layers for efficient general-purpose Lipschitz networks,” in <i>Computer Vision – ECCV 2022</i>, Tel Aviv, Israel, 2022, vol. 13681, pp. 350–365.","short":"B. Prach, C. Lampert, in:, Computer Vision – ECCV 2022, Springer Nature, 2022, pp. 350–365.","ista":"Prach B, Lampert C. 2022. Almost-orthogonal layers for efficient general-purpose Lipschitz networks. Computer Vision – ECCV 2022. ECCV: European Conference on Computer Vision, LNCS, vol. 13681, 350–365.","chicago":"Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” In <i>Computer Vision – ECCV 2022</i>, 13681:350–65. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">https://doi.org/10.1007/978-3-031-19803-8_21</a>.","mla":"Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” <i>Computer Vision – ECCV 2022</i>, vol. 13681, Springer Nature, 2022, pp. 350–65, doi:<a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">10.1007/978-3-031-19803-8_21</a>."},"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"11839","month":"10","scopus_import":"1","arxiv":1,"year":"2022","quality_controlled":"1","page":"350-365","external_id":{"isi":["000904104000021"],"arxiv":["2208.03160"]},"date_published":"2022-10-23T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Springer Nature","doi":"10.1007/978-3-031-19803-8_21","oa":1},{"_id":"11841","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"pmid":1,"scopus_import":"1","month":"07","publication_status":"published","citation":{"apa":"Toprakcioglu, Z., Kamada, A., Michaels, T. C. T., Xie, M., Krausser, J., Wei, J., … Knowles, T. P. J. (2022). Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>","ama":"Toprakcioglu Z, Kamada A, Michaels TCT, et al. Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>","ieee":"Z. Toprakcioglu <i>et al.</i>, “Adsorption free energy predicts amyloid protein nucleation rates,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. National Academy of Sciences, 2022.","short":"Z. Toprakcioglu, A. Kamada, T.C.T. Michaels, M. Xie, J. Krausser, J. Wei, A. Šarić, M. Vendruscolo, T.P.J. Knowles, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","mla":"Toprakcioglu, Zenon, et al. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2109718119, National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>.","chicago":"Toprakcioglu, Zenon, Ayaka Kamada, Thomas C.T. Michaels, Mengqi Xie, Johannes Krausser, Jiapeng Wei, Anđela Šarić, Michele Vendruscolo, and Tuomas P.J. Knowles. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>.","ista":"Toprakcioglu Z, Kamada A, Michaels TCT, Xie M, Krausser J, Wei J, Šarić A, Vendruscolo M, Knowles TPJ. 2022. Adsorption free energy predicts amyloid protein nucleation rates. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2109718119."},"volume":119,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","file":[{"date_created":"2023-10-04T09:05:44Z","success":1,"relation":"main_file","creator":"dernst","file_name":"2022_PNAS_Toprakcioglu.pdf","access_level":"open_access","checksum":"0fe3878896cbeb6c44e29222ec2f336a","file_id":"14386","file_size":2476021,"content_type":"application/pdf","date_updated":"2023-10-04T09:05:44Z"}],"oa":1,"doi":"10.1073/pnas.2109718119","date_published":"2022-07-28T00:00:00Z","publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"issue":"31","quality_controlled":"1","year":"2022","external_id":{"pmid":["35901206"],"isi":["000903753500002"]},"isi":1,"has_accepted_license":"1","department":[{"_id":"AnSa"}],"project":[{"name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","grant_number":"802960","call_identifier":"H2020","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e"}],"title":"Adsorption free energy predicts amyloid protein nucleation rates","ddc":["570"],"day":"28","oa_version":"Published Version","article_number":"e2109718119","date_updated":"2025-06-12T06:21:34Z","intvolume":"       119","abstract":[{"lang":"eng","text":"Primary nucleation is the fundamental event that initiates the conversion of proteins from their normal physiological forms into pathological amyloid aggregates associated with the onset and development of disorders including systemic amyloidosis, as well as the neurodegenerative conditions Alzheimer’s and Parkinson’s diseases. It has become apparent that the presence of surfaces can dramatically modulate nucleation. However, the underlying physicochemical parameters governing this process have been challenging to elucidate, with interfaces in some cases having been found to accelerate aggregation, while in others they can inhibit the kinetics of this process. Here we show through kinetic analysis that for three different fibril-forming proteins, interfaces affect the aggregation reaction mainly through modulating the primary nucleation step. Moreover, we show through direct measurements of the Gibbs free energy of adsorption, combined with theory and coarse-grained computer simulations, that overall nucleation rates are suppressed at high and at low surface interaction strengths but significantly enhanced at intermediate strengths, and we verify these regimes experimentally. Taken together, these results provide a quantitative description of the fundamental process which triggers amyloid formation and shed light on the key factors that control this process."}],"author":[{"last_name":"Toprakcioglu","full_name":"Toprakcioglu, Zenon","first_name":"Zenon"},{"full_name":"Kamada, Ayaka","last_name":"Kamada","first_name":"Ayaka"},{"full_name":"Michaels, Thomas C.T.","last_name":"Michaels","first_name":"Thomas C.T."},{"first_name":"Mengqi","full_name":"Xie, Mengqi","last_name":"Xie"},{"first_name":"Johannes","full_name":"Krausser, Johannes","last_name":"Krausser"},{"first_name":"Jiapeng","last_name":"Wei","full_name":"Wei, Jiapeng"},{"first_name":"Anđela","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","orcid":"0000-0002-7854-2139","last_name":"Šarić","full_name":"Šarić, Anđela"},{"full_name":"Vendruscolo, Michele","last_name":"Vendruscolo","first_name":"Michele"},{"first_name":"Tuomas P.J.","full_name":"Knowles, Tuomas P.J.","last_name":"Knowles"}],"article_processing_charge":"No","date_created":"2022-08-14T22:01:45Z","status":"public","file_date_updated":"2023-10-04T09:05:44Z","acknowledgement":"The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP7/2007-2013) through the ERC grant PhysProt\r\n(agreement 337969). We are grateful for financial support from the Biotechnology and Biological Sciences Research Council (BBSRC) (T.P.J.K.), the Newman\r\nFoundation (T.P.J.K.), the Wellcome Trust (T.P.J.K. and M.V.), Peterhouse College\r\nCambridge (T.C.T.M.), the ERC Starting Grant (StG) Non-Equilibrium Protein Assembly (NEPA) (A.S.), the Royal Society (A.S.), the Academy of Medical Sciences\r\n(A.S. and J.K.), and the Cambridge Centre for Misfolding Diseases (CMD).","publication":"Proceedings of the National Academy of Sciences of the United States of America","ec_funded":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]}},{"article_processing_charge":"No","date_created":"2022-08-14T22:01:45Z","status":"public","file_date_updated":"2022-08-16T06:55:22Z","acknowledgement":"The authors warmly thank their former resp. current PhD advisor Julian Fischer for the suggestion of this problem and for valuable initial discussions on the subjects of this paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819) , and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","publication":"Journal of Mathematical Fluid Mechanics","related_material":{"record":[{"status":"public","id":"14587","relation":"dissertation_contains"}]},"ec_funded":1,"publication_identifier":{"issn":["1422-6928"],"eissn":["1422-6952"]},"isi":1,"has_accepted_license":"1","department":[{"_id":"JuFi"}],"project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","call_identifier":"H2020","name":"Bridging Scales in Random Materials"}],"title":"Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities","ddc":["510"],"day":"01","article_number":"93","oa_version":"Published Version","date_updated":"2026-04-07T13:28:13Z","intvolume":"        24","abstract":[{"lang":"eng","text":"We consider the flow of two viscous and incompressible fluids within a bounded domain modeled by means of a two-phase Navier–Stokes system. The two fluids are assumed to be immiscible, meaning that they are separated by an interface. With respect to the motion of the interface, we consider pure transport by the fluid flow. Along the boundary of the domain, a complete slip boundary condition for the fluid velocities and a constant ninety degree contact angle condition for the interface are assumed. In the present work, we devise for the resulting evolution problem a suitable weak solution concept based on the framework of varifolds and establish as the main result a weak-strong uniqueness principle in 2D. The proof is based on a relative entropy argument and requires a non-trivial further development of ideas from the recent work of Fischer and the first author (Arch. Ration. Mech. Anal. 236, 2020) to incorporate the contact angle condition. To focus on the effects of the necessarily singular geometry of the evolving fluid domains, we work for simplicity in the regime of same viscosities for the two fluids."}],"author":[{"full_name":"Hensel, Sebastian","last_name":"Hensel","orcid":"0000-0001-7252-8072","first_name":"Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alice","id":"25647992-AA84-11E9-9D75-8427E6697425","full_name":"Marveggio, Alice","last_name":"Marveggio"}],"article_type":"original","file":[{"file_name":"2022_JMathFluidMech_Hensel.pdf","access_level":"open_access","checksum":"75c5f286300e6f0539cf57b4dba108d5","file_id":"11848","file_size":2045570,"content_type":"application/pdf","date_updated":"2022-08-16T06:55:22Z","date_created":"2022-08-16T06:55:22Z","success":1,"relation":"main_file","creator":"cchlebak"}],"oa":1,"language":[{"iso":"eng"}],"date_published":"2022-08-01T00:00:00Z","publisher":"Springer Nature","doi":"10.1007/s00021-022-00722-2","issue":"3","quality_controlled":"1","year":"2022","external_id":{"arxiv":["2112.11154"],"isi":["000834834300001"]},"_id":"11842","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"arxiv":1,"scopus_import":"1","month":"08","publication_status":"published","citation":{"chicago":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>.","ista":"Hensel S, Marveggio A. 2022. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. Journal of Mathematical Fluid Mechanics. 24(3), 93.","mla":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3, 93, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>.","short":"S. Hensel, A. Marveggio, Journal of Mathematical Fluid Mechanics 24 (2022).","ama":"Hensel S, Marveggio A. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. 2022;24(3). doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>","apa":"Hensel, S., &#38; Marveggio, A. (2022). Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>","ieee":"S. Hensel and A. Marveggio, “Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities,” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3. Springer Nature, 2022."},"corr_author":"1","type":"journal_article","volume":24,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"external_id":{"isi":["000838410200001"],"pmid":["35881547"]},"quality_controlled":"1","year":"2022","file":[{"date_created":"2022-08-16T08:57:37Z","relation":"main_file","creator":"cchlebak","success":1,"file_id":"11861","checksum":"002a3c7c7ea5caa9af9cfbea308f6ea4","access_level":"open_access","file_name":"2022_eLife_Tomasek.pdf","date_updated":"2022-08-16T08:57:37Z","content_type":"application/pdf","file_size":2057577}],"oa":1,"doi":"10.7554/eLife.78995","publisher":"eLife Sciences Publications","language":[{"iso":"eng"}],"date_published":"2022-07-26T00:00:00Z","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"apa":"Tomasek, K., Leithner, A. F., Glatzová, I., Lukesch, M. S., Guet, C. C., &#38; Sixt, M. K. (2022). Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.78995\">https://doi.org/10.7554/eLife.78995</a>","ama":"Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/eLife.78995\">10.7554/eLife.78995</a>","ieee":"K. Tomasek, A. F. Leithner, I. Glatzová, M. S. Lukesch, C. C. Guet, and M. K. Sixt, “Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","short":"K. Tomasek, A.F. Leithner, I. Glatzová, M.S. Lukesch, C.C. Guet, M.K. Sixt, ELife 11 (2022).","mla":"Tomasek, Kathrin, et al. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack the Host Immune Response by Binding to CD14.” <i>ELife</i>, vol. 11, e78995, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/eLife.78995\">10.7554/eLife.78995</a>.","ista":"Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. 2022. Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. eLife. 11, e78995.","chicago":"Tomasek, Kathrin, Alexander F Leithner, Ivana Glatzová, Michael S. Lukesch, Calin C Guet, and Michael K Sixt. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack the Host Immune Response by Binding to CD14.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/eLife.78995\">https://doi.org/10.7554/eLife.78995</a>."},"type":"journal_article","volume":11,"corr_author":"1","pmid":1,"month":"07","scopus_import":"1","_id":"11843","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"ec_funded":1,"publication_identifier":{"eissn":["2050-084X"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10316"}]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"publication":"eLife","date_created":"2022-08-14T22:01:46Z","file_date_updated":"2022-08-16T08:57:37Z","status":"public","acknowledgement":"We thank Ulrich Dobrindt for providing UPEC strains CFT073, UTI89, and 536, Frank Assen, Vlad Gavra, Maximilian Götz, Bor Kavčič, Jonna Alanko, and Eva Kiermaier for help with experiments and Robert Hauschild, Julian Stopp, and Saren Tasciyan for help with data analysis. We thank the IST Austria Scientific Service Units, especially the Bioimaging facility, the Preclinical facility and the Electron microscopy facility for technical support, Jakob Wallner and all members of the Guet and Sixt lab for fruitful discussions and Daria Siekhaus for critically reading the manuscript. This work was supported by grants from the Austrian Research Promotion Agency (FEMtech 868984) to IG, the European Research Council (CoG 724373), and the Austrian Science Fund (FWF P29911) to MS.","article_processing_charge":"Yes","author":[{"full_name":"Tomasek, Kathrin","last_name":"Tomasek","orcid":"0000-0003-3768-877X","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","first_name":"Kathrin"},{"orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander F","full_name":"Leithner, Alexander F","last_name":"Leithner"},{"last_name":"Glatzová","full_name":"Glatzová, Ivana","first_name":"Ivana","id":"727b3c7d-4939-11ec-89b3-b9b0750ab74d"},{"full_name":"Lukesch, Michael S.","last_name":"Lukesch","first_name":"Michael S."},{"orcid":"0000-0001-6220-2052","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","last_name":"Guet"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt"}],"article_number":"e78995","oa_version":"Published Version","date_updated":"2025-04-15T07:17:32Z","intvolume":"        11","abstract":[{"lang":"eng","text":"A key attribute of persistent or recurring bacterial infections is the ability of the pathogen to evade the host’s immune response. Many Enterobacteriaceae express type 1 pili, a pre-adapted virulence trait, to invade host epithelial cells and establish persistent infections. However, the molecular mechanisms and strategies by which bacteria actively circumvent the immune response of the host remain poorly understood. Here, we identified CD14, the major co-receptor for lipopolysaccharide detection, on mouse dendritic cells (DCs) as a binding partner of FimH, the protein located at the tip of the type 1 pilus of Escherichia coli. The FimH amino acids involved in CD14 binding are highly conserved across pathogenic and non-pathogenic strains. Binding of the pathogenic strain CFT073 to CD14 reduced DC migration by overactivation of integrins and blunted expression of co-stimulatory molecules by overactivating the NFAT (nuclear factor of activated T-cells) pathway, both rate-limiting factors of T cell activation. This response was binary at the single-cell level, but averaged in larger populations exposed to both piliated and non-piliated pathogens, presumably via the exchange of immunomodulatory cytokines. While defining an active molecular mechanism of immune evasion by pathogens, the interaction between FimH and CD14 represents a potential target to interfere with persistent and recurrent infections, such as urinary tract infections or Crohn’s disease."}],"title":"Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14","ddc":["570"],"day":"26","has_accepted_license":"1","isi":1,"department":[{"_id":"MiSi"},{"_id":"CaGu"}],"project":[{"name":"Cellular Navigation Along Spatial Gradients","grant_number":"724373","call_identifier":"H2020","_id":"25FE9508-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"P29911","_id":"26018E70-B435-11E9-9278-68D0E5697425","name":"Mechanical adaptation of lamellipodial actin"}]},{"year":"2022","quality_controlled":"1","external_id":{"isi":["001031439100030"],"arxiv":["2205.12597"]},"page":"246-256","oa":1,"file":[{"date_updated":"2022-08-16T08:05:15Z","content_type":"application/pdf","file_size":1593474,"file_id":"11854","checksum":"4c6b29172b8e355b4fbc364a2e0827b2","access_level":"open_access","file_name":"2022_PODC_Alistarh.pdf","relation":"main_file","creator":"cchlebak","success":1,"date_created":"2022-08-16T08:05:15Z"}],"doi":"10.1145/3519270.3538435","date_published":"2022-07-21T00:00:00Z","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"citation":{"mla":"Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2022, pp. 246–56, doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>.","ista":"Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election in population protocols on graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 246–256.","chicago":"Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, 246–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>.","short":"D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–256.","ieee":"D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Salerno, Italy, 2022, pp. 246–256.","apa":"Alistarh, D.-A., Rybicki, J., &#38; Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i> (pp. 246–256). Salerno, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>","ama":"Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2022:246-256. doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>"},"publication_status":"published","corr_author":"1","type":"conference","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"11844","arxiv":1,"month":"07","scopus_import":"1","publication":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing","related_material":{"record":[{"id":"19969","relation":"later_version","status":"public"}]},"conference":{"start_date":"2022-07-25","location":"Salerno, Italy","end_date":"2022-07-29","name":"PODC: Symposium on Principles of Distributed Computing"},"ec_funded":1,"publication_identifier":{"isbn":["9781450392624"]},"article_processing_charge":"Yes (via OA deal)","file_date_updated":"2022-08-16T08:05:15Z","status":"public","date_created":"2022-08-14T22:01:46Z","acknowledgement":"We thank the anonymous reviewers for their helpful comments. We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","date_updated":"2025-12-30T09:04:17Z","oa_version":"Published Version","abstract":[{"text":"In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs.","lang":"eng"}],"author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"last_name":"Rybicki","full_name":"Rybicki, Joel","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646"},{"full_name":"Voitovych, Sasha","last_name":"Voitovych","first_name":"Sasha"}],"isi":1,"has_accepted_license":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"}],"department":[{"_id":"DaAl"}],"title":"Near-optimal leader election in population protocols on graphs","day":"21","ddc":["000"]}]