[{"scopus_import":"1","date_published":"2020-03-01T00:00:00Z","month":"03","citation":{"short":"J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001.","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.","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.","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","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.","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."},"date_updated":"2024-02-22T14:34:33Z","type":"journal_article","oa_version":"Preprint","ec_funded":1,"related_material":{"record":[{"status":"public","id":"149","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"6179"}]},"doi":"10.1214/19-AOP1379","article_type":"original","intvolume":" 48","title":"Correlated random matrices: Band rigidity and edge universality","main_file_link":[{"url":"https://arxiv.org/abs/1804.07744","open_access":"1"}],"language":[{"iso":"eng"}],"year":"2020","article_processing_charge":"No","publication":"Annals of Probability","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","_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."}],"volume":48,"publication_identifier":{"issn":["0091-1798"]},"project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Alt, Johannes","last_name":"Alt","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Erdös","orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger","orcid":"0000-0002-4821-3297","first_name":"Torben H","full_name":"Krüger, Torben H"},{"full_name":"Schröder, Dominik J","last_name":"Schröder","orcid":"0000-0002-2904-1856","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000528269100013"],"arxiv":["1804.07744"]},"arxiv":1,"issue":"2","oa":1,"quality_controlled":"1","department":[{"_id":"LaEr"}],"isi":1,"day":"01","status":"public","date_created":"2019-03-28T09:20:08Z","page":"963-1001","publisher":"Institute of Mathematical Statistics"},{"intvolume":" 378","title":"Cusp universality for random matrices I: Local law and the complex Hermitian case","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.","year":"2020","language":[{"iso":"eng"}],"publication":"Communications in Mathematical Physics","article_processing_charge":"Yes (via OA deal)","date_published":"2020-09-01T00:00:00Z","month":"09","ddc":["530","510"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","has_accepted_license":"1","date_updated":"2023-09-07T12:54:12Z","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","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.","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.","short":"L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics 378 (2020) 1203–1278.","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.","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."},"type":"journal_article","oa_version":"Published Version","file_date_updated":"2020-11-18T11:14:37Z","related_material":{"record":[{"id":"6179","relation":"dissertation_contains","status":"public"}]},"doi":"10.1007/s00220-019-03657-4","article_type":"original","ec_funded":1,"quality_controlled":"1","arxiv":1,"oa":1,"isi":1,"day":"01","department":[{"_id":"LaEr"}],"status":"public","date_created":"2019-03-28T10:21:15Z","publisher":"Springer Nature","file":[{"success":1,"date_created":"2020-11-18T11:14:37Z","checksum":"c3a683e2afdcea27afa6880b01e53dc2","access_level":"open_access","file_name":"2020_CommMathPhysics_Erdoes.pdf","file_id":"8771","relation":"main_file","content_type":"application/pdf","file_size":2904574,"creator":"dernst","date_updated":"2020-11-18T11:14:37Z"}],"page":"1203-1278","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","abstract":[{"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).","lang":"eng"}],"_id":"6185","project":[{"grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"volume":378,"publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","full_name":"Erdös, László"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","last_name":"Krüger","first_name":"Torben H","full_name":"Krüger, Torben H"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856","last_name":"Schröder","first_name":"Dominik J","full_name":"Schröder, Dominik J"}],"external_id":{"isi":["000529483000001"],"arxiv":["1809.03971"]}},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","month":"01","date_published":"2020-01-01T00:00:00Z","ddc":["500"],"has_accepted_license":"1","date_updated":"2023-08-17T13:49:40Z","citation":{"short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.","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.","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.","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","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.","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."},"type":"journal_article","file_date_updated":"2020-07-14T12:47:28Z","oa_version":"Published Version","ec_funded":1,"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s10955-020-02671-4"}]},"article_type":"original","doi":"10.1007/s10955-019-02434-w","intvolume":" 178","title":"Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems","year":"2020","language":[{"iso":"eng"}],"publication":"Journal of Statistical Physics","article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","_id":"6358","abstract":[{"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.","lang":"eng"}],"volume":178,"publication_identifier":{"issn":["00224715"],"eissn":["15729613"]},"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117"},{"name":"Taming Complexity in Partial Di erential Systems","_id":"260482E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":" F06504"}],"external_id":{"isi":["000498933300001"],"arxiv":["1811.04572"]},"author":[{"full_name":"Carlen, Eric A.","last_name":"Carlen","first_name":"Eric A."},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Maas, Jan"}],"arxiv":1,"issue":"2","oa":1,"quality_controlled":"1","department":[{"_id":"JaMa"}],"isi":1,"day":"01","status":"public","date_created":"2019-04-30T07:34:18Z","publisher":"Springer Nature","file":[{"file_name":"2019_JourStatistPhysics_Carlen.pdf","access_level":"open_access","checksum":"7b04befbdc0d4982c0ee945d25d19872","date_created":"2019-12-23T12:03:09Z","file_size":905538,"content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:47:28Z","relation":"main_file","file_id":"7209"}],"page":"319-378"},{"publisher":"Institute of Mathematical Statistics","file":[{"relation":"main_file","file_id":"8549","file_size":273042,"content_type":"application/pdf","date_updated":"2020-09-21T13:15:02Z","creator":"dernst","success":1,"checksum":"8e7c42e72596f6889d786e8e8b89994f","date_created":"2020-09-21T13:15:02Z","file_name":"2020_EJournProbab_Dareiotis.pdf","access_level":"open_access"}],"date_created":"2019-04-30T07:40:17Z","status":"public","department":[{"_id":"JaMa"}],"day":"16","isi":1,"oa":1,"arxiv":1,"quality_controlled":"1","author":[{"first_name":"Konstantinos","last_name":"Dareiotis","full_name":"Dareiotis, Konstantinos"},{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser","full_name":"Gerencser, Mate"}],"external_id":{"isi":["000550150700001"],"arxiv":["1812.04583"]},"publication_identifier":{"eissn":["1083-6489"]},"volume":25,"_id":"6359","abstract":[{"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.","lang":"eng"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Electronic Journal of Probability","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2020","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","intvolume":" 25","doi":"10.1214/20-EJP479","article_type":"original","file_date_updated":"2020-09-21T13:15:02Z","oa_version":"Published Version","article_number":"82","type":"journal_article","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","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.","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.","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","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (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.","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."},"date_updated":"2023-10-16T09:22:50Z","has_accepted_license":"1","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["510"],"month":"07","date_published":"2020-07-16T00:00:00Z"},{"arxiv":1,"oa":1,"issue":"3","quality_controlled":"1","department":[{"_id":"LaEr"}],"isi":1,"day":"01","status":"public","date_created":"2019-05-26T21:59:14Z","publisher":"World Scientific Publishing","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","_id":"6488","abstract":[{"text":"We prove a central limit theorem for the difference of linear eigenvalue statistics of a sample covariance matrix W˜ and its minor W. We find that the fluctuation of this difference is much smaller than those of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of W˜ and W. Our result identifies the fluctuation of the spatial derivative of the approximate Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar result for Wigner matrices, for sample covariance matrices, the fluctuation may entirely vanish.","lang":"eng"}],"volume":9,"publication_identifier":{"issn":["20103263"],"eissn":["20103271"]},"project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7"},{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000547464400001"],"arxiv":["1806.08751"]},"author":[{"full_name":"Cipolloni, Giorgio","first_name":"Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"}],"intvolume":" 9","title":"Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices","main_file_link":[{"url":"https://arxiv.org/abs/1806.08751","open_access":"1"}],"language":[{"iso":"eng"}],"year":"2020","publication":"Random Matrices: Theory and Application","article_processing_charge":"No","scopus_import":"1","month":"07","date_published":"2020-07-01T00:00:00Z","article_number":"2050006","date_updated":"2023-08-28T08:38:48Z","citation":{"ieee":"G. Cipolloni and L. Erdös, “Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices,” Random Matrices: Theory and Application, vol. 9, no. 3. World Scientific Publishing, 2020.","mla":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” Random Matrices: Theory and Application, vol. 9, no. 3, 2050006, World Scientific Publishing, 2020, doi:10.1142/S2010326320500069.","ama":"Cipolloni G, Erdös L. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. Random Matrices: Theory and Application. 2020;9(3). doi:10.1142/S2010326320500069","ista":"Cipolloni G, Erdös L. 2020. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. Random Matrices: Theory and Application. 9(3), 2050006.","chicago":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” Random Matrices: Theory and Application. World Scientific Publishing, 2020. https://doi.org/10.1142/S2010326320500069.","apa":"Cipolloni, G., & Erdös, L. (2020). Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. Random Matrices: Theory and Application. World Scientific Publishing. https://doi.org/10.1142/S2010326320500069","short":"G. Cipolloni, L. Erdös, Random Matrices: Theory and Application 9 (2020)."},"type":"journal_article","oa_version":"Preprint","ec_funded":1,"article_type":"original","doi":"10.1142/S2010326320500069"},{"oa_version":"Preprint","doi":"10.1007/s10208-019-09419-x","article_type":"original","date_published":"2020-04-01T00:00:00Z","month":"04","scopus_import":"1","citation":{"mla":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.","ieee":"M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer Nature, pp. 311–330, 2020.","ama":"Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x","chicago":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x.","ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.","apa":"Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. Springer Nature. https://doi.org/10.1007/s10208-019-09419-x"},"date_updated":"2023-08-17T13:50:44Z","type":"journal_article","language":[{"iso":"eng"}],"year":"2020","publication":"Foundations of Computational Mathematics","article_processing_charge":"No","intvolume":" 20","title":"Are two given maps homotopic? An algorithmic viewpoint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1312.2337"}],"project":[{"grant_number":"P31312","call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory"}],"volume":20,"publication_identifier":{"eissn":["16153383"],"issn":["16153375"]},"author":[{"id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","last_name":"Filakovský","first_name":"Marek","full_name":"Filakovský, Marek"},{"first_name":"Lukas","last_name":"Vokřínek","full_name":"Vokřínek, Lukas"}],"external_id":{"isi":["000522437400004"],"arxiv":["1312.2337"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","abstract":[{"text":"This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋.","lang":"eng"}],"_id":"6563","status":"public","date_created":"2019-06-16T21:59:14Z","page":"311-330","publisher":"Springer Nature","quality_controlled":"1","arxiv":1,"oa":1,"isi":1,"day":"01","department":[{"_id":"UlWa"}]},{"status":"public","date_created":"2019-06-27T20:09:33Z","publisher":"Springer Nature","file":[{"file_size":359654,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:34Z","creator":"kschuh","relation":"main_file","file_id":"6927","file_name":"ExtragradientMethodPaper.pdf","access_level":"open_access","checksum":"bb1a1eb3ebb2df380863d0db594673ba","date_created":"2019-10-01T13:14:10Z"}],"page":"365-388","oa":1,"quality_controlled":"1","department":[{"_id":"VlKo"}],"isi":1,"day":"01","volume":84,"publication_identifier":{"issn":["1017-1398"],"eissn":["1572-9265"]},"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160"}],"author":[{"id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","first_name":"Yekini","orcid":"0000-0001-9224-7139","last_name":"Shehu","full_name":"Shehu, Yekini"},{"last_name":"Li","first_name":"Xiao-Huan","full_name":"Li, Xiao-Huan"},{"first_name":"Qiao-Li","last_name":"Dong","full_name":"Dong, Qiao-Li"}],"external_id":{"isi":["000528979000015"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","_id":"6593","abstract":[{"text":"We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising.","lang":"eng"}],"language":[{"iso":"eng"}],"year":"2020","publication":"Numerical Algorithms","article_processing_charge":"No","intvolume":" 84","title":"An efficient projection-type method for monotone variational inequalities in Hilbert spaces","acknowledgement":"The research of this author is supported by the ERC grant at the IST.","file_date_updated":"2020-07-14T12:47:34Z","oa_version":"Submitted Version","ec_funded":1,"article_type":"original","doi":"10.1007/s11075-019-00758-y","scopus_import":"1","month":"05","date_published":"2020-05-01T00:00:00Z","ddc":["000"],"citation":{"ama":"Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388. doi:10.1007/s11075-019-00758-y","mla":"Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms, vol. 84, Springer Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y.","ieee":"Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” Numerical Algorithms, vol. 84. Springer Nature, pp. 365–388, 2020.","short":"Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.","apa":"Shehu, Y., Li, X.-H., & Dong, Q.-L. (2020). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. Springer Nature. https://doi.org/10.1007/s11075-019-00758-y","chicago":"Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms. Springer Nature, 2020. https://doi.org/10.1007/s11075-019-00758-y.","ista":"Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388."},"date_updated":"2023-08-17T13:51:18Z","has_accepted_license":"1","type":"journal_article"},{"title":"Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime","intvolume":" 374","publication":"Communications in Mathematical Physics","article_processing_charge":"No","year":"2020","language":[{"iso":"eng"}],"type":"journal_article","date_updated":"2023-08-17T13:51:50Z","citation":{"ama":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 2020;374:2097–2150. doi:10.1007/s00220-019-03505-5","mla":"Benedikter, Niels P., et al. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics, vol. 374, Springer Nature, 2020, pp. 2097–2150, doi:10.1007/s00220-019-03505-5.","ieee":"N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime,” Communications in Mathematical Physics, vol. 374. Springer Nature, pp. 2097–2150, 2020.","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications in Mathematical Physics 374 (2020) 2097–2150.","apa":"Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R. (2020). Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03505-5","chicago":"Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03505-5.","ista":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2020. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 374, 2097–2150."},"has_accepted_license":"1","ddc":["530"],"month":"03","date_published":"2020-03-01T00:00:00Z","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1007/s00220-019-03505-5","article_type":"original","ec_funded":1,"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:35Z","day":"01","isi":1,"department":[{"_id":"RoSe"}],"quality_controlled":"1","oa":1,"arxiv":1,"file":[{"relation":"main_file","file_id":"6668","file_size":853289,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:35Z","creator":"dernst","checksum":"f9dd6dd615a698f1d3636c4a092fed23","date_created":"2019-07-24T07:19:10Z","file_name":"2019_CommMathPhysics_Benedikter.pdf","access_level":"open_access"}],"page":"2097–2150","publisher":"Springer Nature","date_created":"2019-07-18T13:30:04Z","status":"public","abstract":[{"text":"While Hartree–Fock theory is well established as a fundamental approximation for interacting fermions, it has been unclear how to describe corrections to it due to many-body correlations. In this paper we start from the Hartree–Fock state given by plane waves and introduce collective particle–hole pair excitations. These pairs can be approximately described by a bosonic quadratic Hamiltonian. We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type upper bound to the ground state energy. Our result justifies the random-phase approximation in the mean-field scaling regime, for repulsive, regular interaction potentials.\r\n","lang":"eng"}],"_id":"6649","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Niels P","last_name":"Benedikter","orcid":"0000-0002-1071-6091","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","full_name":"Benedikter, Niels P"},{"last_name":"Nam","first_name":"Phan Thành","full_name":"Nam, Phan Thành"},{"full_name":"Porta, Marcello","last_name":"Porta","first_name":"Marcello"},{"full_name":"Schlein, Benjamin","first_name":"Benjamin","last_name":"Schlein"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"external_id":{"isi":["000527910700019"],"arxiv":["1809.01902"]},"project":[{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","call_identifier":"FWF"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227"}],"publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"volume":374},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.01375"}],"title":"Analysis of a two-layer neural network via displacement convexity","intvolume":" 48","language":[{"iso":"eng"}],"year":"2020","publication":"Annals of Statistics","article_processing_charge":"No","date_published":"2020-12-11T00:00:00Z","month":"12","type":"journal_article","date_updated":"2024-03-06T08:28:50Z","citation":{"ama":"Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 2020;48(6):3619-3642. doi:10.1214/20-AOS1945","ieee":"A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural network via displacement convexity,” Annals of Statistics, vol. 48, no. 6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.","mla":"Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics, vol. 48, no. 6, Institute of Mathematical Statistics, 2020, pp. 3619–42, doi:10.1214/20-AOS1945.","apa":"Javanmard, A., Mondelli, M., & Montanari, A. (2020). Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/20-AOS1945","short":"A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642.","ista":"Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.","chicago":"Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-AOS1945."},"oa_version":"Preprint","article_type":"original","doi":"10.1214/20-AOS1945","quality_controlled":"1","oa":1,"issue":"6","arxiv":1,"day":"11","isi":1,"department":[{"_id":"MaMo"}],"date_created":"2019-07-31T09:39:42Z","status":"public","publisher":"Institute of Mathematical Statistics","page":"3619-3642","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches.\r\nHere we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge.","lang":"eng"}],"_id":"6748","publication_identifier":{"eissn":["1941-7330"],"issn":["1932-6157"]},"volume":48,"external_id":{"arxiv":["1901.01375"],"isi":["000598369200021"]},"author":[{"last_name":"Javanmard","first_name":"Adel","full_name":"Javanmard, Adel"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Montanari","first_name":"Andrea","full_name":"Montanari, Andrea"}]},{"title":"Dynamic resource allocation games","intvolume":" 807","publication":"Theoretical Computer Science","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2020","type":"journal_article","date_updated":"2023-08-17T13:52:49Z","has_accepted_license":"1","citation":{"short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","apa":"Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031","chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.","ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.","ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020."},"scopus_import":"1","ddc":["000"],"month":"02","date_published":"2020-02-06T00:00:00Z","article_type":"original","doi":"10.1016/j.tcs.2019.06.031","related_material":{"record":[{"id":"1341","relation":"earlier_version","status":"public"}]},"file_date_updated":"2020-10-09T06:31:22Z","oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"day":"06","isi":1,"oa":1,"quality_controlled":"1","publisher":"Elsevier","file":[{"file_name":"2020_TheoreticalCS_Avni.pdf","access_level":"open_access","success":1,"checksum":"e86635417f45eb2cd75778f91382f737","date_created":"2020-10-09T06:31:22Z","file_size":1413001,"content_type":"application/pdf","date_updated":"2020-10-09T06:31:22Z","creator":"dernst","relation":"main_file","file_id":"8639"}],"page":"42-55","date_created":"2019-08-04T21:59:20Z","status":"public","_id":"6761","abstract":[{"text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.","lang":"eng"}],"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","full_name":"Avni, Guy"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"external_id":{"isi":["000512219400004"]},"publication_identifier":{"issn":["03043975"]},"volume":807,"project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369"}]},{"year":"2020","language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"Hippocampus","intvolume":" 30","title":"Partial coherence and frustration in self-organizing spherical grids","oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:40Z","article_type":"original","doi":"10.1002/hipo.23144","month":"04","date_published":"2020-04-01T00:00:00Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","date_updated":"2023-08-17T13:53:14Z","has_accepted_license":"1","citation":{"apa":"Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence and frustration in self-organizing spherical grids. Hippocampus. Wiley. https://doi.org/10.1002/hipo.23144","short":"F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.","ista":"Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313.","chicago":"Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus. Wiley, 2020. https://doi.org/10.1002/hipo.23144.","ama":"Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144","ieee":"F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley, pp. 302–313, 2020.","mla":"Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13, doi:10.1002/hipo.23144."},"pmid":1,"type":"journal_article","status":"public","date_created":"2019-08-11T21:59:24Z","page":"302-313","publisher":"Wiley","file":[{"access_level":"open_access","file_name":"2019_Hippocampus_Stella.pdf","date_created":"2019-08-12T07:53:33Z","checksum":"7b54d22bfbfc0d1188a9ea24d985bfb2","content_type":"application/pdf","file_size":2370658,"creator":"dernst","date_updated":"2020-07-14T12:47:40Z","file_id":"6800","relation":"main_file"}],"quality_controlled":"1","issue":"4","oa":1,"isi":1,"day":"01","department":[{"_id":"JoCs"}],"volume":30,"publication_identifier":{"eissn":["10981063"],"issn":["10509631"]},"author":[{"full_name":"Stella, Federico","first_name":"Federico","last_name":"Stella","orcid":"0000-0001-9439-3148","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Urdapilleta, Eugenio","last_name":"Urdapilleta","first_name":"Eugenio"},{"last_name":"Luo","first_name":"Yifan","full_name":"Luo, Yifan"},{"last_name":"Treves","first_name":"Alessandro","full_name":"Treves, Alessandro"}],"external_id":{"isi":["000477299600001"],"pmid":["31339190"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","abstract":[{"text":"Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses.","lang":"eng"}],"_id":"6796"},{"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/"}],"title":"Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens","intvolume":" 174","publication":"Methods","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2020","pmid":1,"type":"journal_article","citation":{"ama":"Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41. doi:10.1016/j.ymeth.2019.07.019","mla":"Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174, no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019.","ieee":"W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods, vol. 174, no. 3. Elsevier, pp. 27–41, 2020.","short":"W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.","apa":"Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019","chicago":"Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019.","ista":"Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3), 27–41."},"date_updated":"2023-08-17T13:59:57Z","scopus_import":"1","date_published":"2020-03-01T00:00:00Z","month":"03","article_type":"original","doi":"10.1016/j.ymeth.2019.07.019","oa_version":"Submitted Version","department":[{"_id":"JoDa"}],"day":"01","isi":1,"issue":"3","oa":1,"quality_controlled":"1","publisher":"Elsevier","page":"27-41","date_created":"2019-08-12T16:36:32Z","status":"public","_id":"6808","abstract":[{"lang":"eng","text":"Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions."}],"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Jahr, Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","last_name":"Jahr","first_name":"Wiebke"},{"id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","orcid":"0000-0002-2340-7431","last_name":"Velicky","full_name":"Velicky, Philipp"},{"full_name":"Danzl, Johann G","last_name":"Danzl","orcid":"0000-0001-8559-3973","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"pmid":["31344404"],"isi":["000525860400005"]},"publication_identifier":{"issn":["1046-2023"]},"volume":174,"project":[{"name":"Optical control of synaptic function via adhesion molecules","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I03600"},{"name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration","_id":"2668BFA0-B435-11E9-9278-68D0E5697425","grant_number":"LT00057"}]},{"language":[{"iso":"eng"}],"year":"2020","publication":"Communications in Mathematical Physics","article_processing_charge":"No","title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.03086"}],"intvolume":" 376","acknowledgement":"We would like to thank P. T. Nam and R. Seiringer for several useful discussions and\r\nfor suggesting us to use the localization techniques from [9]. C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges support from the NCCR SwissMAP and from the Swiss National Foundation of Science (Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties of Bose–Einstein condensates”.","oa_version":"Preprint","ec_funded":1,"article_type":"original","doi":"10.1007/s00220-019-03555-9","scopus_import":"1","date_published":"2020-06-01T00:00:00Z","month":"06","type":"journal_article","citation":{"ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime,” Communications in Mathematical Physics, vol. 376. Springer, pp. 1311–1395, 2020.","mla":"Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics, vol. 376, Springer, 2020, pp. 1311–95, doi:10.1007/s00220-019-03555-9.","ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 2020;376:1311-1395. doi:10.1007/s00220-019-03555-9","ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 376, 1311–1395.","chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics. Springer, 2020. https://doi.org/10.1007/s00220-019-03555-9.","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2020). Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-019-03555-9","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395."},"date_updated":"2024-02-22T13:33:02Z","date_created":"2019-09-24T17:30:59Z","status":"public","page":"1311-1395","publisher":"Springer","oa":1,"arxiv":1,"quality_controlled":"1","department":[{"_id":"RoSe"}],"day":"01","isi":1,"publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"volume":376,"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227"}],"author":[{"full_name":"Boccato, Chiara","first_name":"Chiara","last_name":"Boccato","id":"342E7E22-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brennecke, Christian","last_name":"Brennecke","first_name":"Christian"},{"full_name":"Cenatiempo, Serena","first_name":"Serena","last_name":"Cenatiempo"},{"full_name":"Schlein, Benjamin","last_name":"Schlein","first_name":"Benjamin"}],"external_id":{"isi":["000536053300012"],"arxiv":["1812.03086"]},"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6906","abstract":[{"lang":"eng","text":"We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential."}]},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.09692"}],"title":"An efficient algorithm for computing network reliability in small treewidth","intvolume":" 193","acknowledgement":"We are grateful to the anonymous reviewers for their comments, which significantly improved the present work. The research was partially supported by the EPSRC Early Career Fellowship EP/R023379/1, grant no. SC7-1718-01 of the London Mathematical Society, an IBM PhD Fellowship, and a DOC Fellowship of the Austrian Academy of Sciences (ÖAW).","year":"2020","language":[{"iso":"eng"}],"publication":"Reliability Engineering and System Safety","article_processing_charge":"No","scopus_import":"1","date_published":"2020-01-01T00:00:00Z","month":"01","article_number":"106665","type":"journal_article","citation":{"mla":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.","ieee":"A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020.","ama":"Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2020;193. doi:10.1016/j.ress.2019.106665","chicago":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety. Elsevier, 2020. https://doi.org/10.1016/j.ress.2019.106665.","ista":"Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.","short":"A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2020).","apa":"Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665"},"date_updated":"2024-03-25T23:30:18Z","oa_version":"Preprint","doi":"10.1016/j.ress.2019.106665","article_type":"original","related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"oa":1,"arxiv":1,"quality_controlled":"1","department":[{"_id":"KrCh"}],"day":"01","isi":1,"date_created":"2019-09-29T22:00:44Z","status":"public","publisher":"Elsevier","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6918","abstract":[{"lang":"eng","text":"We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.\r\n\r\nWe provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem."}],"publication_identifier":{"issn":["09518320"]},"volume":193,"project":[{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"author":[{"last_name":"Goharshady","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Mohammadi, Fatemeh","last_name":"Mohammadi","first_name":"Fatemeh"}],"external_id":{"isi":["000501641400050"],"arxiv":["1712.09692"]}},{"article_type":"original","doi":"10.1007/s11263-019-01232-x","related_material":{"record":[{"id":"6482","relation":"earlier_version","status":"public"}],"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s11263-019-01262-5"}]},"ec_funded":1,"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:45Z","type":"journal_article","citation":{"apa":"Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x","short":"R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.","ista":"Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 128(4), 970–995.","chicago":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.","ama":"Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 2020;128(4):970-995. doi:10.1007/s11263-019-01232-x","ieee":"R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications,” International Journal of Computer Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.","mla":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x."},"date_updated":"2024-02-22T14:57:30Z","has_accepted_license":"1","ddc":["004"],"month":"04","date_published":"2020-04-01T00:00:00Z","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"Yes (via OA deal)","publication":"International Journal of Computer Vision","language":[{"iso":"eng"}],"year":"2020","title":"KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications","intvolume":" 128","author":[{"first_name":"Rémy","last_name":"Sun","full_name":"Sun, Rémy"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","first_name":"Christoph"}],"external_id":{"isi":["000494406800001"]},"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"volume":128,"abstract":[{"text":"We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change.","lang":"eng"}],"_id":"6944","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2019_IJCV_Sun.pdf","access_level":"open_access","checksum":"155e63edf664dcacb3bdc1c2223e606f","date_created":"2019-11-26T10:30:02Z","file_size":1715072,"content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:47:45Z","relation":"main_file","file_id":"7110"}],"publisher":"Springer Nature","page":"970-995","date_created":"2019-10-14T09:14:28Z","status":"public","day":"01","isi":1,"department":[{"_id":"ChLa"}],"quality_controlled":"1","issue":"4","oa":1},{"status":"public","date_created":"2019-10-17T13:38:20Z","page":"835-854","file":[{"checksum":"a0f05dd4f5f64e4f713d8d9d4b5b1e3f","date_created":"2019-10-25T10:28:29Z","file_name":"2019_CompVision_Henderson.pdf","access_level":"open_access","relation":"main_file","file_id":"6973","date_updated":"2020-07-14T12:47:46Z","creator":"dernst","file_size":2243134,"content_type":"application/pdf"}],"publisher":"Springer Nature","arxiv":1,"oa":1,"quality_controlled":"1","department":[{"_id":"ChLa"}],"isi":1,"day":"01","volume":128,"publication_identifier":{"eissn":["1573-1405"],"issn":["0920-5691"]},"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"author":[{"id":"13C09E74-18D9-11E9-8878-32CFE5697425","first_name":"Paul M","last_name":"Henderson","orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M"},{"full_name":"Ferrari, Vittorio","first_name":"Vittorio","last_name":"Ferrari"}],"external_id":{"isi":["000491042100002"],"arxiv":["1901.06447"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","_id":"6952","abstract":[{"text":"We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn.","lang":"eng"}],"language":[{"iso":"eng"}],"year":"2020","publication":"International Journal of Computer Vision","article_processing_charge":"Yes (via OA deal)","intvolume":" 128","title":"Learning single-image 3D reconstruction by generative modelling of shape, pose and shading","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","file_date_updated":"2020-07-14T12:47:46Z","oa_version":"Published Version","doi":"10.1007/s11263-019-01219-8","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","date_published":"2020-04-01T00:00:00Z","month":"04","ddc":["004"],"date_updated":"2023-08-17T14:01:16Z","citation":{"ieee":"P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by generative modelling of shape, pose and shading,” International Journal of Computer Vision, vol. 128. Springer Nature, pp. 835–854, 2020.","mla":"Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision, vol. 128, Springer Nature, 2020, pp. 835–54, doi:10.1007/s11263-019-01219-8.","ama":"Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 2020;128:835-854. doi:10.1007/s11263-019-01219-8","ista":"Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 128, 835–854.","chicago":"Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01219-8.","apa":"Henderson, P. M., & Ferrari, V. (2020). Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01219-8","short":"P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 835–854."},"has_accepted_license":"1","type":"journal_article"},{"issue":"1","intvolume":" 16","quality_controlled":"1","title":"Jigsaw puzzle design of pluripotent origami","day":"01","year":"2020","language":[{"iso":"eng"}],"status":"public","date_created":"2019-10-31T07:51:44Z","page":"63–68","publisher":"Springer Nature","article_processing_charge":"No","publication":"Nature Physics","extern":"1","date_published":"2020-01-01T00:00:00Z","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","month":"01","publication_status":"published","_id":"6976","abstract":[{"text":"Origami is rapidly transforming the design of robots1,2, deployable structures3,4,5,6 and metamaterials7,8,9,10,11,12,13,14. However, as foldability requires a large number of complex compatibility conditions that are difficult to satisfy, the design of crease patterns is limited to heuristics and computer optimization. Here we introduce a systematic strategy that enables intuitive and effective design of complex crease patterns that are guaranteed to fold. First, we exploit symmetries to construct 140 distinct foldable motifs, and represent these as jigsaw puzzle pieces. We then show that when these pieces are fitted together they encode foldable crease patterns. This maps origami design to solving combinatorial problems, which allows us to systematically create, count and classify a vast number of crease patterns. We show that all of these crease patterns are pluripotent—capable of folding into multiple shapes—and solve exactly for the number of possible shapes for each pattern. Finally, we employ our framework to rationally design a crease pattern that folds into two independently defined target shapes, and fabricate such pluripotent origami. Our results provide physicists, mathematicians and engineers with a powerful new design strategy.","lang":"eng"}],"citation":{"apa":"Dieleman, P., Vasmel, N., Waitukaitis, S. R., & van Hecke, M. (2020). Jigsaw puzzle design of pluripotent origami. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-019-0677-3","short":"P. Dieleman, N. Vasmel, S.R. Waitukaitis, M. van Hecke, Nature Physics 16 (2020) 63–68.","ista":"Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. 2020. Jigsaw puzzle design of pluripotent origami. Nature Physics. 16(1), 63–68.","chicago":"Dieleman, Peter, Niek Vasmel, Scott R Waitukaitis, and Martin van Hecke. “Jigsaw Puzzle Design of Pluripotent Origami.” Nature Physics. Springer Nature, 2020. https://doi.org/10.1038/s41567-019-0677-3.","ama":"Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. Jigsaw puzzle design of pluripotent origami. Nature Physics. 2020;16(1):63–68. doi:10.1038/s41567-019-0677-3","ieee":"P. Dieleman, N. Vasmel, S. R. Waitukaitis, and M. van Hecke, “Jigsaw puzzle design of pluripotent origami,” Nature Physics, vol. 16, no. 1. Springer Nature, pp. 63–68, 2020.","mla":"Dieleman, Peter, et al. “Jigsaw Puzzle Design of Pluripotent Origami.” Nature Physics, vol. 16, no. 1, Springer Nature, 2020, pp. 63–68, doi:10.1038/s41567-019-0677-3."},"date_updated":"2021-01-12T08:11:16Z","type":"journal_article","volume":16,"publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"oa_version":"None","author":[{"full_name":"Dieleman, Peter","last_name":"Dieleman","first_name":"Peter"},{"full_name":"Vasmel, Niek","first_name":"Niek","last_name":"Vasmel"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","first_name":"Scott R","full_name":"Waitukaitis, Scott R"},{"last_name":"van Hecke","first_name":"Martin","full_name":"van Hecke, Martin"}],"doi":"10.1038/s41567-019-0677-3","article_type":"letter_note"},{"title":"Auxin guides roots to avoid obstacles during gravitropic growth","intvolume":" 225","publication":"New Phytologist","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"year":"2020","type":"journal_article","pmid":1,"citation":{"ama":"Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 2020;225(3):1049-1052. doi:10.1111/nph.16203","mla":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist, vol. 225, no. 3, Wiley, 2020, pp. 1049–52, doi:10.1111/nph.16203.","ieee":"Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic growth,” New Phytologist, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020.","short":"Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052.","apa":"Zhang, Y., & Friml, J. (2020). Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. Wiley. https://doi.org/10.1111/nph.16203","chicago":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist. Wiley, 2020. https://doi.org/10.1111/nph.16203.","ista":"Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 225(3), 1049–1052."},"has_accepted_license":"1","date_updated":"2023-08-17T14:01:49Z","ddc":["580"],"date_published":"2020-02-01T00:00:00Z","month":"02","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_type":"original","doi":"10.1111/nph.16203","ec_funded":1,"oa_version":"Published Version","file_date_updated":"2020-11-18T16:42:48Z","day":"01","isi":1,"department":[{"_id":"JiFr"}],"quality_controlled":"1","issue":"3","oa":1,"file":[{"file_size":717345,"content_type":"application/pdf","date_updated":"2020-11-18T16:42:48Z","creator":"dernst","relation":"main_file","file_id":"8772","file_name":"2020_NewPhytologist_Zhang.pdf","access_level":"open_access","success":1,"checksum":"cd42ffdb381fd52812b9583d4d407139","date_created":"2020-11-18T16:42:48Z"}],"page":"1049-1052","publisher":"Wiley","date_created":"2019-11-12T11:41:32Z","status":"public","_id":"6997","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Zhang, Yuzhou","first_name":"Yuzhou","orcid":"0000-0003-2627-6956","last_name":"Zhang","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Friml, Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000489638800001"],"pmid":["31603260"]},"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","call_identifier":"H2020"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","call_identifier":"FWF"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"publication_identifier":{"eissn":["1469-8137"],"issn":["0028-646x"]},"volume":225},{"abstract":[{"text":"We define an action of the (double of) Cohomological Hall algebra of Kontsevich and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov. We identify this action with the one of the affine Yangian of gl(1). Based on that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák. We conjecture that our approach works for a big class of Calabi–Yau categories, including those associated with toric Calabi–Yau 3-folds.","lang":"eng"}],"_id":"7004","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Rapcak","first_name":"Miroslav","full_name":"Rapcak, Miroslav"},{"last_name":"Soibelman","first_name":"Yan","full_name":"Soibelman, Yan"},{"full_name":"Yang, Yaping","last_name":"Yang","first_name":"Yaping"},{"full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","first_name":"Gufang","last_name":"Zhao"}],"external_id":{"isi":["000536255500004"],"arxiv":["1810.10402"]},"project":[{"_id":"25E549F4-B435-11E9-9278-68D0E5697425","name":"Arithmetic and physics of Higgs moduli spaces","grant_number":"320593","call_identifier":"FP7"}],"publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"volume":376,"day":"01","isi":1,"department":[{"_id":"TaHa"}],"quality_controlled":"1","oa":1,"arxiv":1,"publisher":"Springer Nature","page":"1803-1873","date_created":"2019-11-12T14:01:27Z","status":"public","type":"journal_article","citation":{"chicago":"Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03575-5.","ista":"Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873.","short":"M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical Physics 376 (2020) 1803–1873.","apa":"Rapcak, M., Soibelman, Y., Yang, Y., & Zhao, G. (2020). Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03575-5","mla":"Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics, vol. 376, Springer Nature, 2020, pp. 1803–73, doi:10.1007/s00220-019-03575-5.","ieee":"M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras, vertex algebras and instantons,” Communications in Mathematical Physics, vol. 376. Springer Nature, pp. 1803–1873, 2020.","ama":"Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 2020;376:1803-1873. doi:10.1007/s00220-019-03575-5"},"date_updated":"2023-08-17T14:02:59Z","date_published":"2020-06-01T00:00:00Z","month":"06","scopus_import":"1","doi":"10.1007/s00220-019-03575-5","article_type":"original","ec_funded":1,"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1810.10402","open_access":"1"}],"title":"Cohomological Hall algebras, vertex algebras and instantons","intvolume":" 376","article_processing_charge":"No","publication":"Communications in Mathematical Physics","language":[{"iso":"eng"}],"year":"2020"},{"quality_controlled":"1","oa":1,"issue":"2","day":"01","isi":1,"department":[{"_id":"SaSi"}],"date_created":"2019-11-18T14:18:39Z","status":"public","page":"1070–1084","publisher":"Springer Nature","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"text":"Removal of the Bax gene from mice completely protects the somas of retinal ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes BAX a promising therapeutic target to prevent neurodegeneration. In this study, Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN, and quantitative PCR were used to monitor the status of the BAX activation mechanism in the months following injury. The apoptotic susceptibility of injured cells was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury. The competency of quiescent RGCs to reactivate their BAX activation mechanism was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly, cells deactivated their BAX activation mechanism between 7 and 12 weeks after crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that these cells had a nearly normal capacity to activate this protein, but this capacity was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks after crush, damaged cells no longer displayed increased susceptibility to BAX activation relative to their naïve counterparts. In this same timeframe, retinal glial activation and the signaling of the pro-apoptotic JNK pathway also abated. Quiescent RGCs did not show a timely reactivation of their JNK pathway following intravitreal injection with anisomycin. These findings demonstrate that lowering the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs enter a quiescent state months after injury and are no longer responsive to an apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality.","lang":"eng"}],"_id":"7033","publication_identifier":{"issn":["0893-7648"],"eissn":["1559-1182"]},"volume":57,"author":[{"full_name":"Donahue, RJ","first_name":"RJ","last_name":"Donahue"},{"first_name":"Margaret E","orcid":"0000-0001-9642-1085","last_name":"Maes","id":"3838F452-F248-11E8-B48F-1D18A9856A87","full_name":"Maes, Margaret E"},{"full_name":"Grosser, JA","last_name":"Grosser","first_name":"JA"},{"full_name":"Nickells, RW","first_name":"RW","last_name":"Nickells"}],"external_id":{"pmid":["31673950"],"isi":["000493754200001"]},"title":"BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7035206/"}],"intvolume":" 57","acknowledgement":"This work was supported by National Eye Institute grants R01 EY012223 (RWN), R01 EY030123 (RWN), T32 EY027721 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), and a Vision Science Core grant P30 EY016665 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), an unrestricted funding grant from Research to Prevent Blindness (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), the Frederick A. Davis Endowment (RWN), and the Mr. and Mrs. George Taylor Foundation (RWN).","language":[{"iso":"eng"}],"year":"2020","publication":"Molecular Neurobiology","article_processing_charge":"No","month":"02","date_published":"2020-02-01T00:00:00Z","scopus_import":"1","pmid":1,"type":"journal_article","citation":{"ama":"Donahue R, Maes ME, Grosser J, Nickells R. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 2020;57(2):1070–1084. doi:10.1007/s12035-019-01783-7","ieee":"R. Donahue, M. E. Maes, J. Grosser, and R. Nickells, “BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage,” Molecular Neurobiology, vol. 57, no. 2. Springer Nature, pp. 1070–1084, 2020.","mla":"Donahue, RJ, et al. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology, vol. 57, no. 2, Springer Nature, 2020, pp. 1070–1084, doi:10.1007/s12035-019-01783-7.","apa":"Donahue, R., Maes, M. E., Grosser, J., & Nickells, R. (2020). BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. Springer Nature. https://doi.org/10.1007/s12035-019-01783-7","short":"R. Donahue, M.E. Maes, J. Grosser, R. Nickells, Molecular Neurobiology 57 (2020) 1070–1084.","ista":"Donahue R, Maes ME, Grosser J, Nickells R. 2020. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 57(2), 1070–1084.","chicago":"Donahue, RJ, Margaret E Maes, JA Grosser, and RW Nickells. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology. Springer Nature, 2020. https://doi.org/10.1007/s12035-019-01783-7."},"date_updated":"2023-08-17T14:05:48Z","oa_version":"Submitted Version","article_type":"original","doi":"10.1007/s12035-019-01783-7"}]