[{"page":"101-146","external_id":{"arxiv":["1908.01653"]},"keyword":["General Medicine"],"date_published":"2020-11-16T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["2690-1005","2690-0998"]},"arxiv":1,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"16","oa_version":"Preprint","date_updated":"2024-03-04T10:33:15Z","type":"journal_article","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"doi":"10.2140/pmp.2020.1.101","ec_funded":1,"acknowledgement":"Partially supported by ERC Advanced Grant No. 338804. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 66538","volume":1,"issue":"1","publisher":"Mathematical Sciences Publishers","article_type":"original","intvolume":" 1","status":"public","month":"11","date_created":"2024-03-04T10:27:57Z","author":[{"first_name":"Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","last_name":"Schröder"}],"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1908.01653","open_access":"1"}],"citation":{"mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” Probability and Mathematical Physics, vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:10.2140/pmp.2020.1.101.","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. Mathematical Sciences Publishers. https://doi.org/10.2140/pmp.2020.1.101","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” Probability and Mathematical Physics. Mathematical Sciences Publishers, 2020. https://doi.org/10.2140/pmp.2020.1.101.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 1(1), 101–146.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal lower bound on the least singular value of the shifted Ginibre ensemble,” Probability and Mathematical Physics, vol. 1, no. 1. Mathematical Sciences Publishers, pp. 101–146, 2020.","ama":"Cipolloni G, Erdös L, Schröder DJ. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 2020;1(1):101-146. doi:10.2140/pmp.2020.1.101"},"year":"2020","_id":"15063","oa":1,"title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","publication":"Probability and Mathematical Physics","abstract":[{"text":"We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395).","lang":"eng"}],"publication_status":"published","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}]},{"oa_version":"Published Version","type":"journal_article","date_updated":"2024-03-04T10:54:04Z","day":"01","article_processing_charge":"Yes (via OA deal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","department":[{"_id":"HeEd"}],"has_accepted_license":"1","doi":"10.1007/s41468-020-00058-8","language":[{"iso":"eng"}],"file":[{"file_size":851190,"creator":"dernst","content_type":"application/pdf","date_created":"2024-03-04T10:52:42Z","relation":"main_file","access_level":"open_access","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","file_name":"2020_JourApplCompTopology_Bauer.pdf","date_updated":"2024-03-04T10:52:42Z","file_id":"15065","success":1}],"date_published":"2020-12-01T00:00:00Z","page":"455-480","scopus_import":"1","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020","citation":{"apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., & Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-020-00058-8","mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” Journal of Applied and Computational Topology, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:10.1007/s41468-020-00058-8.","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480.","chicago":"Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” Journal of Applied and Computational Topology. Springer Nature, 2020. https://doi.org/10.1007/s41468-020-00058-8.","ista":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480.","ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” Journal of Applied and Computational Topology, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020.","ama":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 2020;4(4):455-480. doi:10.1007/s41468-020-00058-8"},"quality_controlled":"1","author":[{"last_name":"Bauer","first_name":"U.","full_name":"Bauer, U."},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","first_name":"Grzegorz","last_name":"Jablonski"},{"full_name":"Mrozek, M.","last_name":"Mrozek","first_name":"M."}],"abstract":[{"lang":"eng","text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems."}],"publication_status":"published","title":"Čech-Delaunay gradient flow and homology inference for self-maps","publication":"Journal of Applied and Computational Topology","_id":"15064","ddc":["500"],"oa":1,"file_date_updated":"2024-03-04T10:52:42Z","publisher":"Springer Nature","article_type":"original","volume":4,"issue":"4","month":"12","date_created":"2024-03-04T10:47:49Z","status":"public","intvolume":" 4"},{"publication_status":"published","abstract":[{"lang":"eng","text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds."}],"title":"Brief announcement: Efficient load-balancing through distributed token dropping","publication":"34th International Symposium on Distributed Computing","related_material":{"record":[{"status":"public","relation":"later_version","id":"9678"}]},"oa":1,"ddc":["000"],"_id":"15074","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"year":"2020","citation":{"mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” 34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In 34th International Symposium on Distributed Computing (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.40","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: 34th International Symposium on Distributed Computing. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.DISC.2020.40","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In 34th International Symposium on Distributed Computing, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.40.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40."},"author":[{"last_name":"Brandt","first_name":"Sebastian","full_name":"Brandt, Sebastian"},{"first_name":"Barbara","last_name":"Keller","full_name":"Keller, Barbara"},{"orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","last_name":"Rybicki"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"last_name":"Uitto","first_name":"Jara","full_name":"Uitto, Jara"}],"quality_controlled":"1","date_created":"2024-03-05T07:09:12Z","conference":{"location":"Virtual","start_date":"2020-10-12","end_date":"2020-10-16","name":"DISC: Symposium on Distributed Computing"},"month":"10","article_number":"40","status":"public","intvolume":" 179","file_date_updated":"2024-03-05T07:08:27Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":179,"doi":"10.4230/LIPIcs.DISC.2020.40","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"DaAl"}],"date_updated":"2024-03-05T07:13:13Z","type":"conference","oa_version":"Published Version","day":"07","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"alternative_title":["LIPIcs"],"scopus_import":"1","date_published":"2020-10-07T00:00:00Z","file":[{"date_updated":"2024-03-05T07:08:27Z","file_id":"15075","success":1,"access_level":"open_access","checksum":"23e2d9321aef53092dc1e24a8ab82d72","file_name":"2020_LIPIcs_Brandt.pdf","date_created":"2024-03-05T07:08:27Z","relation":"main_file","file_size":303529,"creator":"dernst","content_type":"application/pdf"}],"external_id":{"arxiv":["2005.07761"]}},{"intvolume":" 168","article_number":"7","status":"public","conference":{"start_date":"2020-07-08","location":"Saarbrücken, Germany, Virtual","name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2020-07-11"},"month":"06","date_created":"2024-03-05T07:25:37Z","volume":168,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2024-03-05T07:25:15Z","_id":"15077","related_material":{"record":[{"relation":"later_version","status":"public","id":"8286"}]},"ddc":["000"],"oa":1,"publication":"47th International Colloquium on Automata, Languages, and Programming","title":"Dynamic averaging load balancing on cycles","abstract":[{"text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor.","lang":"eng"}],"publication_status":"published","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Nadiradze","first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5634-0731","full_name":"Nadiradze, Giorgi"},{"last_name":"Sabour","first_name":"Amirmojtaba","full_name":"Sabour, Amirmojtaba","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67"}],"quality_controlled":"1","citation":{"short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7.","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, Virtual, 2020, vol. 168.","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” 47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.","apa":"Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2020). Dynamic averaging load balancing on cycles. In 47th International Colloquium on Automata, Languages, and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.7"},"year":"2020","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"scopus_import":"1","alternative_title":["LIPIcs"],"arxiv":1,"file":[{"date_created":"2024-03-05T07:25:15Z","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":782987,"file_id":"15078","date_updated":"2024-03-05T07:25:15Z","success":1,"access_level":"open_access","checksum":"e5eb16199f4ccfd77a321977eb3f026f","file_name":"2020_LIPIcs_Alistarh.pdf"}],"external_id":{"arxiv":["2003.09297"]},"date_published":"2020-06-29T00:00:00Z","has_accepted_license":"1","department":[{"_id":"DaAl"}],"doi":"10.4230/LIPIcs.ICALP.2020.7","language":[{"iso":"eng"}],"ec_funded":1,"acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"29","oa_version":"Published Version","type":"conference","date_updated":"2024-03-05T07:35:53Z"},{"title":"Disjoint tree-compatible plane perfect matchings","publication":"36th European Workshop on Computational Geometry","department":[{"_id":"KrCh"},{"_id":"UlWa"}],"_id":"15082","language":[{"iso":"eng"}],"oa":1,"acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922.","abstract":[{"lang":"eng","text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n."}],"publication_status":"published","main_file_link":[{"url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf","open_access":"1"}],"citation":{"ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.","chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in 36th European Workshop on Computational Geometry, Würzburg, Germany, Virtual, 2020.","ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual."},"author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"full_name":"Obmann, Julia","last_name":"Obmann","first_name":"Julia"},{"last_name":"Patak","first_name":"Pavel","full_name":"Patak, Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83"},{"first_name":"Daniel","last_name":"Perz","full_name":"Perz, Daniel"},{"orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Published Version","type":"conference","date_updated":"2024-03-05T09:00:07Z","year":"2020","day":"01","conference":{"name":"EuroCG: European Workshop on Computational Geometry","end_date":"2020-03-18","start_date":"2020-03-16","location":"Würzburg, Germany, Virtual"},"month":"04","date_created":"2024-03-05T08:57:17Z","status":"public","article_number":"56","date_published":"2020-04-01T00:00:00Z"},{"oa":1,"_id":"177","publication":"Annals of Mathematics","title":"A geometric version of the circle method","publication_status":"published","abstract":[{"lang":"eng","text":"We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree."}],"author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sawin, Will","first_name":"Will","last_name":"Sawin"}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1711.10451","open_access":"1"}],"citation":{"apa":"Browning, T. D., & Sawin, W. (2020). A geometric version of the circle method. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2020.191.3.4","mla":"Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:10.4007/annals.2020.191.3.4.","ama":"Browning TD, Sawin W. A geometric version of the circle method. Annals of Mathematics. 2020;191(3):893-948. doi:10.4007/annals.2020.191.3.4","ieee":"T. D. Browning and W. Sawin, “A geometric version of the circle method,” Annals of Mathematics, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.","chicago":"Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics. Princeton University, 2020. https://doi.org/10.4007/annals.2020.191.3.4.","short":"T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.","ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948."},"year":"2020","publist_id":"7744","isi":1,"intvolume":" 191","status":"public","date_created":"2018-12-11T11:45:02Z","month":"05","volume":191,"issue":"3","publisher":"Princeton University","article_type":"original","language":[{"iso":"eng"}],"doi":"10.4007/annals.2020.191.3.4","department":[{"_id":"TiBr"}],"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","type":"journal_article","date_updated":"2023-08-17T07:12:37Z","oa_version":"Preprint","arxiv":1,"page":"893-948","date_published":"2020-05-01T00:00:00Z","external_id":{"isi":["000526986300004"],"arxiv":["1711.10451"]}},{"page":"3099-3165","external_id":{"arxiv":["1805.10715"],"isi":["000582676300002"]},"date_published":"2020-09-10T00:00:00Z","arxiv":1,"publication_identifier":{"issn":["0012-7094"]},"day":"10","oa_version":"Preprint","type":"journal_article","date_updated":"2023-10-17T12:51:10Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"TiBr"}],"language":[{"iso":"eng"}],"doi":"10.1215/00127094-2020-0031","article_type":"original","publisher":"Duke University Press","issue":"16","volume":169,"status":"public","month":"09","date_created":"2018-12-11T11:45:02Z","isi":1,"intvolume":" 169","year":"2020","quality_controlled":"1","author":[{"first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"},{"full_name":"Heath Brown, Roger","first_name":"Roger","last_name":"Heath Brown"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.10715"}],"citation":{"apa":"Browning, T. D., & Heath Brown, R. (2020). Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2020-0031","mla":"Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal, vol. 169, no. 16, Duke University Press, 2020, pp. 3099–165, doi:10.1215/00127094-2020-0031.","ieee":"T. D. Browning and R. Heath Brown, “Density of rational points on a quadric bundle in ℙ3×ℙ3,” Duke Mathematical Journal, vol. 169, no. 16. Duke University Press, pp. 3099–3165, 2020.","ama":"Browning TD, Heath Brown R. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 2020;169(16):3099-3165. doi:10.1215/00127094-2020-0031","ista":"Browning TD, Heath Brown R. 2020. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165.","chicago":"Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal. Duke University Press, 2020. https://doi.org/10.1215/00127094-2020-0031.","short":"T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165."},"abstract":[{"text":"An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed.","lang":"eng"}],"publication_status":"published","_id":"179","oa":1,"publication":"Duke Mathematical Journal","title":"Density of rational points on a quadric bundle in ℙ3×ℙ3"},{"publisher":"Oxford University Press","article_type":"original","issue":"Supplement_2","volume":36,"status":"public","date_created":"2023-08-21T12:28:20Z","month":"12","intvolume":" 36","year":"2020","author":[{"last_name":"Stark","first_name":"Stefan G","full_name":"Stark, Stefan G"},{"last_name":"Ficek","first_name":"Joanna","full_name":"Ficek, Joanna"},{"first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683"},{"full_name":"Bonilla, Ximena","last_name":"Bonilla","first_name":"Ximena"},{"first_name":"Stéphane","last_name":"Chevrier","full_name":"Chevrier, Stéphane"},{"full_name":"Singer, Franziska","last_name":"Singer","first_name":"Franziska"},{"full_name":"Aebersold, Rudolf","last_name":"Aebersold","first_name":"Rudolf"},{"first_name":"Faisal S","last_name":"Al-Quaddoomi","full_name":"Al-Quaddoomi, Faisal S"},{"full_name":"Albinus, Jonas","last_name":"Albinus","first_name":"Jonas"},{"full_name":"Alborelli, Ilaria","last_name":"Alborelli","first_name":"Ilaria"},{"last_name":"Andani","first_name":"Sonali","full_name":"Andani, Sonali"},{"full_name":"Attinger, Per-Olof","last_name":"Attinger","first_name":"Per-Olof"},{"last_name":"Bacac","first_name":"Marina","full_name":"Bacac, Marina"},{"last_name":"Baumhoer","first_name":"Daniel","full_name":"Baumhoer, Daniel"},{"full_name":"Beck-Schimmer, Beatrice","last_name":"Beck-Schimmer","first_name":"Beatrice"},{"last_name":"Beerenwinkel","first_name":"Niko","full_name":"Beerenwinkel, Niko"},{"full_name":"Beisel, Christian","first_name":"Christian","last_name":"Beisel"},{"last_name":"Bernasconi","first_name":"Lara","full_name":"Bernasconi, Lara"},{"first_name":"Anne","last_name":"Bertolini","full_name":"Bertolini, Anne"},{"full_name":"Bodenmiller, Bernd","last_name":"Bodenmiller","first_name":"Bernd"},{"last_name":"Bonilla","first_name":"Ximena","full_name":"Bonilla, Ximena"},{"first_name":"Ruben","last_name":"Casanova","full_name":"Casanova, Ruben"},{"full_name":"Chevrier, Stéphane","first_name":"Stéphane","last_name":"Chevrier"},{"first_name":"Natalia","last_name":"Chicherova","full_name":"Chicherova, Natalia"},{"first_name":"Maya","last_name":"D'Costa","full_name":"D'Costa, Maya"},{"first_name":"Esther","last_name":"Danenberg","full_name":"Danenberg, Esther"},{"full_name":"Davidson, Natalie","last_name":"Davidson","first_name":"Natalie"},{"first_name":"Monica-Andreea Dră","last_name":"gan","full_name":"gan, Monica-Andreea Dră"},{"full_name":"Dummer, Reinhard","last_name":"Dummer","first_name":"Reinhard"},{"full_name":"Engler, Stefanie","first_name":"Stefanie","last_name":"Engler"},{"first_name":"Martin","last_name":"Erkens","full_name":"Erkens, Martin"},{"full_name":"Eschbach, Katja","last_name":"Eschbach","first_name":"Katja"},{"full_name":"Esposito, Cinzia","first_name":"Cinzia","last_name":"Esposito"},{"full_name":"Fedier, André","first_name":"André","last_name":"Fedier"},{"first_name":"Pedro","last_name":"Ferreira","full_name":"Ferreira, Pedro"},{"full_name":"Ficek, Joanna","first_name":"Joanna","last_name":"Ficek"},{"last_name":"Frei","first_name":"Anja L","full_name":"Frei, Anja L"},{"last_name":"Frey","first_name":"Bruno","full_name":"Frey, Bruno"},{"first_name":"Sandra","last_name":"Goetze","full_name":"Goetze, Sandra"},{"full_name":"Grob, Linda","last_name":"Grob","first_name":"Linda"},{"first_name":"Gabriele","last_name":"Gut","full_name":"Gut, Gabriele"},{"last_name":"Günther","first_name":"Detlef","full_name":"Günther, Detlef"},{"first_name":"Martina","last_name":"Haberecker","full_name":"Haberecker, Martina"},{"full_name":"Haeuptle, Pirmin","first_name":"Pirmin","last_name":"Haeuptle"},{"first_name":"Viola","last_name":"Heinzelmann-Schwarz","full_name":"Heinzelmann-Schwarz, Viola"},{"last_name":"Herter","first_name":"Sylvia","full_name":"Herter, Sylvia"},{"full_name":"Holtackers, Rene","first_name":"Rene","last_name":"Holtackers"},{"first_name":"Tamara","last_name":"Huesser","full_name":"Huesser, Tamara"},{"full_name":"Irmisch, Anja","last_name":"Irmisch","first_name":"Anja"},{"first_name":"Francis","last_name":"Jacob","full_name":"Jacob, Francis"},{"full_name":"Jacobs, Andrea","last_name":"Jacobs","first_name":"Andrea"},{"last_name":"Jaeger","first_name":"Tim M","full_name":"Jaeger, Tim M"},{"full_name":"Jahn, Katharina","first_name":"Katharina","last_name":"Jahn"},{"full_name":"James, Alva R","last_name":"James","first_name":"Alva R"},{"full_name":"Jermann, Philip M","first_name":"Philip M","last_name":"Jermann"},{"full_name":"Kahles, André","last_name":"Kahles","first_name":"André"},{"full_name":"Kahraman, Abdullah","last_name":"Kahraman","first_name":"Abdullah"},{"first_name":"Viktor H","last_name":"Koelzer","full_name":"Koelzer, Viktor H"},{"full_name":"Kuebler, Werner","first_name":"Werner","last_name":"Kuebler"},{"last_name":"Kuipers","first_name":"Jack","full_name":"Kuipers, Jack"},{"full_name":"Kunze, Christian P","last_name":"Kunze","first_name":"Christian P"},{"full_name":"Kurzeder, Christian","first_name":"Christian","last_name":"Kurzeder"},{"last_name":"Lehmann","first_name":"Kjong-Van","full_name":"Lehmann, Kjong-Van"},{"full_name":"Levesque, Mitchell","first_name":"Mitchell","last_name":"Levesque"},{"first_name":"Sebastian","last_name":"Lugert","full_name":"Lugert, Sebastian"},{"full_name":"Maass, Gerd","last_name":"Maass","first_name":"Gerd"},{"last_name":"Manz","first_name":"Markus","full_name":"Manz, Markus"},{"full_name":"Markolin, Philipp","last_name":"Markolin","first_name":"Philipp"},{"last_name":"Mena","first_name":"Julien","full_name":"Mena, Julien"},{"last_name":"Menzel","first_name":"Ulrike","full_name":"Menzel, Ulrike"},{"first_name":"Julian M","last_name":"Metzler","full_name":"Metzler, Julian M"},{"full_name":"Miglino, Nicola","first_name":"Nicola","last_name":"Miglino"},{"first_name":"Emanuela S","last_name":"Milani","full_name":"Milani, Emanuela S"},{"full_name":"Moch, Holger","first_name":"Holger","last_name":"Moch"},{"first_name":"Simone","last_name":"Muenst","full_name":"Muenst, Simone"},{"full_name":"Murri, Riccardo","first_name":"Riccardo","last_name":"Murri"},{"full_name":"Ng, Charlotte KY","last_name":"Ng","first_name":"Charlotte KY"},{"full_name":"Nicolet, Stefan","last_name":"Nicolet","first_name":"Stefan"},{"first_name":"Marta","last_name":"Nowak","full_name":"Nowak, Marta"},{"full_name":"Pedrioli, Patrick GA","last_name":"Pedrioli","first_name":"Patrick GA"},{"full_name":"Pelkmans, Lucas","first_name":"Lucas","last_name":"Pelkmans"},{"full_name":"Piscuoglio, Salvatore","first_name":"Salvatore","last_name":"Piscuoglio"},{"last_name":"Prummer","first_name":"Michael","full_name":"Prummer, Michael"},{"full_name":"Ritter, Mathilde","first_name":"Mathilde","last_name":"Ritter"},{"full_name":"Rommel, Christian","last_name":"Rommel","first_name":"Christian"},{"full_name":"Rosano-González, María L","last_name":"Rosano-González","first_name":"María L"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"last_name":"Santacroce","first_name":"Natascha","full_name":"Santacroce, Natascha"},{"full_name":"Castillo, Jacobo Sarabia del","first_name":"Jacobo Sarabia del","last_name":"Castillo"},{"first_name":"Ramona","last_name":"Schlenker","full_name":"Schlenker, Ramona"},{"full_name":"Schwalie, Petra C","first_name":"Petra C","last_name":"Schwalie"},{"last_name":"Schwan","first_name":"Severin","full_name":"Schwan, Severin"},{"last_name":"Schär","first_name":"Tobias","full_name":"Schär, Tobias"},{"first_name":"Gabriela","last_name":"Senti","full_name":"Senti, Gabriela"},{"last_name":"Singer","first_name":"Franziska","full_name":"Singer, Franziska"},{"full_name":"Sivapatham, Sujana","last_name":"Sivapatham","first_name":"Sujana"},{"last_name":"Snijder","first_name":"Berend","full_name":"Snijder, Berend"},{"full_name":"Sobottka, Bettina","first_name":"Bettina","last_name":"Sobottka"},{"first_name":"Vipin T","last_name":"Sreedharan","full_name":"Sreedharan, Vipin T"},{"full_name":"Stark, Stefan","last_name":"Stark","first_name":"Stefan"},{"full_name":"Stekhoven, Daniel J","first_name":"Daniel J","last_name":"Stekhoven"},{"full_name":"Theocharides, Alexandre PA","last_name":"Theocharides","first_name":"Alexandre PA"},{"full_name":"Thomas, Tinu M","first_name":"Tinu M","last_name":"Thomas"},{"full_name":"Tolnay, Markus","last_name":"Tolnay","first_name":"Markus"},{"full_name":"Tosevski, Vinko","first_name":"Vinko","last_name":"Tosevski"},{"first_name":"Nora C","last_name":"Toussaint","full_name":"Toussaint, Nora C"},{"full_name":"Tuncel, Mustafa A","last_name":"Tuncel","first_name":"Mustafa A"},{"full_name":"Tusup, Marina","last_name":"Tusup","first_name":"Marina"},{"first_name":"Audrey Van","last_name":"Drogen","full_name":"Drogen, Audrey Van"},{"full_name":"Vetter, Marcus","first_name":"Marcus","last_name":"Vetter"},{"full_name":"Vlajnic, Tatjana","first_name":"Tatjana","last_name":"Vlajnic"},{"first_name":"Sandra","last_name":"Weber","full_name":"Weber, Sandra"},{"full_name":"Weber, Walter P","last_name":"Weber","first_name":"Walter P"},{"full_name":"Wegmann, Rebekka","last_name":"Wegmann","first_name":"Rebekka"},{"last_name":"Weller","first_name":"Michael","full_name":"Weller, Michael"},{"last_name":"Wendt","first_name":"Fabian","full_name":"Wendt, Fabian"},{"full_name":"Wey, Norbert","last_name":"Wey","first_name":"Norbert"},{"full_name":"Wicki, Andreas","first_name":"Andreas","last_name":"Wicki"},{"last_name":"Wollscheid","first_name":"Bernd","full_name":"Wollscheid, Bernd"},{"full_name":"Yu, Shuqing","last_name":"Yu","first_name":"Shuqing"},{"full_name":"Ziegler, Johanna","first_name":"Johanna","last_name":"Ziegler"},{"full_name":"Zimmermann, Marc","first_name":"Marc","last_name":"Zimmermann"},{"full_name":"Zoche, Martin","first_name":"Martin","last_name":"Zoche"},{"first_name":"Gregor","last_name":"Zuend","full_name":"Zuend, Gregor"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"full_name":"Lehmann, Kjong-Van","first_name":"Kjong-Van","last_name":"Lehmann"}],"extern":"1","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1093/bioinformatics/btaa843","open_access":"1"}],"citation":{"apa":"Stark, S. G., Ficek, J., Locatello, F., Bonilla, X., Chevrier, S., Singer, F., … Lehmann, K.-V. (2020). SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. Oxford University Press. https://doi.org/10.1093/bioinformatics/btaa843","mla":"Stark, Stefan G., et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics, vol. 36, no. Supplement_2, Oxford University Press, 2020, pp. i919–27, doi:10.1093/bioinformatics/btaa843.","ama":"Stark SG, Ficek J, Locatello F, et al. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 2020;36(Supplement_2):i919-i927. doi:10.1093/bioinformatics/btaa843","ieee":"S. G. Stark et al., “SCIM: Universal single-cell matching with unpaired feature sets,” Bioinformatics, vol. 36, no. Supplement_2. Oxford University Press, pp. i919–i927, 2020.","chicago":"Stark, Stefan G, Joanna Ficek, Francesco Locatello, Ximena Bonilla, Stéphane Chevrier, Franziska Singer, Rudolf Aebersold, et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics. Oxford University Press, 2020. https://doi.org/10.1093/bioinformatics/btaa843.","short":"S.G. Stark, J. Ficek, F. Locatello, X. Bonilla, S. Chevrier, F. Singer, R. Aebersold, F.S. Al-Quaddoomi, J. Albinus, I. Alborelli, S. Andani, P.-O. Attinger, M. Bacac, D. Baumhoer, B. Beck-Schimmer, N. Beerenwinkel, C. Beisel, L. Bernasconi, A. Bertolini, B. Bodenmiller, X. Bonilla, R. Casanova, S. Chevrier, N. Chicherova, M. D’Costa, E. Danenberg, N. Davidson, M.-A.D. gan, R. Dummer, S. Engler, M. Erkens, K. Eschbach, C. Esposito, A. Fedier, P. Ferreira, J. Ficek, A.L. Frei, B. Frey, S. Goetze, L. Grob, G. Gut, D. Günther, M. Haberecker, P. Haeuptle, V. Heinzelmann-Schwarz, S. Herter, R. Holtackers, T. Huesser, A. Irmisch, F. Jacob, A. Jacobs, T.M. Jaeger, K. Jahn, A.R. James, P.M. Jermann, A. Kahles, A. Kahraman, V.H. Koelzer, W. Kuebler, J. Kuipers, C.P. Kunze, C. Kurzeder, K.-V. Lehmann, M. Levesque, S. Lugert, G. Maass, M. Manz, P. Markolin, J. Mena, U. Menzel, J.M. Metzler, N. Miglino, E.S. Milani, H. Moch, S. Muenst, R. Murri, C.K. Ng, S. Nicolet, M. Nowak, P.G. Pedrioli, L. Pelkmans, S. Piscuoglio, M. Prummer, M. Ritter, C. Rommel, M.L. Rosano-González, G. Rätsch, N. Santacroce, J.S. del Castillo, R. Schlenker, P.C. Schwalie, S. Schwan, T. Schär, G. Senti, F. Singer, S. Sivapatham, B. Snijder, B. Sobottka, V.T. Sreedharan, S. Stark, D.J. Stekhoven, A.P. Theocharides, T.M. Thomas, M. Tolnay, V. Tosevski, N.C. Toussaint, M.A. Tuncel, M. Tusup, A.V. Drogen, M. Vetter, T. Vlajnic, S. Weber, W.P. Weber, R. Wegmann, M. Weller, F. Wendt, N. Wey, A. Wicki, B. Wollscheid, S. Yu, J. Ziegler, M. Zimmermann, M. Zoche, G. Zuend, G. Rätsch, K.-V. Lehmann, Bioinformatics 36 (2020) i919–i927.","ista":"Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 36(Supplement_2), i919–i927."},"publication_status":"published","abstract":[{"text":"Motivation: Recent technological advances have led to an increase in the production and availability of single-cell data. The ability to integrate a set of multi-technology measurements would allow the identification of biologically or clinically meaningful observations through the unification of the perspectives afforded by each technology. In most cases, however, profiling technologies consume the used cells and thus pairwise correspondences between datasets are lost. Due to the sheer size single-cell datasets can acquire, scalable algorithms that are able to universally match single-cell measurements carried out in one cell to its corresponding sibling in another technology are needed.\r\nResults: We propose Single-Cell data Integration via Matching (SCIM), a scalable approach to recover such correspondences in two or more technologies. SCIM assumes that cells share a common (low-dimensional) underlying structure and that the underlying cell distribution is approximately constant across technologies. It constructs a technology-invariant latent space using an autoencoder framework with an adversarial objective. Multi-modal datasets are integrated by pairing cells across technologies using a bipartite matching scheme that operates on the low-dimensional latent representations. We evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell matches derived by SCIM reflect the same pseudotime on the simulated dataset. Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample and a human bone marrow sample, where we pair cells from a scRNA dataset to their sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy for each one of the samples, respectively.","lang":"eng"}],"related_material":{"link":[{"url":"https://github.com/ratschlab/scim","relation":"software"}]},"oa":1,"_id":"14125","publication":"Bioinformatics","title":"SCIM: Universal single-cell matching with unpaired feature sets","pmid":1,"page":"i919-i927","date_published":"2020-12-01T00:00:00Z","external_id":{"pmid":["33381818"]},"keyword":["Computational Mathematics","Computational Theory and Mathematics","Computer Science Applications","Molecular Biology","Biochemistry","Statistics and Probability"],"publication_identifier":{"eissn":["1367-4811"]},"scopus_import":"1","day":"01","date_updated":"2023-09-11T10:21:00Z","type":"journal_article","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1093/bioinformatics/btaa843","department":[{"_id":"FrLo"}]},{"date_published":"2020-07-28T00:00:00Z","external_id":{"arxiv":["2007.14184"]},"page":"13681-13684","publication_identifier":{"eissn":["2374-3468"],"isbn":["9781577358350"]},"scopus_import":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"conference","date_updated":"2023-09-12T07:44:48Z","oa_version":"Preprint","day":"28","language":[{"iso":"eng"}],"doi":"10.1609/aaai.v34i09.7120","department":[{"_id":"FrLo"}],"volume":34,"issue":"9","publisher":"Association for the Advancement of Artificial Intelligence","intvolume":" 34","date_created":"2023-08-22T14:07:26Z","conference":{"end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence","start_date":"2020-02-07","location":"New York, NY, United States"},"month":"07","status":"public","citation":{"mla":"Locatello, Francesco, et al. “A Commentary on the Unsupervised Learning of Disentangled Representations.” The 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 9, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–84, doi:10.1609/aaai.v34i09.7120.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A commentary on the unsupervised learning of disentangled representations. In The 34th AAAI Conference on Artificial Intelligence (Vol. 34, pp. 13681–13684). New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i09.7120","ama":"Locatello F, Bauer S, Lucic M, et al. A commentary on the unsupervised learning of disentangled representations. In: The 34th AAAI Conference on Artificial Intelligence. Vol 34. Association for the Advancement of Artificial Intelligence; 2020:13681-13684. doi:10.1609/aaai.v34i09.7120","ieee":"F. Locatello et al., “A commentary on the unsupervised learning of disentangled representations,” in The 34th AAAI Conference on Artificial Intelligence, New York, NY, United States, 2020, vol. 34, no. 9, pp. 13681–13684.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A commentary on the unsupervised learning of disentangled representations. The 34th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 34, 13681–13684.","chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Commentary on the Unsupervised Learning of Disentangled Representations.” In The 34th AAAI Conference on Artificial Intelligence, 34:13681–84. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i09.7120.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, in:, The 34th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–13684."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.14184"}],"extern":"1","quality_controlled":"1","author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"},{"full_name":"Bauer, Stefan","last_name":"Bauer","first_name":"Stefan"},{"first_name":"Mario","last_name":"Lucic","full_name":"Lucic, Mario"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"first_name":"Sylvain","last_name":"Gelly","full_name":"Gelly, Sylvain"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"last_name":"Bachem","first_name":"Olivier","full_name":"Bachem, Olivier"}],"year":"2020","publication":"The 34th AAAI Conference on Artificial Intelligence","title":"A commentary on the unsupervised learning of disentangled representations","oa":1,"_id":"14186","publication_status":"published","abstract":[{"text":"The goal of the unsupervised learning of disentangled representations is to\r\nseparate the independent explanatory factors of variation in the data without\r\naccess to supervision. In this paper, we summarize the results of Locatello et\r\nal., 2019, and focus on their implications for practitioners. We discuss the\r\ntheoretical result showing that the unsupervised learning of disentangled\r\nrepresentations is fundamentally impossible without inductive biases and the\r\npractical challenges it entails. Finally, we comment on our experimental\r\nfindings, highlighting the limitations of state-of-the-art approaches and\r\ndirections for future research.","lang":"eng"}]},{"status":"public","conference":{"location":"Virtual","start_date":"2020-07-13","name":"International Conference on Machine Learning","end_date":"2020-07-18"},"month":"07","date_created":"2023-08-22T14:07:52Z","intvolume":" 119","volume":119,"abstract":[{"text":"We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient)\r\nalgorithm for constrained smooth finite-sum minimization with a generalized\r\nlinear prediction/structure. This class of problems includes empirical risk\r\nminimization with sparse, low-rank, or other structured constraints. The\r\nproposed method is simple to implement, does not require step-size tuning, and\r\nhas a constant per-iteration cost that is independent of the dataset size.\r\nFurthermore, as a byproduct of the method we obtain a stochastic estimator of\r\nthe Frank-Wolfe gap that can be used as a stopping criterion. Depending on the\r\nsetting, the proposed method matches or improves on the best computational\r\nguarantees for Stochastic Frank-Wolfe algorithms. Benchmarks on several\r\ndatasets highlight different regimes in which the proposed method exhibits a\r\nfaster empirical convergence than related methods. Finally, we provide an\r\nimplementation of all considered methods in an open-source package.","lang":"eng"}],"publication_status":"published","_id":"14187","oa":1,"title":"Stochastic Frank-Wolfe for constrained finite-sum minimization","publication":"Proceedings of the 37th International Conference on Machine Learning","year":"2020","quality_controlled":"1","author":[{"last_name":"Négiar","first_name":"Geoffrey","full_name":"Négiar, Geoffrey"},{"last_name":"Dresdner","first_name":"Gideon","full_name":"Dresdner, Gideon"},{"full_name":"Tsai, Alicia","first_name":"Alicia","last_name":"Tsai"},{"full_name":"Ghaoui, Laurent El","last_name":"Ghaoui","first_name":"Laurent El"},{"first_name":"Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Freund, Robert M.","last_name":"Freund","first_name":"Robert M."},{"last_name":"Pedregosa","first_name":"Fabian","full_name":"Pedregosa, Fabian"}],"extern":"1","citation":{"ieee":"G. Négiar et al., “Stochastic Frank-Wolfe for constrained finite-sum minimization,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 7253–7262.","ama":"Négiar G, Dresdner G, Tsai A, et al. Stochastic Frank-Wolfe for constrained finite-sum minimization. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:7253-7262.","short":"G. Négiar, G. Dresdner, A. Tsai, L.E. Ghaoui, F. Locatello, R.M. Freund, F. Pedregosa, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 7253–7262.","chicago":"Négiar, Geoffrey, Gideon Dresdner, Alicia Tsai, Laurent El Ghaoui, Francesco Locatello, Robert M. Freund, and Fabian Pedregosa. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” In Proceedings of the 37th International Conference on Machine Learning, 119:7253–62, 2020.","ista":"Négiar G, Dresdner G, Tsai A, Ghaoui LE, Locatello F, Freund RM, Pedregosa F. 2020. Stochastic Frank-Wolfe for constrained finite-sum minimization. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 7253–7262.","apa":"Négiar, G., Dresdner, G., Tsai, A., Ghaoui, L. E., Locatello, F., Freund, R. M., & Pedregosa, F. (2020). Stochastic Frank-Wolfe for constrained finite-sum minimization. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 7253–7262). Virtual.","mla":"Négiar, Geoffrey, et al. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 7253–62."},"main_file_link":[{"url":"https://arxiv.org/abs/2002.11860","open_access":"1"}],"arxiv":1,"alternative_title":["PMLR"],"page":"7253-7262","external_id":{"arxiv":["2002.11860"]},"date_published":"2020-07-27T00:00:00Z","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}],"day":"27","oa_version":"Preprint","type":"conference","date_updated":"2023-09-12T08:03:40Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"intvolume":" 119","status":"public","month":"07","conference":{"name":"International Conference on Machine Learning","end_date":"2020-07-18","start_date":"2020-07-13","location":"Virtual"},"date_created":"2023-08-22T14:08:14Z","volume":119,"_id":"14188","oa":1,"publication":"Proceedings of the 37th International Conference on Machine Learning","title":"Weakly-supervised disentanglement without compromises","abstract":[{"lang":"eng","text":"Intelligent agents should be able to learn useful representations by\r\nobserving changes in their environment. We model such observations as pairs of\r\nnon-i.i.d. images sharing at least one of the underlying factors of variation.\r\nFirst, we theoretically show that only knowing how many factors have changed,\r\nbut not which ones, is sufficient to learn disentangled representations.\r\nSecond, we provide practical algorithms that learn disentangled representations\r\nfrom pairs of images without requiring annotation of groups, individual\r\nfactors, or the number of factors that have changed. Third, we perform a\r\nlarge-scale empirical study and show that such pairs of observations are\r\nsufficient to reliably learn disentangled representations on several benchmark\r\ndata sets. Finally, we evaluate our learned representations and find that they\r\nare simultaneously useful on a diverse suite of tasks, including generalization\r\nunder covariate shifts, fairness, and abstract reasoning. Overall, our results\r\ndemonstrate that weak supervision enables learning of useful disentangled\r\nrepresentations in realistic scenarios."}],"publication_status":"published","quality_controlled":"1","author":[{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco"},{"last_name":"Poole","first_name":"Ben","full_name":"Poole, Ben"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"last_name":"Schölkopf","first_name":"Bernhard","full_name":"Schölkopf, Bernhard"},{"full_name":"Bachem, Olivier","first_name":"Olivier","last_name":"Bachem"},{"first_name":"Michael","last_name":"Tschannen","full_name":"Tschannen, Michael"}],"extern":"1","citation":{"apa":"Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., & Tschannen, M. (2020). Weakly-supervised disentanglement without compromises. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 6348–6359). Virtual.","mla":"Locatello, Francesco, et al. “Weakly-Supervised Disentanglement without Compromises.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 6348–6359.","ista":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. 2020. Weakly-supervised disentanglement without compromises. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 6348–6359.","chicago":"Locatello, Francesco, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf, Olivier Bachem, and Michael Tschannen. “Weakly-Supervised Disentanglement without Compromises.” In Proceedings of the 37th International Conference on Machine Learning, 119:6348–6359, 2020.","short":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, M. Tschannen, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 6348–6359.","ama":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. Weakly-supervised disentanglement without compromises. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:6348–6359.","ieee":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, and M. Tschannen, “Weakly-supervised disentanglement without compromises,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 6348–6359."},"main_file_link":[{"url":"https://arxiv.org/abs/2002.02886","open_access":"1"}],"year":"2020","scopus_import":"1","alternative_title":["PMLR"],"arxiv":1,"page":"6348–6359","external_id":{"arxiv":["2002.02886"]},"date_published":"2020-07-07T00:00:00Z","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"07","oa_version":"Preprint","date_updated":"2023-09-12T07:59:29Z","type":"conference"},{"external_id":{"arxiv":["2010.14766"]},"date_published":"2020-09-01T00:00:00Z","scopus_import":"1","arxiv":1,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Published Version","type":"journal_article","date_updated":"2023-09-12T09:23:56Z","department":[{"_id":"FrLo"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"volume":21,"article_type":"original","publisher":"MIT Press","intvolume":" 21","status":"public","article_number":"209","month":"09","date_created":"2023-08-22T14:10:34Z","quality_controlled":"1","extern":"1","author":[{"last_name":"Locatello","first_name":"Francesco","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Bauer, Stefan","first_name":"Stefan","last_name":"Bauer"},{"full_name":"Lucic, Mario","first_name":"Mario","last_name":"Lucic"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"full_name":"Gelly, Sylvain","first_name":"Sylvain","last_name":"Gelly"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"first_name":"Olivier","last_name":"Bachem","full_name":"Bachem, Olivier"}],"citation":{"ama":"Locatello F, Bauer S, Lucic M, et al. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 2020;21.","ieee":"F. Locatello et al., “A sober look at the unsupervised learning of disentangled representations and their evaluation,” Journal of Machine Learning Research, vol. 21. MIT Press, 2020.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, Journal of Machine Learning Research 21 (2020).","chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research. MIT Press, 2020.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 21, 209.","mla":"Locatello, Francesco, et al. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research, vol. 21, 209, MIT Press, 2020.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. MIT Press."},"main_file_link":[{"url":"https://jmlr.csail.mit.edu/papers/v21/19-976.html","open_access":"1"}],"year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"14195","oa":1,"ddc":["000"],"publication":"Journal of Machine Learning Research","title":"A sober look at the unsupervised learning of disentangled representations and their evaluation","abstract":[{"text":"The idea behind the unsupervised learning of disentangled representations is that real-world data is generated by a few explanatory factors of variation which can be recovered by unsupervised learning algorithms. In this paper, we provide a sober look at recent progress in the field and challenge some common assumptions. We first theoretically show that the unsupervised learning of disentangled representations is fundamentally impossible without inductive biases on both the models and the data. Then, we train over 14000\r\n models covering most prominent methods and evaluation metrics in a reproducible large-scale experimental study on eight data sets. We observe that while the different methods successfully enforce properties “encouraged” by the corresponding losses, well-disentangled models seemingly cannot be identified without supervision. Furthermore, different evaluation metrics do not always agree on what should be considered “disentangled” and exhibit systematic differences in the estimation. Finally, increased disentanglement does not seem to necessarily lead to a decreased sample complexity of learning for downstream tasks. Our results suggest that future work on disentanglement learning should be explicit about the role of inductive biases and (implicit) supervision, investigate concrete benefits of enforcing disentanglement of the learned representations, and consider a reproducible experimental setup covering several data sets.","lang":"eng"}],"publication_status":"published"},{"title":"Object-centric learning with slot attention","publication":"Advances in Neural Information Processing Systems","language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"FrLo"}],"_id":"14326","publication_status":"published","abstract":[{"text":"Learning object-centric representations of complex scenes is a promising step towards enabling efficient abstract reasoning from low-level perceptual features. Yet, most deep learning approaches learn distributed representations that do not capture the compositional properties of natural scenes. In this paper, we present the Slot Attention module, an architectural component that interfaces with perceptual representations such as the output of a convolutional neural network and produces a set of task-dependent abstract representations which we call slots. These slots are exchangeable and can bind to any object in the input by specializing through a competitive procedure over multiple rounds of attention. We empirically demonstrate that Slot Attention can extract object-centric representations that enable generalization to unseen compositions when trained on unsupervised object discovery and supervised property prediction tasks.\r\n\r\n","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2006.15055"}],"citation":{"mla":"Locatello, Francesco, et al. “Object-Centric Learning with Slot Attention.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11525–38.","apa":"Locatello, F., Weissenborn, D., Unterthiner, T., Mahendran, A., Heigold, G., Uszkoreit, J., … Kipf, T. (2020). Object-centric learning with slot attention. In Advances in Neural Information Processing Systems (Vol. 33, pp. 11525–11538). Virtual: Curran Associates.","short":"F. Locatello, D. Weissenborn, T. Unterthiner, A. Mahendran, G. Heigold, J. Uszkoreit, A. Dosovitskiy, T. Kipf, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 11525–11538.","chicago":"Locatello, Francesco, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. “Object-Centric Learning with Slot Attention.” In Advances in Neural Information Processing Systems, 33:11525–38. Curran Associates, 2020.","ista":"Locatello F, Weissenborn D, Unterthiner T, Mahendran A, Heigold G, Uszkoreit J, Dosovitskiy A, Kipf T. 2020. Object-centric learning with slot attention. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11525–11538.","ama":"Locatello F, Weissenborn D, Unterthiner T, et al. Object-centric learning with slot attention. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11525-11538.","ieee":"F. Locatello et al., “Object-centric learning with slot attention,” in Advances in Neural Information Processing Systems, Virtual, 2020, vol. 33, pp. 11525–11538."},"article_processing_charge":"No","author":[{"first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683"},{"last_name":"Weissenborn","first_name":"Dirk","full_name":"Weissenborn, Dirk"},{"full_name":"Unterthiner, Thomas","first_name":"Thomas","last_name":"Unterthiner"},{"full_name":"Mahendran, Aravindh","first_name":"Aravindh","last_name":"Mahendran"},{"last_name":"Heigold","first_name":"Georg","full_name":"Heigold, Georg"},{"full_name":"Uszkoreit, Jakob","first_name":"Jakob","last_name":"Uszkoreit"},{"first_name":"Alexey","last_name":"Dosovitskiy","full_name":"Dosovitskiy, Alexey"},{"last_name":"Kipf","first_name":"Thomas","full_name":"Kipf, Thomas"}],"extern":"1","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_updated":"2023-09-13T12:19:19Z","oa_version":"Preprint","year":"2020","intvolume":" 33","publication_identifier":{"isbn":["9781713829546"]},"date_created":"2023-09-13T12:03:46Z","arxiv":1,"conference":{"location":"Virtual","start_date":"2020-12-06","name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12"},"status":"public","date_published":"2020-01-01T00:00:00Z","external_id":{"arxiv":["2006.15055"]},"volume":33,"page":"11525-11538","publisher":"Curran Associates"},{"day":"01","contributor":[{"last_name":"Fäßler","contributor_type":"researcher","first_name":"Florian","orcid":"0000-0001-7149-769X","id":"404F5528-F248-11E8-B48F-1D18A9856A87"},{"id":"45FD126C-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Zens","first_name":"Bettina"},{"contributor_type":"researcher","last_name":"Hauschild","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Florian KM","contributor_type":"researcher","last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078"}],"year":"2020","date_updated":"2024-02-21T12:44:48Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png"},"type":"research_data","oa_version":"Published Version","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078","first_name":"Florian KM","last_name":"Schur"}],"citation":{"apa":"Schur, F. K. (2020). STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:14592","mla":"Schur, Florian KM. STL-Files for 3D-Printed Grid Holders Described in Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:14592.","ieee":"F. K. Schur, “STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy.” Institute of Science and Technology Austria, 2020.","ama":"Schur FK. STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. 2020. doi:10.15479/AT:ISTA:14592","ista":"Schur FK. 2020. STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14592.","chicago":"Schur, Florian KM. “STL-Files for 3D-Printed Grid Holders Described in Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:14592.","short":"F.K. Schur, (2020)."},"abstract":[{"text":"Cryo-electron microscopy (cryo-EM) of cellular specimens provides insights into biological processes and structures within a native context. However, a major challenge still lies in the efficient and reproducible preparation of adherent cells for subsequent cryo-EM analysis. This is due to the sensitivity of many cellular specimens to the varying seeding and culturing conditions required for EM experiments, the often limited amount of cellular material and also the fragility of EM grids and their substrate. Here, we present low-cost and reusable 3D printed grid holders, designed to improve specimen preparation when culturing challenging cellular samples directly on grids. The described grid holders increase cell culture reproducibility and throughput, and reduce the resources required for cell culturing. We show that grid holders can be integrated into various cryo-EM workflows, including micro-patterning approaches to control cell seeding on grids, and for generating samples for cryo-focused ion beam milling and cryo-electron tomography experiments. Their adaptable design allows for the generation of specialized grid holders customized to a large variety of applications.","lang":"eng"}],"project":[{"_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","grant_number":"P33367","name":"Structure and isoform diversity of the Arp2/3 complex"}],"ddc":["570"],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","related_material":{"record":[{"relation":"research_data","status":"public","id":"8586"}]},"oa":1,"doi":"10.15479/AT:ISTA:14592","_id":"14592","department":[{"_id":"FlSc"}],"has_accepted_license":"1","title":"STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy","publisher":"Institute of Science and Technology Austria","file_date_updated":"2023-12-01T10:39:59Z","date_published":"2020-12-01T00:00:00Z","file":[{"relation":"main_file","date_created":"2023-11-22T14:58:44Z","file_size":49297,"creator":"fschur","content_type":"application/zip","success":1,"date_updated":"2023-11-22T14:58:44Z","file_id":"14593","checksum":"0108616e2a59e51879ea51299a29b091","file_name":"3Dprint-files_download_v2.zip","access_level":"open_access"},{"content_type":"text/plain","creator":"cchlebak","file_size":641,"date_created":"2023-12-01T10:39:59Z","relation":"main_file","access_level":"open_access","file_name":"readme.txt","checksum":"4c66ddedee4d01c1c4a7978208350cfc","file_id":"14637","date_updated":"2023-12-01T10:39:59Z","success":1}],"status":"public","date_created":"2023-11-22T15:00:57Z","month":"12"},{"year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","first_name":"Johannes"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László","last_name":"Erdös"},{"full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","last_name":"Krüger"}],"quality_controlled":"1","citation":{"ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” Documenta Mathematica, vol. 25. EMS Press, pp. 1421–1539, 2020.","ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 2020;25:1421-1539. doi:10.4171/dm/780","short":"J. Alt, L. Erdös, T.H. Krüger, Documenta Mathematica 25 (2020) 1421–1539.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” Documenta Mathematica. EMS Press, 2020. https://doi.org/10.4171/dm/780.","ista":"Alt J, Erdös L, Krüger TH. 2020. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 25, 1421–1539.","apa":"Alt, J., Erdös, L., & Krüger, T. H. (2020). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. EMS Press. https://doi.org/10.4171/dm/780","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” Documenta Mathematica, vol. 25, EMS Press, 2020, pp. 1421–539, doi:10.4171/dm/780."},"abstract":[{"text":"We study the unique solution m of the Dyson equation \\( -m(z)^{-1} = z\\1 - a + S[m(z)] \\) on a von Neumann algebra A with the constraint Imm≥0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of A and S is a positivity-preserving linear operator on A. We show that m is the Stieltjes transform of a compactly supported A-valued measure on R. Under suitable assumptions, we establish that this measure has a uniformly 1/3-Hölder continuous density with respect to the Lebesgue measure, which is supported on finitely many intervals, called bands. In fact, the density is analytic inside the bands with a square-root growth at the edges and internal cubic root cusps whenever the gap between two bands vanishes. The shape of these singularities is universal and no other singularity may occur. We give a precise asymptotic description of m near the singular points. These asymptotics generalize the analysis at the regular edges given in the companion paper on the Tracy-Widom universality for the edge eigenvalue statistics for correlated random matrices [the first author et al., Ann. Probab. 48, No. 2, 963--1001 (2020; Zbl 1434.60017)] and they play a key role in the proof of the Pearcey universality at the cusp for Wigner-type matrices [G. Cipolloni et al., Pure Appl. Anal. 1, No. 4, 615--707 (2019; Zbl 07142203); the second author et al., Commun. Math. Phys. 378, No. 2, 1203--1278 (2020; Zbl 07236118)]. We also extend the finite dimensional band mass formula from [the first author et al., loc. cit.] to the von Neumann algebra setting by showing that the spectral mass of the bands is topologically rigid under deformations and we conclude that these masses are quantized in some important cases.","lang":"eng"}],"publication_status":"published","_id":"14694","related_material":{"record":[{"id":"6183","relation":"earlier_version","status":"public"}]},"ddc":["510"],"oa":1,"publication":"Documenta Mathematica","title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","article_type":"original","publisher":"EMS Press","file_date_updated":"2023-12-18T10:42:32Z","volume":25,"status":"public","month":"09","date_created":"2023-12-18T10:37:43Z","intvolume":" 25","day":"01","oa_version":"Published Version","type":"journal_article","date_updated":"2023-12-18T10:46:09Z","article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"has_accepted_license":"1","doi":"10.4171/dm/780","language":[{"iso":"eng"}],"page":"1421-1539","file":[{"date_created":"2023-12-18T10:42:32Z","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_size":1374708,"date_updated":"2023-12-18T10:42:32Z","file_id":"14695","success":1,"access_level":"open_access","checksum":"12aacc1d63b852ff9a51c1f6b218d4a6","file_name":"2020_DocumentaMathematica_Alt.pdf"}],"keyword":["General Mathematics"],"external_id":{"arxiv":["1804.07752"]},"date_published":"2020-09-01T00:00:00Z","arxiv":1,"publication_identifier":{"eissn":["1431-0643"],"issn":["1431-0635"]}},{"department":[{"_id":"ChWo"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1109/TVCG.2018.2883628","acknowledged_ssus":[{"_id":"ScienComp"}],"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.","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","oa_version":"Submitted Version","type":"journal_article","date_updated":"2023-09-18T09:30:01Z","scopus_import":"1","publication_identifier":{"eissn":["19410506"],"issn":["10772626"]},"page":"2288-2302","file":[{"access_level":"open_access","file_name":"preprint.pdf","checksum":"8d4c55443a0ee335bb5bb652de503042","date_updated":"2020-10-08T08:34:53Z","file_id":"8626","success":1,"creator":"wojtan","content_type":"application/pdf","file_size":21910098,"date_created":"2020-10-08T08:34:53Z","relation":"main_file"}],"external_id":{"isi":["000532295600014"],"pmid":["30507534"]},"date_published":"2020-06-01T00:00:00Z","_id":"5681","ddc":["006"],"oa":1,"pmid":1,"title":"Simulating liquids on dynamically warping grids","publication":"IEEE Transactions on Visualization and Computer Graphics","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"}],"publication_status":"published","quality_controlled":"1","author":[{"full_name":"Hikaru, Ibayashi","first_name":"Ibayashi","last_name":"Hikaru"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J"},{"full_name":"Thuerey, Nils","first_name":"Nils","last_name":"Thuerey"},{"full_name":"Igarashi, Takeo","last_name":"Igarashi","first_name":"Takeo"},{"first_name":"Ryoichi","last_name":"Ando","full_name":"Ando, Ryoichi"}],"citation":{"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.","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.","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.","short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 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"},"year":"2020","isi":1,"intvolume":" 26","status":"public","month":"06","date_created":"2018-12-16T22:59:21Z","volume":26,"issue":"6","publisher":"IEEE","article_type":"original","file_date_updated":"2020-10-08T08:34:53Z"},{"status":"public","month":"03","date_created":"2019-03-28T09:20:08Z","isi":1,"intvolume":" 48","publisher":"Institute of Mathematical Statistics","article_type":"original","issue":"2","volume":48,"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."}],"publication_status":"published","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"_id":"6184","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"6179"}]},"oa":1,"title":"Correlated random matrices: Band rigidity and edge universality","publication":"Annals of Probability","year":"2020","author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes","last_name":"Alt","first_name":"Johannes"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László"},{"first_name":"Torben H","last_name":"Krüger","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schröder","first_name":"Dominik J","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07744"}],"citation":{"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.","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.","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","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.","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.","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"},"arxiv":1,"scopus_import":"1","publication_identifier":{"issn":["0091-1798"]},"page":"963-1001","external_id":{"isi":["000528269100013"],"arxiv":["1804.07744"]},"date_published":"2020-03-01T00:00:00Z","department":[{"_id":"LaEr"}],"doi":"10.1214/19-AOP1379","language":[{"iso":"eng"}],"ec_funded":1,"day":"01","oa_version":"Preprint","date_updated":"2024-02-22T14:34:33Z","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No"},{"day":"01","oa_version":"Published Version","type":"journal_article","date_updated":"2023-09-07T12:54:12Z","article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","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.","has_accepted_license":"1","department":[{"_id":"LaEr"}],"doi":"10.1007/s00220-019-03657-4","language":[{"iso":"eng"}],"ec_funded":1,"page":"1203-1278","file":[{"date_created":"2020-11-18T11:14:37Z","relation":"main_file","file_size":2904574,"content_type":"application/pdf","creator":"dernst","file_id":"8771","date_updated":"2020-11-18T11:14:37Z","success":1,"access_level":"open_access","file_name":"2020_CommMathPhysics_Erdoes.pdf","checksum":"c3a683e2afdcea27afa6880b01e53dc2"}],"external_id":{"arxiv":["1809.03971"],"isi":["000529483000001"]},"date_published":"2020-09-01T00:00:00Z","arxiv":1,"scopus_import":"1","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"last_name":"Krüger","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H"},{"last_name":"Schröder","first_name":"Dominik J","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","citation":{"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.","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.","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.","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.","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"},"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"}],"publication_status":"published","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"_id":"6185","oa":1,"ddc":["530","510"],"related_material":{"record":[{"id":"6179","relation":"dissertation_contains","status":"public"}]},"publication":"Communications in Mathematical Physics","title":"Cusp universality for random matrices I: Local law and the complex Hermitian case","article_type":"original","publisher":"Springer Nature","file_date_updated":"2020-11-18T11:14:37Z","volume":378,"status":"public","month":"09","date_created":"2019-03-28T10:21:15Z","isi":1,"intvolume":" 378"},{"intvolume":" 178","isi":1,"month":"01","date_created":"2019-04-30T07:34:18Z","status":"public","volume":178,"issue":"2","file_date_updated":"2020-07-14T12:47:28Z","publisher":"Springer Nature","article_type":"original","title":"Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems","publication":"Journal of Statistical Physics","_id":"6358","ddc":["500"],"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s10955-020-02671-4"}]},"oa":1,"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117"},{"grant_number":" F06504","name":"Taming Complexity in Partial Di erential Systems","call_identifier":"FWF","_id":"260482E2-B435-11E9-9278-68D0E5697425"}],"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"}],"publication_status":"published","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","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.","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.","short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.","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","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."},"author":[{"full_name":"Carlen, Eric A.","last_name":"Carlen","first_name":"Eric A."},{"full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Maas"}],"quality_controlled":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020","scopus_import":"1","publication_identifier":{"issn":["00224715"],"eissn":["15729613"]},"arxiv":1,"file":[{"relation":"main_file","date_created":"2019-12-23T12:03:09Z","file_size":905538,"content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:47:28Z","file_id":"7209","checksum":"7b04befbdc0d4982c0ee945d25d19872","file_name":"2019_JourStatistPhysics_Carlen.pdf","access_level":"open_access"}],"external_id":{"isi":["000498933300001"],"arxiv":["1811.04572"]},"date_published":"2020-01-01T00:00:00Z","page":"319-378","ec_funded":1,"has_accepted_license":"1","department":[{"_id":"JaMa"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10955-019-02434-w","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","date_updated":"2023-08-17T13:49:40Z","type":"journal_article","day":"01"},{"file_date_updated":"2020-09-21T13:15:02Z","publisher":"Institute of Mathematical Statistics","article_type":"original","volume":25,"date_created":"2019-04-30T07:40:17Z","month":"07","status":"public","article_number":"82","intvolume":" 25","isi":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020","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","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.","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.","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)."},"quality_controlled":"1","author":[{"full_name":"Dareiotis, Konstantinos","last_name":"Dareiotis","first_name":"Konstantinos"},{"full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser"}],"publication_status":"published","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":"Electronic Journal of Probability","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","oa":1,"ddc":["510"],"_id":"6359","date_published":"2020-07-16T00:00:00Z","external_id":{"arxiv":["1812.04583"],"isi":["000550150700001"]},"file":[{"success":1,"date_updated":"2020-09-21T13:15:02Z","file_id":"8549","file_name":"2020_EJournProbab_Dareiotis.pdf","checksum":"8e7c42e72596f6889d786e8e8b89994f","access_level":"open_access","relation":"main_file","date_created":"2020-09-21T13:15:02Z","file_size":273042,"creator":"dernst","content_type":"application/pdf"}],"arxiv":1,"publication_identifier":{"eissn":["1083-6489"]},"scopus_import":"1","date_updated":"2023-10-16T09:22:50Z","type":"journal_article","oa_version":"Published Version","day":"16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1214/20-EJP479","has_accepted_license":"1","department":[{"_id":"JaMa"}]}]