[{"citation":{"ista":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 26(6), 2288–2302.","mla":"Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6, IEEE, 2020, pp. 2288–302, doi:10.1109/TVCG.2018.2883628.","apa":"Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2020). Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2018.2883628","short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 2288–2302.","chicago":"Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics. IEEE, 2020. https://doi.org/10.1109/TVCG.2018.2883628.","ama":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 2020;26(6):2288-2302. doi:10.1109/TVCG.2018.2883628","ieee":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids on dynamically warping grids,” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020."},"publication_identifier":{"issn":["10772626"],"eissn":["19410506"]},"_id":"5681","year":"2020","article_type":"original","volume":26,"day":"01","acknowledged_ssus":[{"_id":"ScienComp"}],"article_processing_charge":"No","oa":1,"month":"06","oa_version":"Submitted Version","issue":"6","ddc":["006"],"acknowledgement":"This work was partially supported by JSPS Grant-in-Aid forYoung Scientists (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176). This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria through resources providedby Scientific Computing. We would like to express my grati-tude to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.","author":[{"last_name":"Hikaru","full_name":"Hikaru, Ibayashi","first_name":"Ibayashi"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"},{"full_name":"Thuerey, Nils","first_name":"Nils","last_name":"Thuerey"},{"last_name":"Igarashi","first_name":"Takeo","full_name":"Igarashi, Takeo"},{"last_name":"Ando","first_name":"Ryoichi","full_name":"Ando, Ryoichi"}],"type":"journal_article","date_updated":"2023-09-18T09:30:01Z","status":"public","external_id":{"isi":["000532295600014"],"pmid":["30507534"]},"department":[{"_id":"ChWo"}],"quality_controlled":"1","intvolume":" 26","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"success":1,"content_type":"application/pdf","date_created":"2020-10-08T08:34:53Z","file_size":21910098,"file_id":"8626","relation":"main_file","file_name":"preprint.pdf","access_level":"open_access","checksum":"8d4c55443a0ee335bb5bb652de503042","creator":"wojtan","date_updated":"2020-10-08T08:34:53Z"}],"abstract":[{"text":"We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms.","lang":"eng"}],"pmid":1,"publication":"IEEE Transactions on Visualization and Computer Graphics","date_created":"2018-12-16T22:59:21Z","language":[{"iso":"eng"}],"date_published":"2020-06-01T00:00:00Z","scopus_import":"1","publication_status":"published","isi":1,"has_accepted_license":"1","publisher":"IEEE","file_date_updated":"2020-10-08T08:34:53Z","title":"Simulating liquids on dynamically warping grids","page":"2288-2302","doi":"10.1109/TVCG.2018.2883628"},{"title":"Correlated random matrices: Band rigidity and edge universality","arxiv":1,"page":"963-1001","doi":"10.1214/19-AOP1379","publisher":"Institute of Mathematical Statistics","isi":1,"scopus_import":"1","publication_status":"published","publication":"Annals of Probability","date_created":"2019-03-28T09:20:08Z","language":[{"iso":"eng"}],"date_published":"2020-03-01T00:00:00Z","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."}],"intvolume":" 48","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","external_id":{"isi":["000528269100013"],"arxiv":["1804.07744"]},"department":[{"_id":"LaEr"}],"related_material":{"record":[{"id":"149","relation":"dissertation_contains","status":"public"},{"id":"6179","relation":"dissertation_contains","status":"public"}]},"type":"journal_article","status":"public","date_updated":"2024-02-22T14:34:33Z","issue":"2","author":[{"full_name":"Alt, Johannes","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt"},{"full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"orcid":"0000-0002-4821-3297","first_name":"Torben H","full_name":"Krüger, Torben H","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2904-1856","first_name":"Dominik J","full_name":"Schröder, Dominik J","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint","oa":1,"month":"03","ec_funded":1,"day":"01","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07744"}],"volume":48,"project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"_id":"6184","year":"2020","article_type":"original","publication_identifier":{"issn":["0091-1798"]},"citation":{"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.","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.","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.","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","short":"J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001.","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.","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"}},{"article_processing_charge":"Yes (via OA deal)","day":"01","ec_funded":1,"project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"volume":378,"article_type":"original","year":"2020","_id":"6185","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"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","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.","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.","short":"L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics 378 (2020) 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.","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."},"department":[{"_id":"LaEr"}],"related_material":{"record":[{"id":"6179","relation":"dissertation_contains","status":"public"}]},"external_id":{"arxiv":["1809.03971"],"isi":["000529483000001"]},"status":"public","date_updated":"2023-09-07T12:54:12Z","type":"journal_article","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.","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","first_name":"Torben H","full_name":"Krüger, Torben H"},{"orcid":"0000-0002-2904-1856","first_name":"Dominik J","full_name":"Schröder, Dominik J","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"ddc":["530","510"],"oa_version":"Published Version","month":"09","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"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)."}],"file":[{"date_created":"2020-11-18T11:14:37Z","content_type":"application/pdf","success":1,"checksum":"c3a683e2afdcea27afa6880b01e53dc2","access_level":"open_access","file_name":"2020_CommMathPhysics_Erdoes.pdf","relation":"main_file","file_size":2904574,"file_id":"8771","date_updated":"2020-11-18T11:14:37Z","creator":"dernst"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 378","quality_controlled":"1","arxiv":1,"page":"1203-1278","doi":"10.1007/s00220-019-03657-4","title":"Cusp universality for random matrices I: Local law and the complex Hermitian case","file_date_updated":"2020-11-18T11:14:37Z","publisher":"Springer Nature","has_accepted_license":"1","isi":1,"publication_status":"published","scopus_import":"1","date_published":"2020-09-01T00:00:00Z","date_created":"2019-03-28T10:21:15Z","language":[{"iso":"eng"}],"publication":"Communications in Mathematical Physics"},{"oa_version":"Published Version","oa":1,"month":"01","issue":"2","author":[{"full_name":"Carlen, Eric A.","first_name":"Eric A.","last_name":"Carlen"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","first_name":"Jan"}],"ddc":["500"],"type":"journal_article","status":"public","date_updated":"2023-08-17T13:49:40Z","external_id":{"isi":["000498933300001"],"arxiv":["1811.04572"]},"department":[{"_id":"JaMa"}],"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s10955-020-02671-4"}]},"publication_identifier":{"eissn":["15729613"],"issn":["00224715"]},"citation":{"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","short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.","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.","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","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."},"year":"2020","_id":"6358","article_type":"original","volume":178,"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"call_identifier":"FWF","grant_number":" F06504","_id":"260482E2-B435-11E9-9278-68D0E5697425","name":"Taming Complexity in Partial Di erential Systems"}],"day":"01","ec_funded":1,"article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"date_created":"2019-04-30T07:34:18Z","publication":"Journal of Statistical Physics","date_published":"2020-01-01T00:00:00Z","isi":1,"publication_status":"published","scopus_import":"1","has_accepted_license":"1","publisher":"Springer Nature","title":"Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems","file_date_updated":"2020-07-14T12:47:28Z","page":"319-378","arxiv":1,"doi":"10.1007/s10955-019-02434-w","quality_controlled":"1","intvolume":" 178","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","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"}],"file":[{"checksum":"7b04befbdc0d4982c0ee945d25d19872","access_level":"open_access","file_name":"2019_JourStatistPhysics_Carlen.pdf","file_size":905538,"relation":"main_file","file_id":"7209","date_updated":"2020-07-14T12:47:28Z","creator":"dernst","date_created":"2019-12-23T12:03:09Z","content_type":"application/pdf"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"_id":"6359","year":"2020","article_type":"original","publication_identifier":{"eissn":["1083-6489"]},"article_number":"82","citation":{"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.","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020).","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.","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","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."},"day":"16","article_processing_charge":"No","volume":25,"author":[{"first_name":"Konstantinos","full_name":"Dareiotis, Konstantinos","last_name":"Dareiotis"},{"last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","full_name":"Gerencser, Mate"}],"ddc":["510"],"oa_version":"Published Version","oa":1,"month":"07","external_id":{"isi":["000550150700001"],"arxiv":["1812.04583"]},"department":[{"_id":"JaMa"}],"type":"journal_article","status":"public","date_updated":"2023-10-16T09:22:50Z","intvolume":" 25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","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."}],"file":[{"success":1,"content_type":"application/pdf","date_created":"2020-09-21T13:15:02Z","creator":"dernst","date_updated":"2020-09-21T13:15:02Z","relation":"main_file","file_id":"8549","file_size":273042,"file_name":"2020_EJournProbab_Dareiotis.pdf","access_level":"open_access","checksum":"8e7c42e72596f6889d786e8e8b89994f"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"publication_status":"published","scopus_import":"1","has_accepted_license":"1","publication":"Electronic Journal of Probability","date_created":"2019-04-30T07:40:17Z","language":[{"iso":"eng"}],"date_published":"2020-07-16T00:00:00Z","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","file_date_updated":"2020-09-21T13:15:02Z","doi":"10.1214/20-EJP479","arxiv":1,"publisher":"Institute of Mathematical Statistics"},{"abstract":[{"lang":"eng","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."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 9","quality_controlled":"1","arxiv":1,"doi":"10.1142/S2010326320500069","title":"Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices","publisher":"World Scientific Publishing","scopus_import":"1","publication_status":"published","isi":1,"date_published":"2020-07-01T00:00:00Z","date_created":"2019-05-26T21:59:14Z","language":[{"iso":"eng"}],"publication":"Random Matrices: Theory and Application","main_file_link":[{"url":"https://arxiv.org/abs/1806.08751","open_access":"1"}],"article_processing_charge":"No","ec_funded":1,"day":"01","volume":9,"project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"article_type":"original","year":"2020","_id":"6488","citation":{"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.","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.","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.","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","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.","short":"G. Cipolloni, L. Erdös, Random Matrices: Theory and Application 9 (2020).","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"},"article_number":"2050006","publication_identifier":{"eissn":["20103271"],"issn":["20103263"]},"department":[{"_id":"LaEr"}],"external_id":{"arxiv":["1806.08751"],"isi":["000547464400001"]},"date_updated":"2023-08-28T08:38:48Z","status":"public","type":"journal_article","author":[{"last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","first_name":"Giorgio","full_name":"Cipolloni, Giorgio"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603"}],"issue":"3","oa":1,"month":"07","oa_version":"Preprint"},{"quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 20","abstract":[{"lang":"eng","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 𝐴⊆𝑋."}],"date_published":"2020-04-01T00:00:00Z","publication":"Foundations of Computational Mathematics","date_created":"2019-06-16T21:59:14Z","language":[{"iso":"eng"}],"isi":1,"publication_status":"published","scopus_import":"1","publisher":"Springer Nature","doi":"10.1007/s10208-019-09419-x","page":"311-330","arxiv":1,"title":"Are two given maps homotopic? An algorithmic viewpoint","publication_identifier":{"issn":["16153375"],"eissn":["16153383"]},"citation":{"ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","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.","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","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.","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.","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","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."},"article_type":"original","year":"2020","_id":"6563","volume":20,"project":[{"grant_number":"P31312","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory","call_identifier":"FWF"}],"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1312.2337"}],"day":"01","oa_version":"Preprint","month":"04","oa":1,"author":[{"full_name":"Filakovský, Marek","first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","last_name":"Filakovský"},{"last_name":"Vokřínek","first_name":"Lukas","full_name":"Vokřínek, Lukas"}],"status":"public","date_updated":"2023-08-17T13:50:44Z","type":"journal_article","department":[{"_id":"UlWa"}],"external_id":{"arxiv":["1312.2337"],"isi":["000522437400004"]}},{"file":[{"date_updated":"2020-07-14T12:47:34Z","creator":"kschuh","checksum":"bb1a1eb3ebb2df380863d0db594673ba","access_level":"open_access","file_id":"6927","file_size":359654,"relation":"main_file","file_name":"ExtragradientMethodPaper.pdf","content_type":"application/pdf","date_created":"2019-10-01T13:14:10Z"}],"abstract":[{"lang":"eng","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."}],"quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 84","publisher":"Springer Nature","page":"365-388","doi":"10.1007/s11075-019-00758-y","title":"An efficient projection-type method for monotone variational inequalities in Hilbert spaces","file_date_updated":"2020-07-14T12:47:34Z","date_published":"2020-05-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2019-06-27T20:09:33Z","publication":"Numerical Algorithms","has_accepted_license":"1","scopus_import":"1","publication_status":"published","isi":1,"volume":84,"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"article_processing_charge":"No","day":"01","ec_funded":1,"citation":{"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.","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.","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","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.","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.","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"},"publication_identifier":{"eissn":["1572-9265"],"issn":["1017-1398"]},"article_type":"original","_id":"6593","year":"2020","date_updated":"2023-08-17T13:51:18Z","status":"public","type":"journal_article","department":[{"_id":"VlKo"}],"external_id":{"isi":["000528979000015"]},"oa":1,"month":"05","oa_version":"Submitted Version","ddc":["000"],"author":[{"first_name":"Yekini","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","last_name":"Shehu","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Li","first_name":"Xiao-Huan","full_name":"Li, Xiao-Huan"},{"last_name":"Dong","full_name":"Dong, Qiao-Li","first_name":"Qiao-Li"}],"acknowledgement":"The research of this author is supported by the ERC grant at the IST."},{"article_type":"original","year":"2020","_id":"6649","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"citation":{"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.","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.","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","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.","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","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications in Mathematical Physics 374 (2020) 2097–2150.","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."},"article_processing_charge":"No","ec_funded":1,"day":"01","project":[{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"},{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"volume":374,"author":[{"orcid":"0000-0002-1071-6091","first_name":"Niels P","full_name":"Benedikter, Niels P","last_name":"Benedikter","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Phan Thành","full_name":"Nam, Phan Thành","last_name":"Nam"},{"last_name":"Porta","full_name":"Porta, Marcello","first_name":"Marcello"},{"last_name":"Schlein","full_name":"Schlein, Benjamin","first_name":"Benjamin"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"ddc":["530"],"oa_version":"Published Version","oa":1,"month":"03","department":[{"_id":"RoSe"}],"external_id":{"isi":["000527910700019"],"arxiv":["1809.01902"]},"status":"public","date_updated":"2023-08-17T13:51:50Z","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 374","quality_controlled":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"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"}],"file":[{"file_size":853289,"file_id":"6668","relation":"main_file","file_name":"2019_CommMathPhysics_Benedikter.pdf","access_level":"open_access","checksum":"f9dd6dd615a698f1d3636c4a092fed23","creator":"dernst","date_updated":"2020-07-14T12:47:35Z","content_type":"application/pdf","date_created":"2019-07-24T07:19:10Z"}],"has_accepted_license":"1","isi":1,"publication_status":"published","scopus_import":"1","date_published":"2020-03-01T00:00:00Z","date_created":"2019-07-18T13:30:04Z","publication":"Communications in Mathematical Physics","language":[{"iso":"eng"}],"arxiv":1,"doi":"10.1007/s00220-019-03505-5","page":"2097–2150","file_date_updated":"2020-07-14T12:47:35Z","title":"Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime","publisher":"Springer Nature"},{"intvolume":" 48","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","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"}],"publication_status":"published","isi":1,"language":[{"iso":"eng"}],"date_created":"2019-07-31T09:39:42Z","publication":"Annals of Statistics","date_published":"2020-12-11T00:00:00Z","title":"Analysis of a two-layer neural network via displacement convexity","doi":"10.1214/20-AOS1945","arxiv":1,"page":"3619-3642","publisher":"Institute of Mathematical Statistics","year":"2020","_id":"6748","article_type":"original","citation":{"short":"A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 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.","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","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.","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.","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."},"publication_identifier":{"issn":["1932-6157"],"eissn":["1941-7330"]},"day":"11","main_file_link":[{"url":"https://arxiv.org/abs/1901.01375","open_access":"1"}],"article_processing_charge":"No","volume":48,"issue":"6","author":[{"last_name":"Javanmard","full_name":"Javanmard, Adel","first_name":"Adel"},{"full_name":"Mondelli, Marco","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli"},{"first_name":"Andrea","full_name":"Montanari, Andrea","last_name":"Montanari"}],"oa":1,"month":"12","oa_version":"Preprint","external_id":{"isi":["000598369200021"],"arxiv":["1901.01375"]},"department":[{"_id":"MaMo"}],"type":"journal_article","date_updated":"2024-03-06T08:28:50Z","status":"public"},{"file":[{"access_level":"open_access","checksum":"e86635417f45eb2cd75778f91382f737","file_name":"2020_TheoreticalCS_Avni.pdf","relation":"main_file","file_id":"8639","file_size":1413001,"date_updated":"2020-10-09T06:31:22Z","creator":"dernst","date_created":"2020-10-09T06:31:22Z","content_type":"application/pdf","success":1}],"abstract":[{"lang":"eng","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."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 807","quality_controlled":"1","page":"42-55","doi":"10.1016/j.tcs.2019.06.031","title":"Dynamic resource allocation games","file_date_updated":"2020-10-09T06:31:22Z","publisher":"Elsevier","has_accepted_license":"1","scopus_import":"1","publication_status":"published","isi":1,"date_published":"2020-02-06T00:00:00Z","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","date_created":"2019-08-04T21:59:20Z","article_processing_charge":"No","day":"06","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"volume":807,"article_type":"original","year":"2020","_id":"6761","citation":{"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.","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","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.","short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","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.","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"},"publication_identifier":{"issn":["03043975"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1341"}]},"department":[{"_id":"ToHe"}],"external_id":{"isi":["000512219400004"]},"date_updated":"2023-08-17T13:52:49Z","status":"public","type":"journal_article","ddc":["000"],"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","first_name":"Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"month":"02","oa":1,"oa_version":"Submitted Version"},{"oa_version":"Published Version","month":"04","oa":1,"issue":"4","author":[{"last_name":"Stella","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","first_name":"Federico","orcid":"0000-0001-9439-3148","full_name":"Stella, Federico"},{"full_name":"Urdapilleta, Eugenio","first_name":"Eugenio","last_name":"Urdapilleta"},{"last_name":"Luo","first_name":"Yifan","full_name":"Luo, Yifan"},{"last_name":"Treves","first_name":"Alessandro","full_name":"Treves, Alessandro"}],"ddc":["570"],"type":"journal_article","status":"public","date_updated":"2023-08-17T13:53:14Z","external_id":{"isi":["000477299600001"],"pmid":["31339190"]},"department":[{"_id":"JoCs"}],"publication_identifier":{"eissn":["10981063"],"issn":["10509631"]},"citation":{"ista":"Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313.","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.","short":"F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 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.","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","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."},"_id":"6796","year":"2020","article_type":"original","volume":30,"day":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Hippocampus","date_created":"2019-08-11T21:59:24Z","date_published":"2020-04-01T00:00:00Z","isi":1,"publication_status":"published","scopus_import":"1","has_accepted_license":"1","publisher":"Wiley","file_date_updated":"2020-07-14T12:47:40Z","title":"Partial coherence and frustration in self-organizing spherical grids","page":"302-313","doi":"10.1002/hipo.23144","quality_controlled":"1","intvolume":" 30","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","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."}],"file":[{"content_type":"application/pdf","date_created":"2019-08-12T07:53:33Z","creator":"dernst","date_updated":"2020-07-14T12:47:40Z","relation":"main_file","file_id":"6800","file_size":2370658,"file_name":"2019_Hippocampus_Stella.pdf","access_level":"open_access","checksum":"7b54d22bfbfc0d1188a9ea24d985bfb2"}],"pmid":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"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."}],"pmid":1,"quality_controlled":"1","intvolume":" 174","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Elsevier","title":"Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens","doi":"10.1016/j.ymeth.2019.07.019","page":"27-41","publication":"Methods","date_created":"2019-08-12T16:36:32Z","language":[{"iso":"eng"}],"date_published":"2020-03-01T00:00:00Z","publication_status":"published","scopus_import":"1","isi":1,"volume":174,"project":[{"name":"Optical control of synaptic function via adhesion molecules","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","grant_number":"I03600","call_identifier":"FWF"},{"grant_number":"LT00057","_id":"2668BFA0-B435-11E9-9278-68D0E5697425","name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration"}],"day":"01","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/"}],"article_processing_charge":"No","citation":{"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.","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","short":"W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.","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.","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","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.","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."},"publication_identifier":{"issn":["1046-2023"]},"year":"2020","_id":"6808","article_type":"original","type":"journal_article","date_updated":"2023-08-17T13:59:57Z","status":"public","external_id":{"pmid":["31344404"],"isi":["000525860400005"]},"department":[{"_id":"JoDa"}],"oa":1,"month":"03","oa_version":"Submitted Version","issue":"3","author":[{"first_name":"Wiebke","full_name":"Jahr, Wiebke","last_name":"Jahr","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Velicky","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","orcid":"0000-0002-2340-7431","full_name":"Velicky, Philipp"},{"orcid":"0000-0001-8559-3973","first_name":"Johann G","full_name":"Danzl, Johann G","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"}]},{"day":"01","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1812.03086","open_access":"1"}],"article_processing_charge":"No","project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"volume":376,"_id":"6906","year":"2020","article_type":"original","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"citation":{"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.","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.","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.","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","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","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.","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395."},"external_id":{"arxiv":["1812.03086"],"isi":["000536053300012"]},"department":[{"_id":"RoSe"}],"type":"journal_article","status":"public","date_updated":"2024-02-22T13:33:02Z","author":[{"full_name":"Boccato, Chiara","first_name":"Chiara","id":"342E7E22-F248-11E8-B48F-1D18A9856A87","last_name":"Boccato"},{"first_name":"Christian","full_name":"Brennecke, Christian","last_name":"Brennecke"},{"full_name":"Cenatiempo, Serena","first_name":"Serena","last_name":"Cenatiempo"},{"last_name":"Schlein","first_name":"Benjamin","full_name":"Schlein, Benjamin"}],"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","month":"06","oa":1,"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."}],"intvolume":" 376","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","page":"1311-1395","doi":"10.1007/s00220-019-03555-9","arxiv":1,"publisher":"Springer","isi":1,"publication_status":"published","scopus_import":"1","language":[{"iso":"eng"}],"publication":"Communications in Mathematical Physics","date_created":"2019-09-24T17:30:59Z","date_published":"2020-06-01T00:00:00Z"},{"publication_status":"submitted","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.","author":[{"last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","first_name":"Julian L","full_name":"Fischer, Julian L"},{"full_name":"Hensel, Sebastian","first_name":"Sebastian","orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel"},{"last_name":"Laux","full_name":"Laux, Tim","first_name":"Tim"},{"first_name":"Thilo","full_name":"Simon, Thilo","last_name":"Simon"}],"oa_version":"Preprint","oa":1,"month":"03","date_created":"2021-09-13T12:17:11Z","publication":"arXiv","language":[{"iso":"eng"}],"date_published":"2020-03-11T00:00:00Z","title":"The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions","external_id":{"arxiv":["2003.05478"]},"department":[{"_id":"JuFi"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"10007","status":"public"}]},"arxiv":1,"type":"preprint","status":"public","date_updated":"2023-09-07T13:30:45Z","year":"2020","_id":"10012","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_number":"2003.05478","citation":{"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.","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.","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.","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. .","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.","short":"J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).","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."},"day":"11","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."}],"ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2003.05478"}],"article_processing_charge":"No","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"}]},{"project":[{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"day":"25","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."}],"ec_funded":1,"article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/2008.10962","open_access":"1"}],"article_number":"2008.10962","citation":{"ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” arXiv. .","ama":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv.","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.","short":"D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).","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.","mla":"Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, 2008.10962.","ista":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962."},"year":"2020","_id":"10022","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"preprint","status":"public","date_updated":"2023-09-07T13:31:05Z","title":"Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","external_id":{"arxiv":["2008.10962"]},"department":[{"_id":"JaMa"}],"page":"33","related_material":{"record":[{"status":"public","id":"11739","relation":"later_version"},{"status":"public","relation":"dissertation_contains","id":"10030"}]},"arxiv":1,"oa_version":"Preprint","oa":1,"month":"08","date_created":"2021-09-17T10:57:27Z","publication":"arXiv","language":[{"iso":"eng"}],"date_published":"2020-08-25T00:00:00Z","publication_status":"submitted","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.","author":[{"last_name":"Forkert","id":"35C79D68-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik L","full_name":"Forkert, Dominik L"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Maas, Jan"},{"id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","full_name":"Portinale, Lorenzo","first_name":"Lorenzo"}]},{"author":[{"full_name":"Lambert, Nicholas J.","first_name":"Nicholas J.","last_name":"Lambert"},{"last_name":"Mobassem","first_name":"Sonia","full_name":"Mobassem, Sonia"},{"last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R"},{"full_name":"Schwefel, Harald G.L.","first_name":"Harald G.L.","last_name":"Schwefel"}],"scopus_import":"1","publication_status":"published","date_published":"2020-01-01T00:00:00Z","oa_version":"None","language":[{"iso":"eng"}],"publication":"OSA Quantum 2.0 Conference","date_created":"2021-11-21T23:01:31Z","month":"01","department":[{"_id":"JoFi"}],"doi":"10.1364/QUANTUM.2020.QTu8A.1","title":"New designs and noise channels in electro-optic microwave to optical up-conversion","status":"public","date_updated":"2023-10-18T08:32:34Z","publisher":"Optica Publishing Group","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","_id":"10328","publication_identifier":{"isbn":["9-781-5575-2820-9"]},"quality_controlled":"1","article_number":"QTu8A.1","citation":{"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.","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.","short":"N.J. Lambert, S. Mobassem, A.R. Rueda Sanchez, H.G.L. Schwefel, in:, OSA Quantum 2.0 Conference, Optica Publishing Group, 2020.","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","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.","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"},"article_processing_charge":"No","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."}],"day":"01","conference":{"name":"OSA: Optical Society of America","location":"Washington, DC, United States","end_date":"2020-09-17","start_date":"2020-09-14"},"alternative_title":["OSA Technical Digest"]},{"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"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 (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.","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.","ama":"Kokoris Kogias E, Malkhi D, Spiegelman A. 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. Association for Computing Machinery; 2020:1751–1767. doi: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: 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."},"_id":"10556","year":"2020","conference":{"end_date":"2020-11-13","location":"Virtual, United States","start_date":"2020-11-09","name":"CCS: Computer and Communications Security"},"day":"30","article_processing_charge":"No","main_file_link":[{"url":"https://eprint.iacr.org/2019/1015","open_access":"1"}],"oa_version":"Preprint","oa":1,"month":"10","acknowledgement":"We would like to thank Ittai Abraham for the discussions and guidance during the initial conception of the project, especially for HAVSS. Furthermore, we would like to thank the anonymous reviewers for pointing out the relevance of this work to MPC protocols.","author":[{"last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"last_name":"Malkhi","full_name":"Malkhi, Dahlia","first_name":"Dahlia"},{"last_name":"Spiegelman","first_name":"Alexander","full_name":"Spiegelman, Alexander"}],"type":"conference","status":"public","date_updated":"2024-02-22T13:10:45Z","external_id":{"isi":["000768470400104"]},"department":[{"_id":"ElKo"}]},{"publisher":"ICLR","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","file_date_updated":"2022-01-26T07:35:17Z","title":"Learning representations for binary-classification without backpropagation","date_created":"2022-01-25T15:50:00Z","language":[{"iso":"eng"}],"publication":"8th International Conference on Learning Representations","date_published":"2020-03-11T00:00:00Z","scopus_import":"1","publication_status":"published","has_accepted_license":"1","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."}],"file":[{"content_type":"application/pdf","date_created":"2022-01-26T07:35:17Z","success":1,"creator":"mlechner","date_updated":"2022-01-26T07:35:17Z","file_name":"iclr_2020.pdf","relation":"main_file","file_id":"10677","file_size":249431,"access_level":"open_access","checksum":"ea13d42dd4541ddb239b6a75821fd6c9"}],"tmp":{"short":"CC BY-NC-ND (3.0)","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)"},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","status":"public","date_updated":"2023-04-03T07:33:40Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"oa_version":"Published Version","oa":1,"month":"03","author":[{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","ddc":["000"],"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2020-04-26","location":"Virtual ; Addis Ababa, Ethiopia","end_date":"2020-05-01"},"day":"11","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Bke61krFvS"}],"citation":{"ama":"Lechner M. 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.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020.","short":"M. Lechner, 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.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations."},"_id":"10672","year":"2020"},{"date_published":"2020-01-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2022-01-25T15:50:34Z","publication":"Proceedings of the 37th International Conference on Machine Learning","has_accepted_license":"1","publication_status":"published","scopus_import":"1","page":"4082-4093","title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","file_date_updated":"2022-01-26T11:08:51Z","quality_controlled":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","tmp":{"short":"CC BY-NC-ND (3.0)","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)"},"series_title":"PMLR","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."}],"file":[{"success":1,"content_type":"application/pdf","date_created":"2022-01-26T11:08:51Z","creator":"cchlebak","date_updated":"2022-01-26T11:08:51Z","file_size":2329798,"file_id":"10691","relation":"main_file","file_name":"2020_PMLR_Hasani.pdf","access_level":"open_access","checksum":"c9a4a29161777fc1a89ef451c040e3b1"}],"oa_version":"Published Version","oa":1,"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","author":[{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"ddc":["000"],"status":"public","date_updated":"2022-01-26T11:14:27Z","type":"conference","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_identifier":{"issn":["2640-3498"]},"citation":{"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.","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.","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.","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.","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."},"_id":"10673","year":"2020","alternative_title":["PMLR"],"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"conference":{"location":"Virtual","end_date":"2020-07-18","start_date":"2020-07-12","name":"ML: Machine Learning"},"article_processing_charge":"No","main_file_link":[{"url":"http://proceedings.mlr.press/v119/hasani20a.html","open_access":"1"}]}]