--- _id: '11717' abstract: - lang: eng 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." 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' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Kostiantyn full_name: Drach, Kostiantyn id: fe8209e2-906f-11eb-847d-950f8fc09115 last_name: Drach orcid: 0000-0002-9156-8616 - first_name: Dierk full_name: Schleicher, Dierk last_name: Schleicher citation: ama: Drach K, Schleicher D. Rigidity of Newton dynamics. Advances in Mathematics. 2022;408(Part A). doi:10.1016/j.aim.2022.108591 apa: Drach, K., & Schleicher, D. (2022). Rigidity of Newton dynamics. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2022.108591 chicago: Drach, Kostiantyn, and Dierk Schleicher. “Rigidity of Newton Dynamics.” Advances in Mathematics. Elsevier, 2022. https://doi.org/10.1016/j.aim.2022.108591. ieee: K. Drach and D. Schleicher, “Rigidity of Newton dynamics,” Advances in Mathematics, vol. 408, no. Part A. Elsevier, 2022. ista: Drach K, Schleicher D. 2022. Rigidity of Newton dynamics. Advances in Mathematics. 408(Part A), 108591. mla: Drach, Kostiantyn, and Dierk Schleicher. “Rigidity of Newton Dynamics.” Advances in Mathematics, vol. 408, no. Part A, 108591, Elsevier, 2022, doi:10.1016/j.aim.2022.108591. short: K. Drach, D. Schleicher, Advances in Mathematics 408 (2022). corr_author: '1' date_created: 2022-08-01T17:08:16Z date_published: 2022-10-29T00:00:00Z date_updated: 2025-04-14T07:53:45Z day: '29' ddc: - '510' department: - _id: VaKa doi: 10.1016/j.aim.2022.108591 ec_funded: 1 external_id: isi: - '000860924200005' file: - access_level: open_access checksum: 2710e6f5820f8c20a676ddcbb30f0e8d content_type: application/pdf creator: dernst date_created: 2023-02-02T07:39:09Z date_updated: 2023-02-02T07:39:09Z file_id: '12474' file_name: 2022_AdvancesMathematics_Drach.pdf file_size: 2164036 relation: main_file success: 1 file_date_updated: 2023-02-02T07:39:09Z has_accepted_license: '1' intvolume: ' 408' isi: 1 issue: Part A keyword: - General Mathematics language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication: Advances in Mathematics publication_identifier: issn: - 0001-8708 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Rigidity of Newton dynamics tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 408 year: '2022' ... --- _id: '11723' abstract: - lang: eng 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. 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).” article_number: e2121058119 article_processing_charge: No article_type: original author: - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Huihuang full_name: Chen, Huihuang id: 83c96512-15b2-11ec-abd3-b7eede36184f last_name: Chen - first_name: Saqer S. full_name: Alotaibi, Saqer S. last_name: Alotaibi - first_name: Aleš full_name: Pěnčík, Aleš last_name: Pěnčík - first_name: Maciek full_name: Adamowski, Maciek id: 45F536D2-F248-11E8-B48F-1D18A9856A87 last_name: Adamowski orcid: 0000-0001-6463-5257 - first_name: Ondřej full_name: Novák, Ondřej last_name: Novák - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Li L, Chen H, Alotaibi SS, et al. RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis. Proceedings of the National Academy of Sciences of the United States of America. 2022;119(31). doi:10.1073/pnas.2121058119 apa: Li, L., Chen, H., Alotaibi, S. S., 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. National Academy of Sciences. https://doi.org/10.1073/pnas.2121058119 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.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2121058119. ieee: L. Li et al., “RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis,” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 31. National Academy of Sciences, 2022. 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. mla: Li, Lanxin, et al. “RALF1 Peptide Triggers Biphasic Root Growth Inhibition Upstream of Auxin Biosynthesis.” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 31, e2121058119, National Academy of Sciences, 2022, doi:10.1073/pnas.2121058119. 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). corr_author: '1' date_created: 2022-08-04T20:06:49Z date_published: 2022-07-25T00:00:00Z date_updated: 2025-05-14T11:01:00Z day: '25' ddc: - '580' department: - _id: GradSch - _id: JiFr doi: 10.1073/pnas.2121058119 external_id: isi: - '000881496900002' pmid: - '35878023' file: - access_level: open_access checksum: ae6f19b0d9efba6687f9e4dc1bab1d6e content_type: application/pdf creator: dernst date_created: 2022-08-08T07:42:09Z date_updated: 2022-08-08T07:42:09Z file_id: '11747' file_name: 2022_PNAS_Li.pdf file_size: 2506262 relation: main_file success: 1 file_date_updated: 2022-08-08T07:42:09Z has_accepted_license: '1' intvolume: ' 119' isi: 1 issue: '31' keyword: - Multidisciplinary language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants - _id: 26B4D67E-B435-11E9-9278-68D0E5697425 grant_number: '25351' name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root' publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 issn: - 0027-8424 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' scopus_import: '1' status: public title: RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2022' ... --- _id: '11732' 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. 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)" article_number: '5' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Asbjørn Bækgaard full_name: Lauritsen, Asbjørn Bækgaard id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1 last_name: Lauritsen orcid: 0000-0003-4476-2288 citation: ama: Henheik SJ, Lauritsen AB. The BCS energy gap at high density. Journal of Statistical Physics. 2022;189. doi:10.1007/s10955-022-02965-9 apa: Henheik, S. J., & Lauritsen, A. B. (2022). The BCS energy gap at high density. Journal of Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-022-02965-9 chicago: Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “The BCS Energy Gap at High Density.” Journal of Statistical Physics. Springer Nature, 2022. https://doi.org/10.1007/s10955-022-02965-9. ieee: S. J. Henheik and A. B. Lauritsen, “The BCS energy gap at high density,” Journal of Statistical Physics, vol. 189. Springer Nature, 2022. ista: Henheik SJ, Lauritsen AB. 2022. The BCS energy gap at high density. Journal of Statistical Physics. 189, 5. mla: Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “The BCS Energy Gap at High Density.” Journal of Statistical Physics, vol. 189, 5, Springer Nature, 2022, doi:10.1007/s10955-022-02965-9. short: S.J. Henheik, A.B. Lauritsen, Journal of Statistical Physics 189 (2022). corr_author: '1' date_created: 2022-08-05T11:36:56Z date_published: 2022-07-29T00:00:00Z date_updated: 2026-04-07T13:01:40Z day: '29' ddc: - '530' department: - _id: GradSch - _id: LaEr - _id: RoSe doi: 10.1007/s10955-022-02965-9 ec_funded: 1 external_id: isi: - '000833007200002' file: - access_level: open_access checksum: b398c4dbf65f71d417981d6e366427e9 content_type: application/pdf creator: dernst date_created: 2022-08-08T07:36:34Z date_updated: 2022-08-08T07:36:34Z file_id: '11746' file_name: 2022_JourStatisticalPhysics_Henheik.pdf file_size: 419563 relation: main_file success: 1 file_date_updated: 2022-08-08T07:36:34Z has_accepted_license: '1' intvolume: ' 189' isi: 1 keyword: - Mathematical Physics - Statistical and Nonlinear Physics language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Journal of Statistical Physics publication_identifier: eissn: - 1572-9613 issn: - 0022-4715 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '19540' relation: dissertation_contains status: public - id: '18135' relation: dissertation_contains status: public scopus_import: '1' status: public title: The BCS energy gap at high density tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 189 year: '2022' ... --- _id: '11733' 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. 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. article_number: e2121279119 article_processing_charge: No article_type: original author: - first_name: Etienne J. full_name: Orliac, Etienne J. last_name: Orliac - first_name: Daniel full_name: Trejo Banos, Daniel last_name: Trejo Banos - first_name: Sven E. full_name: Ojavee, Sven E. last_name: Ojavee - first_name: Kristi full_name: Läll, Kristi last_name: Läll - first_name: Reedik full_name: Mägi, Reedik last_name: Mägi - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 citation: ama: Orliac EJ, Trejo Banos D, Ojavee SE, et al. Improving GWAS discovery and genomic prediction accuracy in biobank data. Proceedings of the National Academy of Sciences of the United States of America. 2022;119(31). doi:10.1073/pnas.2121279119 apa: Orliac, E. J., Trejo Banos, D., Ojavee, S. E., Läll, K., Mägi, R., Visscher, P. M., & Robinson, M. R. (2022). Improving GWAS discovery and genomic prediction accuracy in biobank data. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2121279119 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.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2121279119. ieee: E. J. Orliac et al., “Improving GWAS discovery and genomic prediction accuracy in biobank data,” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 31. National Academy of Sciences, 2022. 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. mla: Orliac, Etienne J., et al. “Improving GWAS Discovery and Genomic Prediction Accuracy in Biobank Data.” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 31, e2121279119, National Academy of Sciences, 2022, doi:10.1073/pnas.2121279119. 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). corr_author: '1' date_created: 2022-08-07T22:01:56Z date_published: 2022-07-29T00:00:00Z date_updated: 2025-06-12T06:22:37Z day: '29' ddc: - '570' department: - _id: MaRo doi: 10.1073/pnas.2121279119 external_id: isi: - '000881496900003' pmid: - '35905320' file: - access_level: open_access checksum: b5d2024e19fbad6f85a5e384e44d0f3b content_type: application/pdf creator: dernst date_created: 2022-08-08T07:31:19Z date_updated: 2022-08-08T07:31:19Z file_id: '11745' file_name: 2022_PNAS_Orliac.pdf file_size: 1001164 relation: main_file success: 1 file_date_updated: 2022-08-08T07:31:19Z has_accepted_license: '1' intvolume: ' 119' isi: 1 issue: '31' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' related_material: record: - id: '13064' relation: research_data status: public scopus_import: '1' status: public title: Improving GWAS discovery and genomic prediction accuracy in biobank data tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2022' ... --- _id: '11734' abstract: - lang: eng 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. acknowledged_ssus: - _id: Bio - _id: LifeSc acknowledgement: "We acknowledge Hana Semeradova, Juan Carlos Montesinos, Nicola Cavallari, Marc¸al Gallem\x03ı, Kaori Tabata, Andrej Hurn\x03y, 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)." article_number: e2122460119 article_processing_charge: No article_type: original author: - first_name: Rashed full_name: Abualia, Rashed id: 4827E134-F248-11E8-B48F-1D18A9856A87 last_name: Abualia orcid: 0000-0002-9357-9415 - first_name: Krisztina full_name: Ötvös, Krisztina id: 29B901B0-F248-11E8-B48F-1D18A9856A87 last_name: Ötvös orcid: 0000-0002-5503-4983 - first_name: Ondřej full_name: Novák, Ondřej last_name: Novák - first_name: Eleonore full_name: Bouguyon, Eleonore last_name: Bouguyon - first_name: Kevin full_name: Domanegg, Kevin id: a24c7829-16e8-11ed-8527-c4d36ffb7539 last_name: Domanegg orcid: 0000-0002-1215-4264 - first_name: Anne full_name: Krapp, Anne last_name: Krapp - first_name: Philip full_name: Nacry, Philip last_name: Nacry - first_name: Alain full_name: Gojon, Alain last_name: Gojon - first_name: Benoit full_name: Lacombe, Benoit last_name: Lacombe - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 citation: ama: Abualia R, Ötvös K, Novák O, et al. 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. 2022;119(31). doi:10.1073/pnas.2122460119 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. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2122460119 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.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2122460119. ieee: R. Abualia et al., “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, vol. 119, no. 31. National Academy of Sciences, 2022. 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.” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 31, e2122460119, National Academy of Sciences, 2022, doi:10.1073/pnas.2122460119. 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). corr_author: '1' date_created: 2022-08-07T22:01:57Z date_published: 2022-07-25T00:00:00Z date_updated: 2025-05-14T11:00:29Z day: '25' ddc: - '570' department: - _id: EvBe doi: 10.1073/pnas.2122460119 external_id: isi: - '000881496900007' pmid: - '35878040' file: - access_level: open_access checksum: 6e97dedc281247fc3fe238a209f14af0 content_type: application/pdf creator: dernst date_created: 2022-08-08T07:09:58Z date_updated: 2022-08-08T07:09:58Z file_id: '11744' file_name: 2022_PNAS_Abualia.pdf file_size: 3092330 relation: main_file success: 1 file_date_updated: 2022-08-08T07:09:58Z has_accepted_license: '1' intvolume: ' 119' isi: 1 issue: '31' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2542D156-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I 1774-B16 name: Hormone cross-talk drives nutrient dependent plant development publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' scopus_import: '1' status: public title: Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2022' ... --- _id: '11735' abstract: - lang: eng 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." 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)." article_number: '150' article_processing_charge: No article_type: original author: - first_name: Rulin full_name: Chen, Rulin last_name: Chen - first_name: Ziqi full_name: Wang, Ziqi last_name: Wang - first_name: Peng full_name: Song, Peng last_name: Song - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Chen R, Wang Z, Song P, Bickel B. Computational design of high-level interlocking puzzles. ACM Transactions on Graphics. 2022;41(4). doi:10.1145/3528223.3530071 apa: Chen, R., Wang, Z., Song, P., & Bickel, B. (2022). Computational design of high-level interlocking puzzles. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3528223.3530071 chicago: Chen, Rulin, Ziqi Wang, Peng Song, and Bernd Bickel. “Computational Design of High-Level Interlocking Puzzles.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528223.3530071. ieee: R. Chen, Z. Wang, P. Song, and B. Bickel, “Computational design of high-level interlocking puzzles,” ACM Transactions on Graphics, vol. 41, no. 4. Association for Computing Machinery, 2022. ista: Chen R, Wang Z, Song P, Bickel B. 2022. Computational design of high-level interlocking puzzles. ACM Transactions on Graphics. 41(4), 150. mla: Chen, Rulin, et al. “Computational Design of High-Level Interlocking Puzzles.” ACM Transactions on Graphics, vol. 41, no. 4, 150, Association for Computing Machinery, 2022, doi:10.1145/3528223.3530071. short: R. Chen, Z. Wang, P. Song, B. Bickel, ACM Transactions on Graphics 41 (2022). date_created: 2022-08-07T22:01:57Z date_published: 2022-07-22T00:00:00Z date_updated: 2025-04-14T07:28:57Z day: '22' ddc: - '000' department: - _id: BeBi doi: 10.1145/3528223.3530071 ec_funded: 1 external_id: isi: - '000830989200018' file: - access_level: open_access checksum: 0b51651be45b1b33f2072bd5d2686c69 content_type: application/pdf creator: bbickel date_created: 2022-08-28T07:56:19Z date_updated: 2022-08-28T07:56:19Z file_id: '11992' file_name: Chen-2022-High-LevelPuzzle_authorVersion.pdf file_size: 16896871 relation: main_file success: 1 file_date_updated: 2022-08-28T07:56:19Z has_accepted_license: '1' intvolume: ' 41' isi: 1 issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/unlocking-interlocking-riddles/ scopus_import: '1' status: public title: Computational design of high-level interlocking puzzles type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 41 year: '2022' ... --- _id: '11736' abstract: - lang: eng 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." acknowledged_ssus: - _id: ScienComp 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_number: '65' article_processing_charge: No article_type: original author: - first_name: Georg full_name: Sperl, Georg id: 4DD40360-F248-11E8-B48F-1D18A9856A87 last_name: Sperl - first_name: Rosa M. full_name: Sánchez-Banderas, Rosa M. last_name: Sánchez-Banderas - first_name: Manwen full_name: Li, Manwen last_name: Li - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Miguel A. full_name: Otaduy, Miguel A. last_name: Otaduy citation: ama: Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. Estimation of yarn-level simulation models for production fabrics. ACM Transactions on Graphics. 2022;41(4). doi:10.1145/3528223.3530167 apa: Sperl, G., Sánchez-Banderas, R. M., Li, M., Wojtan, C., & Otaduy, M. A. (2022). Estimation of yarn-level simulation models for production fabrics. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3528223.3530167 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.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528223.3530167. 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,” ACM Transactions on Graphics, vol. 41, no. 4. Association for Computing Machinery, 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.” ACM Transactions on Graphics, vol. 41, no. 4, 65, Association for Computing Machinery, 2022, doi:10.1145/3528223.3530167. short: G. Sperl, R.M. Sánchez-Banderas, M. Li, C. Wojtan, M.A. Otaduy, ACM Transactions on Graphics 41 (2022). date_created: 2022-08-07T22:01:58Z date_published: 2022-07-22T00:00:00Z date_updated: 2026-06-18T17:20:41Z day: '22' ddc: - '000' department: - _id: ChWo doi: 10.1145/3528223.3530167 external_id: isi: - '000830989200114' intvolume: ' 41' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1145/3528223.3530167 month: '07' oa: 1 oa_version: Published Version publication: ACM Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: link: - description: News on the ISTA website relation: press_release url: https://ista.ac.at/en/news/digital-yarn-real-socks/ record: - id: '12358' relation: dissertation_contains status: public scopus_import: '1' status: public title: Estimation of yarn-level simulation models for production fabrics type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 41 year: '2022' ... --- _id: '11737' 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. acknowledgement: This work was supported by the Austrian Science Funds (W 1243, I 3456-N27, I 5539-N). article_number: '045302' article_processing_charge: No article_type: original author: - first_name: Uladzislau full_name: Dziom, Uladzislau id: 6A9A37C2-8C5C-11E9-AE53-F2FDE5697425 last_name: Dziom orcid: 0000-0002-1648-0999 - first_name: A. full_name: Shuvaev, A. last_name: Shuvaev - first_name: J. full_name: Gospodarič, J. last_name: Gospodarič - first_name: E. G. full_name: Novik, E. G. last_name: Novik - first_name: A. A. full_name: Dobretsova, A. A. last_name: Dobretsova - first_name: N. N. full_name: Mikhailov, N. N. last_name: Mikhailov - first_name: Z. D. full_name: Kvon, Z. D. last_name: Kvon - first_name: Zhanybek full_name: Alpichshev, Zhanybek id: 45E67A2A-F248-11E8-B48F-1D18A9856A87 last_name: Alpichshev orcid: 0000-0002-7183-5203 - first_name: A. full_name: Pimenov, A. last_name: Pimenov citation: ama: Dziom U, Shuvaev A, Gospodarič J, et al. Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. Physical Review B. 2022;106(4). doi:10.1103/PhysRevB.106.045302 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. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.106.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.” Physical Review B. American Physical Society, 2022. https://doi.org/10.1103/PhysRevB.106.045302. ieee: U. Dziom et al., “Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells,” Physical Review B, vol. 106, no. 4. American Physical Society, 2022. 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. mla: Dziom, Uladzislau, et al. “Universal Transparency and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” Physical Review B, vol. 106, no. 4, 045302, American Physical Society, 2022, doi:10.1103/PhysRevB.106.045302. 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). date_created: 2022-08-07T22:01:58Z date_published: 2022-07-15T00:00:00Z date_updated: 2023-08-03T12:38:57Z day: '15' ddc: - '530' department: - _id: ZhAl doi: 10.1103/PhysRevB.106.045302 external_id: isi: - '000834349200010' file: - access_level: open_access checksum: 115aff9e0cde2f806cb26953d7262791 content_type: application/pdf creator: dernst date_created: 2022-08-08T06:58:22Z date_updated: 2022-08-08T06:58:22Z file_id: '11743' file_name: 2022_PhysRevB_Dziom.pdf file_size: 774455 relation: main_file success: 1 file_date_updated: 2022-08-08T06:58:22Z has_accepted_license: '1' intvolume: ' 106' isi: 1 issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Physical Review B publication_identifier: eissn: - 2469-9969 issn: - 2469-9950 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 106 year: '2022' ... --- _id: '11739' abstract: - lang: eng 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. 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. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Dominik L full_name: Forkert, Dominik L id: 35C79D68-F248-11E8-B48F-1D18A9856A87 last_name: Forkert - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Lorenzo full_name: Portinale, Lorenzo id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87 last_name: Portinale citation: ama: Forkert DL, Maas J, Portinale L. Evolutionary $\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. SIAM Journal on Mathematical Analysis. 2022;54(4):4297-4333. doi:10.1137/21M1410968 apa: Forkert, D. L., 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. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1410968 chicago: Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary $\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/21M1410968. ieee: D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary $\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” SIAM Journal on Mathematical Analysis, vol. 54, no. 4. Society for Industrial and Applied Mathematics, pp. 4297–4333, 2022. 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. mla: Forkert, Dominik L., et al. “Evolutionary $\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” SIAM Journal on Mathematical Analysis, vol. 54, no. 4, Society for Industrial and Applied Mathematics, 2022, pp. 4297–333, doi:10.1137/21M1410968. short: D.L. Forkert, J. Maas, L. Portinale, SIAM Journal on Mathematical Analysis 54 (2022) 4297–4333. corr_author: '1' date_created: 2022-08-07T22:01:59Z date_published: 2022-07-18T00:00:00Z date_updated: 2025-04-15T08:31:31Z day: '18' department: - _id: JaMa doi: 10.1137/21M1410968 ec_funded: 1 external_id: arxiv: - '2008.10962' isi: - '000889274600001' intvolume: ' 54' isi: 1 issue: '4' keyword: - Fokker--Planck equation - gradient flow - evolutionary $\Gamma$-convergence language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2008.10962' month: '07' oa: 1 oa_version: Preprint page: 4297-4333 project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 260788DE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W1245 name: Dissipation and dispersion in nonlinear partial differential equations publication: SIAM Journal on Mathematical Analysis publication_identifier: eissn: - 1095-7154 issn: - 0036-1410 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '10022' relation: earlier_version status: public scopus_import: '1' status: public title: Evolutionary $\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 54 year: '2022' ... --- _id: '11740' 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." acknowledgement: 'Supported by Austrian Science Fund (FWF): I3747, W1230.' article_number: P3.27 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Oliver full_name: Cooley, Oliver id: 43f4ddd0-a46b-11ec-8df6-ef3703bd721d last_name: Cooley - first_name: Nicola full_name: Del Giudice, Nicola last_name: Del Giudice - first_name: Mihyun full_name: Kang, Mihyun last_name: Kang - first_name: Philipp full_name: Sprüssel, Philipp last_name: Sprüssel citation: ama: Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. 2022;29(3). doi:10.37236/10607 apa: 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. Electronic Journal of Combinatorics. https://doi.org/10.37236/10607 chicago: Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2022. https://doi.org/10.37236/10607. ieee: O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” Electronic Journal of Combinatorics, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022. 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. mla: Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” Electronic Journal of Combinatorics, vol. 29, no. 3, P3.27, Electronic Journal of Combinatorics, 2022, doi:10.37236/10607. short: O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022). corr_author: '1' date_created: 2022-08-07T22:01:59Z date_published: 2022-07-29T00:00:00Z date_updated: 2024-10-09T21:03:03Z day: '29' ddc: - '510' department: - _id: MaKw doi: 10.37236/10607 external_id: arxiv: - '2005.07103' isi: - '000836200300001' file: - access_level: open_access checksum: 057c676dcee70236aa234d4ce6138c69 content_type: application/pdf creator: dernst date_created: 2022-08-08T06:28:52Z date_updated: 2022-08-08T06:28:52Z file_id: '11742' file_name: 2022_ElecJournCombinatorics_Cooley.pdf file_size: 1768663 relation: main_file success: 1 file_date_updated: 2022-08-08T06:28:52Z has_accepted_license: '1' intvolume: ' 29' isi: 1 issue: '3' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Electronic Journal of Combinatorics publication_identifier: eissn: - 1077-8926 publication_status: published publisher: Electronic Journal of Combinatorics quality_controlled: '1' scopus_import: '1' status: public title: Phase transition in cohomology groups of non-uniform random simplicial complexes tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 29 year: '2022' ... --- _id: '11775' 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. ' acknowledgement: We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093. alternative_title: - LNCS article_processing_charge: Yes author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Nicolas Adrien full_name: Mazzocchi, Nicolas Adrien id: b26baa86-3308-11ec-87b0-8990f34baa85 last_name: Mazzocchi - first_name: Naci E full_name: Sarac, Naci E id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425 last_name: Sarac citation: ama: 'Henzinger TA, Mazzocchi NA, Sarac NE. Abstract monitors for quantitative specifications. In: 22nd International Conference on Runtime Verification. Vol 13498. Springer Nature; 2022:200-220. doi:10.1007/978-3-031-17196-3_11' apa: 'Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2022). Abstract monitors for quantitative specifications. In 22nd International Conference on Runtime Verification (Vol. 13498, pp. 200–220). Tbilisi, Georgia: Springer Nature. https://doi.org/10.1007/978-3-031-17196-3_11' chicago: Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Abstract Monitors for Quantitative Specifications.” In 22nd International Conference on Runtime Verification, 13498:200–220. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-17196-3_11. ieee: T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in 22nd International Conference on Runtime Verification, 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.” 22nd International Conference on Runtime Verification, vol. 13498, Springer Nature, 2022, pp. 200–20, doi:10.1007/978-3-031-17196-3_11. short: T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 22nd International Conference on Runtime Verification, Springer Nature, 2022, pp. 200–220. conference: end_date: 2022-09-30 location: Tbilisi, Georgia name: 'RV: Runtime Verification' start_date: 2022-09-28 corr_author: '1' date_created: 2022-08-08T17:09:09Z date_published: 2022-09-23T00:00:00Z date_updated: 2026-04-07T12:02:56Z day: '23' ddc: - '000' department: - _id: GradSch - _id: ToHe doi: 10.1007/978-3-031-17196-3_11 ec_funded: 1 external_id: isi: - '000866539700011' file: - access_level: open_access checksum: 05c7dcfbb9053a98f46441fb2eccb213 content_type: application/pdf creator: dernst date_created: 2023-01-20T07:34:50Z date_updated: 2023-01-20T07:34:50Z file_id: '12317' file_name: 2022_LNCS_RV_Henzinger.pdf file_size: 477110 relation: main_file success: 1 file_date_updated: 2023-01-20T07:34:50Z has_accepted_license: '1' intvolume: ' 13498' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 200-220 project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 22nd International Conference on Runtime Verification publication_identifier: issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '20147' relation: dissertation_contains status: public scopus_import: '1' status: public title: Abstract monitors for quantitative specifications tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 13498 year: '2022' ... --- OA_place: publisher _id: '11777' 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Pascal full_name: Wild, Pascal id: 4C20D868-F248-11E8-B48F-1D18A9856A87 last_name: Wild citation: ama: Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:10.15479/at:ista:11777 apa: Wild, P. (2022). High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:11777 chicago: Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:11777. ieee: P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,” Institute of Science and Technology Austria, 2022. ista: Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology Austria. mla: Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:11777. short: P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology Austria, 2022. corr_author: '1' date_created: 2022-08-10T15:51:19Z date_published: 2022-08-11T00:00:00Z date_updated: 2026-04-07T14:18:26Z day: '11' ddc: - '500' - '516' - '514' degree_awarded: PhD department: - _id: GradSch - _id: UlWa doi: 10.15479/at:ista:11777 ec_funded: 1 file: - access_level: open_access checksum: f5f3af1fb7c8a24b71ddc88ad7f7c5b4 content_type: text/x-python creator: pwild date_created: 2022-08-10T15:34:04Z date_updated: 2022-08-10T15:34:04Z description: Code for computer-assisted proofs in Section 8.4.7 in Thesis file_id: '11780' file_name: flags.py file_size: 16828 relation: supplementary_material - access_level: open_access checksum: 1f7c12dfe3bdaa9b147e4fbc3d34e3d5 content_type: text/x-c++src creator: pwild date_created: 2022-08-10T15:34:10Z date_updated: 2022-08-10T15:34:10Z description: Code for proof of Lemma 8.20 in Thesis file_id: '11781' file_name: lowerbound.cpp file_size: 12226 relation: supplementary_material - access_level: open_access checksum: 4cf81455c49e5dec3b9b2e3980137eeb content_type: text/x-python creator: pwild date_created: 2022-08-10T15:34:17Z date_updated: 2022-08-10T15:34:17Z description: Code for proof of Proposition 7.9 in Thesis file_id: '11782' file_name: upperbound.py file_size: 3240 relation: supplementary_material - access_level: open_access checksum: 4e96575b10cbe4e0d0db2045b2847774 content_type: application/pdf creator: pwild date_created: 2022-08-11T16:08:33Z date_updated: 2022-08-11T16:08:33Z file_id: '11809' file_name: finalthesisPascalWildPDFA.pdf file_size: 5086282 relation: main_file title: High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes - access_level: closed checksum: 92d94842a1fb6dca5808448137573b2e content_type: application/zip creator: pwild date_created: 2022-08-11T16:09:19Z date_updated: 2022-08-11T16:09:19Z file_id: '11810' file_name: ThesisSubmission.zip file_size: 18150068 relation: source_file file_date_updated: 2022-08-11T16:09:19Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '170' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: isbn: - 978-3-99078-021-3 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 title: High-dimensional expansion and crossing numbers of simplicial complexes type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2022' ... --- _id: '11783' 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. 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." article_number: '061102' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Lea full_name: Bossmann, Lea id: A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425 last_name: Bossmann orcid: 0000-0002-6854-1343 citation: ama: Bossmann L. Low-energy spectrum and dynamics of the weakly interacting Bose gas. Journal of Mathematical Physics. 2022;63(6). doi:10.1063/5.0089983 apa: Bossmann, L. (2022). Low-energy spectrum and dynamics of the weakly interacting Bose gas. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/5.0089983 chicago: Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” Journal of Mathematical Physics. AIP Publishing, 2022. https://doi.org/10.1063/5.0089983. ieee: L. Bossmann, “Low-energy spectrum and dynamics of the weakly interacting Bose gas,” Journal of Mathematical Physics, vol. 63, no. 6. AIP Publishing, 2022. ista: Bossmann L. 2022. Low-energy spectrum and dynamics of the weakly interacting Bose gas. Journal of Mathematical Physics. 63(6), 061102. mla: Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” Journal of Mathematical Physics, vol. 63, no. 6, 061102, AIP Publishing, 2022, doi:10.1063/5.0089983. short: L. Bossmann, Journal of Mathematical Physics 63 (2022). corr_author: '1' date_created: 2022-08-11T06:37:52Z date_published: 2022-06-10T00:00:00Z date_updated: 2025-04-14T07:43:58Z day: '10' ddc: - '530' department: - _id: RoSe doi: 10.1063/5.0089983 ec_funded: 1 external_id: arxiv: - '2203.00730' isi: - '000809648100002' file: - access_level: open_access checksum: d0d32c338c1896680174be88c70968fa content_type: application/pdf creator: dernst date_created: 2022-08-11T07:03:02Z date_updated: 2022-08-11T07:03:02Z file_id: '11784' file_name: 2022_JourMathPhysics_Bossmann.pdf file_size: 5957888 relation: main_file success: 1 file_date_updated: 2022-08-11T07:03:02Z has_accepted_license: '1' intvolume: ' 63' isi: 1 issue: '6' keyword: - Mathematical Physics - Statistical and Nonlinear Physics language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Journal of Mathematical Physics publication_identifier: eissn: - 1089-7658 issn: - 0022-2488 publication_status: published publisher: AIP Publishing quality_controlled: '1' scopus_import: '1' status: public title: Low-energy spectrum and dynamics of the weakly interacting Bose gas tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 63 year: '2022' ... --- _id: '11808' abstract: - lang: eng 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. alternative_title: - LIPIcs article_number: '1' article_processing_charge: No arxiv: 1 author: - first_name: Kathrin full_name: Hanauer, Kathrin last_name: Hanauer - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Hanauer K, Henzinger M, Schulz C. Recent advances in fully dynamic graph algorithms. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.1' apa: 'Hanauer, K., Henzinger, M., & Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.1' chicago: Hanauer, Kathrin, Monika Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.1. ieee: K. Hanauer, M. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221. 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.' mla: Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.1. short: K. Hanauer, M. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2022-03-30 location: Virtual name: 'SAND: Symposium on Algorithmic Foundations of Dynamic Networks' start_date: 2022-03-28 date_created: 2022-08-11T14:35:52Z date_published: 2022-04-29T00:00:00Z date_updated: 2024-11-06T08:23:49Z day: '29' doi: 10.4230/LIPIcs.SAND.2022.1 extern: '1' external_id: arxiv: - '2102.11169' intvolume: ' 221' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.SAND.2022.1 month: '04' oa: 1 oa_version: Published Version publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks publication_identifier: eissn: - 1868-8969 isbn: - '9783959772242' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Recent advances in fully dynamic graph algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 221 year: '2022' ... --- _id: '11812' abstract: - lang: eng 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." alternative_title: - LIPIcs article_number: '18' article_processing_charge: No arxiv: 1 author: - first_name: Kathrin full_name: Hanauer, Kathrin last_name: Hanauer - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Qi Cheng full_name: Hua, Qi Cheng last_name: Hua citation: ama: 'Hanauer K, Henzinger M, Hua QC. Fully dynamic four-vertex subgraph counting. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.18' apa: 'Hanauer, K., Henzinger, M., & Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.18' chicago: Hanauer, Kathrin, Monika Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.18. ieee: K. Hanauer, M. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221. 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.' mla: Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.18. 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. conference: end_date: 2022-04-30 location: Virtual name: 'SAND: Symposium on Algorithmic Foundations of Dynamic Networks' start_date: 2022-04-28 date_created: 2022-08-12T06:57:55Z date_published: 2022-04-29T00:00:00Z date_updated: 2024-11-06T08:22:47Z day: '29' doi: 10.4230/LIPIcs.SAND.2022.18 extern: '1' external_id: arxiv: - '2106.15524' intvolume: ' 221' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.SAND.2022.18 month: '04' oa: 1 oa_version: Published Version publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks publication_identifier: isbn: - '9783959772242' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Fully dynamic four-vertex subgraph counting type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 221 year: '2022' ... --- _id: '11839' 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." alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Bernd full_name: Prach, Bernd id: 2D561D42-C427-11E9-89B4-9C1AE6697425 last_name: Prach - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Prach B, Lampert C. Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In: Computer Vision – ECCV 2022. Vol 13681. Springer Nature; 2022:350-365. doi:10.1007/978-3-031-19803-8_21' apa: 'Prach, B., & Lampert, C. (2022). Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In Computer Vision – ECCV 2022 (Vol. 13681, pp. 350–365). Tel Aviv, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-19803-8_21' chicago: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” In Computer Vision – ECCV 2022, 13681:350–65. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19803-8_21. ieee: B. Prach and C. Lampert, “Almost-orthogonal layers for efficient general-purpose Lipschitz networks,” in Computer Vision – ECCV 2022, Tel Aviv, Israel, 2022, vol. 13681, 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.' mla: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” Computer Vision – ECCV 2022, vol. 13681, Springer Nature, 2022, pp. 350–65, doi:10.1007/978-3-031-19803-8_21. short: B. Prach, C. Lampert, in:, Computer Vision – ECCV 2022, Springer Nature, 2022, pp. 350–365. conference: end_date: 2022-10-27 location: Tel Aviv, Israel name: 'ECCV: European Conference on Computer Vision' start_date: 2022-10-23 corr_author: '1' date_created: 2022-08-12T15:09:47Z date_published: 2022-10-23T00:00:00Z date_updated: 2026-04-07T11:49:51Z day: '23' department: - _id: GradSch - _id: ChLa doi: 10.1007/978-3-031-19803-8_21 external_id: arxiv: - '2208.03160' isi: - '000904104000021' intvolume: ' 13681' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2208.03160' month: '10' oa: 1 oa_version: Preprint page: 350-365 publication: Computer Vision – ECCV 2022 publication_identifier: eisbn: - '9783031198038' isbn: - '9783031198021' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '19759' relation: dissertation_contains status: public scopus_import: '1' status: public title: Almost-orthogonal layers for efficient general-purpose Lipschitz networks type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 13681 year: '2022' ... --- _id: '11841' 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. 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)." article_number: e2109718119 article_processing_charge: No article_type: original author: - first_name: Zenon full_name: Toprakcioglu, Zenon last_name: Toprakcioglu - first_name: Ayaka full_name: Kamada, Ayaka last_name: Kamada - first_name: Thomas C.T. full_name: Michaels, Thomas C.T. last_name: Michaels - first_name: Mengqi full_name: Xie, Mengqi last_name: Xie - first_name: Johannes full_name: Krausser, Johannes last_name: Krausser - first_name: Jiapeng full_name: Wei, Jiapeng last_name: Wei - first_name: Anđela full_name: Šarić, Anđela id: bf63d406-f056-11eb-b41d-f263a6566d8b last_name: Šarić orcid: 0000-0002-7854-2139 - first_name: Michele full_name: Vendruscolo, Michele last_name: Vendruscolo - first_name: Tuomas P.J. full_name: Knowles, Tuomas P.J. last_name: Knowles citation: ama: Toprakcioglu Z, Kamada A, Michaels TCT, et al. Adsorption free energy predicts amyloid protein nucleation rates. Proceedings of the National Academy of Sciences of the United States of America. 2022;119(31). doi:10.1073/pnas.2109718119 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. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2109718119 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.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2109718119. ieee: Z. Toprakcioglu et al., “Adsorption free energy predicts amyloid protein nucleation rates,” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 31. National Academy of Sciences, 2022. 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. mla: Toprakcioglu, Zenon, et al. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 31, e2109718119, National Academy of Sciences, 2022, doi:10.1073/pnas.2109718119. 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). date_created: 2022-08-14T22:01:45Z date_published: 2022-07-28T00:00:00Z date_updated: 2025-06-12T06:21:34Z day: '28' ddc: - '570' department: - _id: AnSa doi: 10.1073/pnas.2109718119 ec_funded: 1 external_id: isi: - '000903753500002' pmid: - '35901206' file: - access_level: open_access checksum: 0fe3878896cbeb6c44e29222ec2f336a content_type: application/pdf creator: dernst date_created: 2023-10-04T09:05:44Z date_updated: 2023-10-04T09:05:44Z file_id: '14386' file_name: 2022_PNAS_Toprakcioglu.pdf file_size: 2476021 relation: main_file success: 1 file_date_updated: 2023-10-04T09:05:44Z has_accepted_license: '1' intvolume: ' 119' isi: 1 issue: '31' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: eba2549b-77a9-11ec-83b8-a81e493eae4e call_identifier: H2020 grant_number: '802960' name: 'Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines' publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 issn: - 0027-8424 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' scopus_import: '1' status: public title: Adsorption free energy predicts amyloid protein nucleation rates tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2022' ... --- _id: '11842' 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. 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. article_number: '93' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Alice full_name: Marveggio, Alice id: 25647992-AA84-11E9-9D75-8427E6697425 last_name: Marveggio citation: ama: Hensel S, Marveggio A. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. Journal of Mathematical Fluid Mechanics. 2022;24(3). doi:10.1007/s00021-022-00722-2 apa: 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. Springer Nature. https://doi.org/10.1007/s00021-022-00722-2 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.” Journal of Mathematical Fluid Mechanics. Springer Nature, 2022. https://doi.org/10.1007/s00021-022-00722-2. 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,” Journal of Mathematical Fluid Mechanics, vol. 24, no. 3. Springer Nature, 2022. 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.” Journal of Mathematical Fluid Mechanics, vol. 24, no. 3, 93, Springer Nature, 2022, doi:10.1007/s00021-022-00722-2. short: S. Hensel, A. Marveggio, Journal of Mathematical Fluid Mechanics 24 (2022). corr_author: '1' date_created: 2022-08-14T22:01:45Z date_published: 2022-08-01T00:00:00Z date_updated: 2026-04-07T13:28:13Z day: '01' ddc: - '510' department: - _id: JuFi doi: 10.1007/s00021-022-00722-2 ec_funded: 1 external_id: arxiv: - '2112.11154' isi: - '000834834300001' file: - access_level: open_access checksum: 75c5f286300e6f0539cf57b4dba108d5 content_type: application/pdf creator: cchlebak date_created: 2022-08-16T06:55:22Z date_updated: 2022-08-16T06:55:22Z file_id: '11848' file_name: 2022_JMathFluidMech_Hensel.pdf file_size: 2045570 relation: main_file success: 1 file_date_updated: 2022-08-16T06:55:22Z has_accepted_license: '1' intvolume: ' 24' isi: 1 issue: '3' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication: Journal of Mathematical Fluid Mechanics publication_identifier: eissn: - 1422-6952 issn: - 1422-6928 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '14587' relation: dissertation_contains status: public scopus_import: '1' status: public title: Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 24 year: '2022' ... --- _id: '11843' 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. acknowledged_ssus: - _id: Bio - _id: PreCl - _id: EM-Fac 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_number: e78995 article_processing_charge: Yes article_type: original author: - first_name: Kathrin full_name: Tomasek, Kathrin id: 3AEC8556-F248-11E8-B48F-1D18A9856A87 last_name: Tomasek orcid: 0000-0003-3768-877X - first_name: Alexander F full_name: Leithner, Alexander F id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87 last_name: Leithner orcid: 0000-0002-1073-744X - first_name: Ivana full_name: Glatzová, Ivana id: 727b3c7d-4939-11ec-89b3-b9b0750ab74d last_name: Glatzová - first_name: Michael S. full_name: Lukesch, Michael S. last_name: Lukesch - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: 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. eLife. 2022;11. doi:10.7554/eLife.78995 apa: Tomasek, K., Leithner, A. F., Glatzová, I., Lukesch, M. S., Guet, C. C., & Sixt, M. K. (2022). Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.78995 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.” ELife. eLife Sciences Publications, 2022. https://doi.org/10.7554/eLife.78995. 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,” eLife, vol. 11. eLife Sciences Publications, 2022. 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. mla: Tomasek, Kathrin, et al. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack the Host Immune Response by Binding to CD14.” ELife, vol. 11, e78995, eLife Sciences Publications, 2022, doi:10.7554/eLife.78995. short: K. Tomasek, A.F. Leithner, I. Glatzová, M.S. Lukesch, C.C. Guet, M.K. Sixt, ELife 11 (2022). corr_author: '1' date_created: 2022-08-14T22:01:46Z date_published: 2022-07-26T00:00:00Z date_updated: 2025-04-15T07:17:32Z day: '26' ddc: - '570' department: - _id: MiSi - _id: CaGu doi: 10.7554/eLife.78995 ec_funded: 1 external_id: isi: - '000838410200001' pmid: - '35881547' file: - access_level: open_access checksum: 002a3c7c7ea5caa9af9cfbea308f6ea4 content_type: application/pdf creator: cchlebak date_created: 2022-08-16T08:57:37Z date_updated: 2022-08-16T08:57:37Z file_id: '11861' file_name: 2022_eLife_Tomasek.pdf file_size: 2057577 relation: main_file success: 1 file_date_updated: 2022-08-16T08:57:37Z has_accepted_license: '1' intvolume: ' 11' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 25FE9508-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '724373' name: Cellular Navigation Along Spatial Gradients - _id: 26018E70-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P29911 name: Mechanical adaptation of lamellipodial actin publication: eLife publication_identifier: eissn: - 2050-084X publication_status: published publisher: eLife Sciences Publications quality_controlled: '1' related_material: record: - id: '10316' relation: earlier_version status: public scopus_import: '1' status: public title: Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14 tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2022' ... --- _id: '11844' abstract: - lang: eng 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." 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). article_processing_charge: Yes (via OA deal) arxiv: 1 author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 - first_name: Sasha full_name: Voitovych, Sasha last_name: Voitovych citation: ama: 'Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:246-256. doi:10.1145/3519270.3538435' apa: 'Alistarh, D.-A., Rybicki, J., & Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 246–256). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3519270.3538435' chicago: Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 246–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519270.3538435. ieee: D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 246–256. 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.' mla: Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435. 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. conference: end_date: 2022-07-29 location: Salerno, Italy name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2022-07-25 corr_author: '1' date_created: 2022-08-14T22:01:46Z date_published: 2022-07-21T00:00:00Z date_updated: 2025-12-30T09:04:17Z day: '21' ddc: - '000' department: - _id: DaAl doi: 10.1145/3519270.3538435 ec_funded: 1 external_id: arxiv: - '2205.12597' isi: - '001031439100030' file: - access_level: open_access checksum: 4c6b29172b8e355b4fbc364a2e0827b2 content_type: application/pdf creator: cchlebak date_created: 2022-08-16T08:05:15Z date_updated: 2022-08-16T08:05:15Z file_id: '11854' file_name: 2022_PODC_Alistarh.pdf file_size: 1593474 relation: main_file success: 1 file_date_updated: 2022-08-16T08:05:15Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 246-256 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9781450392624' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '19969' relation: later_version status: public scopus_import: '1' status: public title: Near-optimal leader election in population protocols on graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 year: '2022' ...