--- _id: '15063' abstract: - lang: eng 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). 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 article_processing_charge: No article_type: original author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: 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 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 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. 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. 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. 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. short: G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146. date_created: 2024-03-04T10:27:57Z date_published: 2020-11-16T00:00:00Z date_updated: 2024-03-04T10:33:15Z day: '16' department: - _id: LaEr doi: 10.2140/pmp.2020.1.101 ec_funded: 1 external_id: arxiv: - '1908.01653' intvolume: ' 1' issue: '1' keyword: - General Medicine language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1908.01653 month: '11' oa: 1 oa_version: Preprint page: 101-146 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: Probability and Mathematical Physics publication_identifier: issn: - 2690-1005 - 2690-0998 publication_status: published publisher: Mathematical Sciences Publishers quality_controlled: '1' scopus_import: '1' status: public title: Optimal lower bound on the least singular value of the shifted Ginibre ensemble type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1 year: '2020' ... --- _id: '15059' abstract: - lang: eng text: "In this paper we present a room temperature radiometer that can eliminate the need of using cryostats in satellite payload reducing its weight and improving reliability. The proposed radiometer is based on an electro-optic upconverter that boosts up microwave photons energy by upconverting them into an optical domain what makes them immune to thermal noise even if operating at room temperature. The converter uses a high-quality factor whispering gallery\r\nmode (WGM) resonator providing naturally narrow bandwidth and therefore might be useful for applications like microwave hyperspectral sensing. The upconversion process is explained by\r\nproviding essential information about photon conversion efficiency and sensitivity. To prove the concept, we describe an experiment which shows state-of-the-art photon conversion efficiency n=10-5 per mW of pump power at the frequency of 80 GHz." acknowledgement: This work has been financially supported by Comunidad de Madrid S2018/NMT-4333 ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects. article_processing_charge: No author: - first_name: Michal full_name: Wasiak, Michal last_name: Wasiak - first_name: Gabriel Santamaria full_name: Botello, Gabriel Santamaria last_name: Botello - first_name: Kerlos Atia full_name: Abdalmalak, Kerlos Atia last_name: Abdalmalak - first_name: Florian full_name: Sedlmeir, Florian last_name: Sedlmeir - first_name: Alfredo R full_name: Rueda Sanchez, Alfredo R id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87 last_name: Rueda Sanchez orcid: 0000-0001-6249-5860 - first_name: Daniel full_name: Segovia-Vargas, Daniel last_name: Segovia-Vargas - first_name: Harald G. L. full_name: Schwefel, Harald G. L. last_name: Schwefel - first_name: Luis Enrique Garcia full_name: Munoz, Luis Enrique Garcia last_name: Munoz citation: ama: 'Wasiak M, Botello GS, Abdalmalak KA, et al. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In: 14th European Conference on Antennas and Propagation. IEEE; 2020. doi:10.23919/eucap48036.2020.9135962' apa: 'Wasiak, M., Botello, G. S., Abdalmalak, K. A., Sedlmeir, F., Rueda Sanchez, A. R., Segovia-Vargas, D., … Munoz, L. E. G. (2020). Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In 14th European Conference on Antennas and Propagation. Copenhagen, Denmark: IEEE. https://doi.org/10.23919/eucap48036.2020.9135962' chicago: Wasiak, Michal, Gabriel Santamaria Botello, Kerlos Atia Abdalmalak, Florian Sedlmeir, Alfredo R Rueda Sanchez, Daniel Segovia-Vargas, Harald G. L. Schwefel, and Luis Enrique Garcia Munoz. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” In 14th European Conference on Antennas and Propagation. IEEE, 2020. https://doi.org/10.23919/eucap48036.2020.9135962. ieee: M. Wasiak et al., “Compact millimeter and submillimeter-wave photonic radiometer for cubesats,” in 14th European Conference on Antennas and Propagation, Copenhagen, Denmark, 2020. ista: 'Wasiak M, Botello GS, Abdalmalak KA, Sedlmeir F, Rueda Sanchez AR, Segovia-Vargas D, Schwefel HGL, Munoz LEG. 2020. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. 14th European Conference on Antennas and Propagation. EuCAP: European Conference on Antennas and Propagation.' mla: Wasiak, Michal, et al. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” 14th European Conference on Antennas and Propagation, IEEE, 2020, doi:10.23919/eucap48036.2020.9135962. short: M. Wasiak, G.S. Botello, K.A. Abdalmalak, F. Sedlmeir, A.R. Rueda Sanchez, D. Segovia-Vargas, H.G.L. Schwefel, L.E.G. Munoz, in:, 14th European Conference on Antennas and Propagation, IEEE, 2020. conference: end_date: 2020-03-20 location: Copenhagen, Denmark name: 'EuCAP: European Conference on Antennas and Propagation' start_date: 2020-03-15 date_created: 2024-03-04T09:57:48Z date_published: 2020-07-08T00:00:00Z date_updated: 2024-03-04T10:02:49Z day: '08' department: - _id: JoFi doi: 10.23919/eucap48036.2020.9135962 language: - iso: eng month: '07' oa_version: None publication: 14th European Conference on Antennas and Propagation publication_identifier: eisbn: - '9788831299008' publication_status: published publisher: IEEE quality_controlled: '1' status: public title: Compact millimeter and submillimeter-wave photonic radiometer for cubesats type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '15074' 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. alternative_title: - LIPIcs article_number: '40' article_processing_charge: No author: - first_name: Sebastian full_name: Brandt, Sebastian last_name: Brandt - first_name: Barbara full_name: Keller, Barbara last_name: Keller - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 - first_name: Jukka full_name: Suomela, Jukka last_name: Suomela - first_name: Jara full_name: Uitto, Jara last_name: Uitto citation: 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' 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' 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.' 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.' 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.' 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.' 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. conference: end_date: 2020-10-16 location: Virtual name: 'DISC: Symposium on Distributed Computing' start_date: 2020-10-12 date_created: 2024-03-05T07:09:12Z date_published: 2020-10-07T00:00:00Z date_updated: 2024-03-05T07:13:13Z day: '07' ddc: - '000' department: - _id: DaAl doi: 10.4230/LIPIcs.DISC.2020.40 external_id: arxiv: - '2005.07761' file: - access_level: open_access checksum: 23e2d9321aef53092dc1e24a8ab82d72 content_type: application/pdf creator: dernst date_created: 2024-03-05T07:08:27Z date_updated: 2024-03-05T07:08:27Z file_id: '15075' file_name: 2020_LIPIcs_Brandt.pdf file_size: 303529 relation: main_file success: 1 file_date_updated: 2024-03-05T07:08:27Z has_accepted_license: '1' intvolume: ' 179' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '10' oa: 1 oa_version: Published Version publication: 34th International Symposium on Distributed Computing publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '9678' relation: later_version status: public scopus_import: '1' status: public title: 'Brief announcement: Efficient load-balancing through distributed token dropping' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 179 year: '2020' ... --- _id: '15077' abstract: - lang: eng 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 \U0001D4AA(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 \U0001D4AA (√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." 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" alternative_title: - LIPIcs article_number: '7' article_processing_charge: No author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 - first_name: Amirmojtaba full_name: Sabour, Amirmojtaba id: bcc145fd-e77f-11ea-ae8b-80d661dbff67 last_name: Sabour citation: 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' 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' 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. 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. 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.' 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. 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. conference: end_date: 2020-07-11 location: Saarbrücken, Germany, Virtual name: 'ICALP: International Colloquium on Automata, Languages, and Programming' start_date: 2020-07-08 date_created: 2024-03-05T07:25:37Z date_published: 2020-06-29T00:00:00Z date_updated: 2024-03-05T07:35:53Z day: '29' ddc: - '000' department: - _id: DaAl doi: 10.4230/LIPIcs.ICALP.2020.7 ec_funded: 1 external_id: arxiv: - '2003.09297' file: - access_level: open_access checksum: e5eb16199f4ccfd77a321977eb3f026f content_type: application/pdf creator: dernst date_created: 2024-03-05T07:25:15Z date_updated: 2024-03-05T07:25:15Z file_id: '15078' file_name: 2020_LIPIcs_Alistarh.pdf file_size: 782987 relation: main_file success: 1 file_date_updated: 2024-03-05T07:25:15Z has_accepted_license: '1' intvolume: ' 168' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: 47th International Colloquium on Automata, Languages, and Programming publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '8286' relation: later_version status: public scopus_import: '1' status: public title: Dynamic averaging load balancing on cycles tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 168 year: '2020' ... --- _id: '15082' 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." 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. article_number: '56' article_processing_charge: No author: - first_name: Oswin full_name: Aichholzer, Oswin last_name: Aichholzer - first_name: Julia full_name: Obmann, Julia last_name: Obmann - first_name: Pavel full_name: Patak, Pavel id: B593B804-1035-11EA-B4F1-947645A5BB83 last_name: Patak - first_name: Daniel full_name: Perz, Daniel last_name: Perz - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 citation: 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.' 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. 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. 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.' mla: Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020. short: O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020. conference: end_date: 2020-03-18 location: Würzburg, Germany, Virtual name: 'EuroCG: European Workshop on Computational Geometry' start_date: 2020-03-16 date_created: 2024-03-05T08:57:17Z date_published: 2020-04-01T00:00:00Z date_updated: 2024-03-05T09:00:07Z day: '01' department: - _id: KrCh - _id: UlWa language: - iso: eng main_file_link: - open_access: '1' url: https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf month: '04' oa: 1 oa_version: Published Version publication: 36th European Workshop on Computational Geometry publication_status: published quality_controlled: '1' status: public title: Disjoint tree-compatible plane perfect matchings type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '6748' abstract: - lang: eng text: "Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches.\r\nHere we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge." article_processing_charge: No article_type: original author: - first_name: Adel full_name: Javanmard, Adel last_name: Javanmard - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Andrea full_name: Montanari, Andrea last_name: Montanari citation: ama: Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 2020;48(6):3619-3642. doi:10.1214/20-AOS1945 apa: Javanmard, A., Mondelli, M., & Montanari, A. (2020). Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/20-AOS1945 chicago: Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-AOS1945. ieee: A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural network via displacement convexity,” Annals of Statistics, vol. 48, no. 6. Institute of Mathematical Statistics, pp. 3619–3642, 2020. ista: Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 48(6), 3619–3642. mla: Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics, vol. 48, no. 6, Institute of Mathematical Statistics, 2020, pp. 3619–42, doi:10.1214/20-AOS1945. short: A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642. date_created: 2019-07-31T09:39:42Z date_published: 2020-12-11T00:00:00Z date_updated: 2024-03-06T08:28:50Z day: '11' department: - _id: MaMo doi: 10.1214/20-AOS1945 external_id: arxiv: - '1901.01375' isi: - '000598369200021' intvolume: ' 48' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1901.01375 month: '12' oa: 1 oa_version: Preprint page: 3619-3642 publication: Annals of Statistics publication_identifier: eissn: - 1941-7330 issn: - 1932-6157 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' status: public title: Analysis of a two-layer neural network via displacement convexity type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2020' ... --- _id: '15070' abstract: - lang: eng text: This workshop focused on interactions between the various perspectives on the moduli space of Higgs bundles over a Riemann surface. This subject draws on algebraic geometry, geometric topology, geometric analysis and mathematical physics, and the goal was to promote interactions between these various branches of the subject. The main current directions of research were well represented by the participants, and the talks included many from both senior and junior participants. article_processing_charge: No article_type: original author: - first_name: Lara full_name: Anderson, Lara last_name: Anderson - first_name: Tamás full_name: Hausel, Tamás id: 4A0666D8-F248-11E8-B48F-1D18A9856A87 last_name: Hausel - first_name: Rafe full_name: Mazzeo, Rafe last_name: Mazzeo - first_name: Laura full_name: Schaposnik, Laura last_name: Schaposnik citation: ama: Anderson L, Hausel T, Mazzeo R, Schaposnik L. Geometry and physics of Higgs bundles. Oberwolfach Reports. 2020;16(2):1357-1417. doi:10.4171/owr/2019/23 apa: Anderson, L., Hausel, T., Mazzeo, R., & Schaposnik, L. (2020). Geometry and physics of Higgs bundles. Oberwolfach Reports. European Mathematical Society. https://doi.org/10.4171/owr/2019/23 chicago: Anderson, Lara, Tamás Hausel, Rafe Mazzeo, and Laura Schaposnik. “Geometry and Physics of Higgs Bundles.” Oberwolfach Reports. European Mathematical Society, 2020. https://doi.org/10.4171/owr/2019/23. ieee: L. Anderson, T. Hausel, R. Mazzeo, and L. Schaposnik, “Geometry and physics of Higgs bundles,” Oberwolfach Reports, vol. 16, no. 2. European Mathematical Society, pp. 1357–1417, 2020. ista: Anderson L, Hausel T, Mazzeo R, Schaposnik L. 2020. Geometry and physics of Higgs bundles. Oberwolfach Reports. 16(2), 1357–1417. mla: Anderson, Lara, et al. “Geometry and Physics of Higgs Bundles.” Oberwolfach Reports, vol. 16, no. 2, European Mathematical Society, 2020, pp. 1357–417, doi:10.4171/owr/2019/23. short: L. Anderson, T. Hausel, R. Mazzeo, L. Schaposnik, Oberwolfach Reports 16 (2020) 1357–1417. date_created: 2024-03-04T11:36:31Z date_published: 2020-06-04T00:00:00Z date_updated: 2024-03-11T09:20:34Z day: '04' department: - _id: TaHa doi: 10.4171/owr/2019/23 intvolume: ' 16' issue: '2' keyword: - Organic Chemistry - Biochemistry language: - iso: eng month: '06' oa_version: None page: 1357-1417 publication: Oberwolfach Reports publication_identifier: issn: - 1660-8933 publication_status: published publisher: European Mathematical Society quality_controlled: '1' status: public title: Geometry and physics of Higgs bundles type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2020' ... --- _id: '8741' abstract: - lang: eng text: "In ecology, climate and other fields, (sub)systems have been identified that can transition into a qualitatively different state when a critical threshold or tipping point in a driving process is crossed. An understanding of those tipping elements is of great interest given the increasing influence of humans on the biophysical Earth system. Complex interactions exist between tipping elements, e.g. physical mechanisms connect subsystems of the climate system. Based on earlier work on such coupled nonlinear systems, we systematically assessed the qualitative long-term behaviour of interacting tipping elements. We developed an understanding of the consequences of interactions\r\non the tipping behaviour allowing for tipping cascades to emerge under certain conditions. The (narrative) application of\r\nthese qualitative results to real-world examples of interacting tipping elements indicates that tipping cascades with profound consequences may occur: the interacting Greenland ice sheet and thermohaline ocean circulation might tip before the tipping points of the isolated subsystems are crossed. The eutrophication of the first lake in a lake chain might propagate through the following lakes without a crossing of their individual critical nutrient input levels. The possibility of emerging cascading tipping dynamics calls for the development of a unified theory of interacting tipping elements and the quantitative analysis of interacting real-world tipping elements." acknowledgement: "V.K. thanks the German National Academic Foundation (Studienstiftung des deutschen Volkes) for financial\r\nsupport. J.F.D. is grateful for financial support by the Stordalen Foundation via the Planetary Boundary Research\r\nNetwork (PB.net), the Earth League’s EarthDoc program and the European Research Council Advanced Grant\r\nproject ERA (Earth Resilience in the Anthropocene). We are thankful for support by the Leibniz Association\r\n(project DominoES).\r\nAcknowledgements. This work has been performed in the context of the copan collaboration and the FutureLab on Earth\r\nResilience in the Anthropocene at the Potsdam Institute for Climate Impact Research. Furthermore, we acknowledge\r\ndiscussions with and helpful comments by N. Wunderling, J. Heitzig and M. Wiedermann." article_number: '200599' article_processing_charge: No article_type: original author: - first_name: Ann Kristin full_name: Klose, Ann Kristin last_name: Klose - first_name: Volker full_name: Karle, Volker id: D7C012AE-D7ED-11E9-95E8-1EC5E5697425 last_name: Karle orcid: 0000-0002-6963-0129 - first_name: Ricarda full_name: Winkelmann, Ricarda last_name: Winkelmann - first_name: Jonathan F. full_name: Donges, Jonathan F. last_name: Donges citation: ama: 'Klose AK, Karle V, Winkelmann R, Donges JF. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. 2020;7(6). doi:10.1098/rsos.200599' apa: 'Klose, A. K., Karle, V., Winkelmann, R., & Donges, J. F. (2020). Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.200599' chicago: 'Klose, Ann Kristin, Volker Karle, Ricarda Winkelmann, and Jonathan F. Donges. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” Royal Society Open Science. The Royal Society, 2020. https://doi.org/10.1098/rsos.200599.' ieee: 'A. K. Klose, V. Karle, R. Winkelmann, and J. F. Donges, “Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements,” Royal Society Open Science, vol. 7, no. 6. The Royal Society, 2020.' ista: 'Klose AK, Karle V, Winkelmann R, Donges JF. 2020. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. 7(6), 200599.' mla: 'Klose, Ann Kristin, et al. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” Royal Society Open Science, vol. 7, no. 6, 200599, The Royal Society, 2020, doi:10.1098/rsos.200599.' short: A.K. Klose, V. Karle, R. Winkelmann, J.F. Donges, Royal Society Open Science 7 (2020). date_created: 2020-11-08T23:01:25Z date_published: 2020-06-01T00:00:00Z date_updated: 2024-03-12T12:31:30Z day: '01' ddc: - '530' - '550' department: - _id: MiLe doi: 10.1098/rsos.200599 external_id: arxiv: - '1910.12042' isi: - '000545625200001' file: - access_level: open_access checksum: 5505c445de373bfd836eb4d3b48b1f37 content_type: application/pdf creator: dernst date_created: 2020-11-09T09:07:11Z date_updated: 2020-11-09T09:07:11Z file_id: '8748' file_name: 2020_RoyalSocOpenScience_Klose.pdf file_size: 1611485 relation: main_file success: 1 file_date_updated: 2020-11-09T09:07:11Z has_accepted_license: '1' intvolume: ' 7' isi: 1 issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: Royal Society Open Science publication_identifier: eissn: - '20545703' publication_status: published publisher: The Royal Society quality_controlled: '1' scopus_import: '1' status: public title: 'Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2020' ... --- _id: '7687' abstract: - lang: eng text: A working group, which was established within the Network of Repository Managers (RepManNet), has dealt with common certifications for repositories. In addition, current requirements of the research funding agencies FWF and EU were also taken into account. The Core Trust Seal was examined in more detail. For this purpose, a questionnaire was sent to those organizations that are already certified with CTS in Austria. The answers were summarized and evaluated anonymously. It is recommended to go for a repository certification. Moreover, the development of a DINI certificate in Austria is strongly suggested. - lang: ger text: ' Eine Arbeitsgruppe, die im Rahmen des Netzwerks für RepositorienmanagerInnen (RepManNet) entstanden ist, hat sich mit gängigen Zertifizierungen für Repositorien beschäftigt. Weiters wurden aktuelle Vorgaben der Forschungsförderer FWF und EU herangezogen. Das Core Trust Seal wurde genauer betrachtet. Hierfür wurden jenen Organisationen, die in Österreich bereits mit CTS zertifiziert sind, ein Fragebogen übermittelt. Die Antworten wurden anonymisiert zusammengefasst und ausgewertet. Plädiert wird für eine Zertifizierung von Repositorien und die Entwicklung einer DINI-Zertifizierung in Österreich.' article_processing_charge: No article_type: original author: - first_name: Doris full_name: Ernst, Doris id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 last_name: Ernst orcid: 0000-0002-2354-0195 - first_name: Gertraud full_name: Novotny, Gertraud last_name: Novotny - first_name: Eva Maria full_name: Schönher, Eva Maria last_name: Schönher citation: ama: Ernst D, Novotny G, Schönher EM. (Core Trust) Seal your repository! Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2020;73(1):46-59. doi:10.31263/voebm.v73i1.3491 apa: Ernst, D., Novotny, G., & Schönher, E. M. (2020). (Core Trust) Seal your repository! Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v73i1.3491 chicago: Ernst, Doris, Gertraud Novotny, and Eva Maria Schönher. “(Core Trust) Seal your repository!” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020. https://doi.org/10.31263/voebm.v73i1.3491. ieee: D. Ernst, G. Novotny, and E. M. Schönher, “(Core Trust) Seal your repository!,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 1. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp. 46–59, 2020. ista: Ernst D, Novotny G, Schönher EM. 2020. (Core Trust) Seal your repository! Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 73(1), 46–59. mla: Ernst, Doris, et al. “(Core Trust) Seal your repository!” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 1, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020, pp. 46–59, doi:10.31263/voebm.v73i1.3491. short: D. Ernst, G. Novotny, E.M. Schönher, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 73 (2020) 46–59. date_created: 2020-04-28T08:37:38Z date_published: 2020-04-28T00:00:00Z date_updated: 2024-03-12T10:12:33Z day: '28' ddc: - '020' department: - _id: E-Lib doi: 10.31263/voebm.v73i1.3491 file: - access_level: open_access checksum: fee784f15a489deb7def6ccf8c5bf8c3 content_type: application/pdf creator: dernst date_created: 2020-06-17T10:50:13Z date_updated: 2024-03-12T10:12:33Z file_id: '7970' file_name: 2020_VOEB_Ernst.pdf file_size: 579291 relation: main_file file_date_updated: 2024-03-12T10:12:33Z has_accepted_license: '1' intvolume: ' 73' issue: '1' language: - iso: ger month: '04' oa: 1 oa_version: Published Version page: 46-59 popular_science: '1' publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare publication_identifier: issn: - 1022-2588 publication_status: published publisher: Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare scopus_import: '1' status: public title: (Core Trust) Seal your repository! tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 73 year: '2020' ... --- _id: '15079' abstract: - lang: eng text: "Large complex systems tend to develop universal patterns that often represent their essential characteristics. For example, the cumulative effects of independent or weakly dependent random variables often yield the Gaussian universality class via the central limit theorem. For non-commutative random variables, e.g. matrices, the Gaussian behavior is often replaced by another universality class, commonly called random matrix statistics. Nearby eigenvalues are strongly correlated, and, remarkably, their correlation structure is universal, depending only on the symmetry type of the matrix. Even more surprisingly, this feature is not restricted to matrices; in fact Eugene Wigner, the pioneer of the field, discovered in the 1950s that distributions of the gaps between energy levels of complicated quantum systems universally follow the same random matrix statistics. This claim has never been rigorously proved for any realistic physical system but experimental data and extensive numerics leave no doubt as to its correctness. Since then random matrices have proved to be extremely useful phenomenological models in a wide range of applications beyond quantum physics that include number theory, statistics, neuroscience, population dynamics, wireless communication and mathematical finance. The ubiquity of random matrices in natural sciences is still a mystery, but recent years have witnessed a breakthrough in the mathematical description of the statistical structure of their spectrum. Random matrices and closely related areas such as log-gases have become an extremely active research area in probability theory.\r\nThis workshop brought together outstanding researchers from a variety of mathematical backgrounds whose areas of research are linked to random matrices. While there are strong links between their motivations, the techniques used by these researchers span a large swath of mathematics, ranging from purely algebraic techniques to stochastic analysis, classical probability theory, operator algebra, supersymmetry, orthogonal polynomials, etc." article_processing_charge: No article_type: original author: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Friedrich full_name: Götze, Friedrich last_name: Götze - first_name: Alice full_name: Guionnet, Alice last_name: Guionnet citation: ama: Erdös L, Götze F, Guionnet A. Random matrices. Oberwolfach Reports. 2020;16(4):3459-3527. doi:10.4171/owr/2019/56 apa: Erdös, L., Götze, F., & Guionnet, A. (2020). Random matrices. Oberwolfach Reports. European Mathematical Society. https://doi.org/10.4171/owr/2019/56 chicago: Erdös, László, Friedrich Götze, and Alice Guionnet. “Random Matrices.” Oberwolfach Reports. European Mathematical Society, 2020. https://doi.org/10.4171/owr/2019/56. ieee: L. Erdös, F. Götze, and A. Guionnet, “Random matrices,” Oberwolfach Reports, vol. 16, no. 4. European Mathematical Society, pp. 3459–3527, 2020. ista: Erdös L, Götze F, Guionnet A. 2020. Random matrices. Oberwolfach Reports. 16(4), 3459–3527. mla: Erdös, László, et al. “Random Matrices.” Oberwolfach Reports, vol. 16, no. 4, European Mathematical Society, 2020, pp. 3459–527, doi:10.4171/owr/2019/56. short: L. Erdös, F. Götze, A. Guionnet, Oberwolfach Reports 16 (2020) 3459–3527. date_created: 2024-03-05T07:54:44Z date_published: 2020-11-19T00:00:00Z date_updated: 2024-03-12T12:25:18Z day: '19' department: - _id: LaEr doi: 10.4171/owr/2019/56 intvolume: ' 16' issue: '4' language: - iso: eng month: '11' oa_version: None page: 3459-3527 publication: Oberwolfach Reports publication_identifier: issn: - 1660-8933 publication_status: published publisher: European Mathematical Society quality_controlled: '1' status: public title: Random matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2020' ...