--- _id: '12705' abstract: - lang: eng text: The elasticity of disordered and polydisperse polymer networks is a fundamental problem of soft matter physics that is still open. Here, we self-assemble polymer networks via simulations of a mixture of bivalent and tri- or tetravalent patchy particles, which result in an exponential strand length distribution analogous to that of experimental randomly cross-linked systems. After assembly, the network connectivity and topology are frozen and the resulting system is characterized. We find that the fractal structure of the network depends on the number density at which the assembly has been carried out, but that systems with the same mean valence and same assembly density have the same structural properties. Moreover, we compute the long-time limit of the mean-squared displacement, also known as the (squared) localization length, of the cross-links and of the middle monomers of the strands, showing that the dynamics of long strands is well described by the tube model. Finally, we find a relation connecting these two localization lengths at high density and connect the cross-link localization length to the shear modulus of the system. acknowledgement: We thank Michael Lang for helpful discussions. We acknowledge financial support from the European Research Council (ERC Consolidator Grant No. 681597, MIMIC) and from LabEx NUMEV (Grant No. ANR-10-LABX-20) funded by the “Investissements d’Avenir” French Government program, managed by the French National Research Agency (ANR). W.K. is a senior member of the Institut Universitaire de France. article_number: '074905' article_processing_charge: No article_type: original author: - first_name: Valerio full_name: Sorichetti, Valerio id: ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b last_name: Sorichetti orcid: 0000-0002-9645-6576 - first_name: Andrea full_name: Ninarello, Andrea last_name: Ninarello - first_name: José full_name: Ruiz-Franco, José last_name: Ruiz-Franco - first_name: Virginie full_name: Hugouvieux, Virginie last_name: Hugouvieux - first_name: Emanuela full_name: Zaccarelli, Emanuela last_name: Zaccarelli - first_name: Cristian full_name: Micheletti, Cristian last_name: Micheletti - first_name: Walter full_name: Kob, Walter last_name: Kob - first_name: Lorenzo full_name: Rovigatti, Lorenzo last_name: Rovigatti citation: ama: Sorichetti V, Ninarello A, Ruiz-Franco J, et al. Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks. Journal of Chemical Physics. 2023;158(7). doi:10.1063/5.0134271 apa: Sorichetti, V., Ninarello, A., Ruiz-Franco, J., Hugouvieux, V., Zaccarelli, E., Micheletti, C., … Rovigatti, L. (2023). Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks. Journal of Chemical Physics. American Institute of Physics. https://doi.org/10.1063/5.0134271 chicago: Sorichetti, Valerio, Andrea Ninarello, José Ruiz-Franco, Virginie Hugouvieux, Emanuela Zaccarelli, Cristian Micheletti, Walter Kob, and Lorenzo Rovigatti. “Structure and Elasticity of Model Disordered, Polydisperse, and Defect-Free Polymer Networks.” Journal of Chemical Physics. American Institute of Physics, 2023. https://doi.org/10.1063/5.0134271. ieee: V. Sorichetti et al., “Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks,” Journal of Chemical Physics, vol. 158, no. 7. American Institute of Physics, 2023. ista: Sorichetti V, Ninarello A, Ruiz-Franco J, Hugouvieux V, Zaccarelli E, Micheletti C, Kob W, Rovigatti L. 2023. Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks. Journal of Chemical Physics. 158(7), 074905. mla: Sorichetti, Valerio, et al. “Structure and Elasticity of Model Disordered, Polydisperse, and Defect-Free Polymer Networks.” Journal of Chemical Physics, vol. 158, no. 7, 074905, American Institute of Physics, 2023, doi:10.1063/5.0134271. short: V. Sorichetti, A. Ninarello, J. Ruiz-Franco, V. Hugouvieux, E. Zaccarelli, C. Micheletti, W. Kob, L. Rovigatti, Journal of Chemical Physics 158 (2023). date_created: 2023-03-05T23:01:05Z date_published: 2023-02-21T00:00:00Z date_updated: 2023-10-03T11:31:51Z day: '21' department: - _id: AnSa doi: 10.1063/5.0134271 external_id: arxiv: - '2211.04810' isi: - '000936943800002' pmid: - '36813705' intvolume: ' 158' isi: 1 issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2211.04810 month: '02' oa: 1 oa_version: Preprint pmid: 1 publication: Journal of Chemical Physics publication_identifier: eissn: - 1089-7690 issn: - 0021-9606 publication_status: published publisher: American Institute of Physics quality_controlled: '1' scopus_import: '1' status: public title: Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 158 year: '2023' ... --- _id: '12738' abstract: - lang: eng text: We study turn-based stochastic zero-sum games with lexicographic preferences over objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as controllable and adversarial non-determinism. Lexicographic order allows one to consider multiple objectives with a strict preference order. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. For a mixture of reachability and safety objectives, we show that deterministic lexicographically optimal strategies exist and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP, matching the current known bound for single objectives; and in general the decision problem is PSPACE-hard and can be solved in NEXPTIME∩coNEXPTIME. We present an algorithm that computes the lexicographically optimal strategies via a reduction to the computation of optimal strategies in a sequence of single-objectives games. For omega-regular objectives, we restrict our analysis to one-player games, also known as Markov decision processes. We show that lexicographically optimal strategies exist and need either randomization or finite memory. We present an algorithm that solves the relevant decision problem in polynomial time. We have implemented our algorithms and report experimental results on various case studies. acknowledgement: Tobias Winkler and Joost-Pieter Katoen are supported by the DFG RTG 2236 UnRAVeL and the innovation programme under the Marie Skłodowska-Curie grant agreement No. 101008233 (Mission). Krishnendu Chatterjee is supported by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) Project ICT15-003. Maximilian Weininger is supported by the DFG projects 383882557 Statistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic Verification (GOPro). Stefanie Mohr is supported by the DFG RTG 2428 CONVEY. Open Access funding enabled and organized by Projekt DEAL. article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Joost P full_name: Katoen, Joost P id: 4524F760-F248-11E8-B48F-1D18A9856A87 last_name: Katoen - first_name: Stefanie full_name: Mohr, Stefanie last_name: Mohr - first_name: Maximilian full_name: Weininger, Maximilian last_name: Weininger - first_name: Tobias full_name: Winkler, Tobias last_name: Winkler citation: ama: Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. Stochastic games with lexicographic objectives. Formal Methods in System Design. 2023. doi:10.1007/s10703-023-00411-4 apa: Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. https://doi.org/10.1007/s10703-023-00411-4 chicago: Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design. Springer Nature, 2023. https://doi.org/10.1007/s10703-023-00411-4. ieee: K. Chatterjee, J. P. Katoen, S. Mohr, M. Weininger, and T. Winkler, “Stochastic games with lexicographic objectives,” Formal Methods in System Design. Springer Nature, 2023. ista: Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2023. Stochastic games with lexicographic objectives. Formal Methods in System Design. mla: Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design, Springer Nature, 2023, doi:10.1007/s10703-023-00411-4. short: K. Chatterjee, J.P. Katoen, S. Mohr, M. Weininger, T. Winkler, Formal Methods in System Design (2023). date_created: 2023-03-19T23:00:59Z date_published: 2023-03-08T00:00:00Z date_updated: 2023-10-03T11:36:13Z day: '08' ddc: - '000' department: - _id: KrCh doi: 10.1007/s10703-023-00411-4 ec_funded: 1 external_id: isi: - '000946174300001' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1007/s10703-023-00411-4 month: '03' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Formal Methods in System Design publication_identifier: eissn: - 1572-8102 publication_status: epub_ahead publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '8272' relation: earlier_version status: public scopus_import: '1' status: public title: Stochastic games with lexicographic objectives 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 year: '2023' ... --- _id: '14279' abstract: - lang: eng text: "The zip file includes source data used in the manuscript \"CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration\", as well as a representative Jupyter notebook to reproduce the main figures. Please see the preprint on bioRxiv and the DOI link there to access the final published version. Note the title change between the preprint and the published manuscript.\r\nA sample script for particle-based simulations of collective chemotaxis by self-generated gradients is also included (see Self-generated_chemotaxis_sample_script.ipynb) to generate exemplary cell trajectories. A detailed description of the simulation setup is provided in the supplementary information of the manuscipt." article_processing_charge: No author: - first_name: Mehmet C full_name: Ucar, Mehmet C id: 50B2A802-6007-11E9-A42B-EB23E6697425 last_name: Ucar orcid: 0000-0003-0506-4217 citation: ama: Ucar MC. Source data for the manuscript “CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.” 2023. doi:10.5281/ZENODO.8133960 apa: Ucar, M. C. (2023). Source data for the manuscript “CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.” Zenodo. https://doi.org/10.5281/ZENODO.8133960 chicago: Ucar, Mehmet C. “Source Data for the Manuscript ‘CCR7 Acts as Both a Sensor and a Sink for CCL19 to Coordinate Collective Leukocyte Migration.’” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8133960. ieee: M. C. Ucar, “Source data for the manuscript ‘CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration.’” Zenodo, 2023. ista: Ucar MC. 2023. Source data for the manuscript ‘CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration’, Zenodo, 10.5281/ZENODO.8133960. mla: Ucar, Mehmet C. Source Data for the Manuscript “CCR7 Acts as Both a Sensor and a Sink for CCL19 to Coordinate Collective Leukocyte Migration.” Zenodo, 2023, doi:10.5281/ZENODO.8133960. short: M.C. Ucar, (2023). date_created: 2023-09-06T08:39:25Z date_published: 2023-07-11T00:00:00Z date_updated: 2023-10-03T11:42:58Z day: '11' ddc: - '570' department: - _id: EdHa doi: 10.5281/ZENODO.8133960 has_accepted_license: '1' main_file_link: - open_access: '1' url: https://doi.org/10.5281/zenodo.8133960 month: '07' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '14274' relation: used_in_publication status: public status: public title: Source data for the manuscript "CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration" 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: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '10405' abstract: - lang: eng text: 'We consider large non-Hermitian random matrices X with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having 2+ϵ derivatives. Previously this result was known only for a few special cases; either the test functions were required to be analytic [72], or the distribution of the matrix elements needed to be Gaussian [73], or at least match the Gaussian up to the first four moments [82, 56]. We find the exact dependence of the limiting variance on the fourth cumulant that was not known before. The proof relies on two novel ingredients: (i) a local law for a product of two resolvents of the Hermitisation of X with different spectral parameters and (ii) a coupling of several weakly dependent Dyson Brownian motions. These methods are also the key inputs for our analogous results on the linear eigenvalue statistics of real matrices X that are presented in the companion paper [32]. ' acknowledgement: L.E. would like to thank Nathanaël Berestycki and D.S.would like to thank Nina Holden for valuable discussions on the Gaussian freefield.G.C. and L.E. are partially supported by ERC Advanced Grant No. 338804.G.C. received funding from the European Union’s Horizon 2020 research and in-novation programme under the Marie Skłodowska-Curie Grant Agreement No.665385. D.S. is supported by Dr. Max Rössler, the Walter Haefner Foundation, and the ETH Zürich Foundation. article_processing_charge: Yes (via OA deal) 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. Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. Communications on Pure and Applied Mathematics. 2023;76(5):946-1034. doi:10.1002/cpa.22028 apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. Communications on Pure and Applied Mathematics. Wiley. https://doi.org/10.1002/cpa.22028 chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Central Limit Theorem for Linear Eigenvalue Statistics of Non-Hermitian Random Matrices.” Communications on Pure and Applied Mathematics. Wiley, 2023. https://doi.org/10.1002/cpa.22028. ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices,” Communications on Pure and Applied Mathematics, vol. 76, no. 5. Wiley, pp. 946–1034, 2023. ista: Cipolloni G, Erdös L, Schröder DJ. 2023. Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. Communications on Pure and Applied Mathematics. 76(5), 946–1034. mla: Cipolloni, Giorgio, et al. “Central Limit Theorem for Linear Eigenvalue Statistics of Non-Hermitian Random Matrices.” Communications on Pure and Applied Mathematics, vol. 76, no. 5, Wiley, 2023, pp. 946–1034, doi:10.1002/cpa.22028. short: G. Cipolloni, L. Erdös, D.J. Schröder, Communications on Pure and Applied Mathematics 76 (2023) 946–1034. date_created: 2021-12-05T23:01:41Z date_published: 2023-05-01T00:00:00Z date_updated: 2023-10-04T09:22:55Z day: '01' ddc: - '510' department: - _id: LaEr doi: 10.1002/cpa.22028 ec_funded: 1 external_id: arxiv: - '1912.04100' isi: - '000724652500001' file: - access_level: open_access checksum: 8346bc2642afb4ccb7f38979f41df5d9 content_type: application/pdf creator: dernst date_created: 2023-10-04T09:21:48Z date_updated: 2023-10-04T09:21:48Z file_id: '14388' file_name: 2023_CommPureMathematics_Cipolloni.pdf file_size: 803440 relation: main_file success: 1 file_date_updated: 2023-10-04T09:21:48Z has_accepted_license: '1' intvolume: ' 76' isi: 1 issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 946-1034 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: Communications on Pure and Applied Mathematics publication_identifier: eissn: - 1097-0312 issn: - 0010-3640 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 76 year: '2023' ... --- _id: '10770' abstract: - lang: eng text: Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings. acknowledgement: "The authors would like to acknowledge stimulating email discussions with Dr Wayne Lobb of W.A. Lobb LLC on the topic of evolutionary games. We also thank Dr Thomas Taimre for his input to the material in Sect. 3.\r\nThe authors would like to acknowledge partial support from the Australian Research Council under the Discovery grant DP180101602 and support by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411." article_processing_charge: No article_type: original author: - first_name: Thomas full_name: Graham, Thomas last_name: Graham - first_name: Maria full_name: Kleshnina, Maria id: 4E21749C-F248-11E8-B48F-1D18A9856A87 last_name: Kleshnina - first_name: Jerzy A. full_name: Filar, Jerzy A. last_name: Filar citation: ama: Graham T, Kleshnina M, Filar JA. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 2023;13:231-264. doi:10.1007/s13235-022-00425-3 apa: Graham, T., Kleshnina, M., & Filar, J. A. (2023). Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-022-00425-3 chicago: Graham, Thomas, Maria Kleshnina, and Jerzy A. Filar. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” Dynamic Games and Applications. Springer Nature, 2023. https://doi.org/10.1007/s13235-022-00425-3. ieee: T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” Dynamic Games and Applications, vol. 13. Springer Nature, pp. 231–264, 2023. ista: Graham T, Kleshnina M, Filar JA. 2023. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 13, 231–264. mla: Graham, Thomas, et al. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” Dynamic Games and Applications, vol. 13, Springer Nature, 2023, pp. 231–64, doi:10.1007/s13235-022-00425-3. short: T. Graham, M. Kleshnina, J.A. Filar, Dynamic Games and Applications 13 (2023) 231–264. date_created: 2022-02-20T23:01:32Z date_published: 2023-03-01T00:00:00Z date_updated: 2023-10-04T09:24:30Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/s13235-022-00425-3 ec_funded: 1 external_id: isi: - '000753777100001' file: - access_level: open_access checksum: cd53b07e96f9030ddb348f305e5b58c7 content_type: application/pdf creator: dernst date_created: 2022-02-21T08:54:17Z date_updated: 2022-02-21T08:54:17Z file_id: '10781' file_name: 2022_DynamicGamesApplic_Graham.pdf file_size: 1890512 relation: main_file success: 1 file_date_updated: 2022-02-21T08:54:17Z has_accepted_license: '1' intvolume: ' 13' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 231-264 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Dynamic Games and Applications publication_identifier: eissn: - 2153-0793 issn: - 2153-0785 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Where do mistakes lead? A survey of games with incompetent players 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: 13 year: '2023' ... --- _id: '10145' abstract: - lang: eng text: We study direct integrals of quadratic and Dirichlet forms. We show that each quasi-regular Dirichlet space over a probability space admits a unique representation as a direct integral of irreducible Dirichlet spaces, quasi-regular for the same underlying topology. The same holds for each quasi-regular strongly local Dirichlet space over a metrizable Luzin σ-finite Radon measure space, and admitting carré du champ operator. In this case, the representation is only projectively unique. acknowledgement: The author is grateful to Professors Sergio Albeverio and Andreas Eberle, and to Dr. Kohei Suzuki, for fruitful conversations on the subject of the present work, and for respectively pointing out the references [1, 13], and [3, 20]. Finally, he is especially grateful to an anonymous Reviewer for their very careful reading and their suggestions which improved the readability of the paper. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Lorenzo full_name: Dello Schiavo, Lorenzo id: ECEBF480-9E4F-11EA-B557-B0823DDC885E last_name: Dello Schiavo orcid: 0000-0002-9881-6870 citation: ama: Dello Schiavo L. Ergodic decomposition of Dirichlet forms via direct integrals and applications. Potential Analysis. 2023;58:573-615. doi:10.1007/s11118-021-09951-y apa: Dello Schiavo, L. (2023). Ergodic decomposition of Dirichlet forms via direct integrals and applications. Potential Analysis. Springer Nature. https://doi.org/10.1007/s11118-021-09951-y chicago: Dello Schiavo, Lorenzo. “Ergodic Decomposition of Dirichlet Forms via Direct Integrals and Applications.” Potential Analysis. Springer Nature, 2023. https://doi.org/10.1007/s11118-021-09951-y. ieee: L. Dello Schiavo, “Ergodic decomposition of Dirichlet forms via direct integrals and applications,” Potential Analysis, vol. 58. Springer Nature, pp. 573–615, 2023. ista: Dello Schiavo L. 2023. Ergodic decomposition of Dirichlet forms via direct integrals and applications. Potential Analysis. 58, 573–615. mla: Dello Schiavo, Lorenzo. “Ergodic Decomposition of Dirichlet Forms via Direct Integrals and Applications.” Potential Analysis, vol. 58, Springer Nature, 2023, pp. 573–615, doi:10.1007/s11118-021-09951-y. short: L. Dello Schiavo, Potential Analysis 58 (2023) 573–615. date_created: 2021-10-17T22:01:17Z date_published: 2023-03-01T00:00:00Z date_updated: 2023-10-04T09:19:12Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1007/s11118-021-09951-y ec_funded: 1 external_id: arxiv: - '2003.01366' isi: - '000704213400001' file: - access_level: open_access checksum: 625526482be300ca7281c91c30d41725 content_type: application/pdf creator: dernst date_created: 2023-10-04T09:18:59Z date_updated: 2023-10-04T09:18:59Z file_id: '14387' file_name: 2023_PotentialAnalysis_DelloSchiavo.pdf file_size: 806391 relation: main_file success: 1 file_date_updated: 2023-10-04T09:18:59Z has_accepted_license: '1' intvolume: ' 58' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 573-615 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics publication: Potential Analysis publication_identifier: eissn: - 1572-929X issn: - 0926-2601 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Ergodic decomposition of Dirichlet forms via direct integrals and applications 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: 58 year: '2023' ... --- _id: '11706' abstract: - lang: eng text: 'We say that (Formula presented.) if, in every edge coloring (Formula presented.), we can find either a 1-colored copy of (Formula presented.) or a 2-colored copy of (Formula presented.). The well-known states that the threshold for the property (Formula presented.) is equal to (Formula presented.), where (Formula presented.) is given by (Formula presented.) for any pair of graphs (Formula presented.) and (Formula presented.) with (Formula presented.). In this article, we show the 0-statement of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques. ' acknowledgement: "This work was started at the thematic program GRAPHS@IMPA (January–March 2018), in Rio de Janeiro. We thank IMPA and the organisers for the hospitality and for providing a pleasant research environment. We thank Rob Morris for helpful discussions, and the anonymous referees for their careful reading and many helpful suggestions. Open Access funding enabled and organized by Projekt DEAL.\r\nA. Liebenau was supported by an ARC DECRA Fellowship Grant DE170100789. L. Mattos was supported by CAPES and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy – The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689). W. Mendonça was supported by CAPES project 88882.332408/2010-01." article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Anita full_name: Liebenau, Anita last_name: Liebenau - first_name: Letícia full_name: Mattos, Letícia last_name: Mattos - first_name: Walner full_name: Mendonca Dos Santos, Walner id: 12c6bd4d-2cd0-11ec-a0da-e28f42f65ebd last_name: Mendonca Dos Santos - first_name: Jozef full_name: Skokan, Jozef last_name: Skokan citation: ama: Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. 2023;62(4):1035-1055. doi:10.1002/rsa.21106 apa: Liebenau, A., Mattos, L., Mendonca dos Santos, W., & Skokan, J. (2023). Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.21106 chicago: Liebenau, Anita, Letícia Mattos, Walner Mendonca dos Santos, and Jozef Skokan. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” Random Structures and Algorithms. Wiley, 2023. https://doi.org/10.1002/rsa.21106. ieee: A. Liebenau, L. Mattos, W. Mendonca dos Santos, and J. Skokan, “Asymmetric Ramsey properties of random graphs involving cliques and cycles,” Random Structures and Algorithms, vol. 62, no. 4. Wiley, pp. 1035–1055, 2023. ista: Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. 2023. Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. 62(4), 1035–1055. mla: Liebenau, Anita, et al. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” Random Structures and Algorithms, vol. 62, no. 4, Wiley, 2023, pp. 1035–55, doi:10.1002/rsa.21106. short: A. Liebenau, L. Mattos, W. Mendonca dos Santos, J. Skokan, Random Structures and Algorithms 62 (2023) 1035–1055. date_created: 2022-07-31T22:01:49Z date_published: 2023-07-01T00:00:00Z date_updated: 2023-10-04T09:38:45Z day: '01' ddc: - '510' department: - _id: MaKw doi: 10.1002/rsa.21106 external_id: isi: - '000828530400001' file: - access_level: open_access checksum: 3a5969d0c512aef01c30f3dc81c6d59b content_type: application/pdf creator: dernst date_created: 2023-10-04T09:37:26Z date_updated: 2023-10-04T09:37:26Z file_id: '14389' file_name: 2023_RandomStructureAlgorithms_Liebenau.pdf file_size: 1362334 relation: main_file success: 1 file_date_updated: 2023-10-04T09:37:26Z has_accepted_license: '1' intvolume: ' 62' isi: 1 issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 1035-1055 publication: Random Structures and Algorithms publication_identifier: eissn: - 1098-2418 issn: - 1042-9832 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Asymmetric Ramsey properties of random graphs involving cliques and cycles tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 62 year: '2023' ... --- _id: '12707' abstract: - lang: eng text: We establish precise right-tail small deviation estimates for the largest eigenvalue of real symmetric and complex Hermitian matrices whose entries are independent random variables with uniformly bounded moments. The proof relies on a Green function comparison along a continuous interpolating matrix flow for a long time. Less precise estimates are also obtained in the left tail. 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: Yuanyuan full_name: Xu, Yuanyuan id: 7902bdb1-a2a4-11eb-a164-c9216f71aea3 last_name: Xu orcid: 0000-0003-1559-1205 citation: ama: Erdös L, Xu Y. Small deviation estimates for the largest eigenvalue of Wigner matrices. Bernoulli. 2023;29(2):1063-1079. doi:10.3150/22-BEJ1490 apa: Erdös, L., & Xu, Y. (2023). Small deviation estimates for the largest eigenvalue of Wigner matrices. Bernoulli. Bernoulli Society for Mathematical Statistics and Probability. https://doi.org/10.3150/22-BEJ1490 chicago: Erdös, László, and Yuanyuan Xu. “Small Deviation Estimates for the Largest Eigenvalue of Wigner Matrices.” Bernoulli. Bernoulli Society for Mathematical Statistics and Probability, 2023. https://doi.org/10.3150/22-BEJ1490. ieee: L. Erdös and Y. Xu, “Small deviation estimates for the largest eigenvalue of Wigner matrices,” Bernoulli, vol. 29, no. 2. Bernoulli Society for Mathematical Statistics and Probability, pp. 1063–1079, 2023. ista: Erdös L, Xu Y. 2023. Small deviation estimates for the largest eigenvalue of Wigner matrices. Bernoulli. 29(2), 1063–1079. mla: Erdös, László, and Yuanyuan Xu. “Small Deviation Estimates for the Largest Eigenvalue of Wigner Matrices.” Bernoulli, vol. 29, no. 2, Bernoulli Society for Mathematical Statistics and Probability, 2023, pp. 1063–79, doi:10.3150/22-BEJ1490. short: L. Erdös, Y. Xu, Bernoulli 29 (2023) 1063–1079. date_created: 2023-03-05T23:01:05Z date_published: 2023-05-01T00:00:00Z date_updated: 2023-10-04T10:21:07Z day: '01' department: - _id: LaEr doi: 10.3150/22-BEJ1490 ec_funded: 1 external_id: arxiv: - '2112.12093 ' isi: - '000947270100008' intvolume: ' 29' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2112.12093 month: '05' oa: 1 oa_version: Preprint page: 1063-1079 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Bernoulli publication_identifier: issn: - 1350-7265 publication_status: published publisher: Bernoulli Society for Mathematical Statistics and Probability quality_controlled: '1' scopus_import: '1' status: public title: Small deviation estimates for the largest eigenvalue of Wigner matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 29 year: '2023' ... --- _id: '12837' abstract: - lang: eng text: As developing tissues grow in size and undergo morphogenetic changes, their material properties may be altered. Such changes result from tension dynamics at cell contacts or cellular jamming. Yet, in many cases, the cellular mechanisms controlling the physical state of growing tissues are unclear. We found that at early developmental stages, the epithelium in the developing mouse spinal cord maintains both high junctional tension and high fluidity. This is achieved via a mechanism in which interkinetic nuclear movements generate cell area dynamics that drive extensive cell rearrangements. Over time, the cell proliferation rate declines, effectively solidifying the tissue. Thus, unlike well-studied jamming transitions, the solidification uncovered here resembles a glass transition that depends on the dynamical stresses generated by proliferation and differentiation. Our finding that the fluidity of developing epithelia is linked to interkinetic nuclear movements and the dynamics of growth is likely to be relevant to multiple developing tissues. acknowledgement: 'We thank S. Hippenmeyer for the reagents and C. P. Heisenberg, J. Briscoe and K. Page for comments on the manuscript. This work was supported by IST Austria; the European Research Council under Horizon 2020 research and innovation programme grant no. 680037 and Horizon Europe grant 101044579 (A.K.); Austrian Science Fund (FWF): F78 (Stem Cell Modulation) (A.K.); ISTFELLOW postdoctoral program (A.S.); Narodowe Centrum Nauki, Poland SONATA, 2017/26/D/NZ2/00454 (M.Z.); and the Polish National Agency for Academic Exchange (M.Z.).' article_processing_charge: No article_type: original author: - first_name: Laura full_name: Bocanegra, Laura id: 4896F754-F248-11E8-B48F-1D18A9856A87 last_name: Bocanegra - first_name: Amrita full_name: Singh, Amrita id: 76250f9f-3a21-11eb-9a80-a6180a0d7958 last_name: Singh - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 - first_name: Marcin P full_name: Zagórski, Marcin P id: 343DA0DC-F248-11E8-B48F-1D18A9856A87 last_name: Zagórski orcid: 0000-0001-7896-7762 - first_name: Anna full_name: Kicheva, Anna id: 3959A2A0-F248-11E8-B48F-1D18A9856A87 last_name: Kicheva orcid: 0000-0003-4509-4998 citation: ama: Bocanegra L, Singh A, Hannezo EB, Zagórski MP, Kicheva A. Cell cycle dynamics control fluidity of the developing mouse neuroepithelium. Nature Physics. 2023;19:1050-1058. doi:10.1038/s41567-023-01977-w apa: Bocanegra, L., Singh, A., Hannezo, E. B., Zagórski, M. P., & Kicheva, A. (2023). Cell cycle dynamics control fluidity of the developing mouse neuroepithelium. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-023-01977-w chicago: Bocanegra, Laura, Amrita Singh, Edouard B Hannezo, Marcin P Zagórski, and Anna Kicheva. “Cell Cycle Dynamics Control Fluidity of the Developing Mouse Neuroepithelium.” Nature Physics. Springer Nature, 2023. https://doi.org/10.1038/s41567-023-01977-w. ieee: L. Bocanegra, A. Singh, E. B. Hannezo, M. P. Zagórski, and A. Kicheva, “Cell cycle dynamics control fluidity of the developing mouse neuroepithelium,” Nature Physics, vol. 19. Springer Nature, pp. 1050–1058, 2023. ista: Bocanegra L, Singh A, Hannezo EB, Zagórski MP, Kicheva A. 2023. Cell cycle dynamics control fluidity of the developing mouse neuroepithelium. Nature Physics. 19, 1050–1058. mla: Bocanegra, Laura, et al. “Cell Cycle Dynamics Control Fluidity of the Developing Mouse Neuroepithelium.” Nature Physics, vol. 19, Springer Nature, 2023, pp. 1050–58, doi:10.1038/s41567-023-01977-w. short: L. Bocanegra, A. Singh, E.B. Hannezo, M.P. Zagórski, A. Kicheva, Nature Physics 19 (2023) 1050–1058. date_created: 2023-04-16T22:01:09Z date_published: 2023-07-01T00:00:00Z date_updated: 2023-10-04T11:14:05Z day: '01' ddc: - '570' department: - _id: EdHa - _id: AnKi doi: 10.1038/s41567-023-01977-w ec_funded: 1 external_id: isi: - '000964029300003' file: - access_level: open_access checksum: 858225a4205b74406e5045006cdd853f content_type: application/pdf creator: dernst date_created: 2023-10-04T11:13:28Z date_updated: 2023-10-04T11:13:28Z file_id: '14392' file_name: 2023_NaturePhysics_Boncanegra.pdf file_size: 5532285 relation: main_file success: 1 file_date_updated: 2023-10-04T11:13:28Z has_accepted_license: '1' intvolume: ' 19' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 1050-1058 project: - _id: B6FC0238-B512-11E9-945C-1524E6697425 call_identifier: H2020 grant_number: '680037' name: Coordination of Patterning And Growth In the Spinal Cord - _id: bd7e737f-d553-11ed-ba76-d69ffb5ee3aa grant_number: '101044579' name: Mechanisms of tissue size regulation in spinal cord development - _id: 059DF620-7A3F-11EA-A408-12923DDC885E grant_number: F07802 name: Morphogen control of growth and pattern in the spinal cord - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '13081' relation: dissertation_contains status: public scopus_import: '1' status: public title: Cell cycle dynamics control fluidity of the developing mouse neuroepithelium 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: 19 year: '2023' ... --- _id: '12836' abstract: - lang: eng text: Coherent control and manipulation of quantum degrees of freedom such as spins forms the basis of emerging quantum technologies. In this context, the robust valley degree of freedom and the associated valley pseudospin found in two-dimensional transition metal dichalcogenides is a highly attractive platform. Valley polarization and coherent superposition of valley states have been observed in these systems even up to room temperature. Control of valley coherence is an important building block for the implementation of valley qubit. Large magnetic fields or high-power lasers have been used in the past to demonstrate the control (initialization and rotation) of the valley coherent states. Here, the control of layer–valley coherence via strong coupling of valley excitons in bilayer WS2 to microcavity photons is demonstrated by exploiting the pseudomagnetic field arising in optical cavities owing to the transverse electric–transverse magnetic (TE–TM)mode splitting. The use of photonic structures to generate pseudomagnetic fields which can be used to manipulate exciton-polaritons presents an attractive approach to control optical responses without the need for large magnets or high-intensity optical pump powers. acknowledgement: The authors acknowledge insightful discussions with Prof. Wang Yao and graphics by Rezlind Bushati. M.K. and N.Y. acknowledge support from NSF grants NSF DMR-1709996 and NSF OMA 1936276. S.G. was supported by the Army Research Office Multidisciplinary University Research Initiative program (W911NF-17-1-0312) and V.M.M. by the Army Research Office grant (W911NF-22-1-0091). K.M acknowledges the SPARC program that supported his collaboration with the CUNY team. The authors acknowledge the Nanofabrication facility at the CUNY Advanced Science Research Center where the cavity devices were fabricated. article_number: '2202631' article_processing_charge: No article_type: original author: - first_name: Mandeep full_name: Khatoniar, Mandeep last_name: Khatoniar - first_name: Nicholas full_name: Yama, Nicholas last_name: Yama - first_name: Areg full_name: Ghazaryan, Areg id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87 last_name: Ghazaryan orcid: 0000-0001-9666-3543 - first_name: Sriram full_name: Guddala, Sriram last_name: Guddala - first_name: Pouyan full_name: Ghaemi, Pouyan last_name: Ghaemi - first_name: Kausik full_name: Majumdar, Kausik last_name: Majumdar - first_name: Vinod full_name: Menon, Vinod last_name: Menon citation: ama: Khatoniar M, Yama N, Ghazaryan A, et al. Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities. Advanced Optical Materials. 2023;11(13). doi:10.1002/adom.202202631 apa: Khatoniar, M., Yama, N., Ghazaryan, A., Guddala, S., Ghaemi, P., Majumdar, K., & Menon, V. (2023). Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities. Advanced Optical Materials. Wiley. https://doi.org/10.1002/adom.202202631 chicago: Khatoniar, Mandeep, Nicholas Yama, Areg Ghazaryan, Sriram Guddala, Pouyan Ghaemi, Kausik Majumdar, and Vinod Menon. “Optical Manipulation of Layer–Valley Coherence via Strong Exciton–Photon Coupling in Microcavities.” Advanced Optical Materials. Wiley, 2023. https://doi.org/10.1002/adom.202202631. ieee: M. Khatoniar et al., “Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities,” Advanced Optical Materials, vol. 11, no. 13. Wiley, 2023. ista: Khatoniar M, Yama N, Ghazaryan A, Guddala S, Ghaemi P, Majumdar K, Menon V. 2023. Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities. Advanced Optical Materials. 11(13), 2202631. mla: Khatoniar, Mandeep, et al. “Optical Manipulation of Layer–Valley Coherence via Strong Exciton–Photon Coupling in Microcavities.” Advanced Optical Materials, vol. 11, no. 13, 2202631, Wiley, 2023, doi:10.1002/adom.202202631. short: M. Khatoniar, N. Yama, A. Ghazaryan, S. Guddala, P. Ghaemi, K. Majumdar, V. Menon, Advanced Optical Materials 11 (2023). date_created: 2023-04-16T22:01:09Z date_published: 2023-07-04T00:00:00Z date_updated: 2023-10-04T11:15:17Z day: '04' department: - _id: MiLe doi: 10.1002/adom.202202631 external_id: arxiv: - '2211.08755' isi: - '000963866700001' intvolume: ' 11' isi: 1 issue: '13' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2211.08755 month: '07' oa: 1 oa_version: Preprint publication: Advanced Optical Materials publication_identifier: eissn: - 2195-1071 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2023' ... --- _id: '12959' abstract: - lang: eng text: "This paper deals with the large-scale behaviour of dynamical optimal transport on Zd\r\n-periodic graphs with general lower semicontinuous and convex energy densities. Our main contribution is a homogenisation result that describes the effective behaviour of the discrete problems in terms of a continuous optimal transport problem. The effective energy density can be explicitly expressed in terms of a cell formula, which is a finite-dimensional convex programming problem that depends non-trivially on the local geometry of the discrete graph and the discrete energy density. Our homogenisation result is derived from a Γ\r\n-convergence result for action functionals on curves of measures, which we prove under very mild growth conditions on the energy density. We investigate the cell formula in several cases of interest, including finite-volume discretisations of the Wasserstein distance, where non-trivial limiting behaviour occurs." acknowledgement: J.M. gratefully acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 716117). J.M and L.P. also acknowledge support from the Austrian Science Fund (FWF), grants No F65 and W1245. E.K. gratefully acknowledges support by the German Research Foundation through the Hausdorff Center for Mathematics and the Collaborative Research Center 1060. P.G. is partially funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)—350398276. We thank the anonymous reviewer for the careful reading and for useful suggestions. Open access funding provided by Austrian Science Fund (FWF). article_number: '143' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Peter full_name: Gladbach, Peter last_name: Gladbach - first_name: Eva full_name: Kopfer, Eva last_name: Kopfer - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Lorenzo full_name: Portinale, Lorenzo id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87 last_name: Portinale citation: ama: Gladbach P, Kopfer E, Maas J, Portinale L. Homogenisation of dynamical optimal transport on periodic graphs. Calculus of Variations and Partial Differential Equations. 2023;62(5). doi:10.1007/s00526-023-02472-z apa: Gladbach, P., Kopfer, E., Maas, J., & Portinale, L. (2023). Homogenisation of dynamical optimal transport on periodic graphs. Calculus of Variations and Partial Differential Equations. Springer Nature. https://doi.org/10.1007/s00526-023-02472-z chicago: Gladbach, Peter, Eva Kopfer, Jan Maas, and Lorenzo Portinale. “Homogenisation of Dynamical Optimal Transport on Periodic Graphs.” Calculus of Variations and Partial Differential Equations. Springer Nature, 2023. https://doi.org/10.1007/s00526-023-02472-z. ieee: P. Gladbach, E. Kopfer, J. Maas, and L. Portinale, “Homogenisation of dynamical optimal transport on periodic graphs,” Calculus of Variations and Partial Differential Equations, vol. 62, no. 5. Springer Nature, 2023. ista: Gladbach P, Kopfer E, Maas J, Portinale L. 2023. Homogenisation of dynamical optimal transport on periodic graphs. Calculus of Variations and Partial Differential Equations. 62(5), 143. mla: Gladbach, Peter, et al. “Homogenisation of Dynamical Optimal Transport on Periodic Graphs.” Calculus of Variations and Partial Differential Equations, vol. 62, no. 5, 143, Springer Nature, 2023, doi:10.1007/s00526-023-02472-z. short: P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Calculus of Variations and Partial Differential Equations 62 (2023). date_created: 2023-05-14T22:01:00Z date_published: 2023-04-28T00:00:00Z date_updated: 2023-10-04T11:34:49Z day: '28' ddc: - '510' department: - _id: JaMa doi: 10.1007/s00526-023-02472-z ec_funded: 1 external_id: arxiv: - '2110.15321' isi: - '000980588900001' file: - access_level: open_access checksum: 359bee38d94b7e0aa73925063cb8884d content_type: application/pdf creator: dernst date_created: 2023-10-04T11:34:10Z date_updated: 2023-10-04T11:34:10Z file_id: '14393' file_name: 2023_CalculusEquations_Gladbach.pdf file_size: 1240995 relation: main_file success: 1 file_date_updated: 2023-10-04T11:34:10Z has_accepted_license: '1' intvolume: ' 62' isi: 1 issue: '5' language: - iso: eng month: '04' oa: 1 oa_version: Published Version project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 260788DE-B435-11E9-9278-68D0E5697425 call_identifier: FWF name: Dissipation and Dispersion in Nonlinear Partial Differential Equations publication: Calculus of Variations and Partial Differential Equations publication_identifier: eissn: - 1432-0835 issn: - 0944-2669 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Homogenisation of dynamical optimal transport on periodic graphs 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: 62 year: '2023' ... --- _id: '12877' abstract: - lang: eng text: We consider billiards obtained by removing from the plane finitely many strictly convex analytic obstacles satisfying the non-eclipse condition. The restriction of the dynamics to the set of non-escaping orbits is conjugated to a subshift, which provides a natural labeling of periodic orbits. We show that under suitable symmetry and genericity assumptions, the Marked Length Spectrum determines the geometry of the billiard table. acknowledgement: 'J.D.S. and M.L. have been partially supported by the NSERC Discovery grant, reference number 502617-2017. M.L. was also supported by the ERC project 692925 NUHGD of Sylvain Crovisier, by the ANR AAPG 2021 PRC CoSyDy: Conformally symplectic dynamics, beyond symplectic dynamics (ANR-CE40-0014), and by the ANR JCJC PADAWAN: Parabolic dynamics, bifurcations and wandering domains (ANR-21-CE40-0012). V.K. acknowledges partial support of the NSF grant DMS-1402164 and ERC Grant # 885707.' article_processing_charge: No article_type: original author: - first_name: Jacopo full_name: De Simoi, Jacopo last_name: De Simoi - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 - first_name: Martin full_name: Leguil, Martin last_name: Leguil citation: ama: De Simoi J, Kaloshin V, Leguil M. Marked Length Spectral determination of analytic chaotic billiards with axial symmetries. Inventiones Mathematicae. 2023;233:829-901. doi:10.1007/s00222-023-01191-8 apa: De Simoi, J., Kaloshin, V., & Leguil, M. (2023). Marked Length Spectral determination of analytic chaotic billiards with axial symmetries. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-023-01191-8 chicago: De Simoi, Jacopo, Vadim Kaloshin, and Martin Leguil. “Marked Length Spectral Determination of Analytic Chaotic Billiards with Axial Symmetries.” Inventiones Mathematicae. Springer Nature, 2023. https://doi.org/10.1007/s00222-023-01191-8. ieee: J. De Simoi, V. Kaloshin, and M. Leguil, “Marked Length Spectral determination of analytic chaotic billiards with axial symmetries,” Inventiones Mathematicae, vol. 233. Springer Nature, pp. 829–901, 2023. ista: De Simoi J, Kaloshin V, Leguil M. 2023. Marked Length Spectral determination of analytic chaotic billiards with axial symmetries. Inventiones Mathematicae. 233, 829–901. mla: De Simoi, Jacopo, et al. “Marked Length Spectral Determination of Analytic Chaotic Billiards with Axial Symmetries.” Inventiones Mathematicae, vol. 233, Springer Nature, 2023, pp. 829–901, doi:10.1007/s00222-023-01191-8. short: J. De Simoi, V. Kaloshin, M. Leguil, Inventiones Mathematicae 233 (2023) 829–901. date_created: 2023-04-30T22:01:05Z date_published: 2023-08-01T00:00:00Z date_updated: 2023-10-04T11:25:37Z day: '01' department: - _id: VaKa doi: 10.1007/s00222-023-01191-8 ec_funded: 1 external_id: arxiv: - '1905.00890' isi: - '000978887600001' intvolume: ' 233' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1905.00890 month: '08' oa: 1 oa_version: Preprint page: 829-901 project: - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication: Inventiones Mathematicae publication_identifier: eissn: - 1432-1297 issn: - 0020-9910 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Marked Length Spectral determination of analytic chaotic billiards with axial symmetries type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 233 year: '2023' ... --- _id: '12349' abstract: - lang: eng text: Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types. acknowledged_ssus: - _id: ScienComp - _id: PreCl - _id: LifeSc - _id: Bio acknowledgement: We thank Hiroki Asari for sharing the dataset of naturalistic images, Anton Sumser for sharing visual stimulus code, Yoav Ben Simon for initial explorative work with the generation of AAVs, and Tomas Vega-Zuñiga for help with immunostainings. We also thank Gasper Tkacik and members of the Neuroethology group for their comments on the manuscript. This research was supported by the Scientific Service Units of IST Austria through resources provided by Scientific Computing, the Preclinical Facility, the Lab Support Facility, and the Imaging and Optics Facility. This work was supported by European Union Horizon 2020 Marie Skłodowska-Curie grant 665385 (DG), Austrian Science Fund (FWF) stand-alone grant P 34015 (WM), Human Frontiers Science Program LT000256/2018-L (AS), EMBO ALTF 1098-2017 (AS) and the European Research Council Starting Grant 756502 (MJ). article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Divyansh full_name: Gupta, Divyansh id: 2A485EBE-F248-11E8-B48F-1D18A9856A87 last_name: Gupta orcid: 0000-0001-7400-6665 - first_name: Wiktor F full_name: Mlynarski, Wiktor F id: 358A453A-F248-11E8-B48F-1D18A9856A87 last_name: Mlynarski - first_name: Anton L full_name: Sumser, Anton L id: 3320A096-F248-11E8-B48F-1D18A9856A87 last_name: Sumser orcid: 0000-0002-4792-1881 - first_name: Olga full_name: Symonova, Olga id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87 last_name: Symonova orcid: 0000-0003-2012-9947 - first_name: Jan full_name: Svaton, Jan id: f7f724c3-9d6f-11ed-9f44-e5c5f3a5bee2 last_name: Svaton orcid: 0000-0002-6198-2939 - first_name: Maximilian A full_name: Jösch, Maximilian A id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 citation: ama: Gupta D, Mlynarski WF, Sumser AL, Symonova O, Svaton J, Jösch MA. Panoramic visual statistics shape retina-wide organization of receptive fields. Nature Neuroscience. 2023;26:606-614. doi:10.1038/s41593-023-01280-0 apa: Gupta, D., Mlynarski, W. F., Sumser, A. L., Symonova, O., Svaton, J., & Jösch, M. A. (2023). Panoramic visual statistics shape retina-wide organization of receptive fields. Nature Neuroscience. Springer Nature. https://doi.org/10.1038/s41593-023-01280-0 chicago: Gupta, Divyansh, Wiktor F Mlynarski, Anton L Sumser, Olga Symonova, Jan Svaton, and Maximilian A Jösch. “Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields.” Nature Neuroscience. Springer Nature, 2023. https://doi.org/10.1038/s41593-023-01280-0. ieee: D. Gupta, W. F. Mlynarski, A. L. Sumser, O. Symonova, J. Svaton, and M. A. Jösch, “Panoramic visual statistics shape retina-wide organization of receptive fields,” Nature Neuroscience, vol. 26. Springer Nature, pp. 606–614, 2023. ista: Gupta D, Mlynarski WF, Sumser AL, Symonova O, Svaton J, Jösch MA. 2023. Panoramic visual statistics shape retina-wide organization of receptive fields. Nature Neuroscience. 26, 606–614. mla: Gupta, Divyansh, et al. “Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields.” Nature Neuroscience, vol. 26, Springer Nature, 2023, pp. 606–14, doi:10.1038/s41593-023-01280-0. short: D. Gupta, W.F. Mlynarski, A.L. Sumser, O. Symonova, J. Svaton, M.A. Jösch, Nature Neuroscience 26 (2023) 606–614. date_created: 2023-01-23T14:14:19Z date_published: 2023-04-01T00:00:00Z date_updated: 2023-10-04T11:41:05Z day: '01' ddc: - '570' department: - _id: GradSch - _id: MaJö doi: 10.1038/s41593-023-01280-0 ec_funded: 1 external_id: isi: - '000955258300002' pmid: - '36959418' file: - access_level: open_access checksum: a33d91e398e548f34003170e10988368 content_type: application/pdf creator: dernst date_created: 2023-10-04T11:40:51Z date_updated: 2023-10-04T11:40:51Z file_id: '14395' file_name: 2023_NatureNeuroscience_Gupta.pdf file_size: 6144866 relation: main_file success: 1 file_date_updated: 2023-10-04T11:40:51Z has_accepted_license: '1' intvolume: ' 26' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 606-614 pmid: 1 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 626c45b5-2b32-11ec-9570-e509828c1ba6 grant_number: P34015 name: Efficient coding with biophysical realism - _id: 2634E9D2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '756502' name: Circuits of Visual Attention - _id: 266D407A-B435-11E9-9278-68D0E5697425 grant_number: LT000256 name: Neuronal networks of salience and spatial detection in the murine superior colliculus - _id: 264FEA02-B435-11E9-9278-68D0E5697425 grant_number: ALTF 1098-2017 name: Connecting sensory with motor processing in the superior colliculus publication: Nature Neuroscience publication_identifier: eissn: - 1546-1726 issn: - 1097-6256 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '12370' relation: research_data status: public scopus_import: '1' status: public title: Panoramic visual statistics shape retina-wide organization of receptive fields 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: 26 year: '2023' ... --- _id: '12370' abstract: - lang: eng text: 'Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types. ' acknowledged_ssus: - _id: ScienComp - _id: M-Shop - _id: Bio - _id: PreCl - _id: LifeSc article_processing_charge: No author: - first_name: Divyansh full_name: Gupta, Divyansh id: 2A485EBE-F248-11E8-B48F-1D18A9856A87 last_name: Gupta orcid: 0000-0001-7400-6665 - first_name: Anton L full_name: Sumser, Anton L id: 3320A096-F248-11E8-B48F-1D18A9856A87 last_name: Sumser orcid: 0000-0002-4792-1881 - first_name: Maximilian A full_name: Jösch, Maximilian A id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 citation: ama: 'Gupta D, Sumser AL, Jösch MA. Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields. 2023. doi:10.15479/AT:ISTA:12370' apa: 'Gupta, D., Sumser, A. L., & Jösch, M. A. (2023). Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12370' chicago: 'Gupta, Divyansh, Anton L Sumser, and Maximilian A Jösch. “Research Data for: Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12370.' ieee: 'D. Gupta, A. L. Sumser, and M. A. Jösch, “Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields.” Institute of Science and Technology Austria, 2023.' ista: 'Gupta D, Sumser AL, Jösch MA. 2023. Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields, Institute of Science and Technology Austria, 10.15479/AT:ISTA:12370.' mla: 'Gupta, Divyansh, et al. Research Data for: Panoramic Visual Statistics Shape Retina-Wide Organization of Receptive Fields. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12370.' short: D. Gupta, A.L. Sumser, M.A. Jösch, (2023). contributor: - contributor_type: researcher first_name: Olga id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87 last_name: Symonova - contributor_type: researcher first_name: Wiktor F id: 358A453A-F248-11E8-B48F-1D18A9856A87 last_name: Mlynarski - contributor_type: researcher first_name: Jan id: f7f724c3-9d6f-11ed-9f44-e5c5f3a5bee2 last_name: Svaton date_created: 2023-01-25T12:45:18Z date_published: 2023-01-26T00:00:00Z date_updated: 2023-10-04T11:41:04Z day: '26' ddc: - '571' department: - _id: GradSch - _id: MaJö doi: 10.15479/AT:ISTA:12370 ec_funded: 1 file: - access_level: open_access checksum: 172cd1c315cbf063c122298396bc17a7 content_type: text/plain creator: dgupta date_created: 2023-01-26T10:51:34Z date_updated: 2023-01-26T10:51:34Z file_id: '12396' file_name: readme_exvivo.txt file_size: 1917 relation: main_file success: 1 - access_level: open_access checksum: d3cecda51cad86b1182195731c01a14f content_type: text/plain creator: dgupta date_created: 2023-01-26T10:50:50Z date_updated: 2023-01-26T10:50:50Z file_id: '12397' file_name: readme_invivo.txt file_size: 1585 relation: main_file success: 1 - access_level: open_access checksum: b85018b27f2c43a6d94ee0e8b841220d content_type: application/octet-stream creator: dgupta date_created: 2023-01-26T10:43:30Z date_updated: 2023-01-26T10:43:30Z file_id: '12398' file_name: exvivo_RFs.mat file_size: 5019459775 relation: main_file success: 1 - access_level: open_access checksum: f75dccd96a3f837cdeed65b5134e697e content_type: application/octet-stream creator: dgupta date_created: 2023-01-26T10:40:35Z date_updated: 2023-01-26T10:40:35Z file_id: '12399' file_name: RGC_in_vivo_RFs_selected.mat file_size: 94999721 relation: main_file success: 1 - access_level: open_access checksum: d41836ffe03ea0efb677de31287c8d2e content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:03:49Z date_updated: 2023-01-25T16:03:49Z file_id: '12382' file_name: invivo_BL6-eyeGC8m-dC-3_210924_1534_Result.mat file_size: 720893739 relation: main_file success: 1 - access_level: open_access checksum: 0a0cba5208241a95f9bb7684d0a43afa content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:03:30Z date_updated: 2023-01-25T16:03:30Z file_id: '12383' file_name: invivo_BL6-eyeGC8m-dC-3_211026_1235_Result.mat file_size: 248122209 relation: main_file success: 1 - access_level: open_access checksum: cf72c1f325631212f305ff1a6d342bc3 content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:04:54Z date_updated: 2023-01-25T16:04:54Z file_id: '12384' file_name: invivo_BL6-eyeGC8m-dC-3_211202_1505_Result.mat file_size: 1757729346 relation: main_file success: 1 - access_level: open_access checksum: f4cd25f37d433a7dced3aa8cc326c755 content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:04:41Z date_updated: 2023-01-25T16:04:41Z file_id: '12385' file_name: invivo_BL6-eyeGC8m-dC-3_211208_1738_Result.mat file_size: 1177344595 relation: main_file success: 1 - access_level: open_access checksum: 8c31637d447f2088fdb5ba1c6775f243 content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:06:22Z date_updated: 2023-01-25T16:06:22Z file_id: '12386' file_name: invivo_BL6-eyeGC8m-dC-3_220111_1735_Result.mat file_size: 2246592895 relation: main_file success: 1 - access_level: open_access checksum: 246d660ef06a9151c59b74490d991460 content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:07:41Z date_updated: 2023-01-25T16:07:41Z file_id: '12387' file_name: invivo_BL6-eyeGC8m-dC-4_220216_0950_Result.mat file_size: 2151341770 relation: main_file success: 1 - access_level: open_access checksum: b32987dd4589d05b9dfadb93d4178c0d content_type: application/octet-stream creator: dgupta date_created: 2023-01-26T10:19:02Z date_updated: 2023-01-26T10:19:02Z file_id: '12393' file_name: invivo_BL6-eyeGC8m-dC-4_220428_1351_Result.mat file_size: 3719145736 relation: main_file success: 1 - access_level: open_access checksum: 6c88ca7d1df405f04002146d251dc22e content_type: application/octet-stream creator: dgupta date_created: 2023-01-26T10:34:46Z date_updated: 2023-01-26T10:34:46Z file_id: '12395' file_name: invivo_BL6-eyeGC8m-dC-4_220502_1357_Result.mat file_size: 5818789752 relation: main_file success: 1 - access_level: open_access checksum: 494057076bb0b0a28e4b7146bb50113c content_type: application/octet-stream creator: dgupta date_created: 2023-01-26T10:23:19Z date_updated: 2023-01-26T10:23:19Z file_id: '12394' file_name: invivo_BL6-eyeGC8m-dC-4_220524_1726_Result.mat file_size: 2614677996 relation: main_file success: 1 - access_level: open_access checksum: e51015d43ede6b1628803c58e424f99f content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:20:51Z date_updated: 2023-01-25T16:20:51Z file_id: '12388' file_name: invivo_BL6-eyeGC8m-dC-5_220613_1750_Result.mat file_size: 1840481462 relation: main_file success: 1 - access_level: open_access checksum: 9483686a44e69eadea428b705c33a9a2 content_type: application/octet-stream creator: dgupta date_created: 2023-01-25T16:23:02Z date_updated: 2023-01-25T16:23:02Z file_id: '12389' file_name: invivo_BL6-eyeGC8m-dC-5_220630_1518_Result.mat file_size: 1617777136 relation: main_file success: 1 file_date_updated: 2023-01-26T10:51:34Z has_accepted_license: '1' month: '01' oa: 1 oa_version: Published Version project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 626c45b5-2b32-11ec-9570-e509828c1ba6 grant_number: P34015 name: Efficient coding with biophysical realism - _id: 2634E9D2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '756502' name: Circuits of Visual Attention - _id: 266D407A-B435-11E9-9278-68D0E5697425 grant_number: LT000256 name: Neuronal networks of salience and spatial detection in the murine superior colliculus - _id: 264FEA02-B435-11E9-9278-68D0E5697425 grant_number: ALTF 1098-2017 name: Connecting sensory with motor processing in the superior colliculus publisher: Institute of Science and Technology Austria related_material: record: - id: '12349' relation: used_in_publication status: public status: public title: 'Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields' tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '12764' abstract: - lang: eng text: We study a new discretization of the Gaussian curvature for polyhedral surfaces. This discrete Gaussian curvature is defined on each conical singularity of a polyhedral surface as the quotient of the angle defect and the area of the Voronoi cell corresponding to the singularity. We divide polyhedral surfaces into discrete conformal classes using a generalization of discrete conformal equivalence pioneered by Feng Luo. We subsequently show that, in every discrete conformal class, there exists a polyhedral surface with constant discrete Gaussian curvature. We also provide explicit examples to demonstrate that this surface is in general not unique. acknowledgement: Open access funding provided by the Austrian Science Fund (FWF). This research was supported by the FWF grant, Project number I4245-N35, and by the Deutsche Forschungsgemeinschaft (DFG - German Research Foundation) - Project-ID 195170736 - TRR109. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Hana full_name: Kourimska, Hana id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E last_name: Kourimska orcid: 0000-0001-7841-0091 citation: ama: Kourimska H. Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. 2023;70:123-153. doi:10.1007/s00454-023-00484-2 apa: Kourimska, H. (2023). Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-023-00484-2 chicago: Kourimska, Hana. “Discrete Yamabe Problem for Polyhedral Surfaces.” Discrete and Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-023-00484-2. ieee: H. Kourimska, “Discrete yamabe problem for polyhedral surfaces,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 123–153, 2023. ista: Kourimska H. 2023. Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. 70, 123–153. mla: Kourimska, Hana. “Discrete Yamabe Problem for Polyhedral Surfaces.” Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 123–53, doi:10.1007/s00454-023-00484-2. short: H. Kourimska, Discrete and Computational Geometry 70 (2023) 123–153. date_created: 2023-03-26T22:01:09Z date_published: 2023-07-01T00:00:00Z date_updated: 2023-10-04T11:46:48Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s00454-023-00484-2 external_id: isi: - '000948148000001' file: - access_level: open_access checksum: cdbf90ba4a7ddcb190d37b9e9d4cb9d3 content_type: application/pdf creator: dernst date_created: 2023-10-04T11:46:24Z date_updated: 2023-10-04T11:46:24Z file_id: '14396' file_name: 2023_DiscreteGeometry_Kourimska.pdf file_size: 1026683 relation: main_file success: 1 file_date_updated: 2023-10-04T11:46:24Z has_accepted_license: '1' intvolume: ' 70' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 123-153 project: - _id: 26AD5D90-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I04245 name: Algebraic Footprints of Geometric Features in Homology publication: Discrete and Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Discrete yamabe problem for polyhedral surfaces 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: 70 year: '2023' ... --- _id: '13331' abstract: - lang: eng text: "The extension of extremal combinatorics to the setting of exterior algebra is a work\r\nin progress that gained attention recently. In this thesis, we study the combinatorial structure of exterior algebra by introducing a dictionary that translates the notions from the set systems into the framework of exterior algebra. We show both generalizations of celebrated Erdös--Ko--Rado theorem and Hilton--Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms.\r\n" alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Seyda full_name: Köse, Seyda id: 8ba3170d-dc85-11ea-9058-c4251c96a6eb last_name: Köse citation: ama: Köse S. Exterior algebra and combinatorics. 2023. doi:10.15479/at:ista:13331 apa: Köse, S. (2023). Exterior algebra and combinatorics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13331 chicago: Köse, Seyda. “Exterior Algebra and Combinatorics.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13331. ieee: S. Köse, “Exterior algebra and combinatorics,” Institute of Science and Technology Austria, 2023. ista: Köse S. 2023. Exterior algebra and combinatorics. Institute of Science and Technology Austria. mla: Köse, Seyda. Exterior Algebra and Combinatorics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13331. short: S. Köse, Exterior Algebra and Combinatorics, Institute of Science and Technology Austria, 2023. date_created: 2023-07-31T10:20:55Z date_published: 2023-07-31T00:00:00Z date_updated: 2023-10-04T11:54:56Z day: '31' ddc: - '510' - '516' degree_awarded: MS department: - _id: GradSch - _id: UlWa doi: 10.15479/at:ista:13331 file: - access_level: closed checksum: 96ee518d796d02af71395622c45de03c content_type: application/x-zip-compressed creator: skoese date_created: 2023-07-31T10:16:32Z date_updated: 2023-07-31T10:16:32Z file_id: '13333' file_name: Exterior Algebra and Combinatorics.zip file_size: 28684 relation: source_file - access_level: open_access checksum: f610f4713f88bc477de576aaa46b114e content_type: application/pdf creator: skoese date_created: 2023-08-03T15:28:55Z date_updated: 2023-08-03T15:28:55Z file_id: '13480' file_name: thesis-pdfa.pdf file_size: 4953418 relation: main_file success: 1 file_date_updated: 2023-08-03T15:28:55Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '26' publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12680' relation: part_of_dissertation status: public status: public supervisor: - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 title: Exterior algebra and combinatorics type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2023' ... --- _id: '12680' abstract: - lang: eng text: The celebrated Erdős–Ko–Rado theorem about the maximal size of an intersecting family of r-element subsets of was extended to the setting of exterior algebra in [5, Theorem 2.3] and in [6, Theorem 1.4]. However, the equality case has not been settled yet. In this short note, we show that the extension of the Erdős–Ko–Rado theorem and the characterization of the equality case therein, as well as those of the Hilton–Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms follow from a folklore puzzle about possible arrangements of an intersecting family of lines. article_number: '113363' article_processing_charge: No article_type: letter_note author: - first_name: Grigory full_name: Ivanov, Grigory id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E last_name: Ivanov - first_name: Seyda full_name: Köse, Seyda id: 8ba3170d-dc85-11ea-9058-c4251c96a6eb last_name: Köse citation: ama: Ivanov G, Köse S. Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 2023;346(6). doi:10.1016/j.disc.2023.113363 apa: Ivanov, G., & Köse, S. (2023). Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2023.113363 chicago: Ivanov, Grigory, and Seyda Köse. “Erdős-Ko-Rado and Hilton-Milner Theorems for Two-Forms.” Discrete Mathematics. Elsevier, 2023. https://doi.org/10.1016/j.disc.2023.113363. ieee: G. Ivanov and S. Köse, “Erdős-Ko-Rado and Hilton-Milner theorems for two-forms,” Discrete Mathematics, vol. 346, no. 6. Elsevier, 2023. ista: Ivanov G, Köse S. 2023. Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 346(6), 113363. mla: Ivanov, Grigory, and Seyda Köse. “Erdős-Ko-Rado and Hilton-Milner Theorems for Two-Forms.” Discrete Mathematics, vol. 346, no. 6, 113363, Elsevier, 2023, doi:10.1016/j.disc.2023.113363. short: G. Ivanov, S. Köse, Discrete Mathematics 346 (2023). date_created: 2023-02-26T23:01:00Z date_published: 2023-06-01T00:00:00Z date_updated: 2023-10-04T11:54:57Z day: '01' department: - _id: UlWa - _id: GradSch doi: 10.1016/j.disc.2023.113363 external_id: arxiv: - '2201.10892' intvolume: ' 346' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2201.10892' month: '06' oa: 1 oa_version: Preprint publication: Discrete Mathematics publication_identifier: issn: - 0012-365X publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '13331' relation: dissertation_contains status: public scopus_import: '1' status: public title: Erdős-Ko-Rado and Hilton-Milner theorems for two-forms type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 346 year: '2023' ... --- _id: '12792' abstract: - lang: eng text: In the physics literature the spectral form factor (SFF), the squared Fourier transform of the empirical eigenvalue density, is the most common tool to test universality for disordered quantum systems, yet previous mathematical results have been restricted only to two exactly solvable models (Forrester in J Stat Phys 183:33, 2021. https://doi.org/10.1007/s10955-021-02767-5, Commun Math Phys 387:215–235, 2021. https://doi.org/10.1007/s00220-021-04193-w). We rigorously prove the physics prediction on SFF up to an intermediate time scale for a large class of random matrices using a robust method, the multi-resolvent local laws. Beyond Wigner matrices we also consider the monoparametric ensemble and prove that universality of SFF can already be triggered by a single random parameter, supplementing the recently proven Wigner–Dyson universality (Cipolloni et al. in Probab Theory Relat Fields, 2021. https://doi.org/10.1007/s00440-022-01156-7) to larger spectral scales. Remarkably, extensive numerics indicates that our formulas correctly predict the SFF in the entire slope-dip-ramp regime, as customarily called in physics. acknowledgement: "We are grateful to the authors of [25] for sharing with us their insights and preliminary numerical results. We are especially thankful to Stephen Shenker for very valuable advice over several email communications. Helpful comments on the manuscript from Peter Forrester and from the anonymous referees are also acknowledged.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nLászló Erdős: Partially supported by ERC Advanced Grant \"RMTBeyond\" No. 101020331. Dominik Schröder: Supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation." article_processing_charge: Yes (via OA deal) 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. On the spectral form factor for random matrices. Communications in Mathematical Physics. 2023;401:1665-1700. doi:10.1007/s00220-023-04692-y apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). On the spectral form factor for random matrices. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-023-04692-y chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “On the Spectral Form Factor for Random Matrices.” Communications in Mathematical Physics. Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04692-y. ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “On the spectral form factor for random matrices,” Communications in Mathematical Physics, vol. 401. Springer Nature, pp. 1665–1700, 2023. ista: Cipolloni G, Erdös L, Schröder DJ. 2023. On the spectral form factor for random matrices. Communications in Mathematical Physics. 401, 1665–1700. mla: Cipolloni, Giorgio, et al. “On the Spectral Form Factor for Random Matrices.” Communications in Mathematical Physics, vol. 401, Springer Nature, 2023, pp. 1665–700, doi:10.1007/s00220-023-04692-y. short: G. Cipolloni, L. Erdös, D.J. Schröder, Communications in Mathematical Physics 401 (2023) 1665–1700. date_created: 2023-04-02T22:01:11Z date_published: 2023-07-01T00:00:00Z date_updated: 2023-10-04T12:10:31Z day: '01' ddc: - '510' department: - _id: LaEr doi: 10.1007/s00220-023-04692-y ec_funded: 1 external_id: isi: - '000957343500001' file: - access_level: open_access checksum: 72057940f76654050ca84a221f21786c content_type: application/pdf creator: dernst date_created: 2023-10-04T12:09:18Z date_updated: 2023-10-04T12:09:18Z file_id: '14397' file_name: 2023_CommMathPhysics_Cipolloni.pdf file_size: 859967 relation: main_file success: 1 file_date_updated: 2023-10-04T12:09:18Z has_accepted_license: '1' intvolume: ' 401' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 1665-1700 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Communications in Mathematical Physics publication_identifier: eissn: - 1432-0916 issn: - 0010-3616 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: On the spectral form factor for random matrices 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: 401 year: '2023' ... --- _id: '12709' abstract: - lang: eng text: Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. acknowledgement: We thank the anonymous reviewers for many helpful comments and suggestions, which led to substantial improvements of the paper. The first two authors were supported by the Austrian Science Fund (FWF) grant number P 29984-N35 and W1230. The first author was partly supported by an Austrian Marshall Plan Scholarship, and by the Brummer & Partners MathDataLab. A conference version of this paper was presented at the 37th International Symposium on Computational Geometry (SoCG 2021). Open access funding provided by the Royal Institute of Technology. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: René full_name: Corbet, René last_name: Corbet - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Michael full_name: Lesnick, Michael last_name: Lesnick - first_name: Georg F full_name: Osang, Georg F id: 464B40D6-F248-11E8-B48F-1D18A9856A87 last_name: Osang orcid: 0000-0002-8882-5116 citation: ama: Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. Discrete and Computational Geometry. 2023;70:376-405. doi:10.1007/s00454-022-00476-8 apa: Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2023). Computing the multicover bifiltration. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00476-8 chicago: Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00476-8. ieee: R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 376–405, 2023. ista: Corbet R, Kerber M, Lesnick M, Osang GF. 2023. Computing the multicover bifiltration. Discrete and Computational Geometry. 70, 376–405. mla: Corbet, René, et al. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 376–405, doi:10.1007/s00454-022-00476-8. short: R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, Discrete and Computational Geometry 70 (2023) 376–405. date_created: 2023-03-05T23:01:06Z date_published: 2023-09-01T00:00:00Z date_updated: 2023-10-04T12:03:40Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s00454-022-00476-8 external_id: arxiv: - '2103.07823' isi: - '000936496800001' file: - access_level: open_access checksum: 71ce7e59f7ee4620acc704fecca620c2 content_type: application/pdf creator: cchlebak date_created: 2023-03-07T14:40:14Z date_updated: 2023-03-07T14:40:14Z file_id: '12715' file_name: 2023_DisCompGeo_Corbet.pdf file_size: 1359323 relation: main_file success: 1 file_date_updated: 2023-03-07T14:40:14Z has_accepted_license: '1' intvolume: ' 70' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 376-405 publication: Discrete and Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '9605' relation: earlier_version status: public scopus_import: '1' status: public title: Computing the multicover bifiltration 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: 70 year: '2023' ... --- _id: '12763' abstract: - lang: eng text: 'Kleinjohann (Archiv der Mathematik 35(1):574–582, 1980; Mathematische Zeitschrift 176(3), 327–344, 1981) and Bangert (Archiv der Mathematik 38(1):54–57, 1982) extended the reach rch(S) from subsets S of Euclidean space to the reach rchM(S) of subsets S of Riemannian manifolds M, where M is smooth (we’ll assume at least C3). Bangert showed that sets of positive reach in Euclidean space and Riemannian manifolds are very similar. In this paper we introduce a slight variant of Kleinjohann’s and Bangert’s extension and quantify the similarity between sets of positive reach in Euclidean space and Riemannian manifolds in a new way: Given p∈M and q∈S, we bound the local feature size (a local version of the reach) of its lifting to the tangent space via the inverse exponential map (exp−1p(S)) at q, assuming that rchM(S) and the geodesic distance dM(p,q) are bounded. These bounds are motivated by the importance of the reach and local feature size to manifold learning, topological inference, and triangulating manifolds and the fact that intrinsic approaches circumvent the curse of dimensionality.' acknowledgement: "We thank Eddie Aamari, David Cohen-Steiner, Isa Costantini, Fred Chazal, Ramsay Dyer, André Lieutier, and Alef Sterk for discussion and Pierre Pansu for encouragement. We further acknowledge the anonymous reviewers whose comments helped improve the exposition.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). The first author is further supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. The second author is supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 and the Austrian science fund (FWF) M-3073." article_processing_charge: No article_type: original author: - first_name: Jean Daniel full_name: Boissonnat, Jean Daniel last_name: Boissonnat - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Boissonnat JD, Wintraecken M. The reach of subsets of manifolds. Journal of Applied and Computational Topology. 2023;7:619-641. doi:10.1007/s41468-023-00116-x apa: Boissonnat, J. D., & Wintraecken, M. (2023). The reach of subsets of manifolds. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-023-00116-x chicago: Boissonnat, Jean Daniel, and Mathijs Wintraecken. “The Reach of Subsets of Manifolds.” Journal of Applied and Computational Topology. Springer Nature, 2023. https://doi.org/10.1007/s41468-023-00116-x. ieee: J. D. Boissonnat and M. Wintraecken, “The reach of subsets of manifolds,” Journal of Applied and Computational Topology, vol. 7. Springer Nature, pp. 619–641, 2023. ista: Boissonnat JD, Wintraecken M. 2023. The reach of subsets of manifolds. Journal of Applied and Computational Topology. 7, 619–641. mla: Boissonnat, Jean Daniel, and Mathijs Wintraecken. “The Reach of Subsets of Manifolds.” Journal of Applied and Computational Topology, vol. 7, Springer Nature, 2023, pp. 619–41, doi:10.1007/s41468-023-00116-x. short: J.D. Boissonnat, M. Wintraecken, Journal of Applied and Computational Topology 7 (2023) 619–641. date_created: 2023-03-26T22:01:08Z date_published: 2023-09-01T00:00:00Z date_updated: 2023-10-04T12:07:18Z day: '01' department: - _id: HeEd doi: 10.1007/s41468-023-00116-x ec_funded: 1 intvolume: ' 7' language: - iso: eng main_file_link: - open_access: '1' url: https://inserm.hal.science/INRIA-SACLAY/hal-04083524v1 month: '09' oa: 1 oa_version: Submitted Version page: 619-641 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses publication: Journal of Applied and Computational Topology publication_identifier: eissn: - 2367-1734 issn: - 2367-1726 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: The reach of subsets of manifolds type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2023' ... --- _id: '13221' abstract: - lang: eng text: The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications. acknowledgement: We thank Christof Löding for pointing us to some results on PSpace-hardess of universality problems and the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093 and the Israel Science Foundation grant 2410/22. alternative_title: - LIPIcs article_number: '17' article_processing_charge: No author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Nicolas Adrien full_name: Mazzocchi, Nicolas Adrien id: b26baa86-3308-11ec-87b0-8990f34baa85 last_name: Mazzocchi - first_name: Naci E full_name: Sarac, Naci E id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425 last_name: Sarac citation: ama: 'Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.17' apa: 'Boker, U., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Safety and liveness of quantitative automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17' chicago: Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17. ieee: U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness of quantitative automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279. ista: 'Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness of quantitative automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17.' mla: Boker, Udi, et al. “Safety and Liveness of Quantitative Automata.” 34th International Conference on Concurrency Theory, vol. 279, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.17. short: U. Boker, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. conference: end_date: 2023-09-23 location: Antwerp, Belgium name: 'CONCUR: Conference on Concurrency Theory' start_date: 2023-09-18 date_created: 2023-07-14T10:00:15Z date_published: 2023-09-01T00:00:00Z date_updated: 2023-10-09T07:14:03Z day: '01' ddc: - '000' department: - _id: GradSch - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2023.17 ec_funded: 1 external_id: arxiv: - '2307.06016' file: - access_level: open_access checksum: d40e57a04448ea5c77d7e1cfb9590a81 content_type: application/pdf creator: esarac date_created: 2023-07-14T12:03:48Z date_updated: 2023-07-14T12:03:48Z file_id: '13224' file_name: CONCUR23.pdf file_size: 755529 relation: main_file success: 1 file_date_updated: 2023-07-14T12:03:48Z has_accepted_license: '1' intvolume: ' 279' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 34th International Conference on Concurrency Theory publication_identifier: eissn: - 1868-8969 isbn: - '9783959772990' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' status: public title: Safety and liveness of quantitative automata 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: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 279 year: '2023' ... --- _id: '14406' abstract: - lang: eng text: "Recently, a concept of generalized multifractality, which characterizes fluctuations and correlations of critical eigenstates, was introduced and explored for all 10 symmetry classes of disordered systems. Here, by using the nonlinear sigma-model (\r\nNL\r\nσ\r\nM\r\n) field theory, we extend the theory of generalized multifractality to boundaries of systems at criticality. Our numerical simulations on two-dimensional systems of symmetry classes A, C, and AII fully confirm the analytical predictions of pure-scaling observables and Weyl symmetry relations between critical exponents of surface generalized multifractality. This demonstrates the validity of the \r\nNL\r\nσ\r\nM\r\n for the description of Anderson-localization critical phenomena, not only in the bulk but also on the boundary. The critical exponents strongly violate generalized parabolicity, in analogy with earlier results for the bulk, corroborating the conclusion that the considered Anderson-localization critical points are not described by conformal field theories. We further derive relations between generalized surface multifractal spectra and linear combinations of Lyapunov exponents of a strip in quasi-one-dimensional geometry, which hold under the assumption of invariance with respect to a logarithmic conformal map. Our numerics demonstrate that these relations hold with an excellent accuracy. Taken together, our results indicate an intriguing situation: the conformal invariance is broken but holds partially at critical points of Anderson localization." acknowledgement: "We thank Ilya Gruzberg for many illuminating discussions. S.S.B., J.F.K., and A.D.M. acknowledge support by the Deutsche Forschungsgemeinschaft (DFG) via the Grant\r\nNo. MI 658/14-1. I.S.B. acknowledges support from Russian Science Foundation (Grant No. 22-42-04416)." article_number: '104205' article_processing_charge: No article_type: original author: - first_name: Serafim full_name: Babkin, Serafim id: 41e64307-6672-11ee-b9ad-cc7a0075a479 last_name: Babkin orcid: 0009-0003-7382-8036 - first_name: Jonas F. full_name: Karcher, Jonas F. last_name: Karcher - first_name: Igor S. full_name: Burmistrov, Igor S. last_name: Burmistrov - first_name: Alexander D. full_name: Mirlin, Alexander D. last_name: Mirlin citation: ama: Babkin S, Karcher JF, Burmistrov IS, Mirlin AD. Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. 2023;108(10). doi:10.1103/PhysRevB.108.104205 apa: Babkin, S., Karcher, J. F., Burmistrov, I. S., & Mirlin, A. D. (2023). Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.108.104205 chicago: Babkin, Serafim, Jonas F. Karcher, Igor S. Burmistrov, and Alexander D. Mirlin. “Generalized Surface Multifractality in Two-Dimensional Disordered Systems.” Physical Review B. American Physical Society, 2023. https://doi.org/10.1103/PhysRevB.108.104205. ieee: S. Babkin, J. F. Karcher, I. S. Burmistrov, and A. D. Mirlin, “Generalized surface multifractality in two-dimensional disordered systems,” Physical Review B, vol. 108, no. 10. American Physical Society, 2023. ista: Babkin S, Karcher JF, Burmistrov IS, Mirlin AD. 2023. Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. 108(10), 104205. mla: Babkin, Serafim, et al. “Generalized Surface Multifractality in Two-Dimensional Disordered Systems.” Physical Review B, vol. 108, no. 10, 104205, American Physical Society, 2023, doi:10.1103/PhysRevB.108.104205. short: S. Babkin, J.F. Karcher, I.S. Burmistrov, A.D. Mirlin, Physical Review B 108 (2023). date_created: 2023-10-08T22:01:17Z date_published: 2023-09-01T00:00:00Z date_updated: 2023-10-09T07:09:30Z day: '01' department: - _id: MaSe doi: 10.1103/PhysRevB.108.104205 external_id: arxiv: - '2306.09455' intvolume: ' 108' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2306.09455 month: '09' oa: 1 oa_version: Preprint publication: Physical Review B publication_identifier: eissn: - 2469-9969 issn: - 2469-9950 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Generalized surface multifractality in two-dimensional disordered systems type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 108 year: '2023' ... --- _id: '14405' abstract: - lang: eng text: We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic formula specifies relations between sequences of variable values in different system executions. Unlike HyperLTL, hypernode logic takes an asynchronous view on execution traces by constraining the values and the order of value changes of each variable without correlating the timing of the changes. Different execution traces are synchronized solely through the transitions of hypernode automata. Hypernode automata naturally combine asynchronicity at the node level with synchronicity at the transition level. We show that the model-checking problem for hypernode automata is decidable over action-labeled Kripke structures, whose actions induce transitions of the specification automata. For this reason, hypernode automaton is a suitable formalism for specifying and verifying asynchronous hyperproperties, such as declassifying observational determinism in multi-threaded programs. acknowledgement: "This work was supported in part by the Austrian Science Fund (FWF) SFB project\r\nSpyCoDe F8502, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant\r\nVAMOS 101020093." alternative_title: - LIPIcs article_number: '21' article_processing_charge: Yes author: - first_name: Ezio full_name: Bartocci, Ezio last_name: Bartocci - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Dejan full_name: Nickovic, Dejan id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87 last_name: Nickovic - first_name: Ana full_name: Oliveira da Costa, Ana id: f347ec37-6676-11ee-b395-a888cb7b4fb4 last_name: Oliveira da Costa orcid: 0000-0002-8741-5799 citation: ama: 'Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.21' apa: 'Bartocci, E., Henzinger, T. A., Nickovic, D., & Oliveira da Costa, A. (2023). Hypernode automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21' chicago: Bartocci, Ezio, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21. ieee: E. Bartocci, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279. ista: 'Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. 2023. Hypernode automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 21.' mla: Bartocci, Ezio, et al. “Hypernode Automata.” 34th International Conference on Concurrency Theory, vol. 279, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.21. short: E. Bartocci, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. conference: end_date: 2023-09-22 location: Antwerp, Belgium name: 'CONCUR: Conference on Concurrency Theory' start_date: 2023-09-19 date_created: 2023-10-08T22:01:16Z date_published: 2023-09-01T00:00:00Z date_updated: 2023-10-09T07:43:44Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2023.21 ec_funded: 1 external_id: arxiv: - '2305.02836' file: - access_level: open_access checksum: 215765e40454d806174ac0a223e8d6fa content_type: application/pdf creator: dernst date_created: 2023-10-09T07:42:45Z date_updated: 2023-10-09T07:42:45Z file_id: '14413' file_name: 2023_LIPcs_Bartocci.pdf file_size: 795790 relation: main_file success: 1 file_date_updated: 2023-10-09T07:42:45Z has_accepted_license: '1' intvolume: ' 279' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 34th International Conference on Concurrency Theory publication_identifier: isbn: - '9783959772990' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Hypernode automata 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: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 279 year: '2023' ... --- _id: '14408' abstract: - lang: eng text: "We prove that the mesoscopic linear statistics ∑if(na(σi−z0)) of the eigenvalues {σi}i of large n×n non-Hermitian random matrices with complex centred i.i.d. entries are asymptotically Gaussian for any H20-functions f around any point z0 in the bulk of the spectrum on any mesoscopic scale 0Probability Theory and Related Fields. 2023. doi:10.1007/s00440-023-01229-1 apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields. Springer Nature. https://doi.org/10.1007/s00440-023-01229-1 chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Mesoscopic Central Limit Theorem for Non-Hermitian Random Matrices.” Probability Theory and Related Fields. Springer Nature, 2023. https://doi.org/10.1007/s00440-023-01229-1. ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Mesoscopic central limit theorem for non-Hermitian random matrices,” Probability Theory and Related Fields. Springer Nature, 2023. ista: Cipolloni G, Erdös L, Schröder DJ. 2023. Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields. mla: Cipolloni, Giorgio, et al. “Mesoscopic Central Limit Theorem for Non-Hermitian Random Matrices.” Probability Theory and Related Fields, Springer Nature, 2023, doi:10.1007/s00440-023-01229-1. short: G. Cipolloni, L. Erdös, D.J. Schröder, Probability Theory and Related Fields (2023). date_created: 2023-10-08T22:01:17Z date_published: 2023-09-28T00:00:00Z date_updated: 2023-10-09T07:19:01Z day: '28' department: - _id: LaEr doi: 10.1007/s00440-023-01229-1 external_id: arxiv: - '2210.12060' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2210.12060 month: '09' oa: 1 oa_version: Preprint publication: Probability Theory and Related Fields publication_identifier: eissn: - 1432-2064 issn: - 0178-8051 publication_status: epub_ahead publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Mesoscopic central limit theorem for non-Hermitian random matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '14417' abstract: - lang: eng text: Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. In the most general case, the problem is decidable subject to Shanuel’s conjecture. If all inputs are rational, the resulting threshold problem can be solved using algebraic numbers, leading to decidability via a polynomial-time reduction to the existential theory of the reals. Further restrictions on the encoding of the input allow the solution of the threshold problem in NP∩coNP. Finally, an approximation algorithm for the optimal value of ERisk is provided. acknowledgement: "This work was partly funded by the ERC CoG 863818 (ForM-SMArt), the DFG Grant\r\n389792660 as part of TRR 248 (Foundations of Perspicuous Software Systems), the Cluster of\r\nExcellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy), and the DFG projects BA-1679/11-1 and BA-1679/12-1." alternative_title: - LIPIcs article_number: '15' article_processing_charge: Yes author: - first_name: Christel full_name: Baier, Christel last_name: Baier - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: Jakob full_name: Piribauer, Jakob last_name: Piribauer citation: ama: 'Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: 48th International Symposium on Mathematical Foundations of Computer Science. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.MFCS.2023.15' apa: 'Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.15' chicago: Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.MFCS.2023.15. ieee: C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272. ista: 'Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2023. Entropic risk for turn-based stochastic games. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15.' mla: Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” 48th International Symposium on Mathematical Foundations of Computer Science, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.MFCS.2023.15. short: C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, in:, 48th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. conference: end_date: 2023-09-01 location: Bordeaux, France name: 'MFCS: Symposium on Mathematical Foundations of Computer Science' start_date: 2023-08-28 date_created: 2023-10-09T09:21:05Z date_published: 2023-08-21T00:00:00Z date_updated: 2023-10-09T09:22:37Z day: '21' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2023.15 ec_funded: 1 external_id: arxiv: - '2307.06611' file: - access_level: open_access checksum: 402281b17ed669bbf149d0fdf68ac201 content_type: application/pdf creator: dernst date_created: 2023-10-09T09:19:11Z date_updated: 2023-10-09T09:19:11Z file_id: '14418' file_name: 2023_LIPIcsMFCS_Baier.pdf file_size: 826843 relation: main_file success: 1 file_date_updated: 2023-10-09T09:19:11Z has_accepted_license: '1' intvolume: ' 272' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: 48th International Symposium on Mathematical Foundations of Computer Science publication_identifier: eissn: - 1868-8969 isbn: - '9783959772921' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Entropic risk for turn-based stochastic games 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: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 272 year: '2023' ... --- _id: '12960' abstract: - lang: eng text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e., submanifolds of Rd defined as the zero set of some multivariate multivalued smooth function f:Rd→Rd−n, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M=f−1(0) is to consider its piecewise linear (PL) approximation M^\r\n based on a triangulation T of the ambient space Rd. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ=1/D (and unavoidably exponential in n). Since it is known that for δ=Ω(d2.5), M^ is O(D2)-close and isotopic to M\r\n, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M^ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. " acknowledgement: The authors have received funding from the European Research Council under the European Union's ERC grant greement 339025 GUDHI (Algorithmic Foundations of Geometric Un-derstanding in Higher Dimensions). The first author was supported by the French government,through the 3IA C\^ote d'Azur Investments in the Future project managed by the National ResearchAgency (ANR) with the reference ANR-19-P3IA-0002. The third author was supported by the Eu-ropean Union's Horizon 2020 research and innovation programme under the Marie Sk\lodowska-Curiegrant agreement 754411 and the FWF (Austrian Science Fund) grant M 3073. article_processing_charge: No article_type: original author: - first_name: Jean Daniel full_name: Boissonnat, Jean Daniel last_name: Boissonnat - first_name: Siargey full_name: Kachanovich, Siargey last_name: Kachanovich - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Boissonnat JD, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. 2023;52(2):452-486. doi:10.1137/21M1412918 apa: Boissonnat, J. D., Kachanovich, S., & Wintraecken, M. (2023). Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1412918 chicago: Boissonnat, Jean Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/21M1412918. ieee: J. D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations,” SIAM Journal on Computing, vol. 52, no. 2. Society for Industrial and Applied Mathematics, pp. 452–486, 2023. ista: Boissonnat JD, Kachanovich S, Wintraecken M. 2023. Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. 52(2), 452–486. mla: Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.” SIAM Journal on Computing, vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86, doi:10.1137/21M1412918. short: J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing 52 (2023) 452–486. date_created: 2023-05-14T22:01:00Z date_published: 2023-04-30T00:00:00Z date_updated: 2023-10-10T07:34:35Z day: '30' department: - _id: HeEd doi: 10.1137/21M1412918 ec_funded: 1 external_id: isi: - '001013183000012' intvolume: ' 52' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://hal-emse.ccsd.cnrs.fr/3IA-COTEDAZUR/hal-04083489v1 month: '04' oa: 1 oa_version: Submitted Version page: 452-486 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '9441' relation: earlier_version status: public scopus_import: '1' status: public title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 52 year: '2023' ... --- _id: '13216' abstract: - lang: eng text: Physical catalysts often have multiple sites where reactions can take place. One prominent example is single-atom alloys, where the reactive dopant atoms can preferentially locate in the bulk or at different sites on the surface of the nanoparticle. However, ab initio modeling of catalysts usually only considers one site of the catalyst, neglecting the effects of multiple sites. Here, nanoparticles of copper doped with single-atom rhodium or palladium are modeled for the dehydrogenation of propane. Single-atom alloy nanoparticles are simulated at 400–600 K, using machine learning potentials trained on density functional theory calculations, and then the occupation of different single-atom active sites is identified using a similarity kernel. Further, the turnover frequency for all possible sites is calculated for propane dehydrogenation to propene through microkinetic modeling using density functional theory calculations. The total turnover frequencies of the whole nanoparticle are then described from both the population and the individual turnover frequency of each site. Under operating conditions, rhodium as a dopant is found to almost exclusively occupy (111) surface sites while palladium as a dopant occupies a greater variety of facets. Undercoordinated dopant surface sites are found to tend to be more reactive for propane dehydrogenation compared to the (111) surface. It is found that considering the dynamics of the single-atom alloy nanoparticle has a profound effect on the calculated catalytic activity of single-atom alloys by several orders of magnitude. acknowledgement: "B.C. acknowledges resources provided by the Cambridge Tier2 system operated by the University of Cambridge Research\r\nComputing Service funded by EPSRC Tier-2 capital grant EP/\r\nP020259/1." article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Rhys full_name: Bunting, Rhys id: 91deeae8-1207-11ec-b130-c194ad5b50c6 last_name: Bunting orcid: 0000-0001-6928-074X - first_name: Felix full_name: Wodaczek, Felix id: 8b4b6a9f-32b0-11ee-9fa8-bbe85e26258e last_name: Wodaczek orcid: 0009-0000-1457-795X - first_name: Tina full_name: Torabi, Tina last_name: Torabi - first_name: Bingqing full_name: Cheng, Bingqing id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9 last_name: Cheng orcid: 0000-0002-3584-9632 citation: ama: 'Bunting R, Wodaczek F, Torabi T, Cheng B. Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane. Journal of the American Chemical Society. 2023;145(27):14894-14902. doi:10.1021/jacs.3c04030' apa: 'Bunting, R., Wodaczek, F., Torabi, T., & Cheng, B. (2023). Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.3c04030' chicago: 'Bunting, Rhys, Felix Wodaczek, Tina Torabi, and Bingqing Cheng. “Reactivity of Single-Atom Alloy Nanoparticles: Modeling the Dehydrogenation of Propane.” Journal of the American Chemical Society. American Chemical Society, 2023. https://doi.org/10.1021/jacs.3c04030.' ieee: 'R. Bunting, F. Wodaczek, T. Torabi, and B. Cheng, “Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane,” Journal of the American Chemical Society, vol. 145, no. 27. American Chemical Society, pp. 14894–14902, 2023.' ista: 'Bunting R, Wodaczek F, Torabi T, Cheng B. 2023. Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane. Journal of the American Chemical Society. 145(27), 14894–14902.' mla: 'Bunting, Rhys, et al. “Reactivity of Single-Atom Alloy Nanoparticles: Modeling the Dehydrogenation of Propane.” Journal of the American Chemical Society, vol. 145, no. 27, American Chemical Society, 2023, pp. 14894–902, doi:10.1021/jacs.3c04030.' short: R. Bunting, F. Wodaczek, T. Torabi, B. Cheng, Journal of the American Chemical Society 145 (2023) 14894–14902. date_created: 2023-07-12T09:16:40Z date_published: 2023-06-30T00:00:00Z date_updated: 2023-10-11T08:45:10Z day: '30' ddc: - '540' department: - _id: MaIb - _id: BiCh doi: 10.1021/jacs.3c04030 external_id: isi: - '001020623900001' pmid: - '37390457' file: - access_level: open_access checksum: e07d5323f9c0e5cbd1ad6453f29440ab content_type: application/pdf creator: cchlebak date_created: 2023-07-12T10:22:04Z date_updated: 2023-07-12T10:22:04Z file_id: '13219' file_name: 2023_JACS_Bunting.pdf file_size: 3155843 relation: main_file success: 1 file_date_updated: 2023-07-12T10:22:04Z has_accepted_license: '1' intvolume: ' 145' isi: 1 issue: '27' keyword: - Colloid and Surface Chemistry - Biochemistry - General Chemistry - Catalysis language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 14894-14902 pmid: 1 publication: Journal of the American Chemical Society publication_identifier: eissn: - 1520-5126 issn: - 0002-7863 publication_status: published publisher: American Chemical Society quality_controlled: '1' status: public title: 'Reactivity of single-atom alloy nanoparticles: Modeling the dehydrogenation of propane' 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: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 145 year: '2023' ... --- _id: '14426' abstract: - lang: eng text: To meet the physiological demands of the body, organs need to establish a functional tissue architecture and adequate size as the embryo develops to adulthood. In the liver, uni- and bipotent progenitor differentiation into hepatocytes and biliary epithelial cells (BECs), and their relative proportions, comprise the functional architecture. Yet, the contribution of individual liver progenitors at the organ level to both fates, and their specific proportion, is unresolved. Combining mathematical modelling with organ-wide, multispectral FRaeppli-NLS lineage tracing in zebrafish, we demonstrate that a precise BEC-to-hepatocyte ratio is established (i) fast, (ii) solely by heterogeneous lineage decisions from uni- and bipotent progenitors, and (iii) independent of subsequent cell type–specific proliferation. Extending lineage tracing to adulthood determined that embryonic cells undergo spatially heterogeneous three-dimensional growth associated with distinct environments. Strikingly, giant clusters comprising almost half a ventral lobe suggest lobe-specific dominant-like growth behaviours. We show substantial hepatocyte polyploidy in juveniles representing another hallmark of postembryonic liver growth. Our findings uncover heterogeneous progenitor contributions to tissue architecture-defining cell type proportions and postembryonic organ growth as key mechanisms forming the adult liver. acknowledgement: "We thank the Ober group for discussion and comments on the manuscript. We are grateful to\r\nDr. F. Lemaigre for feedback on the manuscript and Dr. T. Piotrowski for invaluable support.\r\nWe thank the department of experimental medicine (AEM) in Copenhagen for expert fish\r\ncare. We gratefully acknowledge the DanStem Imaging Platform (University of Copenhagen)\r\nfor support and assistance in this work.\r\nThis work is supported by Novo Nordisk Foundation grant NNF17CC0027852 (EAO);\r\nNordisk Foundation grant NNF19OC0058327 (EAO); Novo Nordisk Foundation grant\r\nNNF17OC0031204 (PRL); https://novonordiskfonden.dk/en/; Danish National\r\nResearch Foundation grant DNRF116 (EAO and AT); https://dg.dk/en/; John and Birthe Meyer\r\nFoundation (PRL) and European Research Council (ERC) under the EU Horizon 2020 research and Innovation Programme Grant Agreement No. 851288 (EH)." article_number: e3002315 article_processing_charge: No article_type: original author: - first_name: Iris A. full_name: Unterweger, Iris A. last_name: Unterweger - first_name: Julie full_name: Klepstad, Julie last_name: Klepstad - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 - first_name: Pia R. full_name: Lundegaard, Pia R. last_name: Lundegaard - first_name: Ala full_name: Trusina, Ala last_name: Trusina - first_name: Elke A. full_name: Ober, Elke A. last_name: Ober citation: ama: Unterweger IA, Klepstad J, Hannezo EB, Lundegaard PR, Trusina A, Ober EA. Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics. PLoS Biology. 2023;21(10). doi:10.1371/journal.pbio.3002315 apa: Unterweger, I. A., Klepstad, J., Hannezo, E. B., Lundegaard, P. R., Trusina, A., & Ober, E. A. (2023). Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3002315 chicago: Unterweger, Iris A., Julie Klepstad, Edouard B Hannezo, Pia R. Lundegaard, Ala Trusina, and Elke A. Ober. “Lineage Tracing Identifies Heterogeneous Hepatoblast Contribution to Cell Lineages and Postembryonic Organ Growth Dynamics.” PLoS Biology. Public Library of Science, 2023. https://doi.org/10.1371/journal.pbio.3002315. ieee: I. A. Unterweger, J. Klepstad, E. B. Hannezo, P. R. Lundegaard, A. Trusina, and E. A. Ober, “Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics,” PLoS Biology, vol. 21, no. 10. Public Library of Science, 2023. ista: Unterweger IA, Klepstad J, Hannezo EB, Lundegaard PR, Trusina A, Ober EA. 2023. Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics. PLoS Biology. 21(10), e3002315. mla: Unterweger, Iris A., et al. “Lineage Tracing Identifies Heterogeneous Hepatoblast Contribution to Cell Lineages and Postembryonic Organ Growth Dynamics.” PLoS Biology, vol. 21, no. 10, e3002315, Public Library of Science, 2023, doi:10.1371/journal.pbio.3002315. short: I.A. Unterweger, J. Klepstad, E.B. Hannezo, P.R. Lundegaard, A. Trusina, E.A. Ober, PLoS Biology 21 (2023). date_created: 2023-10-15T22:01:10Z date_published: 2023-10-04T00:00:00Z date_updated: 2023-10-16T07:25:48Z day: '04' ddc: - '570' department: - _id: EdHa doi: 10.1371/journal.pbio.3002315 ec_funded: 1 file: - access_level: open_access checksum: 40a2b11b41d70a0e5939f8a52b66e389 content_type: application/pdf creator: dernst date_created: 2023-10-16T07:20:49Z date_updated: 2023-10-16T07:20:49Z file_id: '14431' file_name: 2023_PloSBiology_Unterweger.pdf file_size: 6193110 relation: main_file success: 1 file_date_updated: 2023-10-16T07:20:49Z has_accepted_license: '1' intvolume: ' 21' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 05943252-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '851288' name: Design Principles of Branching Morphogenesis publication: PLoS Biology publication_identifier: eissn: - 1545-7885 publication_status: published publisher: Public Library of Science quality_controlled: '1' related_material: link: - relation: software url: https://github.com/JulieKlepstad/LiverDevelopment scopus_import: '1' status: public title: Lineage tracing identifies heterogeneous hepatoblast contribution to cell lineages and postembryonic organ growth dynamics 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: 21 year: '2023' ... --- _id: '14428' abstract: - lang: eng text: "Suppose we have two hash functions h1 and h2, but we trust the security of only one of them. To mitigate this worry, we wish to build a hash combiner Ch1,h2 which is secure so long as one of the underlying hash functions is. This question has been well-studied in the regime of collision resistance. In this case, concatenating the two hash function outputs clearly works. Unfortunately, a long series of works (Boneh and Boyen, CRYPTO’06; Pietrzak, Eurocrypt’07; Pietrzak, CRYPTO’08) showed no (noticeably) shorter combiner for collision resistance is possible.\r\nIn this work, we revisit this pessimistic state of affairs, motivated by the observation that collision-resistance is insufficient for many interesting applications of cryptographic hash functions anyway. We argue the right formulation of the “hash combiner” is to build what we call random oracle (RO) combiners, utilizing stronger assumptions for stronger constructions.\r\nIndeed, we circumvent the previous lower bounds for collision resistance by constructing a simple length-preserving RO combiner C˜h1,h2Z1,Z2(M)=h1(M,Z1)⊕h2(M,Z2),where Z1,Z2\r\n are random salts of appropriate length. We show that this extra randomness is necessary for RO combiners, and indeed our construction is somewhat tight with this lower bound.\r\nOn the negative side, we show that one cannot generically apply the composition theorem to further replace “monolithic” hash functions h1 and h2 by some simpler indifferentiable construction (such as the Merkle-Damgård transformation) from smaller components, such as fixed-length compression functions. Finally, despite this issue, we directly prove collision resistance of the Merkle-Damgård variant of our combiner, where h1 and h2 are replaced by iterative Merkle-Damgård hashes applied to a fixed-length compression function. Thus, we can still subvert the concatenation barrier for collision-resistance combiners while utilizing practically small fixed-length components underneath." alternative_title: - LNCS article_processing_charge: No author: - first_name: Yevgeniy full_name: Dodis, Yevgeniy last_name: Dodis - first_name: Niels full_name: Ferguson, Niels last_name: Ferguson - first_name: Eli full_name: Goldin, Eli last_name: Goldin - first_name: Peter full_name: Hall, Peter last_name: Hall - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Dodis Y, Ferguson N, Goldin E, Hall P, Pietrzak KZ. Random oracle combiners: Breaking the concatenation barrier for collision-resistance. In: 43rd Annual International Cryptology Conference. Vol 14082. Springer Nature; 2023:514-546. doi:10.1007/978-3-031-38545-2_17' apa: 'Dodis, Y., Ferguson, N., Goldin, E., Hall, P., & Pietrzak, K. Z. (2023). Random oracle combiners: Breaking the concatenation barrier for collision-resistance. In 43rd Annual International Cryptology Conference (Vol. 14082, pp. 514–546). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-38545-2_17' chicago: 'Dodis, Yevgeniy, Niels Ferguson, Eli Goldin, Peter Hall, and Krzysztof Z Pietrzak. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.” In 43rd Annual International Cryptology Conference, 14082:514–46. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-38545-2_17.' ieee: 'Y. Dodis, N. Ferguson, E. Goldin, P. Hall, and K. Z. Pietrzak, “Random oracle combiners: Breaking the concatenation barrier for collision-resistance,” in 43rd Annual International Cryptology Conference, Santa Barbara, CA, United States, 2023, vol. 14082, pp. 514–546.' ista: 'Dodis Y, Ferguson N, Goldin E, Hall P, Pietrzak KZ. 2023. Random oracle combiners: Breaking the concatenation barrier for collision-resistance. 43rd Annual International Cryptology Conference. CRYPTO: Advances in Cryptology, LNCS, vol. 14082, 514–546.' mla: 'Dodis, Yevgeniy, et al. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.” 43rd Annual International Cryptology Conference, vol. 14082, Springer Nature, 2023, pp. 514–46, doi:10.1007/978-3-031-38545-2_17.' short: Y. Dodis, N. Ferguson, E. Goldin, P. Hall, K.Z. Pietrzak, in:, 43rd Annual International Cryptology Conference, Springer Nature, 2023, pp. 514–546. conference: end_date: 2023-08-24 location: Santa Barbara, CA, United States name: 'CRYPTO: Advances in Cryptology' start_date: 2023-08-20 date_created: 2023-10-15T22:01:11Z date_published: 2023-08-09T00:00:00Z date_updated: 2023-10-16T08:02:11Z day: '09' department: - _id: KrPi doi: 10.1007/978-3-031-38545-2_17 intvolume: ' 14082' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2023/1041 month: '08' oa: 1 oa_version: Preprint page: 514-546 publication: 43rd Annual International Cryptology Conference publication_identifier: eissn: - 1611-3349 isbn: - '9783031385445' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: 'Random oracle combiners: Breaking the concatenation barrier for collision-resistance' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14082 year: '2023' ... --- _id: '12406' abstract: - lang: eng text: Let X be a sufficiently large positive integer. We prove that one may choose a subset S of primes with cardinality O(logX) such that a positive proportion of integers less than X can be represented by x2+py2 for at least one p∈S. acknowledgement: "This article is a version the author’s master thesis at the University of Bonn. The author would like to thank his advisor Valentin Blomer for introducing the problem, and giving generous feedback and encouragement along the way, especially during the global pandemic.\r\nThe author thanks Edgar Assing for his lectures on analytic number theory. Finally, the author is grateful to the anonymous referees for their valuable time and comments.\r\n" article_processing_charge: No article_type: original author: - first_name: Yijie full_name: Diao, Yijie id: 7b7eb4ca-eb2c-11ec-b98b-accec0b20c3b last_name: Diao orcid: 0000-0002-4989-5330 citation: ama: Diao Y. Density of the union of positive diagonal binary quadratic forms. Acta Arithmetica. 2023;207:1-17. doi:10.4064/aa210830-24-11 apa: Diao, Y. (2023). Density of the union of positive diagonal binary quadratic forms. Acta Arithmetica. Instytut Matematyczny. https://doi.org/10.4064/aa210830-24-11 chicago: Diao, Yijie. “Density of the Union of Positive Diagonal Binary Quadratic Forms.” Acta Arithmetica. Instytut Matematyczny, 2023. https://doi.org/10.4064/aa210830-24-11. ieee: Y. Diao, “Density of the union of positive diagonal binary quadratic forms,” Acta Arithmetica, vol. 207. Instytut Matematyczny, pp. 1–17, 2023. ista: Diao Y. 2023. Density of the union of positive diagonal binary quadratic forms. Acta Arithmetica. 207, 1–17. mla: Diao, Yijie. “Density of the Union of Positive Diagonal Binary Quadratic Forms.” Acta Arithmetica, vol. 207, Instytut Matematyczny, 2023, pp. 1–17, doi:10.4064/aa210830-24-11. short: Y. Diao, Acta Arithmetica 207 (2023) 1–17. date_created: 2023-01-26T21:17:04Z date_published: 2023-01-09T00:00:00Z date_updated: 2023-10-17T09:15:17Z day: '09' department: - _id: GradSch doi: 10.4064/aa210830-24-11 external_id: arxiv: - '2103.08268' isi: - '000912903000001' intvolume: ' 207' isi: 1 keyword: - Algebra - Number Theory language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2103.08268 month: '01' oa: 1 oa_version: Preprint page: 1-17 publication: Acta Arithmetica publication_identifier: eissn: - 1730-6264 issn: - 0065-1036 publication_status: published publisher: Instytut Matematyczny quality_controlled: '1' status: public title: Density of the union of positive diagonal binary quadratic forms type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 207 year: '2023' ... --- _id: '13200' abstract: - lang: eng text: Recent quantum technologies have established precise quantum control of various microscopic systems using electromagnetic waves. Interfaces based on cryogenic cavity electro-optic systems are particularly promising, due to the direct interaction between microwave and optical fields in the quantum regime. Quantum optical control of superconducting microwave circuits has been precluded so far due to the weak electro-optical coupling as well as quasi-particles induced by the pump laser. Here we report the coherent control of a superconducting microwave cavity using laser pulses in a multimode electro-optical device at millikelvin temperature with near-unity cooperativity. Both the stationary and instantaneous responses of the microwave and optical modes comply with the coherent electro-optical interaction, and reveal only minuscule amount of excess back-action with an unanticipated time delay. Our demonstration enables wide ranges of applications beyond quantum transductions, from squeezing and quantum non-demolition measurements of microwave fields, to entanglement generation and hybrid quantum networks. acknowledgement: This work was supported by the European Research Council under grant agreement no. 758053 (ERC StG QUNNECT), the European Union’s Horizon 2020 research and innovation program under grant agreement no. 899354 (FETopen SuperQuLAN), and the Austrian Science Fund (FWF) through BeyondC (F7105). L.Q. acknowledges generous support from the ISTFELLOW programme. W.H. is the recipient of an ISTplus postdoctoral fellowship with funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement no. 754411. G.A. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria. article_number: '3784' article_processing_charge: No article_type: original author: - first_name: Liu full_name: Qiu, Liu id: 45e99c0d-1eb1-11eb-9b96-ed8ab2983cac last_name: Qiu orcid: 0000-0003-4345-4267 - first_name: Rishabh full_name: Sahu, Rishabh id: 47D26E34-F248-11E8-B48F-1D18A9856A87 last_name: Sahu orcid: 0000-0001-6264-2162 - first_name: William J full_name: Hease, William J id: 29705398-F248-11E8-B48F-1D18A9856A87 last_name: Hease orcid: 0000-0001-9868-2166 - first_name: Georg M full_name: Arnold, Georg M id: 3770C838-F248-11E8-B48F-1D18A9856A87 last_name: Arnold orcid: 0000-0003-1397-7876 - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: Qiu L, Sahu R, Hease WJ, Arnold GM, Fink JM. Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action. Nature Communications. 2023;14. doi:10.1038/s41467-023-39493-3 apa: Qiu, L., Sahu, R., Hease, W. J., Arnold, G. M., & Fink, J. M. (2023). Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action. Nature Communications. Nature Research. https://doi.org/10.1038/s41467-023-39493-3 chicago: Qiu, Liu, Rishabh Sahu, William J Hease, Georg M Arnold, and Johannes M Fink. “Coherent Optical Control of a Superconducting Microwave Cavity via Electro-Optical Dynamical Back-Action.” Nature Communications. Nature Research, 2023. https://doi.org/10.1038/s41467-023-39493-3. ieee: L. Qiu, R. Sahu, W. J. Hease, G. M. Arnold, and J. M. Fink, “Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action,” Nature Communications, vol. 14. Nature Research, 2023. ista: Qiu L, Sahu R, Hease WJ, Arnold GM, Fink JM. 2023. Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action. Nature Communications. 14, 3784. mla: Qiu, Liu, et al. “Coherent Optical Control of a Superconducting Microwave Cavity via Electro-Optical Dynamical Back-Action.” Nature Communications, vol. 14, 3784, Nature Research, 2023, doi:10.1038/s41467-023-39493-3. short: L. Qiu, R. Sahu, W.J. Hease, G.M. Arnold, J.M. Fink, Nature Communications 14 (2023). date_created: 2023-07-09T22:01:11Z date_published: 2023-06-24T00:00:00Z date_updated: 2023-10-17T11:46:12Z day: '24' ddc: - '000' department: - _id: JoFi doi: 10.1038/s41467-023-39493-3 ec_funded: 1 external_id: arxiv: - '2210.12443' isi: - '001018100800002' pmid: - '37355691' file: - access_level: open_access checksum: ec7ccd2c08f90d59cab302fd0d7776a4 content_type: application/pdf creator: alisjak date_created: 2023-07-10T10:10:54Z date_updated: 2023-07-10T10:10:54Z file_id: '13206' file_name: 2023_NatureComms_Qiu.pdf file_size: 1349134 relation: main_file success: 1 file_date_updated: 2023-07-10T10:10:54Z has_accepted_license: '1' intvolume: ' 14' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 26336814-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '758053' name: A Fiber Optic Transceiver for Superconducting Qubits - _id: 9B868D20-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '899354' name: Quantum Local Area Networks with Superconducting Qubits - _id: bdb108fd-d553-11ed-ba76-83dc74a9864f name: QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 2671EB66-B435-11E9-9278-68D0E5697425 name: Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Nature Research quality_controlled: '1' scopus_import: '1' status: public title: Coherent optical control of a superconducting microwave cavity via electro-optical dynamical back-action tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2023' ... --- _id: '13315' abstract: - lang: eng text: How do statistical dependencies in measurement noise influence high-dimensional inference? To answer this, we study the paradigmatic spiked matrix model of principal components analysis (PCA), where a rank-one matrix is corrupted by additive noise. We go beyond the usual independence assumption on the noise entries, by drawing the noise from a low-order polynomial orthogonal matrix ensemble. The resulting noise correlations make the setting relevant for applications but analytically challenging. We provide characterization of the Bayes optimal limits of inference in this model. If the spike is rotation invariant, we show that standard spectral PCA is optimal. However, for more general priors, both PCA and the existing approximate message-passing algorithm (AMP) fall short of achieving the information-theoretic limits, which we compute using the replica method from statistical physics. We thus propose an AMP, inspired by the theory of adaptive Thouless–Anderson–Palmer equations, which is empirically observed to saturate the conjectured theoretical limit. This AMP comes with a rigorous state evolution analysis tracking its performance. Although we focus on specific noise distributions, our methodology can be generalized to a wide class of trace matrix ensembles at the cost of more involved expressions. Finally, despite the seemingly strong assumption of rotation-invariant noise, our theory empirically predicts algorithmic performance on real data, pointing at strong universality properties. acknowledgement: J.B. was funded by the European Union (ERC, CHORAL, project number 101039794). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. M.M. was supported by the 2019 Lopez-Loreta Prize. We would like to thank the reviewers for the insightful comments and, in particular, for suggesting the BAMP-inspired denoisers leading to AMP-AP. article_number: e2302028120 article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Jean full_name: Barbier, Jean last_name: Barbier - first_name: Francesco full_name: Camilli, Francesco last_name: Camilli - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Manuel full_name: Sáenz, Manuel last_name: Sáenz citation: ama: Barbier J, Camilli F, Mondelli M, Sáenz M. Fundamental limits in structured principal component analysis and how to reach them. Proceedings of the National Academy of Sciences of the United States of America. 2023;120(30). doi:10.1073/pnas.2302028120 apa: Barbier, J., Camilli, F., Mondelli, M., & Sáenz, M. (2023). Fundamental limits in structured principal component analysis and how to reach them. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2302028120 chicago: Barbier, Jean, Francesco Camilli, Marco Mondelli, and Manuel Sáenz. “Fundamental Limits in Structured Principal Component Analysis and How to Reach Them.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2023. https://doi.org/10.1073/pnas.2302028120. ieee: J. Barbier, F. Camilli, M. Mondelli, and M. Sáenz, “Fundamental limits in structured principal component analysis and how to reach them,” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 30. National Academy of Sciences, 2023. ista: Barbier J, Camilli F, Mondelli M, Sáenz M. 2023. Fundamental limits in structured principal component analysis and how to reach them. Proceedings of the National Academy of Sciences of the United States of America. 120(30), e2302028120. mla: Barbier, Jean, et al. “Fundamental Limits in Structured Principal Component Analysis and How to Reach Them.” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 30, e2302028120, National Academy of Sciences, 2023, doi:10.1073/pnas.2302028120. short: J. Barbier, F. Camilli, M. Mondelli, M. Sáenz, Proceedings of the National Academy of Sciences of the United States of America 120 (2023). date_created: 2023-07-30T22:01:02Z date_published: 2023-07-25T00:00:00Z date_updated: 2023-10-17T11:44:55Z day: '25' ddc: - '000' department: - _id: MaMo doi: 10.1073/pnas.2302028120 external_id: pmid: - '37463204' file: - access_level: open_access checksum: 1fc06228afdb3aa80cf8e7766bcf9dc5 content_type: application/pdf creator: dernst date_created: 2023-07-31T07:30:48Z date_updated: 2023-07-31T07:30:48Z file_id: '13323' file_name: 2023_PNAS_Barbier.pdf file_size: 995933 relation: main_file success: 1 file_date_updated: 2023-07-31T07:30:48Z has_accepted_license: '1' intvolume: ' 120' issue: '30' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' related_material: link: - relation: software url: https://github.com/fcamilli95/Structured-PCA- scopus_import: '1' status: public title: Fundamental limits in structured principal component analysis and how to reach them 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: 120 year: '2023' ... --- _id: '14037' abstract: - lang: eng text: 'Traditionally, nuclear spin is not considered to affect biological processes. Recently, this has changed as isotopic fractionation that deviates from classical mass dependence was reported both in vitro and in vivo. In these cases, the isotopic effect correlates with the nuclear magnetic spin. Here, we show nuclear spin effects using stable oxygen isotopes (16O, 17O, and 18O) in two separate setups: an artificial dioxygen production system and biological aquaporin channels in cells. We observe that oxygen dynamics in chiral environments (in particular its transport) depend on nuclear spin, suggesting future applications for controlled isotope separation to be used, for instance, in NMR. To demonstrate the mechanism behind our findings, we formulate theoretical models based on a nuclear-spin-enhanced switch between electronic spin states. Accounting for the role of nuclear spin in biology can provide insights into the role of quantum effects in living systems and help inspire the development of future biotechnology solutions.' acknowledgement: N.M.-S. acknowledges the support of the Ministry of Energy, Israel, as part of the scholarship program for graduate students in the fields of energy. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). Y.P. acknowledges the support of the Ministry of Innovation, Science and Technology, Israel Grant No. 1001593872. Y.P acknowledges the support of the BSF-NSF 094 Grant No. 2022503. article_number: e2300828120 article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Ofek full_name: Vardi, Ofek last_name: Vardi - first_name: Naama full_name: Maroudas-Sklare, Naama last_name: Maroudas-Sklare - first_name: Yuval full_name: Kolodny, Yuval last_name: Kolodny - first_name: Artem full_name: Volosniev, Artem id: 37D278BC-F248-11E8-B48F-1D18A9856A87 last_name: Volosniev orcid: 0000-0003-0393-5525 - first_name: Amijai full_name: Saragovi, Amijai last_name: Saragovi - first_name: Nir full_name: Galili, Nir last_name: Galili - first_name: Stav full_name: Ferrera, Stav last_name: Ferrera - first_name: Areg full_name: Ghazaryan, Areg id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87 last_name: Ghazaryan orcid: 0000-0001-9666-3543 - first_name: Nir full_name: Yuran, Nir last_name: Yuran - first_name: Hagit P. full_name: Affek, Hagit P. last_name: Affek - first_name: Boaz full_name: Luz, Boaz last_name: Luz - first_name: Yonaton full_name: Goldsmith, Yonaton last_name: Goldsmith - first_name: Nir full_name: Keren, Nir last_name: Keren - first_name: Shira full_name: Yochelis, Shira last_name: Yochelis - first_name: Itay full_name: Halevy, Itay last_name: Halevy - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Yossi full_name: Paltiel, Yossi last_name: Paltiel citation: ama: Vardi O, Maroudas-Sklare N, Kolodny Y, et al. Nuclear spin effects in biological processes. Proceedings of the National Academy of Sciences of the United States of America. 2023;120(32). doi:10.1073/pnas.2300828120 apa: Vardi, O., Maroudas-Sklare, N., Kolodny, Y., Volosniev, A., Saragovi, A., Galili, N., … Paltiel, Y. (2023). Nuclear spin effects in biological processes. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2300828120 chicago: Vardi, Ofek, Naama Maroudas-Sklare, Yuval Kolodny, Artem Volosniev, Amijai Saragovi, Nir Galili, Stav Ferrera, et al. “Nuclear Spin Effects in Biological Processes.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2023. https://doi.org/10.1073/pnas.2300828120. ieee: O. Vardi et al., “Nuclear spin effects in biological processes,” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 32. National Academy of Sciences, 2023. ista: Vardi O, Maroudas-Sklare N, Kolodny Y, Volosniev A, Saragovi A, Galili N, Ferrera S, Ghazaryan A, Yuran N, Affek HP, Luz B, Goldsmith Y, Keren N, Yochelis S, Halevy I, Lemeshko M, Paltiel Y. 2023. Nuclear spin effects in biological processes. Proceedings of the National Academy of Sciences of the United States of America. 120(32), e2300828120. mla: Vardi, Ofek, et al. “Nuclear Spin Effects in Biological Processes.” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 32, e2300828120, National Academy of Sciences, 2023, doi:10.1073/pnas.2300828120. short: O. Vardi, N. Maroudas-Sklare, Y. Kolodny, A. Volosniev, A. Saragovi, N. Galili, S. Ferrera, A. Ghazaryan, N. Yuran, H.P. Affek, B. Luz, Y. Goldsmith, N. Keren, S. Yochelis, I. Halevy, M. Lemeshko, Y. Paltiel, Proceedings of the National Academy of Sciences of the United States of America 120 (2023). date_created: 2023-08-13T22:01:12Z date_published: 2023-07-31T00:00:00Z date_updated: 2023-10-17T11:45:25Z day: '31' ddc: - '530' department: - _id: MiLe doi: 10.1073/pnas.2300828120 ec_funded: 1 external_id: pmid: - '37523549' file: - access_level: open_access checksum: a5ed64788a5acef9b9a300a26fa5a177 content_type: application/pdf creator: dernst date_created: 2023-08-14T07:43:45Z date_updated: 2023-08-14T07:43:45Z file_id: '14047' file_name: 2023_PNAS_Vardi.pdf file_size: 1003092 relation: main_file success: 1 file_date_updated: 2023-08-14T07:43:45Z has_accepted_license: '1' intvolume: ' 120' issue: '32' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2688CF98-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '801770' name: 'Angulon: physics and applications of a new quasiparticle' publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' scopus_import: '1' status: public title: Nuclear spin effects in biological processes tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 120 year: '2023' ... --- _id: '12683' abstract: - lang: eng text: We study the eigenvalue trajectories of a time dependent matrix Gt=H+itvv∗ for t≥0, where H is an N×N Hermitian random matrix and v is a unit vector. In particular, we establish that with high probability, an outlier can be distinguished at all times t>1+N−1/3+ϵ, for any ϵ>0. The study of this natural process combines elements of Hermitian and non-Hermitian analysis, and illustrates some aspects of the intrinsic instability of (even weakly) non-Hermitian matrices. acknowledgement: G. Dubach gratefully acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. L. Erdős is supported by ERC Advanced Grant “RMTBeyond” No. 101020331. article_processing_charge: No article_type: original author: - first_name: Guillaume full_name: Dubach, Guillaume id: D5C6A458-10C4-11EA-ABF4-A4B43DDC885E last_name: Dubach orcid: 0000-0001-6892-8137 - 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 citation: ama: Dubach G, Erdös L. Dynamics of a rank-one perturbation of a Hermitian matrix. Electronic Communications in Probability. 2023;28:1-13. doi:10.1214/23-ECP516 apa: Dubach, G., & Erdös, L. (2023). Dynamics of a rank-one perturbation of a Hermitian matrix. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/23-ECP516 chicago: Dubach, Guillaume, and László Erdös. “Dynamics of a Rank-One Perturbation of a Hermitian Matrix.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2023. https://doi.org/10.1214/23-ECP516. ieee: G. Dubach and L. Erdös, “Dynamics of a rank-one perturbation of a Hermitian matrix,” Electronic Communications in Probability, vol. 28. Institute of Mathematical Statistics, pp. 1–13, 2023. ista: Dubach G, Erdös L. 2023. Dynamics of a rank-one perturbation of a Hermitian matrix. Electronic Communications in Probability. 28, 1–13. mla: Dubach, Guillaume, and László Erdös. “Dynamics of a Rank-One Perturbation of a Hermitian Matrix.” Electronic Communications in Probability, vol. 28, Institute of Mathematical Statistics, 2023, pp. 1–13, doi:10.1214/23-ECP516. short: G. Dubach, L. Erdös, Electronic Communications in Probability 28 (2023) 1–13. date_created: 2023-02-26T23:01:01Z date_published: 2023-02-08T00:00:00Z date_updated: 2023-10-17T12:48:10Z day: '08' ddc: - '510' department: - _id: LaEr doi: 10.1214/23-ECP516 ec_funded: 1 external_id: arxiv: - '2108.13694' isi: - '000950650200005' file: - access_level: open_access checksum: a1c6f0a3e33688fd71309c86a9aad86e content_type: application/pdf creator: dernst date_created: 2023-02-27T09:43:27Z date_updated: 2023-02-27T09:43:27Z file_id: '12692' file_name: 2023_ElectCommProbability_Dubach.pdf file_size: 479105 relation: main_file success: 1 file_date_updated: 2023-02-27T09:43:27Z has_accepted_license: '1' intvolume: ' 28' isi: 1 language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 1-13 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Electronic Communications in Probability publication_identifier: eissn: - 1083-589X publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' scopus_import: '1' status: public title: Dynamics of a rank-one perturbation of a Hermitian matrix 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: 28 year: '2023' ... --- _id: '12761' abstract: - lang: eng text: "We consider the fluctuations of regular functions f of a Wigner matrix W viewed as an entire matrix f (W). Going beyond the well-studied tracial mode, Trf (W), which is equivalent to the customary linear statistics of eigenvalues, we show that Trf (W)A is asymptotically normal for any nontrivial bounded deterministic matrix A. We identify three different and asymptotically independent modes of this fluctuation, corresponding to the tracial part, the traceless diagonal part and the off-diagonal part of f (W) in the entire mesoscopic regime, where we find that the off-diagonal modes fluctuate on a much smaller scale than the tracial mode. As a main motivation to study CLT in such generality on small mesoscopic scales, we determine\r\nthe fluctuations in the eigenstate thermalization hypothesis (Phys. Rev. A 43 (1991) 2046–2049), that is, prove that the eigenfunction overlaps with any deterministic matrix are asymptotically Gaussian after a small spectral averaging. Finally, in the macroscopic regime our result also generalizes (Zh. Mat. Fiz. Anal. Geom. 9 (2013) 536–581, 611, 615) to complex W and to all crossover ensembles in between. The main technical inputs are the recent\r\nmultiresolvent local laws with traceless deterministic matrices from the companion paper (Comm. Math. Phys. 388 (2021) 1005–1048)." acknowledgement: The second author is partially funded by the ERC Advanced Grant “RMTBEYOND” No. 101020331. The third author is supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation. 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. Functional central limit theorems for Wigner matrices. Annals of Applied Probability. 2023;33(1):447-489. doi:10.1214/22-AAP1820 apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). Functional central limit theorems for Wigner matrices. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/22-AAP1820 chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Functional Central Limit Theorems for Wigner Matrices.” Annals of Applied Probability. Institute of Mathematical Statistics, 2023. https://doi.org/10.1214/22-AAP1820. ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Functional central limit theorems for Wigner matrices,” Annals of Applied Probability, vol. 33, no. 1. Institute of Mathematical Statistics, pp. 447–489, 2023. ista: Cipolloni G, Erdös L, Schröder DJ. 2023. Functional central limit theorems for Wigner matrices. Annals of Applied Probability. 33(1), 447–489. mla: Cipolloni, Giorgio, et al. “Functional Central Limit Theorems for Wigner Matrices.” Annals of Applied Probability, vol. 33, no. 1, Institute of Mathematical Statistics, 2023, pp. 447–89, doi:10.1214/22-AAP1820. short: G. Cipolloni, L. Erdös, D.J. Schröder, Annals of Applied Probability 33 (2023) 447–489. date_created: 2023-03-26T22:01:08Z date_published: 2023-02-01T00:00:00Z date_updated: 2023-10-17T12:48:52Z day: '01' department: - _id: LaEr doi: 10.1214/22-AAP1820 ec_funded: 1 external_id: arxiv: - '2012.13218' isi: - '000946432400015' intvolume: ' 33' isi: 1 issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2012.13218 month: '02' oa: 1 oa_version: Preprint page: 447-489 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Annals of Applied Probability publication_identifier: issn: - 1050-5164 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' scopus_import: '1' status: public title: Functional central limit theorems for Wigner matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 33 year: '2023' ... --- _id: '8682' abstract: - lang: eng text: It is known that the Brauer--Manin obstruction to the Hasse principle is vacuous for smooth Fano hypersurfaces of dimension at least 3 over any number field. Moreover, for such varieties it follows from a general conjecture of Colliot-Thélène that the Brauer--Manin obstruction to the Hasse principle should be the only one, so that the Hasse principle is expected to hold. Working over the field of rational numbers and ordering Fano hypersurfaces of fixed degree and dimension by height, we prove that almost every such hypersurface satisfies the Hasse principle provided that the dimension is at least 3. This proves a conjecture of Poonen and Voloch in every case except for cubic surfaces. article_processing_charge: No article_type: original author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Pierre Le full_name: Boudec, Pierre Le last_name: Boudec - first_name: Will full_name: Sawin, Will last_name: Sawin citation: ama: Browning TD, Boudec PL, Sawin W. The Hasse principle for random Fano hypersurfaces. Annals of Mathematics. 2023;197(3):1115-1203. doi:10.4007/annals.2023.197.3.3 apa: Browning, T. D., Boudec, P. L., & Sawin, W. (2023). The Hasse principle for random Fano hypersurfaces. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2023.197.3.3 chicago: Browning, Timothy D, Pierre Le Boudec, and Will Sawin. “The Hasse Principle for Random Fano Hypersurfaces.” Annals of Mathematics. Princeton University, 2023. https://doi.org/10.4007/annals.2023.197.3.3. ieee: T. D. Browning, P. L. Boudec, and W. Sawin, “The Hasse principle for random Fano hypersurfaces,” Annals of Mathematics, vol. 197, no. 3. Princeton University, pp. 1115–1203, 2023. ista: Browning TD, Boudec PL, Sawin W. 2023. The Hasse principle for random Fano hypersurfaces. Annals of Mathematics. 197(3), 1115–1203. mla: Browning, Timothy D., et al. “The Hasse Principle for Random Fano Hypersurfaces.” Annals of Mathematics, vol. 197, no. 3, Princeton University, 2023, pp. 1115–203, doi:10.4007/annals.2023.197.3.3. short: T.D. Browning, P.L. Boudec, W. Sawin, Annals of Mathematics 197 (2023) 1115–1203. date_created: 2020-10-19T14:28:50Z date_published: 2023-05-01T00:00:00Z date_updated: 2023-10-17T12:47:43Z day: '01' department: - _id: TiBr doi: 10.4007/annals.2023.197.3.3 external_id: arxiv: - '2006.02356' isi: - '000966611000003' intvolume: ' 197' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2006.02356 month: '05' oa: 1 oa_version: Preprint page: 1115-1203 publication: Annals of Mathematics publication_identifier: issn: - 0003-486X publication_status: published publisher: Princeton University quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/when-is-necessary-sufficient/ status: public title: The Hasse principle for random Fano hypersurfaces type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 197 year: '2023' ... --- _id: '12706' abstract: - lang: eng text: Allometric settings of population dynamics models are appealing due to their parsimonious nature and broad utility when studying system level effects. Here, we parameterise the size-scaled Rosenzweig-MacArthur differential equations to eliminate prey-mass dependency, facilitating an in depth analytic study of the equations which incorporates scaling parameters’ contributions to coexistence. We define the functional response term to match empirical findings, and examine situations where metabolic theory derivations and observation diverge. The dynamical properties of the Rosenzweig-MacArthur system, encompassing the distribution of size-abundance equilibria, the scaling of period and amplitude of population cycling, and relationships between predator and prey abundances, are consistent with empirical observation. Our parameterisation is an accurate minimal model across 15+ orders of mass magnitude. acknowledgement: "This research was supported by an Australian Government Research Training Program\r\n(RTP) Scholarship to JCM (https://www.dese.gov.au), and LB is supported by the Centre de\r\nrecherche sur le vieillissement Fellowship Program. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript." article_processing_charge: No article_type: original author: - first_name: Jody C. full_name: Mckerral, Jody C. last_name: Mckerral - first_name: Maria full_name: Kleshnina, Maria id: 4E21749C-F248-11E8-B48F-1D18A9856A87 last_name: Kleshnina - first_name: Vladimir full_name: Ejov, Vladimir last_name: Ejov - first_name: Louise full_name: Bartle, Louise last_name: Bartle - first_name: James G. full_name: Mitchell, James G. last_name: Mitchell - first_name: Jerzy A. full_name: Filar, Jerzy A. last_name: Filar citation: ama: Mckerral JC, Kleshnina M, Ejov V, Bartle L, Mitchell JG, Filar JA. Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. 2023;18(2):e0279838. doi:10.1371/journal.pone.0279838 apa: Mckerral, J. C., Kleshnina, M., Ejov, V., Bartle, L., Mitchell, J. G., & Filar, J. A. (2023). Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0279838 chicago: Mckerral, Jody C., Maria Kleshnina, Vladimir Ejov, Louise Bartle, James G. Mitchell, and Jerzy A. Filar. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.” PLoS One. Public Library of Science, 2023. https://doi.org/10.1371/journal.pone.0279838. ieee: J. C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J. G. Mitchell, and J. A. Filar, “Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations,” PLoS One, vol. 18, no. 2. Public Library of Science, p. e0279838, 2023. ista: Mckerral JC, Kleshnina M, Ejov V, Bartle L, Mitchell JG, Filar JA. 2023. Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. 18(2), e0279838. mla: Mckerral, Jody C., et al. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.” PLoS One, vol. 18, no. 2, Public Library of Science, 2023, p. e0279838, doi:10.1371/journal.pone.0279838. short: J.C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J.G. Mitchell, J.A. Filar, PLoS One 18 (2023) e0279838. date_created: 2023-03-05T23:01:05Z date_published: 2023-02-27T00:00:00Z date_updated: 2023-10-17T12:53:30Z day: '27' ddc: - '000' department: - _id: KrCh doi: 10.1371/journal.pone.0279838 external_id: isi: - '000996122900022' pmid: - '36848357' file: - access_level: open_access checksum: 798ed5739a4117b03173e5d56e0534c9 content_type: application/pdf creator: cchlebak date_created: 2023-03-07T10:26:45Z date_updated: 2023-03-07T10:26:45Z file_id: '12712' file_name: 2023_PLOSOne_Mckerral.pdf file_size: 1257003 relation: main_file success: 1 file_date_updated: 2023-03-07T10:26:45Z has_accepted_license: '1' intvolume: ' 18' isi: 1 issue: '2' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: e0279838 pmid: 1 publication: PLoS One publication_identifier: eissn: - 1932-6203 publication_status: published publisher: Public Library of Science quality_controlled: '1' scopus_import: '1' status: public title: Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations 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: 18 year: '2023' ... --- _id: '13202' abstract: - lang: eng text: Phosphatidylinositol-4,5-bisphosphate (PI(4,5)P2) plays an essential role in neuronal activities through interaction with various proteins involved in signaling at membranes. However, the distribution pattern of PI(4,5)P2 and the association with these proteins on the neuronal cell membranes remain elusive. In this study, we established a method for visualizing PI(4,5)P2 by SDS-digested freeze-fracture replica labeling (SDS-FRL) to investigate the quantitative nanoscale distribution of PI(4,5)P2 in cryo-fixed brain. We demonstrate that PI(4,5)P2 forms tiny clusters with a mean size of ∼1000 nm2 rather than randomly distributed in cerebellar neuronal membranes in male C57BL/6J mice. These clusters show preferential accumulation in specific membrane compartments of different cell types, in particular, in Purkinje cell (PC) spines and granule cell (GC) presynaptic active zones. Furthermore, we revealed extensive association of PI(4,5)P2 with CaV2.1 and GIRK3 across different membrane compartments, whereas its association with mGluR1α was compartment specific. These results suggest that our SDS-FRL method provides valuable insights into the physiological functions of PI(4,5)P2 in neurons. acknowledged_ssus: - _id: EM-Fac acknowledgement: This work was supported by The Institute of Science and Technology (IST) Austria, the European Union's Horizon 2020 Research and Innovation Program under the Marie Skłodowska-Curie Grant Agreement No. 793482 (to K.E.) and by the European Research Council (ERC) Grant Agreement No. 694539 (to R.S.). We thank Nicoleta Condruz (IST Austria, Klosterneuburg, Austria) for technical assistance with sample preparation, the Electron Microscopy Facility of IST Austria (Klosterneuburg, Austria) for technical support with EM works, Natalia Baranova (University of Vienna, Vienna, Austria) and Martin Loose (IST Austria, Klosterneuburg, Austria) for advice on liposome preparation, and Yugo Fukazawa (University of Fukui, Fukui, Japan) for comments. article_processing_charge: No article_type: original author: - first_name: Kohgaku full_name: Eguchi, Kohgaku id: 2B7846DC-F248-11E8-B48F-1D18A9856A87 last_name: Eguchi orcid: 0000-0002-6170-2546 - first_name: Elodie full_name: Le Monnier, Elodie id: 3B59276A-F248-11E8-B48F-1D18A9856A87 last_name: Le Monnier - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 citation: ama: Eguchi K, Le Monnier E, Shigemoto R. Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons. The Journal of Neuroscience. 2023;43(23):4197-4216. doi:10.1523/JNEUROSCI.1514-22.2023 apa: Eguchi, K., Le Monnier, E., & Shigemoto, R. (2023). Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons. The Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1514-22.2023 chicago: Eguchi, Kohgaku, Elodie Le Monnier, and Ryuichi Shigemoto. “Nanoscale Phosphoinositide Distribution on Cell Membranes of Mouse Cerebellar Neurons.” The Journal of Neuroscience. Society for Neuroscience, 2023. https://doi.org/10.1523/JNEUROSCI.1514-22.2023. ieee: K. Eguchi, E. Le Monnier, and R. Shigemoto, “Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons,” The Journal of Neuroscience, vol. 43, no. 23. Society for Neuroscience, pp. 4197–4216, 2023. ista: Eguchi K, Le Monnier E, Shigemoto R. 2023. Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons. The Journal of Neuroscience. 43(23), 4197–4216. mla: Eguchi, Kohgaku, et al. “Nanoscale Phosphoinositide Distribution on Cell Membranes of Mouse Cerebellar Neurons.” The Journal of Neuroscience, vol. 43, no. 23, Society for Neuroscience, 2023, pp. 4197–216, doi:10.1523/JNEUROSCI.1514-22.2023. short: K. Eguchi, E. Le Monnier, R. Shigemoto, The Journal of Neuroscience 43 (2023) 4197–4216. date_created: 2023-07-09T22:01:12Z date_published: 2023-06-07T00:00:00Z date_updated: 2023-10-18T07:12:47Z day: '07' ddc: - '570' department: - _id: RySh doi: 10.1523/JNEUROSCI.1514-22.2023 ec_funded: 1 external_id: isi: - '001020132100005' pmid: - '37160366' file: - access_level: open_access checksum: 70b2141870e0bf1c94fd343e18fdbc32 content_type: application/pdf creator: alisjak date_created: 2023-07-10T09:04:58Z date_updated: 2023-07-10T09:04:58Z file_id: '13205' file_name: 2023_JN_Eguchi.pdf file_size: 7794425 relation: main_file success: 1 file_date_updated: 2023-07-10T09:04:58Z has_accepted_license: '1' intvolume: ' 43' isi: 1 issue: '23' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 4197-4216 pmid: 1 project: - _id: 2659CC84-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '793482' name: 'Ultrastructural analysis of phosphoinositides in nerve terminals: distribution, dynamics and physiological roles in synaptic transmission' - _id: 25CA28EA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694539' name: 'In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour' publication: The Journal of Neuroscience publication_identifier: eissn: - 1529-2401 issn: - 0270-6474 publication_status: published publisher: Society for Neuroscience quality_controlled: '1' scopus_import: '1' status: public title: Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons 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: 43 year: '2023' ... --- _id: '12916' abstract: - lang: eng text: "We apply a variant of the square-sieve to produce an upper bound for the number of rational points of bounded height on a family of surfaces that admit a fibration over P1 whose general fibre is a hyperelliptic curve. The implied constant does not depend on the coefficients of the polynomial defining the surface.\r\n" article_processing_charge: No article_type: original author: - first_name: Dante full_name: Bonolis, Dante id: 6A459894-5FDD-11E9-AF35-BB24E6697425 last_name: Bonolis - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: Bonolis D, Browning TD. Uniform bounds for rational points on hyperelliptic fibrations. Annali della Scuola Normale Superiore di Pisa - Classe di Scienze. 2023;24(1):173-204. doi:10.2422/2036-2145.202010_018 apa: Bonolis, D., & Browning, T. D. (2023). Uniform bounds for rational points on hyperelliptic fibrations. Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze. Scuola Normale Superiore - Edizioni della Normale. https://doi.org/10.2422/2036-2145.202010_018 chicago: Bonolis, Dante, and Timothy D Browning. “Uniform Bounds for Rational Points on Hyperelliptic Fibrations.” Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze. Scuola Normale Superiore - Edizioni della Normale, 2023. https://doi.org/10.2422/2036-2145.202010_018. ieee: D. Bonolis and T. D. Browning, “Uniform bounds for rational points on hyperelliptic fibrations,” Annali della Scuola Normale Superiore di Pisa - Classe di Scienze, vol. 24, no. 1. Scuola Normale Superiore - Edizioni della Normale, pp. 173–204, 2023. ista: Bonolis D, Browning TD. 2023. Uniform bounds for rational points on hyperelliptic fibrations. Annali della Scuola Normale Superiore di Pisa - Classe di Scienze. 24(1), 173–204. mla: Bonolis, Dante, and Timothy D. Browning. “Uniform Bounds for Rational Points on Hyperelliptic Fibrations.” Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze, vol. 24, no. 1, Scuola Normale Superiore - Edizioni della Normale, 2023, pp. 173–204, doi:10.2422/2036-2145.202010_018. short: D. Bonolis, T.D. Browning, Annali Della Scuola Normale Superiore Di Pisa - Classe Di Scienze 24 (2023) 173–204. date_created: 2023-05-07T22:01:04Z date_published: 2023-02-16T00:00:00Z date_updated: 2023-10-18T06:54:30Z day: '16' department: - _id: TiBr doi: 10.2422/2036-2145.202010_018 external_id: arxiv: - '2007.14182' intvolume: ' 24' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2007.14182 month: '02' oa: 1 oa_version: Preprint page: 173-204 publication: Annali della Scuola Normale Superiore di Pisa - Classe di Scienze publication_identifier: eissn: - 2036-2145 issn: - 0391-173X publication_status: published publisher: Scuola Normale Superiore - Edizioni della Normale quality_controlled: '1' scopus_import: '1' status: public title: Uniform bounds for rational points on hyperelliptic fibrations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2023' ... --- _id: '14374' abstract: - lang: eng text: "Superconductivity has many important applications ranging from levitating trains over qubits to MRI scanners. The phenomenon is successfully modeled by Bardeen-Cooper-Schrieffer (BCS) theory. From a mathematical perspective, BCS theory has been studied extensively for systems without boundary. However, little is known in the presence of boundaries. With the help of numerical methods physicists observed that the critical temperature may increase in the presence of a boundary. The goal of this thesis is to understand the influence of boundaries on the critical temperature in BCS theory and to give a first rigorous justification of these observations. On the way, we also study two-body Schrödinger operators on domains with boundaries and prove additional results for superconductors without boundary.\r\n\r\nBCS theory is based on a non-linear functional, where the minimizer indicates whether the system is superconducting or in the normal, non-superconducting state. By considering the Hessian of the BCS functional at the normal state, one can analyze whether the normal state is possibly a minimum of the BCS functional and estimate the critical temperature. The Hessian turns out to be a linear operator resembling a Schrödinger operator for two interacting particles, but with more complicated kinetic energy. As a first step, we study the two-body Schrödinger operator in the presence of boundaries.\r\nFor Neumann boundary conditions, we prove that the addition of a boundary can create new eigenvalues, which correspond to the two particles forming a bound state close to the boundary.\r\n\r\nSecond, we need to understand superconductivity in the translation invariant setting. While in three dimensions this has been extensively studied, there is no mathematical literature for the one and two dimensional cases. In dimensions one and two, we compute the weak coupling asymptotics of the critical temperature and the energy gap in the translation invariant setting. We also prove that their ratio is independent of the microscopic details of the model in the weak coupling limit; this property is referred to as universality.\r\n\r\nIn the third part, we study the critical temperature of superconductors in the presence of boundaries. We start by considering the one-dimensional case of a half-line with contact interaction. Then, we generalize the results to generic interactions and half-spaces in one, two and three dimensions. Finally, we compare the critical temperature of a quarter space in two dimensions to the critical temperatures of a half-space and of the full space." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Barbara full_name: Roos, Barbara id: 5DA90512-D80F-11E9-8994-2E2EE6697425 last_name: Roos orcid: 0000-0002-9071-5880 citation: ama: Roos B. Boundary superconductivity in BCS theory. 2023. doi:10.15479/at:ista:14374 apa: Roos, B. (2023). Boundary superconductivity in BCS theory. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:14374 chicago: Roos, Barbara. “Boundary Superconductivity in BCS Theory.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14374. ieee: B. Roos, “Boundary superconductivity in BCS theory,” Institute of Science and Technology Austria, 2023. ista: Roos B. 2023. Boundary superconductivity in BCS theory. Institute of Science and Technology Austria. mla: Roos, Barbara. Boundary Superconductivity in BCS Theory. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14374. short: B. Roos, Boundary Superconductivity in BCS Theory, Institute of Science and Technology Austria, 2023. date_created: 2023-09-28T14:23:04Z date_published: 2023-09-30T00:00:00Z date_updated: 2023-10-27T10:37:30Z day: '30' ddc: - '515' - '539' degree_awarded: PhD department: - _id: GradSch - _id: RoSe doi: 10.15479/at:ista:14374 ec_funded: 1 file: - access_level: open_access checksum: ef039ffc3de2cb8dee5b14110938e9b6 content_type: application/pdf creator: broos date_created: 2023-10-06T11:35:56Z date_updated: 2023-10-06T11:35:56Z file_id: '14398' file_name: phd-thesis-draft_pdfa_acrobat.pdf file_size: 2365702 relation: main_file - access_level: closed checksum: 81dcac33daeefaf0111db52f41bb1fd0 content_type: application/x-zip-compressed creator: broos date_created: 2023-10-06T11:38:01Z date_updated: 2023-10-06T11:38:01Z file_id: '14399' file_name: Version5.zip file_size: 4691734 relation: source_file file_date_updated: 2023-10-06T11:38:01Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '206' project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems - _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b grant_number: I06427 name: Mathematical Challenges in BCS Theory of Superconductivity publication_identifier: issn: - 2663 - 337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13207' relation: part_of_dissertation status: public - id: '10850' relation: part_of_dissertation status: public status: public supervisor: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 title: Boundary superconductivity in BCS theory tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2023' ... --- _id: '13207' abstract: - lang: eng text: We consider the linear BCS equation, determining the BCS critical temperature, in the presence of a boundary, where Dirichlet boundary conditions are imposed. In the one-dimensional case with point interactions, we prove that the critical temperature is strictly larger than the bulk value, at least at weak coupling. In particular, the Cooper-pair wave function localizes near the boundary, an effect that cannot be modeled by effective Neumann boundary conditions on the order parameter as often imposed in Ginzburg–Landau theory. We also show that the relative shift in critical temperature vanishes if the coupling constant either goes to zero or to infinity. acknowledgement: We thank Egor Babaev for encouraging us to study this problem, and Rupert Frank for many fruitful discussions. scussions. Funding. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (Barbara Roos and Robert Seiringer) is gratefully acknowledged. article_processing_charge: No article_type: original author: - first_name: Christian full_name: Hainzl, Christian last_name: Hainzl - first_name: Barbara full_name: Roos, Barbara id: 5DA90512-D80F-11E9-8994-2E2EE6697425 last_name: Roos orcid: 0000-0002-9071-5880 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Hainzl C, Roos B, Seiringer R. Boundary superconductivity in the BCS model. Journal of Spectral Theory. 2023;12(4):1507–1540. doi:10.4171/JST/439 apa: Hainzl, C., Roos, B., & Seiringer, R. (2023). Boundary superconductivity in the BCS model. Journal of Spectral Theory. EMS Press. https://doi.org/10.4171/JST/439 chicago: Hainzl, Christian, Barbara Roos, and Robert Seiringer. “Boundary Superconductivity in the BCS Model.” Journal of Spectral Theory. EMS Press, 2023. https://doi.org/10.4171/JST/439. ieee: C. Hainzl, B. Roos, and R. Seiringer, “Boundary superconductivity in the BCS model,” Journal of Spectral Theory, vol. 12, no. 4. EMS Press, pp. 1507–1540, 2023. ista: Hainzl C, Roos B, Seiringer R. 2023. Boundary superconductivity in the BCS model. Journal of Spectral Theory. 12(4), 1507–1540. mla: Hainzl, Christian, et al. “Boundary Superconductivity in the BCS Model.” Journal of Spectral Theory, vol. 12, no. 4, EMS Press, 2023, pp. 1507–1540, doi:10.4171/JST/439. short: C. Hainzl, B. Roos, R. Seiringer, Journal of Spectral Theory 12 (2023) 1507–1540. date_created: 2023-07-10T16:35:45Z date_published: 2023-05-18T00:00:00Z date_updated: 2023-10-27T10:37:29Z day: '18' ddc: - '530' department: - _id: GradSch - _id: RoSe doi: 10.4171/JST/439 ec_funded: 1 external_id: arxiv: - '2201.08090' isi: - '000997933500008' file: - access_level: open_access checksum: 5501da33be010b5c81440438287584d5 content_type: application/pdf creator: alisjak date_created: 2023-07-11T08:19:15Z date_updated: 2023-07-11T08:19:15Z file_id: '13208' file_name: 2023_EMS_Hainzl.pdf file_size: 304619 relation: main_file success: 1 file_date_updated: 2023-07-11T08:19:15Z has_accepted_license: '1' intvolume: ' 12' isi: 1 issue: '4' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 1507–1540 project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: Journal of Spectral Theory publication_identifier: eissn: - 1664-0403 issn: - 1664-039X publication_status: published publisher: EMS Press quality_controlled: '1' related_material: record: - id: '14374' relation: dissertation_contains status: public status: public title: Boundary superconductivity in the BCS model tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 12 year: '2023' ... --- _id: '14452' abstract: - lang: eng text: The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and an environmental component, and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the parental traits. In previous work, we showed that when trait values are determined by the sum of a large number of additive Mendelian factors, each of small effect, one can justify the infinitesimal model as a limit of Mendelian inheritance. In this paper, we show that this result extends to include dominance. We define the model in terms of classical quantities of quantitative genetics, before justifying it as a limit of Mendelian inheritance as the number, M, of underlying loci tends to infinity. As in the additive case, the multivariate normal distribution of trait values across the pedigree can be expressed in terms of variance components in an ancestral population and probabilities of identity by descent determined by the pedigree. Now, with just first-order dominance effects, we require two-, three-, and four-way identities. We also show that, even if we condition on parental trait values, the “shared” and “residual” components of trait values within each family will be asymptotically normally distributed as the number of loci tends to infinity, with an error of order 1/M−−√⁠. We illustrate our results with some numerical examples. acknowledgement: NHB was supported in part by ERC Grants 250152 and 101055327. AV was partly supported by the chaire Modélisation Mathématique et Biodiversité of Veolia Environment—Ecole Polytechnique—Museum National d’Histoire Naturelle—Fondation X. article_number: iyad133 article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Alison M. full_name: Etheridge, Alison M. last_name: Etheridge - first_name: Amandine full_name: Véber, Amandine last_name: Véber citation: ama: Barton NH, Etheridge AM, Véber A. The infinitesimal model with dominance. Genetics. 2023;225(2). doi:10.1093/genetics/iyad133 apa: Barton, N. H., Etheridge, A. M., & Véber, A. (2023). The infinitesimal model with dominance. Genetics. Oxford Academic. https://doi.org/10.1093/genetics/iyad133 chicago: Barton, Nicholas H, Alison M. Etheridge, and Amandine Véber. “The Infinitesimal Model with Dominance.” Genetics. Oxford Academic, 2023. https://doi.org/10.1093/genetics/iyad133. ieee: N. H. Barton, A. M. Etheridge, and A. Véber, “The infinitesimal model with dominance,” Genetics, vol. 225, no. 2. Oxford Academic, 2023. ista: Barton NH, Etheridge AM, Véber A. 2023. The infinitesimal model with dominance. Genetics. 225(2), iyad133. mla: Barton, Nicholas H., et al. “The Infinitesimal Model with Dominance.” Genetics, vol. 225, no. 2, iyad133, Oxford Academic, 2023, doi:10.1093/genetics/iyad133. short: N.H. Barton, A.M. Etheridge, A. Véber, Genetics 225 (2023). date_created: 2023-10-29T23:01:15Z date_published: 2023-10-01T00:00:00Z date_updated: 2023-10-30T13:04:11Z day: '01' ddc: - '570' department: - _id: NiBa doi: 10.1093/genetics/iyad133 ec_funded: 1 external_id: arxiv: - '2211.03515' file: - access_level: open_access checksum: 3f65b1fbe813e2f4dbb5d2b5e891844a content_type: application/pdf creator: dernst date_created: 2023-10-30T12:57:53Z date_updated: 2023-10-30T12:57:53Z file_id: '14469' file_name: 2023_Genetics_Barton.pdf file_size: 1439032 relation: main_file success: 1 file_date_updated: 2023-10-30T12:57:53Z has_accepted_license: '1' intvolume: ' 225' issue: '2' language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation - _id: bd6958e0-d553-11ed-ba76-86eba6a76c00 grant_number: '101055327' name: Understanding the evolution of continuous genomes publication: Genetics publication_identifier: eissn: - 1943-2631 issn: - 0016-6731 publication_status: published publisher: Oxford Academic quality_controlled: '1' related_material: record: - id: '12949' relation: research_data status: public scopus_import: '1' status: public title: The infinitesimal model with dominance 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: 225 year: '2023' ... --- _id: '12949' abstract: - lang: eng text: The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and a non-genetic (environmental) component and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the trait values of the parents. Although the trait distribution across the whole population can be far from normal, the trait distributions within families are normally distributed with a variance-covariance matrix that is determined entirely by that in the ancestral population and the probabilities of identity determined by the pedigree. Moreover, conditioning on some of the trait values within the pedigree has predictable effects on the mean and variance within and between families. In previous work, Barton et al. (2017), we showed that when trait values are determined by the sum of a large number of Mendelian factors, each of small effect, one can justify the infinitesimal model as limit of Mendelian inheritance. It was also shown that under some forms of epistasis, trait values within a family are still normally distributed. article_processing_charge: No author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Barton NH. The infinitesimal model with dominance. 2023. doi:10.15479/AT:ISTA:12949 apa: Barton, N. H. (2023). The infinitesimal model with dominance. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12949 chicago: Barton, Nicholas H. “The Infinitesimal Model with Dominance.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12949. ieee: N. H. Barton, “The infinitesimal model with dominance.” Institute of Science and Technology Austria, 2023. ista: Barton NH. 2023. The infinitesimal model with dominance, Institute of Science and Technology Austria, 10.15479/AT:ISTA:12949. mla: Barton, Nicholas H. The Infinitesimal Model with Dominance. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12949. short: N.H. Barton, (2023). contributor: - contributor_type: researcher first_name: Amandine last_name: Veber - contributor_type: researcher first_name: Alison last_name: Etheridge date_created: 2023-05-13T09:49:09Z date_published: 2023-05-13T00:00:00Z date_updated: 2023-10-30T13:04:11Z day: '13' ddc: - '576' department: - _id: NiBa doi: 10.15479/AT:ISTA:12949 file: - access_level: open_access checksum: b0ce7d4b1ee7e7265430ceed36fc3336 content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:36:33Z date_updated: 2023-05-13T09:36:33Z file_id: '12950' file_name: Neutral identities 16th Jan file_size: 13662 relation: main_file success: 1 - access_level: open_access checksum: ad5035ad4f7d3b150a252c79884f6a83 content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:38:17Z date_updated: 2023-05-13T09:38:17Z file_id: '12951' file_name: p, zA, zD, N=30 neutral III file_size: 181619928 relation: main_file success: 1 - access_level: open_access checksum: 62182a1de796256edd6f4223704312ef content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:41:59Z date_updated: 2023-05-13T09:41:59Z file_id: '12952' file_name: p, zA, zD, N=30 neutral IV file_size: 605902074 relation: main_file success: 1 - access_level: open_access checksum: af775dda5c4f6859cb1e5a81ec40a667 content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:46:52Z date_updated: 2023-05-13T09:46:52Z file_id: '12953' file_name: p, zA, zD, N=30 selected k=5 file_size: 1018238746 relation: main_file success: 1 - access_level: open_access checksum: af26f3394c387d3ada14b434cd68b1e5 content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:42:05Z date_updated: 2023-05-13T09:42:05Z file_id: '12954' file_name: Pairwise F N=30 neutral II file_size: 3197160 relation: main_file success: 1 - access_level: open_access checksum: d5da7dc0e7282dd48222e26d12e34220 content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:42:06Z date_updated: 2023-05-13T09:42:06Z file_id: '12955' file_name: Pedigrees N=30 neutral II file_size: 55492 relation: main_file success: 1 - access_level: open_access checksum: 00f386d80677590e29f6235d49cba58d content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:46:06Z date_updated: 2023-05-13T09:46:06Z file_id: '12956' file_name: selected reps N=30 selected k=1,2 300 reps III file_size: 474003467 relation: main_file success: 1 - access_level: open_access checksum: 658cef3eaea6136a4d24da4f074191d7 content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:46:08Z date_updated: 2023-05-13T09:46:08Z file_id: '12957' file_name: Algorithm for caclulating identities.nb file_size: 121209 relation: main_file success: 1 - access_level: open_access checksum: db9b6dddd7a596d974e25f5e78f5c45c content_type: application/octet-stream creator: nbarton date_created: 2023-05-13T09:46:08Z date_updated: 2023-05-13T09:46:08Z file_id: '12958' file_name: Infinitesimal with dominance.nb file_size: 1803898 relation: main_file success: 1 - access_level: open_access checksum: 91f80a9fb58cae8eef2d8bf59fe30189 content_type: text/plain creator: nbarton date_created: 2023-05-16T04:09:08Z date_updated: 2023-05-16T04:09:08Z file_id: '12967' file_name: ReadMe.txt file_size: 990 relation: main_file success: 1 file_date_updated: 2023-05-16T04:09:08Z has_accepted_license: '1' keyword: - Quantitative genetics - infinitesimal model month: '05' oa: 1 oa_version: Published Version project: - _id: bd6958e0-d553-11ed-ba76-86eba6a76c00 grant_number: '101055327' name: Understanding the evolution of continuous genomes publisher: Institute of Science and Technology Austria related_material: record: - id: '14452' relation: used_in_publication status: public status: public title: The infinitesimal model with dominance 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: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '14461' abstract: - lang: eng text: 'Communication-reduction techniques are a popular way to improve scalability in data-parallel training of deep neural networks (DNNs). The recent emergence of large language models such as GPT has created the need for new approaches to exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training is highly popular, yet it still encounters scalability bottlenecks. One reason is that applying compression techniques to FSDP is challenging: as the vast majority of the communication involves the model’s weights, direct compression alters convergence and leads to accuracy loss. We present QSDP, a variant of FSDP which supports both gradient and weight quantization with theoretical guarantees, is simple to implement and has essentially no overheads. To derive QSDP we prove that a natural modification of SGD achieves convergence even when we only maintain quantized weights, and thus the domain over which we train consists of quantized points and is, therefore, highly non-convex. We validate this approach by training GPT-family models with up to 1.3 billion parameters on a multi-node cluster. Experiments show that QSDP preserves model accuracy, while completely removing the communication bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x.' acknowledged_ssus: - _id: ScienComp acknowledgement: The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), as well as experimental support from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl. AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT), the support of Fondation Hadamard with a PRMO grant, and the support of CNRS with a CoopIntEER IEA grant (project ALFRED). alternative_title: - PMLR article_processing_charge: No author: - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Adrian full_name: Vladu, Adrian last_name: Vladu - first_name: Qi full_name: Guo, Qi last_name: Guo - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of large models with convergence guarantees. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:24020-24044.' apa: 'Markov, I., Vladu, A., Guo, Q., & Alistarh, D.-A. (2023). Quantized distributed training of large models with convergence guarantees. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 24020–24044). Honolulu, Hawaii, HI, United States: ML Research Press.' chicago: Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In Proceedings of the 40th International Conference on Machine Learning, 202:24020–44. ML Research Press, 2023. ieee: I. Markov, A. Vladu, Q. Guo, and D.-A. Alistarh, “Quantized distributed training of large models with convergence guarantees,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 24020–24044. ista: 'Markov I, Vladu A, Guo Q, Alistarh D-A. 2023. Quantized distributed training of large models with convergence guarantees. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 24020–24044.' mla: Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence Guarantees.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 24020–44. short: I. Markov, A. Vladu, Q. Guo, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 24020–24044. conference: end_date: 2023-07-29 location: Honolulu, Hawaii, HI, United States name: 'ICML: International Conference on Machine Learning' start_date: 2023-07-23 date_created: 2023-10-29T23:01:17Z date_published: 2023-07-30T00:00:00Z date_updated: 2023-10-31T09:40:45Z day: '30' department: - _id: DaAl ec_funded: 1 external_id: arxiv: - '2302.02390' intvolume: ' 202' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2302.02390 month: '07' oa: 1 oa_version: Preprint page: 24020-24044 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the 40th International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Quantized distributed training of large models with convergence guarantees type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 202 year: '2023' ... --- _id: '14462' abstract: - lang: eng text: "We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error." acknowledgement: "This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was funded by Decanal Research Grant. A part of this work was done when JU was visiting Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia, Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta, and Sarvagya Upadhyay for useful discussions." alternative_title: - PMLR article_processing_charge: No author: - first_name: Hendrik full_name: Fichtenberger, Hendrik last_name: Fichtenberger - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Jalaj full_name: Upadhyay, Jalaj last_name: Upadhyay citation: ama: 'Fichtenberger H, Henzinger MH, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10072-10092.' apa: 'Fichtenberger, H., Henzinger, M. H., & Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.' chicago: 'Fichtenberger, Hendrik, Monika H Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In Proceedings of the 40th International Conference on Machine Learning, 202:10072–92. ML Research Press, 2023.' ieee: 'H. Fichtenberger, M. H. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.' ista: 'Fichtenberger H, Henzinger MH, Upadhyay J. 2023. Constant matters: Fine-grained error bound on differentially private continual observation. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10072–10092.' mla: 'Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.' short: H. Fichtenberger, M.H. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092. conference: end_date: 2023-07-29 location: Honolulu, Hawaii, HI, United States name: 'ICML: International Conference on Machine Learning' start_date: 2023-07-23 date_created: 2023-10-29T23:01:17Z date_published: 2023-07-30T00:00:00Z date_updated: 2023-10-31T09:54:05Z day: '30' department: - _id: MoHe ec_funded: 1 intvolume: ' 202' language: - iso: eng main_file_link: - open_access: '1' url: https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf month: '07' oa: 1 oa_version: Published Version page: 10072-10092 project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: 34def286-11ca-11ed-8bc3-da5948e1613c grant_number: Z00422 name: Wittgenstein Award - Monika Henzinger - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: 'P33775 ' name: Fast Algorithms for a Reactive Network Layer publication: Proceedings of the 40th International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: 'Constant matters: Fine-grained error bound on differentially private continual observation' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 202 year: '2023' ... --- _id: '14459' abstract: - lang: eng text: Autoencoders are a popular model in many branches of machine learning and lossy data compression. However, their fundamental limits, the performance of gradient methods and the features learnt during optimization remain poorly understood, even in the two-layer setting. In fact, earlier work has considered either linear autoencoders or specific training regimes (leading to vanishing or diverging compression rates). Our paper addresses this gap by focusing on non-linear two-layer autoencoders trained in the challenging proportional regime in which the input dimension scales linearly with the size of the representation. Our results characterize the minimizers of the population risk, and show that such minimizers are achieved by gradient methods; their structure is also unveiled, thus leading to a concise description of the features obtained via training. For the special case of a sign activation function, our analysis establishes the fundamental limits for the lossy compression of Gaussian sources via (shallow) autoencoders. Finally, while the results are proved for Gaussian data, numerical simulations on standard datasets display the universality of the theoretical predictions. acknowledgement: Aleksandr Shevchenko, Kevin Kogler and Marco Mondelli are supported by the 2019 Lopez-Loreta Prize. Hamed Hassani acknowledges the support by the NSF CIF award (1910056) and the NSF Institute for CORE Emerging Methods in Data Science (EnCORE). alternative_title: - PMLR article_processing_charge: No author: - first_name: Aleksandr full_name: Shevchenko, Aleksandr id: F2B06EC2-C99E-11E9-89F0-752EE6697425 last_name: Shevchenko - first_name: Kevin full_name: Kögler, Kevin id: 94ec913c-dc85-11ea-9058-e5051ab2428b last_name: Kögler - first_name: Hamed full_name: Hassani, Hamed last_name: Hassani - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Shevchenko A, Kögler K, Hassani H, Mondelli M. Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:31151-31209.' apa: 'Shevchenko, A., Kögler, K., Hassani, H., & Mondelli, M. (2023). Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 31151–31209). Honolulu, Hawaii, HI, United States: ML Research Press.' chicago: Shevchenko, Aleksandr, Kevin Kögler, Hamed Hassani, and Marco Mondelli. “Fundamental Limits of Two-Layer Autoencoders, and Achieving Them with Gradient Methods.” In Proceedings of the 40th International Conference on Machine Learning, 202:31151–209. ML Research Press, 2023. ieee: A. Shevchenko, K. Kögler, H. Hassani, and M. Mondelli, “Fundamental limits of two-layer autoencoders, and achieving them with gradient methods,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 31151–31209. ista: 'Shevchenko A, Kögler K, Hassani H, Mondelli M. 2023. Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 31151–31209.' mla: Shevchenko, Aleksandr, et al. “Fundamental Limits of Two-Layer Autoencoders, and Achieving Them with Gradient Methods.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 31151–209. short: A. Shevchenko, K. Kögler, H. Hassani, M. Mondelli, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 31151–31209. conference: end_date: 2023-07-29 location: Honolulu, Hawaii, HI, United States name: 'ICML: International Conference on Machine Learning' start_date: 2023-07-23 date_created: 2023-10-29T23:01:17Z date_published: 2023-07-30T00:00:00Z date_updated: 2023-10-31T08:52:28Z day: '30' department: - _id: MaMo - _id: DaAl external_id: arxiv: - '2212.13468' intvolume: ' 202' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2212.13468 month: '07' oa: 1 oa_version: Preprint page: 31151-31209 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: Proceedings of the 40th International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Fundamental limits of two-layer autoencoders, and achieving them with gradient methods type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 202 year: '2023' ... --- _id: '14460' abstract: - lang: eng text: We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware. acknowledgement: 'We would like to thank Elias Frantar for his valuable assistance and support at the outset of this project, and the anonymous ICML and SNN reviewers for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant 805223 ScaleML. ' alternative_title: - PMLR article_processing_charge: No author: - first_name: Mahdi full_name: Nikdan, Mahdi id: 66374281-f394-11eb-9cf6-869147deecc0 last_name: Nikdan - first_name: Tommaso full_name: Pegolotti, Tommaso last_name: Pegolotti - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 - first_name: Eldar full_name: Kurtic, Eldar id: 47beb3a5-07b5-11eb-9b87-b108ec578218 last_name: Kurtic - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:26215-26227.' apa: 'Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A. (2023). SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United States: ML Research Press.' chicago: 'Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” In Proceedings of the 40th International Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.' ieee: 'M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.' ista: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.' mla: 'Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.' short: M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 26215–26227. conference: end_date: 2023-07-29 location: Honolulu, Hawaii, HI, United States name: 'ICML: International Conference on Machine Learning' start_date: 2023-07-23 date_created: 2023-10-29T23:01:17Z date_published: 2023-07-30T00:00:00Z date_updated: 2023-10-31T09:33:51Z day: '30' department: - _id: DaAl ec_funded: 1 external_id: arxiv: - '2302.04852' intvolume: ' 202' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2302.04852 month: '07' oa: 1 oa_version: Preprint page: 26215-26227 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the 40th International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: 'SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 202 year: '2023' ... --- _id: '14457' abstract: - lang: eng text: "Threshold secret sharing allows a dealer to split a secret s into n shares, such that any t shares allow for reconstructing s, but no t-1 shares reveal any information about s. Leakage-resilient secret sharing requires that the secret remains hidden, even when an adversary additionally obtains a limited amount of leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy leakage-resilience, where a random subset of leakages is replaced by uniformly random noise. We prove a lower bound for Shamir’s secret sharing, similar to that of Nielsen and Simkin, which holds even when a constant fraction of leakages is replaced by random noise. To this end, we first prove a lower bound on the share size of any noisy-leakage-resilient sharing scheme. We then use this lower bound to show that there exist universal constants c1, c2, such that for sufficiently large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random noise.\r\n\r\n\r\n\r\n" alternative_title: - LNCS article_processing_charge: No author: - first_name: Charlotte full_name: Hoffmann, Charlotte id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7 last_name: Hoffmann orcid: 0000-0003-2027-5549 - first_name: Mark full_name: Simkin, Mark last_name: Simkin citation: ama: 'Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing. In: 8th International Conference on Cryptology and Information Security in Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11' apa: 'Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient secret sharing. In 8th International Conference on Cryptology and Information Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer Nature. https://doi.org/10.1007/978-3-031-44469-2_11' chicago: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” In 8th International Conference on Cryptology and Information Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11. ieee: C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret sharing,” in 8th International Conference on Cryptology and Information Security in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228. ista: 'Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret sharing. 8th International Conference on Cryptology and Information Security in Latin America. LATINCRYPT: Conference on Cryptology and Information Security in Latin America, LNCS, vol. 14168, 215–228.' mla: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” 8th International Conference on Cryptology and Information Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28, doi:10.1007/978-3-031-44469-2_11. short: C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and Information Security in Latin America, Springer Nature, 2023, pp. 215–228. conference: end_date: 2023-10-06 location: Quito, Ecuador name: 'LATINCRYPT: Conference on Cryptology and Information Security in Latin America' start_date: 2023-10-03 date_created: 2023-10-29T23:01:16Z date_published: 2023-10-01T00:00:00Z date_updated: 2023-10-31T11:43:12Z day: '01' department: - _id: KrPi doi: 10.1007/978-3-031-44469-2_11 intvolume: ' 14168' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2023/1017 month: '10' oa: 1 oa_version: Preprint page: 215-228 publication: 8th International Conference on Cryptology and Information Security in Latin America publication_identifier: eissn: - 1611-3349 isbn: - '9783031444685' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Stronger lower bounds for leakage-resilient secret sharing type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14168 year: '2023' ... --- _id: '14458' abstract: - lang: eng text: 'We show for the first time that large-scale generative pretrained transformer (GPT) family models can be pruned to at least 50% sparsity in one-shot, without any retraining, at minimal loss of accuracy. This is achieved via a new pruning method called SparseGPT, specifically designed to work efficiently and accurately on massive GPT-family models. We can execute SparseGPT on the largest available open-source models, OPT-175B and BLOOM-176B, in under 4.5 hours, and can reach 60% unstructured sparsity with negligible increase in perplexity: remarkably, more than 100 billion weights from these models can be ignored at inference time. SparseGPT generalizes to semi-structured (2:4 and 4:8) patterns, and is compatible with weight quantization approaches. The code is available at: https://github.com/IST-DASLab/sparsegpt.' acknowledged_ssus: - _id: ScienComp acknowledgement: The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement No. 805223 ScaleML), as well as experimental support from Eldar Kurtic, and from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl. alternative_title: - PMLR article_processing_charge: No author: - first_name: Elias full_name: Frantar, Elias id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f last_name: Frantar - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Frantar E, Alistarh D-A. SparseGPT: Massive language models can be accurately pruned in one-shot. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10323-10337.' apa: 'Frantar, E., & Alistarh, D.-A. (2023). SparseGPT: Massive language models can be accurately pruned in one-shot. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10323–10337). Honolulu, Hawaii, HI, United States: ML Research Press.' chicago: 'Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” In Proceedings of the 40th International Conference on Machine Learning, 202:10323–37. ML Research Press, 2023.' ieee: 'E. Frantar and D.-A. Alistarh, “SparseGPT: Massive language models can be accurately pruned in one-shot,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10323–10337.' ista: 'Frantar E, Alistarh D-A. 2023. SparseGPT: Massive language models can be accurately pruned in one-shot. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10323–10337.' mla: 'Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10323–37.' short: E. Frantar, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10323–10337. conference: end_date: 2023-07-29 location: Honolulu, Hawaii, HI, United States name: 'ICML: International Conference on Machine Learning' start_date: 2023-07-23 date_created: 2023-10-29T23:01:16Z date_published: 2023-07-30T00:00:00Z date_updated: 2023-10-31T09:59:42Z day: '30' department: - _id: DaAl ec_funded: 1 external_id: arxiv: - '2301.00774' intvolume: ' 202' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2301.00774 month: '07' oa: 1 oa_version: Preprint page: 10323-10337 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the 40th International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: 'SparseGPT: Massive language models can be accurately pruned in one-shot' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 202 year: '2023' ... --- _id: '14451' abstract: - lang: eng text: 'We investigate the potential of Multi-Objective, Deep Reinforcement Learning for stock and cryptocurrency single-asset trading: in particular, we consider a Multi-Objective algorithm which generalizes the reward functions and discount factor (i.e., these components are not specified a priori, but incorporated in the learning process). Firstly, using several important assets (BTCUSD, ETHUSDT, XRPUSDT, AAPL, SPY, NIFTY50), we verify the reward generalization property of the proposed Multi-Objective algorithm, and provide preliminary statistical evidence showing increased predictive stability over the corresponding Single-Objective strategy. Secondly, we show that the Multi-Objective algorithm has a clear edge over the corresponding Single-Objective strategy when the reward mechanism is sparse (i.e., when non-null feedback is infrequent over time). Finally, we discuss the generalization properties with respect to the discount factor. The entirety of our code is provided in open-source format.' acknowledgement: Open access funding provided by Università degli Studi di Trieste within the CRUI-CARE Agreement. Funding was provided by Austrian Science Fund (Grant No. F65), Horizon 2020 (Grant No. 754411) and Österreichische Forschungsförderungsgesellschaft. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Federico full_name: Cornalba, Federico id: 2CEB641C-A400-11E9-A717-D712E6697425 last_name: Cornalba orcid: 0000-0002-6269-5149 - first_name: Constantin full_name: Disselkamp, Constantin last_name: Disselkamp - first_name: Davide full_name: Scassola, Davide last_name: Scassola - first_name: Christopher full_name: Helf, Christopher last_name: Helf citation: ama: 'Cornalba F, Disselkamp C, Scassola D, Helf C. Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading. Neural Computing and Applications. 2023. doi:10.1007/s00521-023-09033-7' apa: 'Cornalba, F., Disselkamp, C., Scassola, D., & Helf, C. (2023). Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading. Neural Computing and Applications. Springer Nature. https://doi.org/10.1007/s00521-023-09033-7' chicago: 'Cornalba, Federico, Constantin Disselkamp, Davide Scassola, and Christopher Helf. “Multi-Objective Reward Generalization: Improving Performance of Deep Reinforcement Learning for Applications in Single-Asset Trading.” Neural Computing and Applications. Springer Nature, 2023. https://doi.org/10.1007/s00521-023-09033-7.' ieee: 'F. Cornalba, C. Disselkamp, D. Scassola, and C. Helf, “Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading,” Neural Computing and Applications. Springer Nature, 2023.' ista: 'Cornalba F, Disselkamp C, Scassola D, Helf C. 2023. Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading. Neural Computing and Applications.' mla: 'Cornalba, Federico, et al. “Multi-Objective Reward Generalization: Improving Performance of Deep Reinforcement Learning for Applications in Single-Asset Trading.” Neural Computing and Applications, Springer Nature, 2023, doi:10.1007/s00521-023-09033-7.' short: F. Cornalba, C. Disselkamp, D. Scassola, C. Helf, Neural Computing and Applications (2023). date_created: 2023-10-22T22:01:16Z date_published: 2023-10-05T00:00:00Z date_updated: 2023-10-31T10:58:28Z day: '05' department: - _id: JuFi doi: 10.1007/s00521-023-09033-7 ec_funded: 1 external_id: arxiv: - '2203.04579' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1007/s00521-023-09033-7 month: '10' oa: 1 oa_version: Published Version project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Neural Computing and Applications publication_identifier: eissn: - 1433-3058 issn: - 0941-0643 publication_status: epub_ahead publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: 'Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ...