--- _id: '6184' abstract: - lang: eng text: We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Johannes full_name: Alt, Johannes id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87 last_name: Alt - 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 - first_name: Torben H full_name: Krüger, Torben H id: 3020C786-F248-11E8-B48F-1D18A9856A87 last_name: Krüger orcid: 0000-0002-4821-3297 - first_name: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: 'Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 2020;48(2):963-1001. doi:10.1214/19-AOP1379' apa: 'Alt, J., Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Correlated random matrices: Band rigidity and edge universality. Annals of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/19-AOP1379' chicago: 'Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/19-AOP1379.' ieee: 'J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices: Band rigidity and edge universality,” Annals of Probability, vol. 48, no. 2. Institute of Mathematical Statistics, pp. 963–1001, 2020.' ista: 'Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.' mla: 'Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability, vol. 48, no. 2, Institute of Mathematical Statistics, 2020, pp. 963–1001, doi:10.1214/19-AOP1379.' short: J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001. date_created: 2019-03-28T09:20:08Z date_published: 2020-03-01T00:00:00Z date_updated: 2026-04-08T14:11:36Z day: '01' department: - _id: LaEr doi: 10.1214/19-AOP1379 ec_funded: 1 external_id: arxiv: - '1804.07744' isi: - '000528269100013' intvolume: ' 48' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.07744 month: '03' oa: 1 oa_version: Preprint page: 963-1001 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Annals of Probability publication_identifier: issn: - 0091-1798 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' related_material: record: - id: '6179' relation: dissertation_contains status: public - id: '149' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Correlated random matrices: Band rigidity and edge universality' type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2020' ... --- _id: '6185' abstract: - lang: eng text: For complex Wigner-type matrices, i.e. Hermitian random matrices with independent, not necessarily identically distributed entries above the diagonal, we show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are universal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner–Dyson–Mehta universality conjecture for the last remaining universality type in the complex Hermitian class. Our analysis holds not only for exact cusps, but approximate cusps as well, where an extended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp for both symmetry classes. This result is also the key input in the companion paper (Cipolloni et al. in Pure Appl Anal, 2018. arXiv:1811.04055) where the cusp universality for real symmetric Wigner-type matrices is proven. The novel cusp fluctuation mechanism is also essential for the recent results on the spectral radius of non-Hermitian random matrices (Alt et al. in Spectral radius of random matrices with independent entries, 2019. arXiv:1907.13631), and the non-Hermitian edge universality (Cipolloni et al. in Edge universality for non-Hermitian random matrices, 2019. arXiv:1908.00969). acknowledgement: Open access funding provided by Institute of Science and Technology (IST Austria). The authors are very grateful to Johannes Alt for numerous discussions on the Dyson equation and for his invaluable help in adjusting [10] to the needs of the present work. article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - 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 - first_name: Torben H full_name: Krüger, Torben H id: 3020C786-F248-11E8-B48F-1D18A9856A87 last_name: Krüger orcid: 0000-0002-4821-3297 - first_name: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: 'Erdös L, Krüger TH, Schröder DJ. Cusp universality for random matrices I: Local law and the complex Hermitian case. Communications in Mathematical Physics. 2020;378:1203-1278. doi:10.1007/s00220-019-03657-4' apa: 'Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Cusp universality for random matrices I: Local law and the complex Hermitian case. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03657-4' chicago: 'Erdös, László, Torben H Krüger, and Dominik J Schröder. “Cusp Universality for Random Matrices I: Local Law and the Complex Hermitian Case.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03657-4.' ieee: 'L. Erdös, T. H. Krüger, and D. J. Schröder, “Cusp universality for random matrices I: Local law and the complex Hermitian case,” Communications in Mathematical Physics, vol. 378. Springer Nature, pp. 1203–1278, 2020.' ista: 'Erdös L, Krüger TH, Schröder DJ. 2020. Cusp universality for random matrices I: Local law and the complex Hermitian case. Communications in Mathematical Physics. 378, 1203–1278.' mla: 'Erdös, László, et al. “Cusp Universality for Random Matrices I: Local Law and the Complex Hermitian Case.” Communications in Mathematical Physics, vol. 378, Springer Nature, 2020, pp. 1203–78, doi:10.1007/s00220-019-03657-4.' short: L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics 378 (2020) 1203–1278. date_created: 2019-03-28T10:21:15Z date_published: 2020-09-01T00:00:00Z date_updated: 2026-04-08T13:55:03Z day: '01' ddc: - '530' - '510' department: - _id: LaEr doi: 10.1007/s00220-019-03657-4 ec_funded: 1 external_id: arxiv: - '1809.03971' isi: - '000529483000001' file: - access_level: open_access checksum: c3a683e2afdcea27afa6880b01e53dc2 content_type: application/pdf creator: dernst date_created: 2020-11-18T11:14:37Z date_updated: 2020-11-18T11:14:37Z file_id: '8771' file_name: 2020_CommMathPhysics_Erdoes.pdf file_size: 2904574 relation: main_file success: 1 file_date_updated: 2020-11-18T11:14:37Z has_accepted_license: '1' intvolume: ' 378' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 1203-1278 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Communications in Mathematical Physics publication_identifier: eissn: - 1432-0916 issn: - 0010-3616 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '6179' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Cusp universality for random matrices I: Local law and the complex Hermitian case' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 378 year: '2020' ... --- _id: '6358' abstract: - lang: eng text: We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral gap estimates. article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Eric A. full_name: Carlen, Eric A. last_name: Carlen - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 citation: ama: Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. 2020;178(2):319-378. doi:10.1007/s10955-019-02434-w apa: Carlen, E. A., & Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-019-02434-w chicago: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” Journal of Statistical Physics. Springer Nature, 2020. https://doi.org/10.1007/s10955-019-02434-w. ieee: E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems,” Journal of Statistical Physics, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020. ista: Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378. mla: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” Journal of Statistical Physics, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:10.1007/s10955-019-02434-w. short: E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378. corr_author: '1' date_created: 2019-04-30T07:34:18Z date_published: 2020-01-01T00:00:00Z date_updated: 2025-06-12T07:27:20Z day: '01' ddc: - '500' department: - _id: JaMa doi: 10.1007/s10955-019-02434-w ec_funded: 1 external_id: arxiv: - '1811.04572' isi: - '000498933300001' pmid: - '33223567' file: - access_level: open_access checksum: 7b04befbdc0d4982c0ee945d25d19872 content_type: application/pdf creator: dernst date_created: 2019-12-23T12:03:09Z date_updated: 2020-07-14T12:47:28Z file_id: '7209' file_name: 2019_JourStatistPhysics_Carlen.pdf file_size: 905538 relation: main_file file_date_updated: 2020-07-14T12:47:28Z has_accepted_license: '1' intvolume: ' 178' isi: 1 issue: '2' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 319-378 pmid: 1 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: 260482E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: F06504 name: Taming Complexity in Partial Differential Systems publication: Journal of Statistical Physics publication_identifier: eissn: - 1572-9613 issn: - 0022-4715 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1007/s10955-020-02671-4 scopus_import: '1' status: public title: Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems 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: 178 year: '2020' ... --- _id: '6359' abstract: - lang: eng text: The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients. article_number: '82' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Konstantinos full_name: Dareiotis, Konstantinos last_name: Dareiotis - first_name: Mate full_name: Gerencser, Mate id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87 last_name: Gerencser citation: ama: Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 2020;25. doi:10.1214/20-EJP479 apa: Dareiotis, K., & Gerencser, M. (2020). On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/20-EJP479 chicago: Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-EJP479. ieee: K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift,” Electronic Journal of Probability, vol. 25. Institute of Mathematical Statistics, 2020. ista: Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 25, 82. mla: Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:10.1214/20-EJP479. short: K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020). date_created: 2019-04-30T07:40:17Z date_published: 2020-07-16T00:00:00Z date_updated: 2023-10-16T09:22:50Z day: '16' ddc: - '510' department: - _id: JaMa doi: 10.1214/20-EJP479 external_id: arxiv: - '1812.04583' isi: - '000550150700001' file: - access_level: open_access checksum: 8e7c42e72596f6889d786e8e8b89994f content_type: application/pdf creator: dernst date_created: 2020-09-21T13:15:02Z date_updated: 2020-09-21T13:15:02Z file_id: '8549' file_name: 2020_EJournProbab_Dareiotis.pdf file_size: 273042 relation: main_file success: 1 file_date_updated: 2020-09-21T13:15:02Z has_accepted_license: '1' intvolume: ' 25' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Electronic Journal of Probability publication_identifier: eissn: - 1083-6489 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' scopus_import: '1' status: public title: On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift 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: 25 year: '2020' ... --- OA_place: publisher _id: '19986' abstract: - lang: eng text: 'For non-probabilistic programs, a key question in static analysis is termination, which asks whether a given program terminates under a given initial condition. In the presence of probabilistic behaviour, there are two fundamental extensions of the termination question: (a) the almost-sure termination question, which asks whether the termination probability is 1; and (b) the bounded-time termination question, which asks whether the expected termination time is bounded. There are many active research directions to address these two questions; one important such direction is the use of martingale theory for termination analysis. In this chapter, we survey the main techniques of the martingale-based approach to the termination analysis of probabilistic programs.' acknowledgement: "Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN\r\nGrant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Hongfei Fu\r\nis supported by the National Natural Science Foundation of China (NSFC) Grant\r\nNo. 61802254. Petr Novotný is supported by the Czech Science Foundation grant\r\nNo. GJ19-15134Y." article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Hongfei full_name: Fu, Hongfei id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87 last_name: Fu - first_name: Petr full_name: Novotný, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotný citation: ama: 'Chatterjee K, Fu H, Novotný P. Termination Analysis of Probabilistic Programs with Martingales. In: Foundations of Probabilistic Programming. Cambridge University Press; 2020:221-258. doi:10.1017/9781108770750.008' apa: Chatterjee, K., Fu, H., & Novotný, P. (2020). Termination Analysis of Probabilistic Programs with Martingales. In Foundations of Probabilistic Programming (pp. 221–258). Cambridge University Press. https://doi.org/10.1017/9781108770750.008 chicago: Chatterjee, Krishnendu, Hongfei Fu, and Petr Novotný. “Termination Analysis of Probabilistic Programs with Martingales.” In Foundations of Probabilistic Programming, 221–58. Cambridge University Press, 2020. https://doi.org/10.1017/9781108770750.008. ieee: K. Chatterjee, H. Fu, and P. Novotný, “Termination Analysis of Probabilistic Programs with Martingales,” in Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–258. ista: 'Chatterjee K, Fu H, Novotný P. 2020.Termination Analysis of Probabilistic Programs with Martingales. In: Foundations of Probabilistic Programming. , 221–258.' mla: Chatterjee, Krishnendu, et al. “Termination Analysis of Probabilistic Programs with Martingales.” Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–58, doi:10.1017/9781108770750.008. short: K. Chatterjee, H. Fu, P. Novotný, in:, Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–258. corr_author: '1' date_created: 2025-07-10T13:28:51Z date_published: 2020-11-18T00:00:00Z date_updated: 2025-09-23T12:10:25Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.1017/9781108770750.008 file: - access_level: open_access checksum: 28ece115e8d2d9263e253a598e7caef2 content_type: application/pdf creator: dernst date_created: 2025-09-23T12:03:09Z date_updated: 2025-09-23T12:03:09Z file_id: '20380' file_name: 2020_ProbProgramming_Chatterjee.pdf file_size: 316681 relation: main_file success: 1 file_date_updated: 2025-09-23T12:03:09Z has_accepted_license: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 221-258 project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Foundations of Probabilistic Programming publication_identifier: eisbn: - '9781108770750' isbn: - '9781108488518' publication_status: published publisher: Cambridge University Press quality_controlled: '1' status: public title: Termination Analysis of Probabilistic Programs with Martingales 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: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '10012' abstract: - lang: eng text: We prove that in the absence of topological changes, the notion of BV solutions to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical) non-uniqueness. Our approach is based on the local structure of the energy landscape near a classical evolution by mean curvature. Mean curvature flow being the gradient flow of the surface energy functional, we develop a gradient-flow analogue of the notion of calibrations. Just like the existence of a calibration guarantees that one has reached a global minimum in the energy landscape, the existence of a "gradient flow calibration" ensures that the route of steepest descent in the energy landscape is unique and stable. acknowledgement: Parts of the paper were written during the visit of the authors to the Hausdorff Research Institute for Mathematics (HIM), University of Bonn, in the framework of the trimester program “Evolution of Interfaces”. The support and the hospitality of HIM are gratefully acknowledged. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385. article_number: '2003.05478' article_processing_charge: No arxiv: 1 author: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Tim full_name: Laux, Tim last_name: Laux - first_name: Thilo full_name: Simon, Thilo last_name: Simon citation: ama: 'Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv. doi:10.48550/arXiv.2003.05478' apa: 'Fischer, J. L., Hensel, S., Laux, T., & Simon, T. (n.d.). The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv. https://doi.org/10.48550/arXiv.2003.05478' chicago: 'Fischer, Julian L, Sebastian Hensel, Tim Laux, and Thilo Simon. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2003.05478.' ieee: 'J. L. Fischer, S. Hensel, T. Laux, and T. Simon, “The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions,” arXiv. .' ista: 'Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv, 2003.05478.' mla: 'Fischer, Julian L., et al. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, 2003.05478, doi:10.48550/arXiv.2003.05478.' short: J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.). date_created: 2021-09-13T12:17:11Z date_published: 2020-03-11T00:00:00Z date_updated: 2026-04-08T07:01:01Z day: '11' department: - _id: JuFi doi: 10.48550/arXiv.2003.05478 ec_funded: 1 external_id: arxiv: - '2003.05478' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2003.05478 month: '03' oa: 1 oa_version: Preprint project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: arXiv publication_status: draft related_material: record: - id: '10007' relation: dissertation_contains status: public status: public title: 'The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions' type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '10022' abstract: - lang: eng text: We consider finite-volume approximations of Fokker-Planck equations on bounded convex domains in R^d and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker-Planck equation via the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalising the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality. acknowledgement: This work is supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and by the Austrian Science Fund (FWF), grants No F65 and W1245. article_number: '2008.10962' article_processing_charge: No arxiv: 1 author: - first_name: Dominik L full_name: Forkert, Dominik L id: 35C79D68-F248-11E8-B48F-1D18A9856A87 last_name: Forkert - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Lorenzo full_name: Portinale, Lorenzo id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87 last_name: Portinale citation: ama: Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv. doi:10.48550/arXiv.2008.10962 apa: Forkert, D. L., Maas, J., & Portinale, L. (n.d.). Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv. https://doi.org/10.48550/arXiv.2008.10962 chicago: Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2008.10962. ieee: D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” arXiv. . ista: Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962. mla: Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, 2008.10962, doi:10.48550/arXiv.2008.10962. short: D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.). corr_author: '1' date_created: 2021-09-17T10:57:27Z date_published: 2020-08-25T00:00:00Z date_updated: 2026-04-08T07:00:03Z day: '25' department: - _id: JaMa doi: 10.48550/arXiv.2008.10962 ec_funded: 1 external_id: arxiv: - '2008.10962' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2008.10962 month: '08' oa: 1 oa_version: Preprint 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: arXiv publication_status: draft related_material: record: - id: '11739' relation: later_version status: public - id: '10030' relation: dissertation_contains status: public status: public title: Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '10328' abstract: - lang: eng text: We discus noise channels in coherent electro-optic up-conversion between microwave and optical fields, in particular due to optical heating. We also report on a novel configuration, which promises to be flexible and highly efficient. alternative_title: - OSA Technical Digest article_number: QTu8A.1 article_processing_charge: No author: - first_name: Nicholas J. full_name: Lambert, Nicholas J. last_name: Lambert - first_name: Sonia full_name: Mobassem, Sonia last_name: Mobassem - first_name: Alfredo R full_name: Rueda Sanchez, Alfredo R id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87 last_name: Rueda Sanchez orcid: 0000-0001-6249-5860 - first_name: Harald G.L. full_name: Schwefel, Harald G.L. last_name: Schwefel citation: ama: 'Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. New designs and noise channels in electro-optic microwave to optical up-conversion. In: OSA Quantum 2.0 Conference. Optica Publishing Group; 2020. doi:10.1364/QUANTUM.2020.QTu8A.1' apa: 'Lambert, N. J., Mobassem, S., Rueda Sanchez, A. R., & Schwefel, H. G. L. (2020). New designs and noise channels in electro-optic microwave to optical up-conversion. In OSA Quantum 2.0 Conference. Washington, DC, United States: Optica Publishing Group. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1' chicago: Lambert, Nicholas J., Sonia Mobassem, Alfredo R Rueda Sanchez, and Harald G.L. Schwefel. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” In OSA Quantum 2.0 Conference. Optica Publishing Group, 2020. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1. ieee: N. J. Lambert, S. Mobassem, A. R. Rueda Sanchez, and H. G. L. Schwefel, “New designs and noise channels in electro-optic microwave to optical up-conversion,” in OSA Quantum 2.0 Conference, Washington, DC, United States, 2020. ista: 'Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. 2020. New designs and noise channels in electro-optic microwave to optical up-conversion. OSA Quantum 2.0 Conference. OSA: Optical Society of America, OSA Technical Digest, , QTu8A.1.' mla: Lambert, Nicholas J., et al. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” OSA Quantum 2.0 Conference, QTu8A.1, Optica Publishing Group, 2020, doi:10.1364/QUANTUM.2020.QTu8A.1. short: N.J. Lambert, S. Mobassem, A.R. Rueda Sanchez, H.G.L. Schwefel, in:, OSA Quantum 2.0 Conference, Optica Publishing Group, 2020. conference: end_date: 2020-09-17 location: Washington, DC, United States name: 'OSA: Optical Society of America' start_date: 2020-09-14 date_created: 2021-11-21T23:01:31Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-10-18T08:32:34Z day: '01' department: - _id: JoFi doi: 10.1364/QUANTUM.2020.QTu8A.1 language: - iso: eng month: '01' oa_version: None publication: OSA Quantum 2.0 Conference publication_identifier: isbn: - 9-781-5575-2820-9 publication_status: published publisher: Optica Publishing Group quality_controlled: '1' scopus_import: '1' status: public title: New designs and noise channels in electro-optic microwave to optical up-conversion type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '10556' abstract: - lang: eng text: In this paper, we present the first Asynchronous Distributed Key Generation (ADKG) algorithm which is also the first distributed key generation algorithm that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number of faulty parties). As a result, using our ADKG we remove the trusted setup assumption that the most scalable consensus algorithms make. In order to create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative the open question posed by Cachin et al. [7] on how to create an Asynchronous Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery; 2020:1751–1767. doi:10.1145/3372297.3423364' apa: 'Kokoris Kogias, E., Malkhi, D., & Spiegelman, A. (2020). Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 1751–1767). Virtual, United States: Association for Computing Machinery. https://doi.org/10.1145/3372297.3423364' chicago: Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 1751–1767. Association for Computing Machinery, 2020. https://doi.org/10.1145/3372297.3423364. ieee: E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual, United States, 2020, pp. 1751–1767. ista: 'Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1751–1767.' mla: Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767, doi:10.1145/3372297.3423364. short: E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767. conference: end_date: 2020-11-13 location: Virtual, United States name: 'CCS: Conference on Computer and Communications Security' start_date: 2020-11-09 date_created: 2021-12-16T13:23:27Z date_published: 2020-10-30T00:00:00Z date_updated: 2025-07-10T11:49:52Z day: '30' department: - _id: ElKo doi: 10.1145/3372297.3423364 external_id: isi: - '000768470400104' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2019/1015 month: '10' oa: 1 oa_version: Preprint page: 1751–1767 publication: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security publication_identifier: isbn: - 978-1-4503-7089-9 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '10557' abstract: - lang: eng text: Data storage and retrieval systems, methods, and computer-readable media utilize a cryptographically verifiable data structure that facilitates verification of a transaction in a decentralized peer-to-peer environment using multi-hop backwards and forwards links. Backward links are cryptographic hashes of past records. Forward links are cryptographic signatures of future records that are added retroactively to records once the target block has been appended to the data structure. applicant: - Ecole Polytechnique Federale de Lausanne application_date: 2017-06-09 article_processing_charge: No author: - first_name: Bryan full_name: Ford, Bryan last_name: Ford - first_name: Linus full_name: Gasse, Linus last_name: Gasse - first_name: Eleftherios full_name: Kokoris Kogias, Eleftherios id: f5983044-d7ef-11ea-ac6d-fd1430a26d30 last_name: Kokoris Kogias - first_name: Philipp full_name: Jovanovic, Philipp last_name: Jovanovic citation: ama: Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods. 2020. apa: Ford, B., Gasse, L., Kokoris Kogias, E., & Jovanovic, P. (2020). Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods. chicago: Ford, Bryan, Linus Gasse, Eleftherios Kokoris Kogias, and Philipp Jovanovic. “Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards Links and Associated Systems and Methods,” 2020. ieee: B. Ford, L. Gasse, E. Kokoris Kogias, and P. Jovanovic, “Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.” 2020. ista: Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. 2020. Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods. mla: Ford, Bryan, et al. Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards Links and Associated Systems and Methods. 2020. short: B. Ford, L. Gasse, E. Kokoris Kogias, P. Jovanovic, (2020). date_created: 2021-12-16T13:28:59Z date_published: 2020-03-03T00:00:00Z date_updated: 2021-12-21T10:04:50Z day: '03' department: - _id: ElKo extern: '1' ipc: ' H04L9/3247 ; G06Q20/29 ; G06Q20/382 ; H04L9/3236' ipn: '10581613' main_file_link: - open_access: '1' url: https://patents.google.com/patent/US10581613B2/en month: '03' oa: 1 oa_version: Published Version publication_date: 2020-03-03 related_material: link: - relation: earlier_version url: https://patents.google.com/patent/US20180359096A1/en status: public title: Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods type: patent user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2020' ... --- _id: '10672' abstract: - lang: eng text: The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity. acknowledgement: "This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n" article_processing_charge: No author: - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner citation: ama: 'Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.' apa: 'Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.' chicago: Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020. ieee: M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020. ista: 'Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020. short: M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020. conference: end_date: 2020-05-01 location: Virtual ; Addis Ababa, Ethiopia name: 'ICLR: International Conference on Learning Representations' start_date: 2020-04-26 corr_author: '1' date_created: 2022-01-25T15:50:00Z date_published: 2020-03-11T00:00:00Z date_updated: 2025-04-15T06:25:56Z day: '11' ddc: - '000' department: - _id: GradSch - _id: ToHe file: - access_level: open_access checksum: ea13d42dd4541ddb239b6a75821fd6c9 content_type: application/pdf creator: mlechner date_created: 2022-01-26T07:35:17Z date_updated: 2022-01-26T07:35:17Z file_id: '10677' file_name: iclr_2020.pdf file_size: 249431 relation: main_file success: 1 file_date_updated: 2022-01-26T07:35:17Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/3.0/ main_file_link: - open_access: '1' url: https://openreview.net/forum?id=Bke61krFvS month: '03' oa: 1 oa_version: Published Version project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: 8th International Conference on Learning Representations publication_status: published publisher: ICLR quality_controlled: '1' scopus_import: '1' status: public title: Learning representations for binary-classification without backpropagation tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) short: CC BY-NC-ND (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '10673' abstract: - lang: eng text: We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level. acknowledgement: "RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n" alternative_title: - PMLR article_processing_charge: No author: - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Alexander full_name: Amini, Alexander last_name: Amini - first_name: Daniela full_name: Rus, Daniela last_name: Rus - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: Proceedings of the 37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.' apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.' chicago: 'Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020.' ieee: 'R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093.' ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.' mla: 'Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.' short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093. conference: end_date: 2020-07-18 location: Virtual name: 'ML: Machine Learning' start_date: 2020-07-12 date_created: 2022-01-25T15:50:34Z date_published: 2020-01-01T00:00:00Z date_updated: 2025-04-15T06:25:56Z ddc: - '000' department: - _id: GradSch - _id: ToHe file: - access_level: open_access checksum: c9a4a29161777fc1a89ef451c040e3b1 content_type: application/pdf creator: cchlebak date_created: 2022-01-26T11:08:51Z date_updated: 2022-01-26T11:08:51Z file_id: '10691' file_name: 2020_PMLR_Hasani.pdf file_size: 2329798 relation: main_file success: 1 file_date_updated: 2022-01-26T11:08:51Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://proceedings.mlr.press/v119/hasani20a.html oa: 1 oa_version: Published Version page: 4082-4093 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: Proceedings of the 37th International Conference on Machine Learning publication_identifier: issn: - 2640-3498 publication_status: published quality_controlled: '1' scopus_import: '1' series_title: PMLR status: public title: 'A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) short: CC BY-NC-ND (3.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2020' ... --- _id: '17444' abstract: - lang: eng text: The first wafer-scale growth of site-controlled Ge/Si nanowires is reported by Georgios Katsaros, Jian-Jun Zhang, and co-workers in article number 1906523. They are highly uniform and their position, distance, length, and even square- or L-shaped structures can all be precisely controlled. The electrically tunable spin-orbit coupling demonstrated by transport measurements and the charge sensing between quantum dots in closely spaced wires open a path toward scalable qubit devices using nanowires on silicon. article_number: '2070122' article_processing_charge: No author: - first_name: Fei full_name: Gao, Fei last_name: Gao - first_name: Jian‐Huan full_name: Wang, Jian‐Huan last_name: Wang - first_name: Hannes full_name: Watzinger, Hannes id: 35DF8E50-F248-11E8-B48F-1D18A9856A87 last_name: Watzinger - first_name: Hao full_name: Hu, Hao last_name: Hu - first_name: Marko J. full_name: Rančić, Marko J. last_name: Rančić - first_name: Jie‐Yin full_name: Zhang, Jie‐Yin last_name: Zhang - first_name: Ting full_name: Wang, Ting last_name: Wang - first_name: Yuan full_name: Yao, Yuan last_name: Yao - first_name: Gui‐Lei full_name: Wang, Gui‐Lei last_name: Wang - first_name: Josip full_name: Kukucka, Josip id: 3F5D8856-F248-11E8-B48F-1D18A9856A87 last_name: Kukucka - first_name: Lada full_name: Vukušić, Lada id: 31E9F056-F248-11E8-B48F-1D18A9856A87 last_name: Vukušić orcid: 0000-0003-2424-8636 - first_name: Christoph full_name: Kloeffel, Christoph last_name: Kloeffel - first_name: Daniel full_name: Loss, Daniel last_name: Loss - first_name: Feng full_name: Liu, Feng last_name: Liu - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X - first_name: Jian‐Jun full_name: Zhang, Jian‐Jun last_name: Zhang citation: ama: 'Gao F, Wang J, Watzinger H, et al. Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020). Vol 32. Wiley; 2020. doi:10.1002/adma.202070122' apa: 'Gao, F., Wang, J., Watzinger, H., Hu, H., Rančić, M. J., Zhang, J., … Zhang, J. (2020). Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020). Advanced Materials (Vol. 32). Wiley. https://doi.org/10.1002/adma.202070122' chicago: 'Gao, Fei, Jian‐Huan Wang, Hannes Watzinger, Hao Hu, Marko J. Rančić, Jie‐Yin Zhang, Ting Wang, et al. Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020). Advanced Materials. Vol. 32. Wiley, 2020. https://doi.org/10.1002/adma.202070122.' ieee: 'F. Gao et al., Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020), vol. 32, no. 16. Wiley, 2020.' ista: 'Gao F, Wang J, Watzinger H, Hu H, Rančić MJ, Zhang J, Wang T, Yao Y, Wang G, Kukucka J, Vukušić L, Kloeffel C, Loss D, Liu F, Katsaros G, Zhang J. 2020. Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020), Wiley,p.' mla: 'Gao, Fei, et al. “Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020).” Advanced Materials, vol. 32, no. 16, 2070122, Wiley, 2020, doi:10.1002/adma.202070122.' short: 'F. Gao, J. Wang, H. Watzinger, H. Hu, M.J. Rančić, J. Zhang, T. Wang, Y. Yao, G. Wang, J. Kukucka, L. Vukušić, C. Kloeffel, D. Loss, F. Liu, G. Katsaros, J. Zhang, Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020), Wiley, 2020.' date_created: 2024-08-20T08:22:42Z date_published: 2020-04-23T00:00:00Z date_updated: 2026-06-18T17:54:47Z day: '23' ddc: - '530' department: - _id: GeKa doi: 10.1002/adma.202070122 intvolume: ' 32' issue: '16' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1002/adma.202070122 month: '04' oa: 1 oa_version: Published Version publication: Advanced Materials publication_identifier: eissn: - 1521-4095 issn: - 0935-9648 publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '7541' relation: other status: public status: public title: 'Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020)' type: other_academic_publication user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2020' ... --- _id: '177' abstract: - lang: eng text: We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Will full_name: Sawin, Will last_name: Sawin citation: ama: Browning TD, Sawin W. A geometric version of the circle method. Annals of Mathematics. 2020;191(3):893-948. doi:10.4007/annals.2020.191.3.4 apa: Browning, T. D., & Sawin, W. (2020). A geometric version of the circle method. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2020.191.3.4 chicago: Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics. Princeton University, 2020. https://doi.org/10.4007/annals.2020.191.3.4. ieee: T. D. Browning and W. Sawin, “A geometric version of the circle method,” Annals of Mathematics, vol. 191, no. 3. Princeton University, pp. 893–948, 2020. ista: Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948. mla: Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:10.4007/annals.2020.191.3.4. short: T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948. date_created: 2018-12-11T11:45:02Z date_published: 2020-05-01T00:00:00Z date_updated: 2024-10-21T06:02:25Z day: '01' department: - _id: TiBr doi: 10.4007/annals.2020.191.3.4 external_id: arxiv: - '1711.10451' isi: - '000526986300004' intvolume: ' 191' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.10451 month: '05' oa: 1 oa_version: Preprint page: 893-948 publication: Annals of Mathematics publication_status: published publisher: Princeton University publist_id: '7744' quality_controlled: '1' scopus_import: '1' status: public title: A geometric version of the circle method type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 191 year: '2020' ... --- _id: '179' abstract: - lang: eng text: An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Roger full_name: Heath Brown, Roger last_name: Heath Brown citation: ama: Browning TD, Heath Brown R. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 2020;169(16):3099-3165. doi:10.1215/00127094-2020-0031 apa: Browning, T. D., & Heath Brown, R. (2020). Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2020-0031 chicago: Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal. Duke University Press, 2020. https://doi.org/10.1215/00127094-2020-0031. ieee: T. D. Browning and R. Heath Brown, “Density of rational points on a quadric bundle in ℙ3×ℙ3,” Duke Mathematical Journal, vol. 169, no. 16. Duke University Press, pp. 3099–3165, 2020. ista: Browning TD, Heath Brown R. 2020. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165. mla: Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal, vol. 169, no. 16, Duke University Press, 2020, pp. 3099–165, doi:10.1215/00127094-2020-0031. short: T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165. date_created: 2018-12-11T11:45:02Z date_published: 2020-09-10T00:00:00Z date_updated: 2024-10-21T06:02:33Z day: '10' department: - _id: TiBr doi: 10.1215/00127094-2020-0031 external_id: arxiv: - '1805.10715' isi: - '000582676300002' intvolume: ' 169' isi: 1 issue: '16' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1805.10715 month: '09' oa: 1 oa_version: Preprint page: 3099-3165 publication: Duke Mathematical Journal publication_identifier: issn: - 0012-7094 publication_status: published publisher: Duke University Press quality_controlled: '1' scopus_import: '1' status: public title: Density of rational points on a quadric bundle in ℙ3×ℙ3 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 169 year: '2020' ... --- _id: '7563' abstract: - lang: eng text: "We introduce “state space persistence analysis” for deducing the symbolic dynamics of time series data obtained from high-dimensional chaotic attractors. To this end, we adapt a topological data analysis technique known as persistent homology for the characterization of state space projections of chaotic trajectories and periodic orbits. By comparing the shapes along a chaotic trajectory to those of the periodic orbits, state space persistence analysis quantifies the shape similarity of chaotic trajectory segments and periodic orbits. We demonstrate the method by applying it to the three-dimensional Rössler system and a 30-dimensional discretization of the Kuramoto–Sivashinsky partial differential equation in (1+1) dimensions.\r\nOne way of studying chaotic attractors systematically is through their symbolic dynamics, in which one partitions the state space into qualitatively different regions and assigns a symbol to each such region.1–3 This yields a “coarse-grained” state space of the system, which can then be reduced to a Markov chain encoding all possible transitions between the states of the system. While it is possible to obtain the symbolic dynamics of low-dimensional chaotic systems with standard tools such as Poincaré maps, when applied to high-dimensional systems such as turbulent flows, these tools alone are not sufficient to determine symbolic dynamics.4,5 In this paper, we develop “state space persistence analysis” and demonstrate that it can be utilized to infer the symbolic dynamics in very high-dimensional settings." article_number: '033109' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Gökhan full_name: Yalniz, Gökhan id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425 last_name: Yalniz orcid: 0000-0002-8490-9312 - first_name: Nazmi B full_name: Budanur, Nazmi B id: 3EA1010E-F248-11E8-B48F-1D18A9856A87 last_name: Budanur orcid: 0000-0003-0423-5010 citation: ama: Yalniz G, Budanur NB. Inferring symbolic dynamics of chaotic flows from persistence. Chaos. 2020;30(3). doi:10.1063/1.5122969 apa: Yalniz, G., & Budanur, N. B. (2020). Inferring symbolic dynamics of chaotic flows from persistence. Chaos. AIP Publishing. https://doi.org/10.1063/1.5122969 chicago: Yalniz, Gökhan, and Nazmi B Budanur. “Inferring Symbolic Dynamics of Chaotic Flows from Persistence.” Chaos. AIP Publishing, 2020. https://doi.org/10.1063/1.5122969. ieee: G. Yalniz and N. B. Budanur, “Inferring symbolic dynamics of chaotic flows from persistence,” Chaos, vol. 30, no. 3. AIP Publishing, 2020. ista: Yalniz G, Budanur NB. 2020. Inferring symbolic dynamics of chaotic flows from persistence. Chaos. 30(3), 033109. mla: Yalniz, Gökhan, and Nazmi B. Budanur. “Inferring Symbolic Dynamics of Chaotic Flows from Persistence.” Chaos, vol. 30, no. 3, 033109, AIP Publishing, 2020, doi:10.1063/1.5122969. short: G. Yalniz, N.B. Budanur, Chaos 30 (2020). corr_author: '1' date_created: 2020-03-04T08:06:25Z date_published: 2020-03-03T00:00:00Z date_updated: 2026-06-18T19:23:35Z day: '03' ddc: - '530' department: - _id: BjHo doi: 10.1063/1.5122969 external_id: arxiv: - '1910.04584' isi: - '000519254800002' intvolume: ' 30' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1063/1.5122969 month: '03' oa: 1 oa_version: Published Version publication: Chaos publication_identifier: eissn: - 1089-7682 issn: - 1054-1500 publication_status: published publisher: AIP Publishing quality_controlled: '1' related_material: record: - id: '19684' relation: dissertation_contains status: public scopus_import: '1' status: public title: Inferring symbolic dynamics of chaotic flows from persistence type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 30 year: '2020' ... --- _id: '7567' abstract: - lang: eng text: Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Aruni full_name: Choudhary, Aruni last_name: Choudhary - first_name: Siargey full_name: Kachanovich, Siargey last_name: Kachanovich - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5 apa: Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5 chicago: Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science. Springer Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5. ieee: A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” Mathematics in Computer Science, vol. 14. Springer Nature, pp. 141–176, 2020. ista: Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176. mla: Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5. short: A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176. corr_author: '1' date_created: 2020-03-05T13:30:18Z date_published: 2020-03-01T00:00:00Z date_updated: 2025-04-14T07:44:03Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s11786-020-00461-5 ec_funded: 1 file: - access_level: open_access checksum: 1d145f3ab50ccee735983cb89236e609 content_type: application/pdf creator: dernst date_created: 2020-11-20T10:18:02Z date_updated: 2020-11-20T10:18:02Z file_id: '8783' file_name: 2020_MathCompScie_Choudhary.pdf file_size: 872275 relation: main_file success: 1 file_date_updated: 2020-11-20T10:18:02Z has_accepted_license: '1' intvolume: ' 14' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 141-176 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Mathematics in Computer Science publication_identifier: eissn: - 1661-8289 issn: - 1661-8270 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Coxeter triangulations have good quality 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: 14 year: '2020' ... --- _id: '7569' abstract: - lang: eng text: 'Genes differ in the frequency at which they are expressed and in the form of regulation used to control their activity. In particular, positive or negative regulation can lead to activation of a gene in response to an external signal. Previous works proposed that the form of regulation of a gene correlates with its frequency of usage: positive regulation when the gene is frequently expressed and negative regulation when infrequently expressed. Such network design means that, in the absence of their regulators, the genes are found in their least required activity state, hence regulatory intervention is often necessary. Due to the multitude of genes and regulators, spurious binding and unbinding events, called “crosstalk”, could occur. To determine how the form of regulation affects the global crosstalk in the network, we used a mathematical model that includes multiple regulators and multiple target genes. We found that crosstalk depends non-monotonically on the availability of regulators. Our analysis showed that excess use of regulation entailed by the formerly suggested network design caused high crosstalk levels in a large part of the parameter space. We therefore considered the opposite ‘idle’ design, where the default unregulated state of genes is their frequently required activity state. We found, that ‘idle’ design minimized the use of regulation and thus minimized crosstalk. In addition, we estimated global crosstalk of S. cerevisiae using transcription factors binding data. We demonstrated that even partial network data could suffice to estimate its global crosstalk, suggesting its applicability to additional organisms. We found that S. cerevisiae estimated crosstalk is lower than that of a random network, suggesting that natural selection reduces crosstalk. In summary, our study highlights a new type of protein production cost which is typically overlooked: that of regulatory interference caused by the presence of excess regulators in the cell. It demonstrates the importance of whole-network descriptions, which could show effects missed by single-gene models.' article_number: e1007642 article_processing_charge: No article_type: original author: - first_name: Rok full_name: Grah, Rok id: 483E70DE-F248-11E8-B48F-1D18A9856A87 last_name: Grah orcid: 0000-0003-2539-3560 - first_name: Tamar full_name: Friedlander, Tamar last_name: Friedlander citation: ama: Grah R, Friedlander T. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 2020;16(2). doi:10.1371/journal.pcbi.1007642 apa: Grah, R., & Friedlander, T. (2020). The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007642 chicago: Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” PLOS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007642. ieee: R. Grah and T. Friedlander, “The relation between crosstalk and gene regulation form revisited,” PLOS Computational Biology, vol. 16, no. 2. Public Library of Science, 2020. ista: Grah R, Friedlander T. 2020. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 16(2), e1007642. mla: Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” PLOS Computational Biology, vol. 16, no. 2, e1007642, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007642. short: R. Grah, T. Friedlander, PLOS Computational Biology 16 (2020). date_created: 2020-03-06T07:39:38Z date_published: 2020-02-25T00:00:00Z date_updated: 2026-04-08T07:25:08Z day: '25' ddc: - '000' - '570' department: - _id: CaGu - _id: GaTk doi: 10.1371/journal.pcbi.1007642 external_id: isi: - '000526725200019' pmid: - '32097416' file: - access_level: open_access checksum: 5239dd134dc6e1c71fe7b3ce2953da37 content_type: application/pdf creator: dernst date_created: 2020-03-09T15:12:21Z date_updated: 2020-07-14T12:48:00Z file_id: '7579' file_name: 2020_PlosCompBio_Grah.pdf file_size: 2209325 relation: main_file file_date_updated: 2020-07-14T12:48:00Z has_accepted_license: '1' intvolume: ' 16' isi: 1 issue: '2' language: - iso: eng month: '02' oa: 1 oa_version: Published Version pmid: 1 publication: PLOS Computational Biology publication_identifier: issn: - 1553-7358 publication_status: published publisher: Public Library of Science quality_controlled: '1' related_material: record: - id: '9716' relation: research_data status: deleted - id: '9776' relation: research_data status: public - id: '9779' relation: research_data status: public - id: '9777' relation: research_data status: public - id: '8155' relation: dissertation_contains status: public scopus_import: '1' status: public title: The relation between crosstalk and gene regulation form revisited 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: 16 year: '2020' ... --- _id: '7570' abstract: - lang: eng text: The relaxation of few-body quantum systems can strongly depend on the initial state when the system’s semiclassical phase space is mixed; i.e., regions of chaotic motion coexist with regular islands. In recent years, there has been much effort to understand the process of thermalization in strongly interacting quantum systems that often lack an obvious semiclassical limit. The time-dependent variational principle (TDVP) allows one to systematically derive an effective classical (nonlinear) dynamical system by projecting unitary many-body dynamics onto a manifold of weakly entangled variational states. We demonstrate that such dynamical systems generally possess mixed phase space. When TDVP errors are small, the mixed phase space leaves a footprint on the exact dynamics of the quantum model. For example, when the system is initialized in a state belonging to a stable periodic orbit or the surrounding regular region, it exhibits persistent many-body quantum revivals. As a proof of principle, we identify new types of “quantum many-body scars,” i.e., initial states that lead to long-time oscillations in a model of interacting Rydberg atoms in one and two dimensions. Intriguingly, the initial states that give rise to most robust revivals are typically entangled states. On the other hand, even when TDVP errors are large, as in the thermalizing tilted-field Ising model, initializing the system in a regular region of phase space leads to a surprising slowdown of thermalization. Our work establishes TDVP as a method for identifying interacting quantum systems with anomalous dynamics in arbitrary dimensions. Moreover, the mixed phase space classical variational equations allow one to find slowly thermalizing initial conditions in interacting models. Our results shed light on a link between classical and quantum chaos, pointing toward possible extensions of the classical Kolmogorov-Arnold-Moser theorem to quantum systems. article_number: '011055' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Alexios full_name: Michailidis, Alexios id: 36EBAD38-F248-11E8-B48F-1D18A9856A87 last_name: Michailidis orcid: 0000-0002-8443-1064 - first_name: C. J. full_name: Turner, C. J. last_name: Turner - first_name: Z. full_name: Papić, Z. last_name: Papić - first_name: D. A. full_name: Abanin, D. A. last_name: Abanin - first_name: Maksym full_name: Serbyn, Maksym id: 47809E7E-F248-11E8-B48F-1D18A9856A87 last_name: Serbyn orcid: 0000-0002-2399-5827 citation: ama: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Slow quantum thermalization and many-body revivals from mixed phase space. Physical Review X. 2020;10(1). doi:10.1103/physrevx.10.011055 apa: Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M. (2020). Slow quantum thermalization and many-body revivals from mixed phase space. Physical Review X. American Physical Society. https://doi.org/10.1103/physrevx.10.011055 chicago: Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Slow Quantum Thermalization and Many-Body Revivals from Mixed Phase Space.” Physical Review X. American Physical Society, 2020. https://doi.org/10.1103/physrevx.10.011055. ieee: A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Slow quantum thermalization and many-body revivals from mixed phase space,” Physical Review X, vol. 10, no. 1. American Physical Society, 2020. ista: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Slow quantum thermalization and many-body revivals from mixed phase space. Physical Review X. 10(1), 011055. mla: Michailidis, Alexios, et al. “Slow Quantum Thermalization and Many-Body Revivals from Mixed Phase Space.” Physical Review X, vol. 10, no. 1, 011055, American Physical Society, 2020, doi:10.1103/physrevx.10.011055. short: A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review X 10 (2020). date_created: 2020-03-08T18:02:01Z date_published: 2020-03-04T00:00:00Z date_updated: 2023-08-18T07:01:07Z day: '04' ddc: - '530' department: - _id: MaSe doi: 10.1103/physrevx.10.011055 external_id: arxiv: - '1905.08564' isi: - '000517969300001' file: - access_level: open_access checksum: 4b3f2c13873d35230173c73d0e11c408 content_type: application/pdf creator: dernst date_created: 2020-03-12T12:13:07Z date_updated: 2020-07-14T12:48:00Z file_id: '7581' file_name: 2020_PhysicalReviewX_Michailidis.pdf file_size: 17828638 relation: main_file file_date_updated: 2020-07-14T12:48:00Z has_accepted_license: '1' intvolume: ' 10' isi: 1 issue: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication: Physical Review X publication_identifier: issn: - 2160-3308 publication_status: published publisher: American Physical Society quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/classical-physics-helps-predict-fate-of-interacting-quantum-systems/ scopus_import: '1' status: public title: Slow quantum thermalization and many-body revivals from mixed phase space tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 10 year: '2020' ... --- _id: '7572' abstract: - lang: eng text: The polymerization–depolymerization dynamics of cytoskeletal proteins play essential roles in the self-organization of cytoskeletal structures, in eukaryotic as well as prokaryotic cells. While advances in fluorescence microscopy and in vitro reconstitution experiments have helped to study the dynamic properties of these complex systems, methods that allow to collect and analyze large quantitative datasets of the underlying polymer dynamics are still missing. Here, we present a novel image analysis workflow to study polymerization dynamics of active filaments in a nonbiased, highly automated manner. Using treadmilling filaments of the bacterial tubulin FtsZ as an example, we demonstrate that our method is able to specifically detect, track and analyze growth and shrinkage of polymers, even in dense networks of filaments. We believe that this automated method can facilitate the analysis of a large variety of dynamic cytoskeletal systems, using standard time-lapse movies obtained from experiments in vitro as well as in the living cell. Moreover, we provide scripts implementing this method as supplementary material. alternative_title: - Methods in Cell Biology article_processing_charge: No author: - first_name: Paulo R full_name: Dos Santos Caldas, Paulo R id: 38FCDB4C-F248-11E8-B48F-1D18A9856A87 last_name: Dos Santos Caldas orcid: 0000-0001-6730-4461 - first_name: Philipp full_name: Radler, Philipp id: 40136C2A-F248-11E8-B48F-1D18A9856A87 last_name: Radler orcid: '0000-0001-9198-2182 ' - first_name: Christoph M full_name: Sommer, Christoph M id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87 last_name: Sommer orcid: 0000-0003-1216-9105 - first_name: Martin full_name: Loose, Martin id: 462D4284-F248-11E8-B48F-1D18A9856A87 last_name: Loose orcid: 0000-0001-7309-9724 citation: ama: 'Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Tran P, ed. Methods in Cell Biology. Vol 158. Elsevier; 2020:145-161. doi:10.1016/bs.mcb.2020.01.006' apa: Dos Santos Caldas, P. R., Radler, P., Sommer, C. M., & Loose, M. (2020). Computational analysis of filament polymerization dynamics in cytoskeletal networks. In P. Tran (Ed.), Methods in Cell Biology (Vol. 158, pp. 145–161). Elsevier. https://doi.org/10.1016/bs.mcb.2020.01.006 chicago: Dos Santos Caldas, Paulo R, Philipp Radler, Christoph M Sommer, and Martin Loose. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” In Methods in Cell Biology, edited by Phong Tran, 158:145–61. Elsevier, 2020. https://doi.org/10.1016/bs.mcb.2020.01.006. ieee: P. R. Dos Santos Caldas, P. Radler, C. M. Sommer, and M. Loose, “Computational analysis of filament polymerization dynamics in cytoskeletal networks,” in Methods in Cell Biology, vol. 158, P. Tran, Ed. Elsevier, 2020, pp. 145–161. ista: 'Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. 2020.Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Methods in Cell Biology. Methods in Cell Biology, vol. 158, 145–161.' mla: Dos Santos Caldas, Paulo R., et al. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” Methods in Cell Biology, edited by Phong Tran, vol. 158, Elsevier, 2020, pp. 145–61, doi:10.1016/bs.mcb.2020.01.006. short: P.R. Dos Santos Caldas, P. Radler, C.M. Sommer, M. Loose, in:, P. Tran (Ed.), Methods in Cell Biology, Elsevier, 2020, pp. 145–161. date_created: 2020-03-08T23:00:47Z date_published: 2020-02-27T00:00:00Z date_updated: 2026-04-08T07:26:30Z day: '27' department: - _id: MaLo doi: 10.1016/bs.mcb.2020.01.006 ec_funded: 1 editor: - first_name: 'Phong ' full_name: 'Tran, Phong ' last_name: Tran external_id: isi: - '000611826500008' intvolume: ' 158' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/839571 month: '02' oa: 1 oa_version: Preprint page: 145-161 project: - _id: 2595697A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '679239' name: Self-Organization of the Bacterial Cell - _id: 260D98C8-B435-11E9-9278-68D0E5697425 name: Reconstitution of Bacterial Cell Division Using Purified Components publication: Methods in Cell Biology publication_identifier: issn: - 0091-679X publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '8358' relation: part_of_dissertation status: public scopus_import: '1' status: public title: Computational analysis of filament polymerization dynamics in cytoskeletal networks type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 158 year: '2020' ...