--- OA_place: publisher OA_type: hybrid _id: '13182' abstract: - lang: eng text: "We characterize critical points of 1-dimensional maps paired in persistent homology\r\ngeometrically and this way get elementary proofs of theorems about the symmetry\r\nof persistence diagrams and the variation of such maps. In particular, we identify\r\nbranching points and endpoints of networks as the sole source of asymmetry and\r\nrelate the cycle basis in persistent homology with a version of the stable marriage\r\nproblem. Our analysis provides the foundations of fast algorithms for maintaining a\r\ncollection of sorted lists together with its persistence diagram." acknowledgement: Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35. The authors of this paper thank anonymous reviewers for their constructive criticism and Monika Henzinger for detailed comments on an earlier version of this paper. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Sebastiano full_name: Cultrera Di Montesano, Sebastiano id: 34D2A09C-F248-11E8-B48F-1D18A9856A87 last_name: Cultrera Di Montesano orcid: 0000-0001-6249-0832 - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Morteza full_name: Saghafian, Morteza id: f86f7148-b140-11ec-9577-95435b8df824 last_name: Saghafian citation: ama: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. 2024;8:1101-1119. doi:10.1007/s41468-023-00126-9 apa: Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian, M. (2024). Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-023-00126-9 chicago: Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Geometric Characterization of the Persistence of 1D Maps.” Journal of Applied and Computational Topology. Springer Nature, 2024. https://doi.org/10.1007/s41468-023-00126-9. ieee: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Geometric characterization of the persistence of 1D maps,” Journal of Applied and Computational Topology, vol. 8. Springer Nature, pp. 1101–1119, 2024. ista: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2024. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. 8, 1101–1119. mla: Biswas, Ranita, et al. “Geometric Characterization of the Persistence of 1D Maps.” Journal of Applied and Computational Topology, vol. 8, Springer Nature, 2024, pp. 1101–19, doi:10.1007/s41468-023-00126-9. short: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Journal of Applied and Computational Topology 8 (2024) 1101–1119. corr_author: '1' date_created: 2023-07-02T22:00:44Z date_published: 2024-10-01T00:00:00Z date_updated: 2026-04-07T12:58:47Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s41468-023-00126-9 ec_funded: 1 external_id: pmid: - '39678706' file: - access_level: open_access checksum: d493df5088c222b88d9ca46b623ad0ee content_type: application/pdf creator: dernst date_created: 2025-01-09T07:39:41Z date_updated: 2025-01-09T07:39:41Z file_id: '18783' file_name: 2024_JourApplCompTopo_Biswas.pdf file_size: 476896 relation: main_file success: 1 file_date_updated: 2025-01-09T07:39:41Z has_accepted_license: '1' intvolume: ' 8' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '10' oa: 1 oa_version: Published Version page: 1101-1119 pmid: 1 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316 grant_number: I4887 name: Persistent Homology, Algorithms and Stochastic Geometry - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science publication: Journal of Applied and Computational Topology publication_identifier: eissn: - 2367-1734 issn: - 2367-1726 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '15094' relation: dissertation_contains status: public scopus_import: '1' status: public title: Geometric characterization of the persistence of 1D maps 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: 8 year: '2024' ... --- _id: '15093' abstract: - lang: eng text: We present a dynamic data structure for maintaining the persistent homology of a time series of real numbers. The data structure supports local operations, including the insertion and deletion of an item and the cutting and concatenating of lists, each in time O(log n + k), in which n counts the critical items and k the changes in the augmented persistence diagram. To achieve this, we design a tailor-made tree structure with an unconventional representation, referred to as banana tree, which may be useful in its own right. acknowledgement: The first and second authors are funded by the European Research Council under the European Union’s Horizon 2020 research and innovation programme, ERC grant no. 788183,“Alpha Shape Theory Extended (Alpha)”, by the Wittgenstein Prize, FWF grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, FWF grant no. I 02979-N35.The third author received funding by the European Research Council under the European Union’s Horizon 2020research and innovation programme, ERC grant no. 101019564, “The Design of Modern Fully Dynamic DataStructures (MoDynStruct)”, and by the Austrian Science Fund through the Wittgenstein Prize with FWF grant no. Z 422-N, and also by FWF grant no. I 5982-N, and by FWF grant no. P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. The fourth author is funded by the Vienna Graduate School on Computational Optimization, FWF project no. W1260-N35. article_processing_charge: No arxiv: 1 author: - first_name: Sebastiano full_name: Cultrera di Montesano, Sebastiano id: 34D2A09C-F248-11E8-B48F-1D18A9856A87 last_name: Cultrera di Montesano orcid: 0000-0001-6249-0832 - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - 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: Lara full_name: Ost, Lara last_name: Ost citation: ama: 'Cultrera di Montesano S, Edelsbrunner H, Henzinger M, Ost L. Dynamically maintaining the persistent homology of time series. In: Woodruff DP, ed. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics; 2024:243-295. doi:10.1137/1.9781611977912.11' apa: 'Cultrera di Montesano, S., Edelsbrunner, H., Henzinger, M., & Ost, L. (2024). Dynamically maintaining the persistent homology of time series. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 243–295). Alexandria, VA, USA: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.11' chicago: Cultrera di Montesano, Sebastiano, Herbert Edelsbrunner, Monika Henzinger, and Lara Ost. “Dynamically Maintaining the Persistent Homology of Time Series.” In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), edited by David P. Woodruff, 243–95. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977912.11. ieee: S. Cultrera di Montesano, H. Edelsbrunner, M. Henzinger, and L. Ost, “Dynamically maintaining the persistent homology of time series,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, VA, USA, 2024, pp. 243–295. ista: 'Cultrera di Montesano S, Edelsbrunner H, Henzinger M, Ost L. 2024. Dynamically maintaining the persistent homology of time series. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SODA: Symposium on Discrete Algorithms, 243–295.' mla: Cultrera di Montesano, Sebastiano, et al. “Dynamically Maintaining the Persistent Homology of Time Series.” Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), edited by David P. Woodruff, Society for Industrial and Applied Mathematics, 2024, pp. 243–95, doi:10.1137/1.9781611977912.11. short: S. Cultrera di Montesano, H. Edelsbrunner, M. Henzinger, L. Ost, in:, D.P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, 2024, pp. 243–295. conference: end_date: 2024-01-10 location: Alexandria, VA, USA name: 'SODA: Symposium on Discrete Algorithms' start_date: 2024-01-07 corr_author: '1' date_created: 2024-03-08T10:27:39Z date_published: 2024-01-04T00:00:00Z date_updated: 2026-04-07T12:58:47Z day: '04' department: - _id: HeEd - _id: MoHe doi: 10.1137/1.9781611977912.11 ec_funded: 1 editor: - first_name: David P. full_name: Woodruff, David P. last_name: Woodruff external_id: arxiv: - '2311.01115' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2311.01115 month: '01' oa: 1 oa_version: Preprint page: 243 - 295 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: 34def286-11ca-11ed-8bc3-da5948e1613c grant_number: Z00422 name: Efficient algorithms - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: P33775 name: Fast Algorithms for a Reactive Network Layer publication: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) publication_identifier: eisbn: - '9781611977912' publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '15094' relation: dissertation_contains status: public scopus_import: '1' status: public title: Dynamically maintaining the persistent homology of time series type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- OA_place: repository _id: '15091' abstract: - lang: eng text: "Motivated by applications in the medical sciences, we study finite chromatic\r\nsets in Euclidean space from a topological perspective. Based on the persistent\r\nhomology for images, kernels and cokernels, we design provably stable\r\nhomological quantifiers that describe the geometric micro- and macro-structure\r\nof how the color classes mingle. These can be efficiently computed using\r\nchromatic variants of Delaunay and alpha complexes, and code that does these\r\ncomputations is provided." article_number: '2212.03128' article_processing_charge: No arxiv: 1 author: - first_name: Sebastiano full_name: Cultrera di Montesano, Sebastiano id: 34D2A09C-F248-11E8-B48F-1D18A9856A87 last_name: Cultrera di Montesano orcid: 0000-0001-6249-0832 - first_name: Ondrej full_name: Draganov, Ondrej id: 2B23F01E-F248-11E8-B48F-1D18A9856A87 last_name: Draganov orcid: 0000-0003-0464-3823 - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Morteza full_name: Saghafian, Morteza id: f86f7148-b140-11ec-9577-95435b8df824 last_name: Saghafian citation: ama: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic alpha complexes. arXiv. doi:10.48550/arXiv.2212.03128 apa: Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., & Saghafian, M. (n.d.). Chromatic alpha complexes. arXiv. https://doi.org/10.48550/arXiv.2212.03128 chicago: Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “Chromatic Alpha Complexes.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2212.03128. ieee: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “Chromatic alpha complexes,” arXiv. . ista: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic alpha complexes. arXiv, 2212.03128. mla: Cultrera di Montesano, Sebastiano, et al. “Chromatic Alpha Complexes.” ArXiv, 2212.03128, doi:10.48550/arXiv.2212.03128. short: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, ArXiv (n.d.). corr_author: '1' date_created: 2024-03-08T10:13:59Z date_published: 2024-02-07T00:00:00Z date_updated: 2026-04-07T12:58:47Z day: '07' department: - _id: HeEd doi: 10.48550/arXiv.2212.03128 external_id: arxiv: - '2212.03128' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2212.03128 month: '02' oa: 1 oa_version: Preprint publication: arXiv publication_status: draft related_material: record: - id: '20585' relation: later_version status: public - id: '18979' relation: dissertation_contains status: public - id: '15094' relation: dissertation_contains status: public status: public title: Chromatic alpha complexes 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: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2024' ... --- OA_place: publisher _id: '18766' abstract: - lang: eng text: Poxviruses are large pleomorphic double-stranded DNA viruses that include well known members such as variola virus, the causative agent of smallpox, Mpox virus, as well as Vaccinia virus (VACV), which serves as a vaccination strain for formerly mentioned viruses. VACV is a valuable model for studying large pleomorphic DNA viruses in general and poxviruses specifically, as many features, such as core morphology and structural proteins, are well conserved within this family. Despite decades of research, our understanding of the structural components and proteins that comprise the poxvirus core in mature virions remains limited. Although major core proteins were identified via indirect experimental evidence, the core's complexity, with its large size, structure and number of involved proteins, has hindered efforts to achieve high-resolution insights and to define the roles of the individual proteins. The specific protein composition of the core's individual layers, including the palisade layer and the inner core wall, has remained unclear. In this study, we have merged multiple approaches, including single particle cryo electron microscopy of purified virus cores, cryo-electron tomography and subtomogram averaging of mature virions and molecular modeling to elucidate the structural determinants of the VACV core. Due to the lack of experimentally derived structures, either in situ or reconstituted in vitro, we used Alphafold to predict models of the putative major core protein candidates, A10, 23k, A3, A4, and L4. Our results show that the VACV core is composed of several layers with varying local symmetries, forming more intricate interactions than observed previously. This allowed us to identify several molecular building blocks forming the viral core lattice. In particular, we identified trimers of protein A10 as a major core structure that forms the palisade layer of the viral core. Additionally, we revealed that six petals of a flower shaped core pore within the core wall are composed of A10 trimers. Furthermore, we obtained a cryo-EM density for the inner core wall that could potentially accommodate an A3 dimer. Integrating descriptions of protein interactions from previous studies enabled us to provide a detailed structural model of the poxvirus core wall, and our findings indicate that the interactions within A10 trimers are likely consistent across orthopox- and parapoxviruses. This combined application of cryo-SPA and cryo-ET can help overcome obstacles in studying complex virus structures in the future, including their key assembly proteins, interactions, and the formation into a core lattice. Our work provides important fundamental new insights into poxvirus core architecture, also considering the recent re-emergence of poxviruses. acknowledged_ssus: - _id: EM-Fac - _id: LifeSc - _id: ScienComp acknowledgement: "This work was funded by the Austrian Science Fund (FWF) grant P31445 and ISTA. I\r\nwould like to express my gratitude to the Scientific Service Units, particularly the Lab\r\nSupport Facility, the Scientific Computing Facility and the Electron Microscopy Facility\r\nfor their tremendous support. I want to especially thank Alois for assisting me with the\r\ninstallation of countless new software and for troubleshooting cluster issues. A special\r\nthanks goes to Valentin for his outstanding support in cryo-EM data acquisition and\r\nhis ongoing help in improving the process to ensure that I obtained the best possible\r\ndata from my sample." alternative_title: - ISTA thesis article_processing_charge: No author: - first_name: Julia full_name: Datler, Julia id: 3B12E2E6-F248-11E8-B48F-1D18A9856A87 last_name: Datler orcid: 0000-0002-3616-8580 citation: ama: Datler J. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. 2024. doi:10.15479/at:ista:18766 apa: Datler, J. (2024). Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18766 chicago: Datler, Julia. “Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18766. ieee: J. Datler, “Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM,” Institute of Science and Technology Austria, 2024. ista: Datler J. 2024. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. Institute of Science and Technology Austria. mla: Datler, Julia. Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18766. short: J. Datler, Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2025-01-07T10:23:12Z date_published: 2024-12-30T00:00:00Z date_updated: 2026-04-07T12:59:44Z day: '30' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: FlSc doi: 10.15479/at:ista:18766 file: - access_level: closed checksum: 3e51cab327c754045c3d29c1a50cc9a9 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: jstanger date_created: 2025-01-07T12:15:11Z date_updated: 2025-01-07T12:15:11Z file_id: '18769' file_name: PhD_thesis_Julia_Datler.docx file_size: 38814932 relation: source_file - access_level: open_access checksum: 22fabe5b97950bf852212f6edb555173 content_type: application/pdf creator: jstanger date_created: 2025-01-07T12:15:14Z date_updated: 2025-01-07T12:15:14Z file_id: '18770' file_name: PhD_thesis_Julia_Datler.pdf file_size: 12044865 relation: main_file success: 1 file_date_updated: 2025-01-07T12:15:14Z has_accepted_license: '1' keyword: - cryo-EM - cryo-ET - cryo-SPA - Structural Virology - Poxvirus - Vaccinia Virus - Structural Biology language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '12' oa: 1 oa_version: Published Version page: '106' project: - _id: 26736D6A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31445 name: Structural conservation and diversity in retroviral capsid publication_identifier: isbn: - 978-3-99078-049-7 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12334' relation: part_of_dissertation status: public - id: '14979' relation: part_of_dissertation status: public status: public supervisor: - first_name: Florian KM full_name: Schur, Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 title: Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM 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: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- APC_amount: 11700 EUR OA_place: publisher OA_type: hybrid _id: '14979' abstract: - lang: eng text: Poxviruses are among the largest double-stranded DNA viruses, with members such as variola virus, monkeypox virus and the vaccination strain vaccinia virus (VACV). Knowledge about the structural proteins that form the viral core has remained sparse. While major core proteins have been annotated via indirect experimental evidence, their structures have remained elusive and they could not be assigned to individual core features. Hence, which proteins constitute which layers of the core, such as the palisade layer and the inner core wall, has remained enigmatic. Here we show, using a multi-modal cryo-electron microscopy (cryo-EM) approach in combination with AlphaFold molecular modeling, that trimers formed by the cleavage product of VACV protein A10 are the key component of the palisade layer. This allows us to place previously obtained descriptions of protein interactions within the core wall into perspective and to provide a detailed model of poxvirus core architecture. Importantly, we show that interactions within A10 trimers are likely generalizable over members of orthopox- and parapoxviruses. acknowledged_ssus: - _id: ScienComp - _id: LifeSc - _id: EM-Fac acknowledgement: "We thank A. Bergthaler (Research Center for Molecular Medicine of the Austrian Academy of Sciences) for providing VACV WR. We thank A. Nicholas and his team at the ISTA proteomics facility, and S. Elefante at the ISTA Scientific Computing facility for their support. We also thank F. Fäßler, D. Porley, T. Muthspiel and other members of the Schur group for support and helpful discussions. We also thank D. Castaño-Díez for support with Dynamo. We thank D. Farrell for his help optimizing the Rosetta protocol to refine the atomic model into the cryo-EM map with symmetry.\r\n\r\nF.K.M.S. acknowledges support from ISTA and EMBO. F.K.M.S. also received support from the Austrian Science Fund (FWF) grant P31445. This publication has been made possible in part by CZI grant DAF2021-234754 and grant https://doi.org/10.37921/812628ebpcwg from the Chan Zuckerberg Initiative DAF, an advised fund of Silicon Valley Community Foundation (funder https://doi.org/10.13039/100014989) awarded to F.K.M.S.\r\n\r\nThis research was also supported by the Scientific Service Units (SSUs) of ISTA through resources provided by Scientific Computing (SciComp), the Life Science Facility (LSF), and the Electron Microscopy Facility (EMF). We also acknowledge the use of COSMIC45 and Colabfold46." article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Julia full_name: Datler, Julia id: 3B12E2E6-F248-11E8-B48F-1D18A9856A87 last_name: Datler orcid: 0000-0002-3616-8580 - first_name: Jesse full_name: Hansen, Jesse id: 1063c618-6f9b-11ec-9123-f912fccded63 last_name: Hansen orcid: 0000-0001-7967-2085 - first_name: Andreas full_name: Thader, Andreas id: 3A18A7B8-F248-11E8-B48F-1D18A9856A87 last_name: Thader - first_name: Alois full_name: Schlögl, Alois id: 45BF87EE-F248-11E8-B48F-1D18A9856A87 last_name: Schlögl orcid: 0000-0002-5621-8100 - first_name: Lukas W full_name: Bauer, Lukas W id: 0c894dcf-897b-11ed-a09c-8186353224b0 last_name: Bauer - first_name: Victor-Valentin full_name: Hodirnau, Victor-Valentin id: 3661B498-F248-11E8-B48F-1D18A9856A87 last_name: Hodirnau orcid: 0000-0003-3904-947X - first_name: Florian KM full_name: Schur, Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 citation: ama: Datler J, Hansen J, Thader A, et al. Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores. Nature Structural & Molecular Biology. 2024;31:1114-1123. doi:10.1038/s41594-023-01201-6 apa: Datler, J., Hansen, J., Thader, A., Schlögl, A., Bauer, L. W., Hodirnau, V.-V., & Schur, F. K. (2024). Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores. Nature Structural & Molecular Biology. Springer Nature. https://doi.org/10.1038/s41594-023-01201-6 chicago: Datler, Julia, Jesse Hansen, Andreas Thader, Alois Schlögl, Lukas W Bauer, Victor-Valentin Hodirnau, and Florian KM Schur. “Multi-Modal Cryo-EM Reveals Trimers of Protein A10 to Form the Palisade Layer in Poxvirus Cores.” Nature Structural & Molecular Biology. Springer Nature, 2024. https://doi.org/10.1038/s41594-023-01201-6. ieee: J. Datler et al., “Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores,” Nature Structural & Molecular Biology, vol. 31. Springer Nature, pp. 1114–1123, 2024. ista: Datler J, Hansen J, Thader A, Schlögl A, Bauer LW, Hodirnau V-V, Schur FK. 2024. Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores. Nature Structural & Molecular Biology. 31, 1114–1123. mla: Datler, Julia, et al. “Multi-Modal Cryo-EM Reveals Trimers of Protein A10 to Form the Palisade Layer in Poxvirus Cores.” Nature Structural & Molecular Biology, vol. 31, Springer Nature, 2024, pp. 1114–23, doi:10.1038/s41594-023-01201-6. short: J. Datler, J. Hansen, A. Thader, A. Schlögl, L.W. Bauer, V.-V. Hodirnau, F.K. Schur, Nature Structural & Molecular Biology 31 (2024) 1114–1123. corr_author: '1' date_created: 2024-02-12T09:59:45Z date_published: 2024-07-01T00:00:00Z date_updated: 2026-04-07T12:59:44Z day: '01' ddc: - '570' department: - _id: FlSc - _id: ScienComp - _id: EM-Fac doi: 10.1038/s41594-023-01201-6 external_id: isi: - '001158144600002' pmid: - '38316877' file: - access_level: open_access checksum: bda7bf65d81455480efaed8ca293b0db content_type: application/pdf creator: dernst date_created: 2024-07-22T11:27:22Z date_updated: 2024-07-22T11:27:22Z file_id: '17307' file_name: 2024_NatureStrucBio_Datler.pdf file_size: 17485494 relation: main_file success: 1 file_date_updated: 2024-07-22T11:27:22Z has_accepted_license: '1' intvolume: ' 31' isi: 1 keyword: - Molecular Biology - Structural Biology language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 1114-1123 pmid: 1 project: - _id: 26736D6A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31445 name: Structural conservation and diversity in retroviral capsid publication: Nature Structural & Molecular Biology publication_identifier: eissn: - 1545-9985 issn: - 1545-9993 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on ISTA Website relation: press_release url: https://ista.ac.at/en/news/down-to-the-core-of-poxviruses/ record: - id: '18766' relation: dissertation_contains status: public scopus_import: '1' status: public title: Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 31 year: '2024' ... --- OA_place: publisher _id: '15020' abstract: - lang: eng text: "This thesis consists of four distinct pieces of work within theoretical biology, with two themes in common: the concept of optimization in biological systems, and the use of information-theoretic tools to quantify biological stochasticity and statistical uncertainty.\r\nChapter 2 develops a statistical framework for studying biological systems which we believe to be optimized for a particular utility function, such as retinal neurons conveying information about visual stimuli. We formalize such beliefs as maximum-entropy Bayesian priors, constrained by the expected utility. We explore how such priors aid inference of system parameters with limited data and enable optimality hypothesis testing: is the utility higher than by chance?\r\nChapter 3 examines the ultimate biological optimization process: evolution by natural selection. As some individuals survive and reproduce more successfully than others, populations evolve towards fitter genotypes and phenotypes. We formalize this as accumulation of genetic information, and use population genetics theory to study how much such information can be accumulated per generation and maintained in the face of random mutation and genetic drift. We identify the population size and fitness variance as the key quantities that control information accumulation and maintenance.\r\nChapter 4 reuses the concept of genetic information from Chapter 3, but from a different perspective: we ask how much genetic information organisms actually need, in particular in the context of gene regulation. For example, how much information is needed to bind transcription factors at correct locations within the genome? Population genetics provides us with a refined answer: with an increasing population size, populations achieve higher fitness by maintaining more genetic information. Moreover, regulatory parameters experience selection pressure to optimize the fitness-information trade-off, i.e. minimize the information needed for a given fitness. This provides an evolutionary derivation of the optimization priors introduced in Chapter 2.\r\nChapter 5 proves an upper bound on mutual information between a signal and a communication channel output (such as neural activity). Mutual information is an important utility measure for biological systems, but its practical use can be difficult due to the large dimensionality of many biological channels. Sometimes, a lower bound on mutual information is computed by replacing the high-dimensional channel outputs with decodes (signal estimates). Our result provides a corresponding upper bound, provided that the decodes are the maximum posterior estimates of the signal." acknowledged_ssus: - _id: ScienComp alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Michal full_name: Hledik, Michal id: 4171253A-F248-11E8-B48F-1D18A9856A87 last_name: Hledik citation: ama: Hledik M. Genetic information and biological optimization. 2024. doi:10.15479/at:ista:15020 apa: Hledik, M. (2024). Genetic information and biological optimization. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:15020 chicago: Hledik, Michal. “Genetic Information and Biological Optimization.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:15020. ieee: M. Hledik, “Genetic information and biological optimization,” Institute of Science and Technology Austria, 2024. ista: Hledik M. 2024. Genetic information and biological optimization. Institute of Science and Technology Austria. mla: Hledik, Michal. Genetic Information and Biological Optimization. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:15020. short: M. Hledik, Genetic Information and Biological Optimization, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-02-23T14:02:04Z date_published: 2024-02-23T00:00:00Z date_updated: 2026-04-07T12:59:25Z day: '23' ddc: - '576' - '519' degree_awarded: PhD department: - _id: GradSch - _id: NiBa - _id: GaTk doi: 10.15479/at:ista:15020 ec_funded: 1 file: - access_level: open_access checksum: b2d3da47c98d481577a4baf68944fe41 content_type: application/pdf creator: mhledik date_created: 2024-02-23T13:50:53Z date_updated: 2024-02-23T13:50:53Z file_id: '15021' file_name: hledik thesis pdfa 2b.pdf file_size: 7102089 relation: main_file success: 1 - access_level: closed checksum: eda9b9430da2610fee7ce1c1419a479a content_type: application/zip creator: mhledik date_created: 2024-02-23T13:50:54Z date_updated: 2024-02-23T14:20:16Z file_id: '15022' file_name: hledik thesis source.zip file_size: 14014790 relation: source_file file_date_updated: 2024-02-23T14:20:16Z has_accepted_license: '1' keyword: - Theoretical biology - Optimality - Evolution - Information language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '158' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 2665AAFE-B435-11E9-9278-68D0E5697425 grant_number: RGP0034/2018 name: Can evolution minimize spurious signaling crosstalk to reach optimal performance? - _id: bd6958e0-d553-11ed-ba76-86eba6a76c00 grant_number: '101055327' name: Understanding the evolution of continuous genomes publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7606' relation: part_of_dissertation status: public - id: '12081' relation: part_of_dissertation status: public - id: '7553' relation: part_of_dissertation status: public status: public supervisor: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Gašper full_name: Tkačik, Gašper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkačik orcid: 0000-0002-6699-1455 title: Genetic information and biological optimization type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- OA_place: publisher _id: '18568' abstract: - lang: eng text: "Locomotion is ubiquitous in the animal kingdom because an animal's survival depends on its ability to navigate its environment to find food, avoid predators and locate potential mates. These behaviours require control mechanisms that can extract information from the environment, particularly visual cues. Selective evolutionary pressures have thus refined such visuomotor transformations in a species-specific manner to meet the specific ecological and ethological challenges of each organism. However, a common challenge across organisms as visual information processing\r\nbecomes increasingly detailed is the mechanisms required to synthesise disparate pieces of information into a coherent percept or unified picture of the world. In this thesis, I investigate how disparate visual information is combined in the brain of Drosophila melanogaster to effectively guide locomotion.\r\nFor this, I first designed and built a behavioural setup to record locomotion and present visual stimuli to freely-walking fruit flies in a closed-loop manner. This setup allowed the investigation of innate visually-guided behaviours, including the optomotor reflex and courtship.\r\nSecond, taking advantage of my system I investigated the optomotor response, a reflexive visual stabilisation behaviour in which flies turn in the direction of global motion to minimise retinal slip. This behaviour is thought to be mediated by Lobula plate tangential cells (LPTCs); a complex network of optic-flow-sensitive neurons essential for self-motion estimation. Using a novel genetic mutant, I demonstrate that electrical coupling between two LPTC subtypes, contralateral HS and H2 neurons, regulates the balance between smooth optomotor turning and saccadic anti-optomotor responses. These findings underscore the critical role of binocular motion cue integration in guiding course control. Finally, I developed a novel behavioural paradigm in which a sexually aroused male fruit fly is presented with an optomotor distractor. This setup creates competition between two visual behaviours, courtship tracking and the optomotor response, enabling me to explore how the visual system resolves this conflict. In this setting, males\r\nengaged in courtship selectively suppress their optomotor response based on the female's location. Furthermore, when this experiment is replicated with an “artificial female”, optogenetically aroused males alternate between tracking and optomotor responses. The probability and dynamics of this switching are determined by the relative strengths of the two competing stimuli. In summary, the results presented in this thesis explore two mechanisms – integration and competition - through which visual information is combined in the brain of the fruit fly to drive locomotion." acknowledged_ssus: - _id: M-Shop acknowledgement: I am incredibly thankful for the outstanding support provided by ISTA, especially the Machine Shop team, who made conducting research much easier and more efficient. I am also grateful for the funding provided by European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie programme (665385) and The German Research Foundation grant DFG (SPP2205) “Evolutionary optimization of neuronal processing”. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Roshan K full_name: Satapathy, Roshan K id: 46046B7A-F248-11E8-B48F-1D18A9856A87 last_name: Satapathy orcid: 0009-0006-2974-5075 citation: ama: Satapathy RK. Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster. 2024. doi:10.15479/at:ista:18568 apa: Satapathy, R. K. (2024). Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18568 chicago: Satapathy, Roshan K. “Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18568. ieee: R. K. Satapathy, “Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster,” Institute of Science and Technology Austria, 2024. ista: Satapathy RK. 2024. Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster. Institute of Science and Technology Austria. mla: Satapathy, Roshan K. Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18568. short: R.K. Satapathy, Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-11-19T12:34:30Z date_published: 2024-11-20T00:00:00Z date_updated: 2026-04-07T13:00:36Z day: '20' ddc: - '573' degree_awarded: PhD department: - _id: GradSch - _id: MaJö doi: 10.15479/at:ista:18568 ec_funded: 1 file: - access_level: open_access checksum: 340f2bfe882c8a85e11ec0687ca15f5e content_type: application/pdf creator: rsatapat date_created: 2024-11-19T12:39:55Z date_updated: 2024-11-19T12:39:55Z file_id: '18570' file_name: Roshan PhD thesis-Final.pdf file_size: 10960975 relation: main_file success: 1 - access_level: closed checksum: 0f846fce60d6ea511e07f77eff59a6a1 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: rsatapat date_created: 2024-11-19T12:46:47Z date_updated: 2024-12-13T10:27:25Z file_id: '18571' file_name: Roshan PhD thesis-Final.docx file_size: 36695917 relation: source_file file_date_updated: 2024-12-13T10:27:25Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-sa/4.0/ month: '11' oa: 1 oa_version: Published Version page: '114' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: isbn: - 978-3-99078-047-3 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '18444' relation: part_of_dissertation status: public status: public supervisor: - first_name: Maximilian A full_name: Jösch, Maximilian A id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 title: Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster tmp: image: /images/cc_by_sa.png legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0) short: CC BY-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- APC_amount: 6828 EUR DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '18444' abstract: - lang: eng text: Animals rely on compensatory actions to maintain stability and navigate their environment efficiently. These actions depend on global visual motion cues known as optic-flow. While the optomotor response has been the traditional focus for studying optic-flow compensation in insects, its simplicity has been insufficient to determine the role of the intricate optic-flow processing network involved in visual course control. Here, we reveal a series of course control behaviours in Drosophila and link them to specific neural circuits. We show that bilateral electrical coupling of optic-flow-sensitive neurons in the fly’s lobula plate are required for a proper course control. This electrical interaction works alongside chemical synapses within the HS-H2 network to control the dynamics and direction of turning behaviours. Our findings reveal how insects use bilateral motion cues for navigation, assigning a new functional significance to the HS-H2 network and suggesting a previously unknown role for gap junctions in non-linear operations. acknowledged_ssus: - _id: Bio - _id: M-Shop - _id: LifeSc acknowledgement: We thank Georg Ammer and Alexander Borst for sharing anti-ShakB serum antibodies. We thank Nélia Varela and Eugenia Chiappe for the w1118;+;10XUAS-IVS-eGFPKir2.1/TM6B fly line, Augustin Hrvoje for the shakB[2] line, as well as Jesse Isaacman-Beck and Thomas R Clandinin for the gift of y1,w*;20XUAS-IVS-PhiC31;+ fly line. We also thank Armel Nicolas and Tomas Masson for the proteomic analysis, Ece Sönmez for help with fly crosses and dissections for protein analysis, and Lisa Hofer for assistance with the reconstruction experiments. We would also like to thank Laura Burnett for drawing scientific illustrations used in the figures. We are particularly grateful to members of the Siekhaus, the Kondrashov, and the Chiappe group for providing material support and technical advice. We are grateful to Daria Siekhaus, Eugenia Chiappe, Alexander Borst, Ben deBivort, and all the members of the Joesch laboratory for valuable discussions and comments on the manuscript. Stocks from the Bloomington Drosophila Stock Center (NIH P40OD018537) and the Vienna Drosophila Resource Center were used in this study. The Scientific Service Units of ISTA supported the project through resources provided by the Imaging and Optics Facility, MIBA Machine Shop, and the Lab Support Facility, as well as Vienna Drosophila Research Centre. This work was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the SPP 2205 – 429960716 (M.J.). article_number: '8830' article_processing_charge: Yes article_type: original author: - first_name: Victoria full_name: Pokusaeva, Victoria id: 3184041C-F248-11E8-B48F-1D18A9856A87 last_name: Pokusaeva orcid: 0000-0001-7660-444X - first_name: Roshan K full_name: Satapathy, Roshan K id: 46046B7A-F248-11E8-B48F-1D18A9856A87 last_name: Satapathy orcid: 0009-0006-2974-5075 - first_name: Olga full_name: Symonova, Olga id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87 last_name: Symonova orcid: 0000-0003-2012-9947 - first_name: Maximilian A full_name: Jösch, Maximilian A id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 citation: ama: Pokusaeva V, Satapathy RK, Symonova O, Jösch MA. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. Nature Communications. 2024;15. doi:10.1038/s41467-024-53173-w apa: Pokusaeva, V., Satapathy, R. K., Symonova, O., & Jösch, M. A. (2024). Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-024-53173-w chicago: Pokusaeva, Victoria, Roshan K Satapathy, Olga Symonova, and Maximilian A Jösch. “Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies.” Nature Communications. Springer Nature, 2024. https://doi.org/10.1038/s41467-024-53173-w. ieee: V. Pokusaeva, R. K. Satapathy, O. Symonova, and M. A. Jösch, “Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies,” Nature Communications, vol. 15. Springer Nature, 2024. ista: Pokusaeva V, Satapathy RK, Symonova O, Jösch MA. 2024. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. Nature Communications. 15, 8830. mla: Pokusaeva, Victoria, et al. “Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies.” Nature Communications, vol. 15, 8830, Springer Nature, 2024, doi:10.1038/s41467-024-53173-w. short: V. Pokusaeva, R.K. Satapathy, O. Symonova, M.A. Jösch, Nature Communications 15 (2024). corr_author: '1' date_created: 2024-10-20T22:02:05Z date_published: 2024-10-12T00:00:00Z date_updated: 2026-04-07T13:00:35Z day: '12' ddc: - '570' department: - _id: MaJö doi: 10.1038/s41467-024-53173-w external_id: isi: - '001336422500001' pmid: - '39396050' file: - access_level: open_access checksum: 2af4d6e7364329107aa94d072d594ce0 content_type: application/pdf creator: dernst date_created: 2024-10-21T12:11:10Z date_updated: 2024-10-21T12:11:10Z file_id: '18459' file_name: 2024_NatureComm_Pokusaeva.pdf file_size: 8276667 relation: main_file success: 1 file_date_updated: 2024-10-21T12:11:10Z has_accepted_license: '1' intvolume: ' 15' isi: 1 language: - iso: eng month: '10' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 9B767A34-BA93-11EA-9121-9846C619BF3A grant_number: '429960716' name: Evolution of Sensorimotor Transformation Across Diptera publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '17488' relation: research_data status: public - id: '18568' relation: dissertation_contains status: public scopus_import: '1' status: public title: Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 15 year: '2024' ... --- OA_place: publisher _id: '17336' abstract: - lang: eng text: "This thesis deals with the study of stochastic processes and their ergodicity properties. The\r\nvariety of problems encountered calls for a set of different approaches, ranging from classical to\r\nmodern ones: a special place is held by probabilistic methods based on couplings, by functional\r\ninequalities, and by the theory of gradient flows in the space of measures.\r\n\r\nThe material is organized as follows. Chapter 1 contains the introduction to this thesis, starting\r\nwith a general presentation of some of the relevant topics. Section 1.1 is dedicated to the\r\ntheory of gradient flows in metric spaces, and introduces the first contribution of this thesis\r\n[DSMP24], which is presented in detail in Chapter 2. Section 1.2 moves to the topic of\r\ncurvature of Markov chains, concluding with a brief description of our second contribution\r\n[Ped23], which is included in Chapter 3. Section 1.3 discusses applications of stochastic\r\nprocesses to the theory of sampling, in particular the recent framework of score-based diffusion\r\nmodels, and our contribution [PMM24], which is contained in Chapter 4. Section 1.4 discusses\r\nsome related problems, concerning the regularization properties of the heat flow. It serves\r\nas a motivation for the work [BP24], which we report in Chapter 5. Finally, Section 1.5\r\ndiscusses the last contribution of this thesis, which can be found in Chapter 6. It deals with\r\nthe convergence to equilibrium of a particular stochastic model from quantitative genetics:\r\nthis is established via some functional inequalities, which we prove with probabilistic arguments\r\nbased on couplings.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Pedrotti F. Functional inequalities and convergence of stochastic processes. 2024. doi:10.15479/at:ista:17336 apa: Pedrotti, F. (2024). Functional inequalities and convergence of stochastic processes. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17336 chicago: Pedrotti, Francesco. “Functional Inequalities and Convergence of Stochastic Processes.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17336. ieee: F. Pedrotti, “Functional inequalities and convergence of stochastic processes,” Institute of Science and Technology Austria, 2024. ista: Pedrotti F. 2024. Functional inequalities and convergence of stochastic processes. Institute of Science and Technology Austria. mla: Pedrotti, Francesco. Functional Inequalities and Convergence of Stochastic Processes. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17336. short: F. Pedrotti, Functional Inequalities and Convergence of Stochastic Processes, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-07-29T09:14:14Z date_published: 2024-07-31T00:00:00Z date_updated: 2026-04-07T13:00:03Z day: '31' ddc: - '500' - '510' - '515' - '519' degree_awarded: PhD department: - _id: GradSch - _id: JaMa doi: 10.15479/at:ista:17336 ec_funded: 1 file: - access_level: open_access checksum: 11650bab714ef85ad43a287060850523 content_type: application/pdf creator: fpedrott date_created: 2024-08-02T09:23:26Z date_updated: 2024-08-02T09:23:26Z file_id: '17366' file_name: thesis_final.pdf file_size: 2941599 relation: main_file success: 1 - access_level: closed checksum: c30ba5611941226cf1bfc867c25b1e80 content_type: application/x-zip-compressed creator: fpedrott date_created: 2024-08-02T09:27:15Z date_updated: 2024-08-02T09:27:15Z file_id: '17367' file_name: thesis_final_source.zip file_size: 6293375 relation: source_file file_date_updated: 2024-08-02T09:27:15Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '183' 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 publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '17351' relation: part_of_dissertation status: public - id: '17353' relation: part_of_dissertation status: public - id: '17350' relation: part_of_dissertation status: public - id: '17352' relation: part_of_dissertation status: public - id: '17143' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 title: Functional inequalities and convergence of stochastic processes 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: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- _id: '17143' abstract: - lang: eng text: "This paper deals with local criteria for the convergence to a global minimiser for gradient flow trajectories and their discretisations. To obtain quantitative estimates on the speed of convergence, we consider variations on the classical Kurdyka–Łojasiewicz inequality for a large class of parameter functions. Our assumptions are given in terms of the initial data, without any reference to an equilibrium point. The main results are convergence statements for gradient flow curves and proximal point sequences to a global minimiser, together with sharp quantitative estimates on the speed of convergence. These convergence results apply in the general setting of lower semicontinuous functionals on complete metric spaces, generalising recent results for smooth functionals on Rn. While the non-smooth setting covers very general spaces, it is also useful for (non)-smooth functionals on Rn.\r\n." acknowledgement: The authors gratefully acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 716117). This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/ESP208. This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Lorenzo full_name: Dello Schiavo, Lorenzo id: ECEBF480-9E4F-11EA-B557-B0823DDC885E last_name: Dello Schiavo orcid: 0000-0002-9881-6870 - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Dello Schiavo L, Maas J, Pedrotti F. Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. Transactions of the American Mathematical Society. 2024;377(6):3779-3804. doi:10.1090/tran/9156 apa: Dello Schiavo, L., Maas, J., & Pedrotti, F. (2024). Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/9156 chicago: Dello Schiavo, Lorenzo, Jan Maas, and Francesco Pedrotti. “Local Conditions for Global Convergence of Gradient Flows and Proximal Point Sequences in Metric Spaces.” Transactions of the American Mathematical Society. American Mathematical Society, 2024. https://doi.org/10.1090/tran/9156. ieee: L. Dello Schiavo, J. Maas, and F. Pedrotti, “Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces,” Transactions of the American Mathematical Society, vol. 377, no. 6. American Mathematical Society, pp. 3779–3804, 2024. ista: Dello Schiavo L, Maas J, Pedrotti F. 2024. Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. Transactions of the American Mathematical Society. 377(6), 3779–3804. mla: Dello Schiavo, Lorenzo, et al. “Local Conditions for Global Convergence of Gradient Flows and Proximal Point Sequences in Metric Spaces.” Transactions of the American Mathematical Society, vol. 377, no. 6, American Mathematical Society, 2024, pp. 3779–804, doi:10.1090/tran/9156. short: L. Dello Schiavo, J. Maas, F. Pedrotti, Transactions of the American Mathematical Society 377 (2024) 3779–3804. date_created: 2024-06-16T22:01:06Z date_published: 2024-06-01T00:00:00Z date_updated: 2026-04-07T13:00:02Z day: '01' department: - _id: JaMa doi: 10.1090/tran/9156 ec_funded: 1 external_id: arxiv: - '2304.05239' isi: - '001203273300001' intvolume: ' 377' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2304.05239 month: '06' oa: 1 oa_version: Preprint page: 3779-3804 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: 34dbf174-11ca-11ed-8bc3-afe9d43d4b9c grant_number: E208 name: Configuration Spaces over Non-Smooth Spaces publication: Transactions of the American Mathematical Society publication_identifier: eissn: - 1088-6850 issn: - 0002-9947 publication_status: published publisher: American Mathematical Society quality_controlled: '1' related_material: record: - id: '17336' relation: dissertation_contains status: public scopus_import: '1' status: public title: Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 377 year: '2024' ... --- OA_place: repository _id: '17350' abstract: - lang: eng text: "Score-based generative models (SGMs) are powerful tools to sample from\r\ncomplex data distributions. Their underlying idea is to (i) run a forward\r\nprocess for time $T_1$ by adding noise to the data, (ii) estimate its score\r\nfunction, and (iii) use such estimate to run a reverse process. As the reverse\r\nprocess is initialized with the stationary distribution of the forward one, the\r\nexisting analysis paradigm requires $T_1\\to\\infty$. This is however\r\nproblematic: from a theoretical viewpoint, for a given precision of the score\r\napproximation, the convergence guarantee fails as $T_1$ diverges; from a\r\npractical viewpoint, a large $T_1$ increases computational costs and leads to\r\nerror propagation. This paper addresses the issue by considering a version of\r\nthe popular predictor-corrector scheme: after running the forward process, we\r\nfirst estimate the final distribution via an inexact Langevin dynamics and then\r\nrevert the process. Our key technical contribution is to provide convergence\r\nguarantees which require to run the forward process only for a fixed finite\r\ntime $T_1$. Our bounds exhibit a mild logarithmic dependence on the input\r\ndimension and the subgaussian norm of the target distribution, have minimal\r\nassumptions on the data, and require only to control the $L^2$ loss on the\r\nscore approximation, which is the quantity minimized in practice." article_processing_charge: No arxiv: 1 author: - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. arXiv. doi:10.48550/arXiv.2305.14164 apa: Pedrotti, F., Maas, J., & Mondelli, M. (n.d.). Improved convergence of score-based diffusion models via prediction-correction. arXiv. https://doi.org/10.48550/arXiv.2305.14164 chicago: Pedrotti, Francesco, Jan Maas, and Marco Mondelli. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2305.14164. ieee: F. Pedrotti, J. Maas, and M. Mondelli, “Improved convergence of score-based diffusion models via prediction-correction,” arXiv. . ista: Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. arXiv, 10.48550/arXiv.2305.14164. mla: Pedrotti, Francesco, et al. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” ArXiv, doi:10.48550/arXiv.2305.14164. short: F. Pedrotti, J. Maas, M. Mondelli, ArXiv (n.d.). corr_author: '1' date_created: 2024-07-31T07:56:40Z date_published: 2024-06-06T00:00:00Z date_updated: 2026-04-07T13:00:02Z day: '06' department: - _id: JaMa - _id: MaMo doi: 10.48550/arXiv.2305.14164 external_id: arxiv: - '2305.14164' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2305.14164 month: '06' oa: 1 oa_version: Preprint project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: arXiv publication_status: draft related_material: record: - id: '18897' relation: later_version status: public - id: '17336' relation: dissertation_contains status: public status: public title: Improved convergence of score-based diffusion models via prediction-correction type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- OA_place: repository _id: '17352' abstract: - lang: eng text: "We prove upper bounds on the $L^\\infty$-Wasserstein distance from optimal\r\ntransport between strongly log-concave probability densities and log-Lipschitz\r\nperturbations. In the simplest setting, such a bound amounts to a\r\ntransport-information inequality involving the $L^\\infty$-Wasserstein metric\r\nand the relative $L^\\infty$-Fisher information. We show that this inequality\r\ncan be sharpened significantly in situations where the involved densities are\r\nanisotropic. Our proof is based on probabilistic techniques using Langevin\r\ndynamics. As an application of these results, we obtain sharp exponential rates\r\nof convergence in Fisher's infinitesimal model from quantitative genetics,\r\ngeneralising recent results by Calvez, Poyato, and Santambrogio in dimension 1\r\nto arbitrary dimensions." article_number: '2402.04151' article_processing_charge: No arxiv: 1 author: - first_name: Kseniia full_name: Khudiakova, Kseniia id: 4E6DC800-AE37-11E9-AC72-31CAE5697425 last_name: Khudiakova orcid: 0000-0002-6246-1465 - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. arXiv. doi:10.48550/arXiv.2402.04151 apa: Khudiakova, K., Maas, J., & Pedrotti, F. (n.d.). L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. arXiv. https://doi.org/10.48550/arXiv.2402.04151 chicago: Khudiakova, Kseniia, Jan Maas, and Francesco Pedrotti. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2402.04151. ieee: K. Khudiakova, J. Maas, and F. Pedrotti, “L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model,” arXiv. . ista: Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. arXiv, 2402.04151. mla: Khudiakova, Kseniia, et al. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” ArXiv, 2402.04151, doi:10.48550/arXiv.2402.04151. short: K. Khudiakova, J. Maas, F. Pedrotti, ArXiv (n.d.). corr_author: '1' date_created: 2024-07-31T08:07:40Z date_published: 2024-02-07T00:00:00Z date_updated: 2026-04-07T13:00:02Z day: '07' department: - _id: JaMa doi: 10.48550/arXiv.2402.04151 external_id: arxiv: - '2402.04151' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2402.04151 month: '02' oa: 1 oa_version: Preprint project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 34d33d68-11ca-11ed-8bc3-ec13763c0ca8 grant_number: '26293' name: The impact of deleterious mutations on small populations publication: arXiv publication_status: draft related_material: record: - id: '20050' relation: later_version status: public - id: '17336' relation: dissertation_contains status: public status: public title: L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher's infinitesimal model type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- OA_place: repository _id: '17353' abstract: - lang: eng text: "In this paper we derive estimates for the Hessian of the logarithm\r\n(log-Hessian) for solutions to the heat equation. For initial data in the form\r\nof log-Lipschitz perturbation of strongly log-concave measures, the log-Hessian\r\nadmits an explicit, uniform (in space) lower bound. This yields a new estimate\r\nfor the Lipschitz constant of a transport map pushing forward the standard\r\nGaussian to a measure in this class. Further connections are discussed with\r\nscore-based diffusion models and improved Gaussian logarithmic Sobolev\r\ninequalities. Finally, we show that assuming only fast decay of the tails of\r\nthe initial datum does not suffice to guarantee uniform log-Hessian upper\r\nbounds." article_number: '2404.15205' article_processing_charge: No arxiv: 1 author: - first_name: Giovanni full_name: Brigati, Giovanni id: 63ff57e8-1fbb-11ee-88f2-f558ffc59cf1 last_name: Brigati - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. arXiv. doi:10.48550/arXiv.2404.15205 apa: Brigati, G., & Pedrotti, F. (n.d.). Heat flow, log-concavity, and Lipschitz transport maps. arXiv. https://doi.org/10.48550/arXiv.2404.15205 chicago: Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2404.15205. ieee: G. Brigati and F. Pedrotti, “Heat flow, log-concavity, and Lipschitz transport maps,” arXiv. . ista: Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. arXiv, 2404.15205. mla: Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” ArXiv, 2404.15205, doi:10.48550/arXiv.2404.15205. short: G. Brigati, F. Pedrotti, ArXiv (n.d.). corr_author: '1' date_created: 2024-07-31T08:17:14Z date_published: 2024-05-08T00:00:00Z date_updated: 2026-04-07T13:00:02Z day: '08' department: - _id: JaMa doi: 10.48550/arXiv.2404.15205 external_id: arxiv: - '2404.15205' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2404.15205 month: '05' oa: 1 oa_version: Preprint publication: arXiv publication_status: draft related_material: record: - id: '20591' relation: later_version status: public - id: '17336' relation: dissertation_contains status: public status: public title: Heat flow, log-concavity, and Lipschitz transport maps type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- OA_place: publisher _id: '18088' abstract: - lang: eng text: "Instant messaging applications like Whatsapp, Signal or Telegram have become ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption, but also security guarantees even when the key material gets compromised.\r\nThese are achieved through frequent key update performed by users.\r\nIn particular, the compromise of a group key should preserve confidentiality of previously exchanged messages (forward secrecy), and a subsequent key update will ensure security for future ones (post-compromise security).\r\nThough great protocols for one-on-one communication have been known for some time, the design of ones that scale efficiently for larger groups while achieving akin security guarantees is a hard problem.\r\nA great deal of research has been aimed at this topic, much of it under the umbrella of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in 2018, this joint effort by academics and industry culminated in 2023 with the publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt the core of secure group messaging is a cryptographic primitive termed Continuous Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing group of users to agree on a common key with the added functionality security against compromises is achieved by users asynchronously issuing a key update. In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst, we present a new technique to effect dynamic operations in groups, i.e., add or remove members, that can be more efficient that the one employed by MLS in certain settings.\r\nConsidering the setting of users belonging to multiple overlapping groups, we then show lowerbounds on the communication cost of constructions that leverage said overlap, at the same time showing protocols that are asymptotically optimal and efficient for practical settings, respectively. Along the way, we show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn important feature in CGKA protocols, particularly for big groups, is the possibility of executing several group operations concurrently. While later versions of MLS support this, they do at the cost of worsening the communication efficiency of future group operations.\r\nIn this thesis we introduce two new protocols that permit concurrency without any negative effect on efficiency. Our protocols circumvent previously existing lower bounds by satisfying a new notion of post-compromise security that only asks for security to be re-established after a certain number of key updates have taken place. While this can be slower than MLS in terms of rounds of communication, we show that it leads to more efficient overall communication. \r\nAdditionally, we introduce a new technique that allows group members to decrease the information they need to store and download, which makes one of our protocols enjoy much lower download cost than any other existing CGKA constructions. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Guillermo full_name: Pascual Perez, Guillermo id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87 last_name: Pascual Perez orcid: 0000-0001-8630-415X citation: ama: Pascual Perez G. On the efficiency and security of secure group messaging. 2024. doi:10.15479/at:ista:18088 apa: Pascual Perez, G. (2024). On the efficiency and security of secure group messaging. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18088 chicago: Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group Messaging.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18088. ieee: G. Pascual Perez, “On the efficiency and security of secure group messaging,” Institute of Science and Technology Austria, 2024. ista: Pascual Perez G. 2024. On the efficiency and security of secure group messaging. Institute of Science and Technology Austria. mla: Pascual Perez, Guillermo. On the Efficiency and Security of Secure Group Messaging. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18088. short: G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-09-18T12:59:49Z date_published: 2024-09-18T00:00:00Z date_updated: 2026-04-07T13:01:26Z day: '18' ddc: - '000' degree_awarded: PhD department: - _id: KrPi - _id: GradSch doi: 10.15479/at:ista:18088 ec_funded: 1 file: - access_level: closed checksum: ce0dca715b3df48e52e2e891b6ac1bc5 content_type: application/x-zip-compressed creator: gpascual date_created: 2024-09-19T12:35:38Z date_updated: 2024-09-19T12:35:38Z file_id: '18099' file_name: thesis_bundle.zip file_size: 11917734 relation: source_file - access_level: open_access checksum: 4a2c72e90f1a0ef2a13cff800f8d1265 content_type: application/pdf creator: gpascual date_created: 2024-09-19T12:36:08Z date_updated: 2024-09-19T12:36:08Z file_id: '18100' file_name: thesis_gpasper.pdf file_size: 2729427 relation: main_file file_date_updated: 2024-09-19T12:36:08Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '09' oa: 1 oa_version: Published Version page: '239' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10408' relation: part_of_dissertation status: public - id: '11476' relation: part_of_dissertation status: public - id: '18086' relation: part_of_dissertation status: public - id: '10049' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: On the efficiency and security of secure group messaging tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- OA_place: publisher _id: '17490' abstract: - lang: eng text: "Deep learning is essential in numerous applications nowadays, with many recent advancements made possible by training very large models. Despite their broad applicability, training neural networks is often time-intensive, and it is usually impractical to manage large models and datasets on a single machine. To address these issues, distributed deep learning training has become increasingly important. However, distributed training requires synchronization among nodes, and the mini-batch stochastic gradient descent algorithm places a significant load on network connections. A possible solution to tackle the synchronization bottleneck is to reduce a message size by lossy compression.\r\n\r\nIn this thesis, we investigate systems and algorithmic approaches to communication compression during training. From the systems perspective, we demonstrate that a common approach of expensive hardware overprovisioning can be replaced through a thorough system design. We introduce a framework that introduces efficient software support for compressed communication in machine learning applications, applicable to both multi-GPU single-node training and larger-scale multi-node training. Our framework integrates with popular ML frameworks, providing up to 3x speedups for multi-GPU nodes based on commodity hardware and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy.\r\n\r\nAlso, we consider an application of our framework to different communication schemes, such as Fully Sharded Data Parallel. We provide strong convergence guarantees for the compression in such a setup. Empirical validation shows that our method preserves model accuracy for GPT-family models with up to 1.3 billion parameters, while completely removing the communication bottlenecks of non-compressed alternatives, providing up to 2.2x speedups end-to-end.\r\n\r\nFrom the algorithmic side, we propose a general framework that dynamically adjusts the degree of compression across a model's layers during training. This approach enhances overall compression and results in significant speedups without compromising accuracy. Our algorithm utilizes an adaptive algorithm that automatically selects the optimal compression parameters for model layers, ensuring the best compression ratio while adhering to an error constraint. Our method is effective across all existing families of compression methods. It achieves up to 2.5x faster training and up to a 5x improvement in compression compared to efficient implementations of current approaches. Additionally, LGreCo can complement existing adaptive algorithms.\r\n" acknowledged_ssus: - _id: ScienComp alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov citation: ama: 'Markov I. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. 2024. doi:10.15479/at:ista:17490' apa: 'Markov, I. (2024). Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17490' chicago: 'Markov, Ilia. “Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17490.' ieee: 'I. Markov, “Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective,” Institute of Science and Technology Austria, 2024.' ista: 'Markov I. 2024. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. Institute of Science and Technology Austria.' mla: 'Markov, Ilia. Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17490.' short: 'I. Markov, Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective, Institute of Science and Technology Austria, 2024.' corr_author: '1' date_created: 2024-09-04T08:51:11Z date_published: 2024-09-04T00:00:00Z date_updated: 2026-04-07T13:00:54Z day: '04' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: DaAl doi: 10.15479/at:ista:17490 ec_funded: 1 file: - access_level: closed checksum: 77609f4835d2730e46fa0d42d9134ed9 content_type: application/x-zip-compressed creator: imarkov date_created: 2024-09-04T08:35:35Z date_updated: 2024-09-04T08:35:35Z file_id: '17491' file_name: Thesis.zip file_size: 43327753 relation: source_file - access_level: open_access checksum: 9e68f7217570f756ceb8f70b980938cd content_type: application/pdf creator: imarkov date_created: 2024-09-04T08:36:06Z date_updated: 2024-09-04T08:36:06Z file_id: '17492' file_name: Thesis_final_version_pdfa2.pdf file_size: 2756082 relation: main_file success: 1 file_date_updated: 2024-09-04T08:36:06Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '102' project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '17456' relation: part_of_dissertation status: public - id: '14461' relation: part_of_dissertation status: public - id: '12780' relation: part_of_dissertation status: public status: public supervisor: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X title: 'Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective' tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- _id: '18086' abstract: - lang: eng text: "Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers to maintain a continuously updated shared key in an asynchronous\r\nsetting where parties only come online sporadically and their messages\r\nare relayed by an untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS) IETF RFC 9420) cannot handle concurrent requests while retaining low communication complexity. The exception being CoCoA, which\r\nis concurrent while having extremely low communication complexity (in\r\ngroups of size n and for m concurrent updates the communication per\r\nuser is log(n), i.e., independent of m). The main downside of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF, where users will heal after at most log(t) requests, with\r\nt being the number of corrupted users. While also suitable for the standard central-server setting, our protocol is particularly interesting for\r\nrealizing decentralized group messaging, where protocol messages (add,\r\nremove, update) are being posted on some append-only data structure\r\nrather than sent to a server. In this setting, concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting, CoCoA (the only alternative with concurrency, sub-linear communication and basic post-compromise security)\r\nenjoys much lower download communication. However, in the decentralized setting – where there is no server which can craft specific messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring a similar per epoch per user communication\r\ncost." alternative_title: - LNCS article_processing_charge: No author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Benedikt full_name: Auerbach, Benedikt id: D33D2B18-E445-11E9-ABB7-15F4E5697425 last_name: Auerbach orcid: 0000-0002-7553-6606 - first_name: Miguel full_name: Cueto Noval, Miguel id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc last_name: Cueto Noval orcid: 0000-0002-2505-4246 - first_name: Karen full_name: Klein, Karen id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87 last_name: Klein - first_name: Guillermo full_name: Pascual Perez, Guillermo id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87 last_name: Pascual Perez orcid: 0000-0001-8630-415X - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. Security and Cryptography for Networks: 14th International Conference. Vol 14974. Cham: Springer Nature; 2024:294–313. doi:10.1007/978-3-031-71073-5_14' apa: 'Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., & Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In C. Galdi & D. H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference (Vol. 14974, pp. 294–313). Cham: Springer Nature. https://doi.org/10.1007/978-3-031-71073-5_14' chicago: 'Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast Healing.” In Security and Cryptography for Networks: 14th International Conference, edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature, 2024. https://doi.org/10.1007/978-3-031-71073-5_14.' ieee: 'J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in Security and Cryptography for Networks: 14th International Conference, Amalfi, Italy, 2024, vol. 14974, pp. 294–313.' ista: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. 2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography for Networks: 14th International Conference. SCN: Security and Cryptography for Networks, LNCS, vol. 14974, 294–313.' mla: 'Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” Security and Cryptography for Networks: 14th International Conference, edited by Clemente Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:10.1007/978-3-031-71073-5_14.' short: 'J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference, Springer Nature, Cham, 2024, pp. 294–313.' conference: end_date: 2024-09-13 location: Amalfi, Italy name: 'SCN: Security and Cryptography for Networks' start_date: 2024-09-11 corr_author: '1' date_created: 2024-09-18T11:35:14Z date_published: 2024-09-10T00:00:00Z date_updated: 2026-04-07T13:01:26Z day: '10' department: - _id: GradSch - _id: KrPi doi: 10.1007/978-3-031-71073-5_14 editor: - first_name: Clemente full_name: Galdi, Clemente last_name: Galdi - first_name: Duong Hieu full_name: Phan, Duong Hieu last_name: Phan external_id: isi: - '001330408000014' intvolume: ' 14974' isi: 1 language: - iso: eng month: '09' oa_version: None page: 294–313 place: Cham publication: 'Security and Cryptography for Networks: 14th International Conference' publication_identifier: eisbn: - '9783031710735' eissn: - 1611-3349 isbn: - '9783031710728' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '18088' relation: dissertation_contains status: public status: public title: 'DeCAF: Decentralizable CGKA with fast healing' type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 14974 year: '2024' ... --- _id: '17456' abstract: - lang: eng text: "Data-parallel distributed training of deep neural networks (DNN) has gained very widespread adoption, but can still experience communication bottlenecks. To address this issue, entire families of compression mechanisms have been developed, including quantization, sparsification, and low-rank approximation, some of which are seeing significant practical adoption. Despite this progress, almost all known compression schemes apply compression uniformly across DNN layers, although layers are heterogeneous in terms of parameter count and their impact on model accuracy.In this work, we provide a general framework for adapting the degree of compression across the model's layers dynamically during training, improving the overall compression, while leading to substantial speedups, without sacrificing accuracy. Our framework, called L-GreCo, is based on an adaptive algorithm, which automatically picks the optimal compression parameters for model layers guaranteeing the best compression ratio while satisfying an error constraint. Extensive experiments over image classification and language modeling tasks shows that L-GreCo is effective across all existing families of compression methods, and achieves up to 2.5\r\n×\r\n training speedup and up to 5\r\n×\r\n compression improvement over efficient implementations of existing approaches, while recovering full accuracy. Moreover, L-GreCo is complementary to existing adaptive algorithms, improving their compression ratio by 50\\% and practical throughput by 66\\%. An anonymized implementation is available at https://github.com/LGrCo/L-GreCo." article_processing_charge: No arxiv: 1 author: - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Kaveh full_name: Alimohammadi, Kaveh last_name: Alimohammadi - first_name: Elias full_name: Frantar, Elias id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f last_name: Frantar - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Markov I, Alimohammadi K, Frantar E, Alistarh D-A. L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. In: Gibbons P, Pekhimenko G, De Sa C, eds. Proceedings of Machine Learning and Systems . Vol 6. Association for Computing Machinery; 2024.' apa: 'Markov, I., Alimohammadi, K., Frantar, E., & Alistarh, D.-A. (2024). L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. In P. Gibbons, G. Pekhimenko, & C. De Sa (Eds.), Proceedings of Machine Learning and Systems (Vol. 6). Athens, Greece: Association for Computing Machinery.' chicago: 'Markov, Ilia, Kaveh Alimohammadi, Elias Frantar, and Dan-Adrian Alistarh. “L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient Data-Parallel Deep Learning.” In Proceedings of Machine Learning and Systems , edited by P. Gibbons, G. Pekhimenko, and C. De Sa, Vol. 6. Association for Computing Machinery, 2024.' ieee: 'I. Markov, K. Alimohammadi, E. Frantar, and D.-A. Alistarh, “L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning,” in Proceedings of Machine Learning and Systems , Athens, Greece, 2024, vol. 6.' ista: 'Markov I, Alimohammadi K, Frantar E, Alistarh D-A. 2024. L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. Proceedings of Machine Learning and Systems . MLSys: Machine Learning and Systems vol. 6.' mla: 'Markov, Ilia, et al. “L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient Data-Parallel Deep Learning.” Proceedings of Machine Learning and Systems , edited by P. Gibbons et al., vol. 6, Association for Computing Machinery, 2024.' short: I. Markov, K. Alimohammadi, E. Frantar, D.-A. Alistarh, in:, P. Gibbons, G. Pekhimenko, C. De Sa (Eds.), Proceedings of Machine Learning and Systems , Association for Computing Machinery, 2024. conference: end_date: 2024-04-22 location: Athens, Greece name: 'MLSys: Machine Learning and Systems' start_date: 2024-04-22 corr_author: '1' date_created: 2024-08-22T08:29:25Z date_published: 2024-04-01T00:00:00Z date_updated: 2026-04-07T13:00:54Z day: '01' department: - _id: DaAl editor: - first_name: P. full_name: Gibbons, P. last_name: Gibbons - first_name: G. full_name: Pekhimenko, G. last_name: Pekhimenko - first_name: C. full_name: De Sa, C. last_name: De Sa external_id: arxiv: - '2210.17357' intvolume: ' 6' language: - iso: eng main_file_link: - open_access: '1' url: https://proceedings.mlsys.org/paper_files/paper/2024/hash/9069a8976ff06f6443e7f4172990a580-Abstract-Conference.html month: '04' oa: 1 oa_version: Published Version publication: 'Proceedings of Machine Learning and Systems ' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '17490' relation: dissertation_contains status: public status: public title: 'L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning' type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 6 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '14542' abstract: - lang: eng text: "It is a remarkable property of BCS theory that the ratio of the energy gap at zero temperature Ξ\r\n and the critical temperature Tc is (approximately) given by a universal constant, independent of the microscopic details of the fermionic interaction. This universality has rigorously been proven quite recently in three spatial dimensions and three different limiting regimes: weak coupling, low density and high density. The goal of this short note is to extend the universal behavior to lower dimensions d=1,2 and give an exemplary proof in the weak coupling limit." acknowledgement: We thank Robert Seiringer for comments on the paper. J. H. gratefully acknowledges partial financial support by the ERC Advanced Grant “RMTBeyond”No. 101020331.This research was funded in part by the Austrian Science Fund (FWF) grantnumber I6427. article_number: '2360005 ' article_processing_charge: Yes (in subscription journal) article_type: original arxiv: 1 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 - first_name: Barbara full_name: Roos, Barbara id: 5DA90512-D80F-11E9-8994-2E2EE6697425 last_name: Roos orcid: 0000-0002-9071-5880 citation: ama: Henheik SJ, Lauritsen AB, Roos B. Universality in low-dimensional BCS theory. Reviews in Mathematical Physics. 2024;36(9). doi:10.1142/s0129055x2360005x apa: Henheik, S. J., Lauritsen, A. B., & Roos, B. (2024). Universality in low-dimensional BCS theory. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/s0129055x2360005x chicago: Henheik, Sven Joscha, Asbjørn Bækgaard Lauritsen, and Barbara Roos. “Universality in Low-Dimensional BCS Theory.” Reviews in Mathematical Physics. World Scientific Publishing, 2024. https://doi.org/10.1142/s0129055x2360005x. ieee: S. J. Henheik, A. B. Lauritsen, and B. Roos, “Universality in low-dimensional BCS theory,” Reviews in Mathematical Physics, vol. 36, no. 9. World Scientific Publishing, 2024. ista: Henheik SJ, Lauritsen AB, Roos B. 2024. Universality in low-dimensional BCS theory. Reviews in Mathematical Physics. 36(9), 2360005. mla: Henheik, Sven Joscha, et al. “Universality in Low-Dimensional BCS Theory.” Reviews in Mathematical Physics, vol. 36, no. 9, 2360005, World Scientific Publishing, 2024, doi:10.1142/s0129055x2360005x. short: S.J. Henheik, A.B. Lauritsen, B. Roos, Reviews in Mathematical Physics 36 (2024). corr_author: '1' date_created: 2023-11-15T23:48:14Z date_published: 2024-10-01T00:00:00Z date_updated: 2026-04-07T13:01:40Z day: '01' ddc: - '510' department: - _id: GradSch - _id: LaEr - _id: RoSe doi: 10.1142/s0129055x2360005x ec_funded: 1 external_id: arxiv: - '2301.05621' isi: - '001099640300002' file: - access_level: open_access checksum: 2b053a4223b4db14b90520999ec56054 content_type: application/pdf creator: dernst date_created: 2025-01-09T07:56:28Z date_updated: 2025-01-09T07:56:28Z file_id: '18786' file_name: 2024_ReviewsmathPhysics_Henheik.pdf file_size: 503910 relation: main_file success: 1 file_date_updated: 2025-01-09T07:56:28Z has_accepted_license: '1' intvolume: ' 36' isi: 1 issue: '9' language: - iso: eng month: '10' 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 - _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b grant_number: I06427 name: Mathematical Challenges in BCS Theory of Superconductivity publication: Reviews in Mathematical Physics publication_identifier: eissn: - 1793-6659 issn: - 0129-055X publication_status: published publisher: World Scientific Publishing 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: Universality in low-dimensional BCS theory 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: 36 year: '2024' ... --- _id: '18107' abstract: - lang: eng text: We consider a dilute fully spin-polarized Fermi gas at positive temperature in dimensions d∈{1,2,3} . We show that the pressure of the interacting gas is bounded from below by that of the free gas plus, to leading order, an explicit term of order adρ2+2/d, where a is the p-wave scattering length of the repulsive interaction and ρ is the particle density. The results are valid for a wide range of repulsive interactions, including that of a hard core, and uniform in temperatures at most of the order of the Fermi temperature. A central ingredient in the proof is a rigorous implementation of the fermionic cluster expansion of Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260). acknowledgement: 'Financial support by the Austrian Science Fund (FWF) through grant DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.' article_number: e78 article_processing_charge: Yes article_type: original arxiv: 1 author: - 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 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: 'Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 2024;12. doi:10.1017/fms.2024.56' apa: 'Lauritsen, A. B., & Seiringer, R. (2024). Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2024.56' chicago: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma. Cambridge University Press, 2024. https://doi.org/10.1017/fms.2024.56.' ieee: 'A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi gas: Lower bound,” Forum of Mathematics, Sigma, vol. 12. Cambridge University Press, 2024.' ista: 'Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.' mla: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma, vol. 12, e78, Cambridge University Press, 2024, doi:10.1017/fms.2024.56.' short: A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024). corr_author: '1' date_created: 2024-09-20T12:25:25Z date_published: 2024-09-09T00:00:00Z date_updated: 2026-04-07T13:01:40Z day: '09' ddc: - '510' department: - _id: GradSch - _id: RoSe doi: 10.1017/fms.2024.56 external_id: arxiv: - '2407.05990' isi: - '001307817400001' file: - access_level: open_access checksum: 330b881240013213a8e08538fec13d29 content_type: application/pdf creator: dernst date_created: 2024-09-23T09:56:17Z date_updated: 2024-09-23T09:56:17Z file_id: '18126' file_name: 2024_ForumMath_Lauritsen.pdf file_size: 599886 relation: main_file success: 1 file_date_updated: 2024-09-23T09:56:17Z has_accepted_license: '1' intvolume: ' 12' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b grant_number: I06427 name: Mathematical Challenges in BCS Theory of Superconductivity publication: Forum of Mathematics, Sigma publication_identifier: issn: - 2050-5094 publication_status: published publisher: Cambridge University Press quality_controlled: '1' related_material: record: - id: '18135' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Pressure of a dilute spin-polarized Fermi gas: Lower bound' 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 12 year: '2024' ... --- OA_place: publisher _id: '17164' abstract: - lang: eng text: "This thesis is structured into two parts. In the first part, we consider the random\r\nvariable X := Tr(f1(W)A1 . . . fk(W)Ak) where W is an N × N Hermitian Wigner matrix, k ∈ N, and we choose (possibly N-dependent) regular functions f1, . . . , fk as well as\r\nbounded deterministic matrices A1, . . . , Ak. In this context, we prove a functional central\r\nlimit theorem on macroscopic and mesoscopic scales, showing that the fluctuations of X\r\naround its expectation are Gaussian and that the limiting covariance structure is given\r\nby a deterministic recursion. We further give explicit error bounds in terms of the scaling\r\nof f1, . . . , fk and the number of traceless matrices among A1, . . . , Ak, thus extending\r\nthe results of Cipolloni, Erdős and Schröder [40] to products of arbitrary length k ≥ 2.\r\nAnalyzing the underlying combinatorics leads to a non-recursive formula for the variance\r\nof X as well as the covariance of X and Y := Tr(fk+1(W)Ak+1 . . . fk+ℓ(W)Ak+ℓ) of similar\r\nbuild. When restricted to polynomials, these formulas reproduce recent results of Male,\r\nMingo, Peché, and Speicher [107], showing that the underlying combinatorics of noncrossing partitions and annular non-crossing permutations continue to stay valid beyond\r\nthe setting of second-order free probability theory. As an application, we consider the\r\nfluctuation of Tr(eitW A1e\r\n−itW A2)/N around its thermal value Tr(A1) Tr(A2)/N2 when t\r\nis large and give an explicit formula for the variance.\r\nThe second part of the thesis collects three smaller projects focusing on different random\r\nmatrix models. In the first project, we show that a class of weakly perturbed Hamiltonians\r\nof the form Hλ = H0 + λW, where W is a Wigner matrix, exhibits prethermalization.\r\nThat is, the time evolution generated by Hλ relaxes to its ultimate thermal state via an\r\nintermediate prethermal state with a lifetime of order λ\r\n−2\r\n. As the main result, we obtain\r\na general relaxation formula, expressing the perturbed dynamics via the unperturbed\r\ndynamics and the ultimate thermal state. The proof relies on a two-resolvent global law\r\nfor the deformed Wigner matrix Hλ.\r\nThe second project focuses on correlated random matrices, more precisely on a correlated N × N Hermitian random matrix with a polynomially decaying metric correlation\r\nstructure. A trivial a priori bound shows that the operator norm of this model is stochastically dominated by √\r\nN. However, by calculating the trace of the moments of the matrix\r\nand using the summable decay of the cumulants, the norm estimate can be improved to a\r\nbound of order one.\r\nIn the third project, we consider a multiplicative perturbation of the form UA(t) where U\r\nis a unitary random matrix and A = diag(t, 1, ..., 1). This so-called UA model was\r\nfirst introduced by Fyodorov [73] for its applications in scattering theory. We give a\r\ngeneral description of the eigenvalue trajectories obtained by varying the parameter t and\r\nintroduce a flow of deterministic domains that separates the outlier resulting from the\r\nrank-one perturbation from the typical eigenvalues for all sub-critical timescales. The\r\nresults are obtained under generic assumptions on U that hold for various unitary random\r\nmatrices, including the circular unitary ensemble (CUE) in the original formulation of\r\nthe model." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jana full_name: Reker, Jana id: e796e4f9-dc8d-11ea-abe3-97e26a0323e9 last_name: Reker citation: ama: 'Reker J. Central limit theorems for random matrices: From resolvents to free probability. 2024. doi:10.15479/at:ista:17164' apa: 'Reker, J. (2024). Central limit theorems for random matrices: From resolvents to free probability. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17164' chicago: 'Reker, Jana. “Central Limit Theorems for Random Matrices: From Resolvents to Free Probability.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17164.' ieee: 'J. Reker, “Central limit theorems for random matrices: From resolvents to free probability,” Institute of Science and Technology Austria, 2024.' ista: 'Reker J. 2024. Central limit theorems for random matrices: From resolvents to free probability. Institute of Science and Technology Austria.' mla: 'Reker, Jana. Central Limit Theorems for Random Matrices: From Resolvents to Free Probability. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17164.' short: 'J. Reker, Central Limit Theorems for Random Matrices: From Resolvents to Free Probability, Institute of Science and Technology Austria, 2024.' corr_author: '1' date_created: 2024-06-24T11:23:29Z date_published: 2024-06-26T00:00:00Z date_updated: 2026-04-07T13:02:13Z day: '26' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/at:ista:17164 ec_funded: 1 file: - access_level: open_access checksum: fb16d86e1f2753dc3a9e14d2bdfd84cd content_type: application/pdf creator: jreker date_created: 2024-06-26T12:39:36Z date_updated: 2024-06-26T12:44:53Z file_id: '17176' file_name: ISTA_Thesis_JReker.pdf file_size: 2783027 relation: main_file - access_level: closed checksum: cb1e54009d47c1dcf5b866c4566fa27f content_type: application/zip creator: jreker date_created: 2024-06-26T12:39:42Z date_updated: 2024-06-26T12:44:53Z file_id: '17177' file_name: ISTA_Thesis_JReker_SourceFiles.zip file_size: 3054878 relation: source_file file_date_updated: 2024-06-26T12:44:53Z has_accepted_license: '1' keyword: - Random Matrices - Spectrum - Central Limit Theorem - Resolvent - Free Probability language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '206' project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '17173' relation: part_of_dissertation status: public - id: '11135' relation: part_of_dissertation status: public - id: '17047' relation: part_of_dissertation status: public - id: '17154' relation: part_of_dissertation status: public - id: '17174' relation: part_of_dissertation status: public status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: 'Central limit theorems for random matrices: From resolvents to free probability' tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ...