[{"month":"06","language":[{"iso":"eng"}],"day":"27","volume":37,"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"type":"conference","article_processing_charge":"No","oa_version":"Published Version","abstract":[{"text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In \"bidding games\", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games.","lang":"eng"}],"_id":"14243","doi":"10.1609/aaai.v37i5.25679","citation":{"mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 5, AAAI Press, 2023, pp. 5464–71, doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:5464–71. AAAI Press, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>.","ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. AAAI Press; 2023:5464-5471. doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI Press, 2023, pp. 5464–5471.","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 5464–5471). Washington, DC, United States: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>"},"page":"5464-5471","date_updated":"2026-07-07T06:24:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","oa":1,"title":"Bidding graph games with partially-observable budgets","issue":"5","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}],"scopus_import":"1","date_published":"2023-06-27T00:00:00Z","quality_controlled":"1","date_created":"2023-08-27T22:01:18Z","ddc":["000"],"ec_funded":1,"publication_identifier":{"isbn":["9781577358800"]},"year":"2023","intvolume":"        37","das_tickbox":"1","publisher":"AAAI Press","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"last_name":"Jecker","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"}],"status":"public","arxiv":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"external_id":{"arxiv":["2211.13626"]},"publication_status":"published","conference":{"start_date":"2023-02-07","name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14","location":"Washington, DC, United States"}},{"date_created":"2024-05-05T22:01:05Z","quality_controlled":"1","ddc":["000"],"ec_funded":1,"publication_identifier":{"issn":["1049-5258"]},"year":"2023","das_tickbox":"1","intvolume":"        36","publisher":"Neural Information Processing Systems Foundation","author":[{"last_name":"Charikar","full_name":"Charikar, Moses","first_name":"Moses"},{"first_name":"Lunjia","full_name":"Hu, Lunjia","last_name":"Hu"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Maximilian","last_name":"Vötsch","full_name":"Vötsch, Maximilian"},{"last_name":"Waingarten","full_name":"Waingarten, Erik","first_name":"Erik"}],"title":"Simple, scalable and effective clustering via one-dimensional projections","scopus_import":"1","date_published":"2023-12-15T00:00:00Z","has_accepted_license":"1","department":[{"_id":"MoHe"}],"external_id":{"arxiv":["2310.16752"]},"publication_status":"published","conference":{"location":"New Orleans, LA, United States","end_date":"2023-12-16","name":"NeurIPS: Neural Information Processing Systems","start_date":"2023-12-10"},"alternative_title":["Advances in Neural Information Processing Systems"],"tmp":{"short":"CC BY (4.0)","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)"},"status":"public","file":[{"relation":"main_file","file_size":1445159,"creator":"dernst","checksum":"d169a147a2adf55878e0a99e36a9d468","file_id":"15416","access_level":"open_access","date_updated":"2024-05-22T07:34:00Z","file_name":"2023_Neurips_Charikar.pdf","content_type":"application/pdf","success":1,"date_created":"2024-05-22T07:34:00Z"}],"arxiv":1,"month":"12","language":[{"iso":"eng"}],"day":"15","volume":36,"file_date_updated":"2024-05-22T07:34:00Z","citation":{"short":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, E. Waingarten, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","apa":"Charikar, M., Hu, L., Henzinger, M., Vötsch, M., &#38; Waingarten, E. (2023). Simple, scalable and effective clustering via one-dimensional projections. In <i>37th Conference on Neural Information Processing Systems</i> (Vol. 36). New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ista":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. 2023. Simple, scalable and effective clustering via one-dimensional projections. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 36.","ieee":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, and E. Waingarten, “Simple, scalable and effective clustering via one-dimensional projections,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36.","ama":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. Simple, scalable and effective clustering via one-dimensional projections. In: <i>37th Conference on Neural Information Processing Systems</i>. Vol 36. Neural Information Processing Systems Foundation; 2023.","mla":"Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” <i>37th Conference on Neural Information Processing Systems</i>, vol. 36, Neural Information Processing Systems Foundation, 2023.","chicago":"Charikar, Moses, Lunjia Hu, Monika Henzinger, Maximilian Vötsch, and Erik Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” In <i>37th Conference on Neural Information Processing Systems</i>, Vol. 36. Neural Information Processing Systems Foundation, 2023."},"date_updated":"2026-07-07T06:37:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"acknowledgement":"Moses Charikar was supported by a Simons Investigator award. Lunjia Hu was supported by Moses Charikar’s and Omer Reingold’s Simons Investigators awards, Omer Reingold’s NSF Award IIS-1908774, and the Simons Foundation Collaboration on the Theory of Algorithmic Fairness. Part of this work was done while Erik Waingarten was a postdoc at Stanford University, supported by an NSF postdoctoral fellowship and by Moses Charikar’s Simons\r\nInvestigator Award. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme\r\n(Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data\r\nStructures (MoDynStruct)” and the Austrian Science Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","publication":"37th Conference on Neural Information Processing Systems","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"type":"conference","article_processing_charge":"Yes","oa_version":"Published Version","_id":"15364","abstract":[{"lang":"eng","text":"Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and k-means++ can make Ω(ndk) time when clustering n points in a d-dimensional space (represented by an n×d matrix X) into k clusters. On massive datasets with moderate to large k, the multiplicative \r\nk factor can become very expensive. We introduce a simple randomized clustering algorithm that provably runs in expected time O(nnz(X)+nlogn) for arbitrary k. Here nnz(X) is the total number of non-zero entries in the input dataset X, which is upper bounded by nd and can be significantly smaller for sparse datasets. We prove that our algorithm achieves approximation ratio ˜O(k4) on any input dataset for the k-means objective, and our experiments show that the quality of the clusters found by our algorithm is usually much better than this worst-case bound. We use our algorithm for k-means clustering and for coreset construction; our experiments show that it gives a new tradeoff between running time and cluster quality compared to previous state-of-the-art methods for these tasks. Our theoretical analysis is based on novel results of independent interest. We show that the approximation ratio achieved after a random one-dimensional projection can be lifted to the original points and that k-means++ seeding can be implemented in expected time O(nlogn) in one dimension."}]},{"file":[{"date_created":"2024-05-22T08:08:08Z","file_name":"2023_Neurips_Safaryan.pdf","content_type":"application/pdf","success":1,"access_level":"open_access","date_updated":"2024-05-22T08:08:08Z","file_id":"15417","file_size":672571,"creator":"dernst","checksum":"288c5148a85abf24ad5e22a6b1183655","relation":"main_file"}],"arxiv":1,"status":"public","alternative_title":["Advances in Neural Information Processing Systems"],"tmp":{"short":"CC BY (4.0)","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)"},"conference":{"end_date":"2023-12-16","location":"New Orleans, LA, United States","start_date":"2023-12-10","name":"NeurIPS: Neural Information Processing Systems"},"publication_status":"published","external_id":{"arxiv":["2305.17581"]},"corr_author":"1","has_accepted_license":"1","department":[{"_id":"DaAl"}],"date_published":"2023-12-15T00:00:00Z","scopus_import":"1","title":"Knowledge distillation performs partial variance reduction","publisher":"Neural Information Processing Systems Foundation","author":[{"full_name":"Safaryan, Mher","last_name":"Safaryan","first_name":"Mher","id":"dd546b39-0804-11ed-9c55-ef075c39778d"},{"first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","last_name":"Peste","full_name":"Peste, Elena-Alexandra"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"}],"year":"2023","intvolume":"        36","das_tickbox":"1","ec_funded":1,"publication_identifier":{"issn":["1049-5258"]},"date_created":"2024-05-05T22:01:04Z","quality_controlled":"1","ddc":["000"],"oa_version":"Published Version","article_processing_charge":"Yes","abstract":[{"text":"Knowledge distillation is a popular approach for enhancing the performance of \"student\" models, with lower representational capacity, by taking advantage of more powerful \"teacher\" models. Despite its apparent simplicity, the underlying mechanics behind knowledge distillation (KD) are not yet fully understood. In this work, we shed new light on the inner workings of this method, by examining it from an optimization perspective. Specifically, we show that, in the context of linear and deep linear models, KD can be interpreted as a novel type of stochastic variance reduction mechanism. We provide a detailed convergence analysis of the resulting dynamics, which hold under standard assumptions for both strongly-convex and non-convex losses, showing that KD acts as a form of \\emph{partial variance reduction}, which can reduce the stochastic gradient noise, but may not eliminate it completely, depending on the properties of the teacher'' model. Our analysis puts further emphasis on the need for careful parametrization of KD, in particular w.r.t. the weighting of the distillation loss, and is validated empirically on both linear models and deep neural networks.","lang":"eng"}],"_id":"15363","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"type":"conference","publication":"36th Conference on Neural Information Processing Systems","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"MS has received funding from the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie grant agreement No 101034413.","date_updated":"2026-07-07T06:37:28Z","citation":{"ieee":"M. Safaryan, A. Krumes, and D.-A. Alistarh, “Knowledge distillation performs partial variance reduction,” in <i>36th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36.","apa":"Safaryan, M., Krumes, A., &#38; Alistarh, D.-A. (2023). Knowledge distillation performs partial variance reduction. In <i>36th Conference on Neural Information Processing Systems</i> (Vol. 36). New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ista":"Safaryan M, Krumes A, Alistarh D-A. 2023. Knowledge distillation performs partial variance reduction. 36th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 36.","short":"M. Safaryan, A. Krumes, D.-A. Alistarh, in:, 36th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","chicago":"Safaryan, Mher, Alexandra Krumes, and Dan-Adrian Alistarh. “Knowledge Distillation Performs Partial Variance Reduction.” In <i>36th Conference on Neural Information Processing Systems</i>, Vol. 36. Neural Information Processing Systems Foundation, 2023.","mla":"Safaryan, Mher, et al. “Knowledge Distillation Performs Partial Variance Reduction.” <i>36th Conference on Neural Information Processing Systems</i>, vol. 36, Neural Information Processing Systems Foundation, 2023.","ama":"Safaryan M, Krumes A, Alistarh D-A. Knowledge distillation performs partial variance reduction. In: <i>36th Conference on Neural Information Processing Systems</i>. Vol 36. Neural Information Processing Systems Foundation; 2023."},"file_date_updated":"2024-05-22T08:08:08Z","day":"15","volume":36,"language":[{"iso":"eng"}],"month":"12"},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"has_accepted_license":"1","external_id":{"arxiv":["2312.01456"]},"corr_author":"1","publication_status":"published","conference":{"end_date":"2023-12-16","location":"New Orleans, LO, United States","start_date":"2023-12-10","name":"NeurIPS: Neural Information Processing Systems"},"alternative_title":["Advances in Neural Information Processing Systems"],"status":"public","arxiv":1,"file":[{"relation":"main_file","creator":"dernst","checksum":"739c6d72506b778302d4e708723bf12c","file_size":562008,"date_updated":"2024-07-22T11:45:17Z","access_level":"open_access","file_id":"17309","date_created":"2024-07-22T11:45:17Z","content_type":"application/pdf","success":1,"file_name":"2023_NeurIPS_Zikelic.pdf"}],"ddc":["000"],"date_created":"2024-02-25T09:23:24Z","quality_controlled":"1","publication_identifier":{"eissn":["1049-5258"]},"ec_funded":1,"das_tickbox":"1","year":"2023","author":[{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6","first_name":"Abhinav","last_name":"Verma","full_name":"Verma, Abhinav"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"publisher":"Neural Information Processing Systems Foundation","title":"Compositional policy learning in stochastic control systems with formal guarantees","date_published":"2023-12-15T00:00:00Z","citation":{"apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LO, United States: Neural Information Processing Systems Foundation.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LO, United States, 2023.","ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2023.","chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2023.","mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2023."},"date_updated":"2026-07-07T06:36:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","publication":"37th Conference on Neural Information Processing Systems","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"type":"conference","_id":"15023","abstract":[{"text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.","lang":"eng"}],"oa_version":"Published Version","article_processing_charge":"No","month":"12","language":[{"iso":"eng"}],"day":"15","file_date_updated":"2024-07-22T11:45:17Z"},{"arxiv":1,"alternative_title":["Advances in Neural Information Processing Systems"],"status":"public","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2023-12-10","location":"New Orleans, LA, United States","end_date":"2023-12-16"},"department":[{"_id":"MaMo"},{"_id":"ChLa"}],"external_id":{"arxiv":["2305.13165"]},"publication_status":"published","corr_author":"1","date_published":"2023-12-15T00:00:00Z","title":"Deep neural collapse is provably optimal for the deep unconstrained features model","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2305.13165"}],"das_tickbox":"1","year":"2023","author":[{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","first_name":"Peter","full_name":"Súkeník, Peter","last_name":"Súkeník"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph"}],"publisher":"Neural Information Processing Systems Foundation","quality_controlled":"1","date_created":"2024-02-02T11:17:41Z","publication_identifier":{"eissn":["1049-5258"]},"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"type":"conference","_id":"14921","abstract":[{"text":"Neural collapse (NC) refers to the surprising structure of the last layer of deep neural networks in the terminal phase of gradient descent training. Recently, an increasing amount of experimental evidence has pointed to the propagation of NC to earlier layers of neural networks. However, while the NC in the last layer is well studied theoretically, much less is known about its multi-layered counterpart - deep neural collapse (DNC). In particular, existing work focuses either on linear layers or only on the last two layers at the price of an extra assumption. Our paper fills this gap by generalizing the established analytical framework for NC - the unconstrained features model - to multiple non-linear layers. Our key technical contribution is to show that, in a deep unconstrained features model, the unique global optimum for binary classification exhibits all the properties typical of DNC. This explains the existing experimental evidence of DNC. We also empirically show that (i) by optimizing deep unconstrained features models via gradient descent, the resulting solution agrees well with our theory, and (ii) trained networks recover the unconstrained features suitable for the occurrence of DNC, thus supporting the validity of this modeling principle.","lang":"eng"}],"article_processing_charge":"No","oa_version":"Preprint","publication":"37th Conference on Neural Information Processing Systems","date_updated":"2026-07-07T06:35:57Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"M. M. is partially supported by the 2019 Lopez-Loreta Prize. The authors would like to thank Eugenia Iofinova, Bernd Prach and Simone Bombari for valuable feedback on the manuscript.","citation":{"short":"P. Súkeník, M. Mondelli, C. Lampert, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","apa":"Súkeník, P., Mondelli, M., &#38; Lampert, C. (2023). Deep neural collapse is provably optimal for the deep unconstrained features model. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ista":"Súkeník P, Mondelli M, Lampert C. 2023. Deep neural collapse is provably optimal for the deep unconstrained features model. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .","ieee":"P. Súkeník, M. Mondelli, and C. Lampert, “Deep neural collapse is provably optimal for the deep unconstrained features model,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023.","ama":"Súkeník P, Mondelli M, Lampert C. Deep neural collapse is provably optimal for the deep unconstrained features model. In: <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2023.","mla":"Súkeník, Peter, et al. “Deep Neural Collapse Is Provably Optimal for the Deep Unconstrained Features Model.” <i>37th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2023.","chicago":"Súkeník, Peter, Marco Mondelli, and Christoph Lampert. “Deep Neural Collapse Is Provably Optimal for the Deep Unconstrained Features Model.” In <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2023."},"day":"15","month":"12","language":[{"iso":"eng"}]},{"file":[{"relation":"main_file","creator":"dernst","checksum":"c346016393123a0a2338ad4d976f61bc","file_size":421408,"file_id":"14275","access_level":"open_access","date_updated":"2023-09-06T08:16:25Z","success":1,"content_type":"application/pdf","file_name":"2023_LNCS_Koval.pdf","date_created":"2023-09-06T08:16:25Z"}],"alternative_title":["LNCS"],"tmp":{"short":"CC BY (4.0)","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)"},"status":"public","conference":{"start_date":"2023-07-17","name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France"},"has_accepted_license":"1","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publication_status":"published","external_id":{"isi":["001310786500008"]},"related_material":{"record":[{"relation":"research_data","id":"14995","status":"public"}]},"date_published":"2023-07-17T00:00:00Z","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","scopus_import":"1","year":"2023","das_tickbox":"1","intvolume":"     13964","publisher":"Springer Nature","author":[{"first_name":"Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","last_name":"Koval","full_name":"Koval, Nikita"},{"full_name":"Fedorov, Alexander","last_name":"Fedorov","first_name":"Alexander","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6"},{"first_name":"Maria","last_name":"Sokolova","full_name":"Sokolova, Maria"},{"first_name":"Dmitry","last_name":"Tsitelov","full_name":"Tsitelov, Dmitry"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"date_created":"2023-09-03T22:01:16Z","isi":1,"quality_controlled":"1","ddc":["000"],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031377051"]},"type":"conference","article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","abstract":[{"text":"This paper presents Lincheck, a new practical and user-friendly framework for testing concurrent algorithms on the Java Virtual Machine (JVM). Lincheck provides a simple and declarative way to write concurrent tests: instead of describing how to perform the test, users specify what to test by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with Lincheck are concise and easy to understand. The framework automatically generates a set of concurrent scenarios, examines them using stress-testing or bounded model checking, and verifies that the results of each invocation are correct. Notably, if an error is detected via model checking, Lincheck provides an easy-to-follow trace to reproduce it, significantly simplifying the bug investigation.\r\n\r\nTo the best of our knowledge, Lincheck is the first production-ready tool on the JVM that offers such a simple way of writing concurrent tests, without requiring special skills or expertise. We successfully integrated Lincheck in the development process of several large projects, such as Kotlin Coroutines, and identified new bugs in popular concurrency libraries, such as a race in Java’s standard ConcurrentLinkedDeque and a liveliness bug in Java’s AbstractQueuedSynchronizer framework, which is used in most of the synchronization primitives. We believe that Lincheck can significantly improve the quality and productivity of concurrent algorithms research and development and become the state-of-the-art tool for checking their correctness.","lang":"eng"}],"_id":"14260","doi":"10.1007/978-3-031-37706-8_8","publication":"35th International Conference on Computer Aided Verification","date_updated":"2026-07-07T13:39:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"citation":{"short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, in:, 35th International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 156–169.","ista":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck: A practical framework for testing concurrent data structures on JVM. 35th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13964, 156–169.","apa":"Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In <i>35th International Conference on Computer Aided Verification</i> (Vol. 13964, pp. 156–169). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>","ieee":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM,” in <i>35th International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13964, pp. 156–169.","ama":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. In: <i>35th International Conference on Computer Aided Verification</i>. Vol 13964. Springer Nature; 2023:156-169. doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>","mla":"Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” <i>35th International Conference on Computer Aided Verification</i>, vol. 13964, Springer Nature, 2023, pp. 156–69, doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>.","chicago":"Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” In <i>35th International Conference on Computer Aided Verification</i>, 13964:156–69. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>."},"page":"156-169","file_date_updated":"2023-09-06T08:16:25Z","day":"17","volume":13964,"month":"07","language":[{"iso":"eng"}]},{"file_date_updated":"2023-09-06T08:25:50Z","day":"17","volume":13964,"language":[{"iso":"eng"}],"month":"07","article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","_id":"14259","abstract":[{"lang":"eng","text":"We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game’s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions.\r\nIn contrast to previous works, we (i) reflect the highly structured logical information in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning."}],"doi":"10.1007/978-3-031-37706-8_20","type":"conference","publication":"35th International Conference on Computer Aided Verification","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was funded in part by the German Research Foundation (DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro).","date_updated":"2026-07-07T13:39:23Z","citation":{"ieee":"J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in <i>35th International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13964, pp. 390–414.","apa":"Kretinsky, J., Meggendorfer, T., Prokop, M., &#38; Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In <i>35th International Conference on Computer Aided Verification</i> (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">https://doi.org/10.1007/978-3-031-37706-8_20</a>","ista":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. 2023. Guessing winning policies in LTL synthesis by semantic learning. 35th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13964, 390–414.","short":"J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 390–414.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In <i>35th International Conference on Computer Aided Verification</i>, 13964:390–414. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">https://doi.org/10.1007/978-3-031-37706-8_20</a>.","mla":"Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” <i>35th International Conference on Computer Aided Verification</i>, vol. 13964, Springer Nature, 2023, pp. 390–414, doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">10.1007/978-3-031-37706-8_20</a>.","ama":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: <i>35th International Conference on Computer Aided Verification</i>. Vol 13964. Springer Nature; 2023:390-414. doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_20\">10.1007/978-3-031-37706-8_20</a>"},"page":"390-414","date_published":"2023-07-17T00:00:00Z","scopus_import":"1","title":"Guessing winning policies in LTL synthesis by semantic learning","publisher":"Springer Nature","author":[{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer"},{"first_name":"Maximilian","last_name":"Prokop","full_name":"Prokop, Maximilian"},{"full_name":"Rieder, Sabine","last_name":"Rieder","first_name":"Sabine"}],"year":"2023","das_tickbox":"1","intvolume":"     13964","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031377051"]},"isi":1,"quality_controlled":"1","date_created":"2023-09-03T22:01:16Z","ddc":["000"],"file":[{"file_size":428354,"creator":"dernst","checksum":"ed66278b61bb869e1baba3d9b9081271","relation":"main_file","date_created":"2023-09-06T08:25:50Z","file_name":"2023_LNCS_CAV_Kretinsky.pdf","success":1,"content_type":"application/pdf","access_level":"open_access","date_updated":"2023-09-06T08:25:50Z","file_id":"14276"}],"status":"public","alternative_title":["LNCS"],"tmp":{"short":"CC BY (4.0)","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)"},"conference":{"start_date":"2023-07-17","name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France"},"publication_status":"published","external_id":{"isi":["001310786500020"]},"has_accepted_license":"1","department":[{"_id":"KrCh"}]},{"article_processing_charge":"No","oa_version":"Published Version","doi":"10.5281/ZENODO.7877757","_id":"14995","abstract":[{"lang":"eng","text":"Lincheck is a new practical and user-friendly framework for testing concurrent data structures on the Java Virtual Machine (JVM). It provides a simple and declarative way to write concurrent tests. Instead of describing how to perform the test, users specify what to test by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with Lincheck are concise and easy to understand. \r\nThe artifact presents a collection of Lincheck tests that discover new bugs in popular libraries and implementations from the concurrency literature -- they are listed in Table 1, Section 3. To evaluate the performance of Lincheck analysis, the collection of tests also includes those which check correct data structures and, thus, always succeed. Similarly to Table 2, Section 3, the experiments demonstrate the reasonable time to perform a test. Finally, Lincheck provides user-friendly output with an easy-to-follow trace to reproduce a detected error, significantly simplifying further investigation."}],"type":"research_data_reference","status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-07T13:39:35Z","citation":{"ama":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>","mla":"Koval, Nikita, et al. <i>Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>.","chicago":"Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7877757\">https://doi.org/10.5281/ZENODO.7877757</a>.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).","ista":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck: A practical framework for testing concurrent data structures on JVM, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>.","apa":"Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7877757\">https://doi.org/10.5281/ZENODO.7877757</a>","ieee":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM.” Zenodo, 2023."},"department":[{"_id":"DaAl"}],"date_published":"2023-04-28T00:00:00Z","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14260"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7877757"}],"title":"Lincheck: A practical framework for testing concurrent data structures on JVM","publisher":"Zenodo","author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","full_name":"Koval, Nikita","last_name":"Koval"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"first_name":"Maria","full_name":"Sokolova, Maria","last_name":"Sokolova"},{"full_name":"Tsitelov, Dmitry","last_name":"Tsitelov","first_name":"Dmitry"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"year":"2023","day":"28","date_created":"2024-02-14T15:14:13Z","month":"04","ddc":["000"]},{"publication":"SIAM Journal on Computing","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"type":"journal_article","article_processing_charge":"No","oa_version":"Submitted Version","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. "}],"_id":"12960","doi":"10.1137/21M1412918","citation":{"short":"J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing 52 (2023) 452–486.","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.","apa":"Boissonnat, J. D., Kachanovich, S., &#38; Wintraecken, M. (2023). Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21M1412918\">https://doi.org/10.1137/21M1412918</a>","ieee":"J. D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations,” <i>SIAM Journal on Computing</i>, vol. 52, no. 2. Society for Industrial and Applied Mathematics, pp. 452–486, 2023.","ama":"Boissonnat JD, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. <i>SIAM Journal on Computing</i>. 2023;52(2):452-486. doi:<a href=\"https://doi.org/10.1137/21M1412918\">10.1137/21M1412918</a>","mla":"Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.” <i>SIAM Journal on Computing</i>, vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86, doi:<a href=\"https://doi.org/10.1137/21M1412918\">10.1137/21M1412918</a>.","chicago":"Boissonnat, Jean Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.” <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/21M1412918\">https://doi.org/10.1137/21M1412918</a>."},"page":"452-486","date_updated":"2026-07-07T13:43:40Z","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.","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","language":[{"iso":"eng"}],"day":"30","volume":52,"status":"public","department":[{"_id":"HeEd"}],"external_id":{"isi":["001013183000012"]},"corr_author":"1","publication_status":"published","issue":"2","title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations","main_file_link":[{"open_access":"1","url":"https://hal-emse.ccsd.cnrs.fr/3IA-COTEDAZUR/hal-04083489v1"}],"article_type":"original","scopus_import":"1","related_material":{"record":[{"id":"9441","relation":"earlier_version","status":"public"}]},"date_published":"2023-04-30T00:00:00Z","isi":1,"date_created":"2023-05-14T22:01:00Z","quality_controlled":"1","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"ec_funded":1,"year":"2023","intvolume":"        52","publisher":"Society for Industrial and Applied Mathematics","author":[{"first_name":"Jean Daniel","full_name":"Boissonnat, Jean Daniel","last_name":"Boissonnat"},{"first_name":"Siargey","last_name":"Kachanovich","full_name":"Kachanovich, Siargey"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"acknowledgement":"The authors are grateful to the referee for her/his detailed and constructive report, which has allowed us to improve our article. S. M. acknowledges support from the CNES GOLF-SOHO and PLATO grants at CEA/DAp and PNPS (CNRS/INSU). We thank R. A. Garcia for fruitful discussions and suggestions.","date_updated":"2026-07-08T06:45:55Z","citation":{"ista":"Mathis S, Bugnet LA. 2023. Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy &#38; Astrophysics. 676, L9.","apa":"Mathis, S., &#38; Bugnet, L. A. (2023). Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202346832\">https://doi.org/10.1051/0004-6361/202346832</a>","short":"S. Mathis, L.A. Bugnet, Astronomy &#38; Astrophysics 676 (2023).","ieee":"S. Mathis and L. A. Bugnet, “Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields,” <i>Astronomy &#38; Astrophysics</i>, vol. 676. EDP Sciences, 2023.","ama":"Mathis S, Bugnet LA. Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields. <i>Astronomy &#38; Astrophysics</i>. 2023;676. doi:<a href=\"https://doi.org/10.1051/0004-6361/202346832\">10.1051/0004-6361/202346832</a>","chicago":"Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2023. <a href=\"https://doi.org/10.1051/0004-6361/202346832\">https://doi.org/10.1051/0004-6361/202346832</a>.","mla":"Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” <i>Astronomy &#38; Astrophysics</i>, vol. 676, L9, EDP Sciences, 2023, doi:<a href=\"https://doi.org/10.1051/0004-6361/202346832\">10.1051/0004-6361/202346832</a>."},"_id":"14256","doi":"10.1051/0004-6361/202346832","abstract":[{"text":"Context. Space asteroseismology is revolutionizing our knowledge of the internal structure and dynamics of stars. A breakthrough is ongoing with the recent discoveries of signatures of strong magnetic fields in the core of red giant stars. The key signature for such a detection is the asymmetry these fields induce in the frequency splittings of observed dipolar mixed gravito-acoustic modes.\r\nAims. We investigate the ability of the observed asymmetries of the frequency splittings of dipolar mixed modes to constrain the geometrical properties of deep magnetic fields.\r\nMethods. We used the powerful analytical Racah-Wigner algebra used in quantum mechanics to characterize the geometrical couplings of dipolar mixed oscillation modes with various realistically plausible topologies of fossil magnetic fields. We also computed the induced perturbation of their frequencies.\r\nResults. First, in the case of an oblique magnetic dipole, we provide the exact analytical expression of the asymmetry as a function of the angle between the rotation and magnetic axes. Its value provides a direct measure of this angle. Second, considering a combination of axisymmetric dipolar and quadrupolar fields, we show how the asymmetry is blind to the unraveling of the relative strength and sign of each component. Finally, in the case of a given multipole, we show that a negative asymmetry is a signature of non-axisymmetric topologies.\r\nConclusions. Asymmetries of dipolar mixed modes provide a key bit of information on the geometrical topology of deep fossil magnetic fields, but this is insufficient on its own. Asteroseismic constraints should therefore be combined with spectropolarimetric observations and numerical simulations, which aim to predict the more probable stable large-scale geometries.","lang":"eng"}],"oa_version":"Published Version","article_processing_charge":"Yes (in subscription journal)","type":"journal_article","publication":"Astronomy & Astrophysics","volume":676,"day":"01","month":"08","language":[{"iso":"eng"}],"file_date_updated":"2023-09-06T07:13:19Z","publication_status":"published","external_id":{"arxiv":["2306.11587"],"isi":["001046037700007"]},"department":[{"_id":"LiBu"}],"has_accepted_license":"1","arxiv":1,"file":[{"date_created":"2023-09-06T07:13:19Z","success":1,"content_type":"application/pdf","file_name":"2023_AstronomyAstrophysics_Mathis.pdf","access_level":"open_access","date_updated":"2023-09-06T07:13:19Z","file_id":"14271","creator":"dernst","checksum":"7b30d26fb2b7bcb5b5be1414950615f9","file_size":458120,"relation":"main_file"}],"article_number":"L9","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"author":[{"first_name":"S.","last_name":"Mathis","full_name":"Mathis, S."},{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"}],"publisher":"EDP Sciences","das_tickbox":"1","intvolume":"       676","year":"2023","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"ddc":["520"],"date_created":"2023-09-03T22:01:15Z","isi":1,"quality_controlled":"1","date_published":"2023-08-01T00:00:00Z","article_type":"letter_note","scopus_import":"1","title":"Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields"},{"file_date_updated":"2023-11-22T09:46:06Z","degree_awarded":"PhD","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","month":"11","language":[{"iso":"eng"}],"day":"16","supervisor":[{"id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrew P","full_name":"Higginbotham, Andrew P","orcid":"0000-0003-2607-2363","last_name":"Higginbotham"}],"type":"dissertation","doi":"10.15479/14547","_id":"14547","abstract":[{"text":"Superconductor-semiconductor heterostructures currently capture a significant amount of research interest and they serve as the physical platform in many proposals towards topological quantum computation.\r\nDespite being under extensive investigations, historically using transport techniques, the basic properties of the interface between the superconductor and the semiconductor remain to be understood.\r\n\r\nIn this thesis, two separate studies on the Al-InAs heterostructures are reported with the first focusing on the physics of the material motivated by the emergence of a new phase, the Bogoliubov-Fermi surface. \r\nThe second focuses on a technological application, a gate-tunable Josephson parametric amplifier.\r\n\r\nIn the first study, we investigate the hypothesized unconventional nature of the induced superconductivity at the interface between the Al thin film and the InAs quantum well.\r\nWe embed a two-dimensional Al-InAs hybrid system in a resonant microwave circuit allowing measurements of change in inductance.\r\nThe behaviour of the resonance in a range of temperature and in-plane magnetic field has been studied and compared with the theory of conventional s-wave superconductor and a two-component theory that includes both contribution of the $s$-wave pairing in Al and the intraband $p \\pm ip$ pairing in InAs.\r\nMeasuring the temperature dependence of resonant frequency, no discrepancy is found between data and the conventional theory.\r\nWe observe the breakdown of superconductivity due to an applied magnetic field which contradicts the conventional theory.\r\nIn contrast, the data can be captured quantitatively by fitting to a two-component model.\r\nWe find the evidence of the intraband $p \\pm ip$ pairing in the InAs and the emergence of the Bogoliubov-Fermi surfaces due to magnetic field with the characteristic value $B^* = 0.33~\\mathrm{T}$.\r\nFrom the fits, the sheet resistance of Al, the carrier density and mobility in InAs are determined.\r\nBy systematically studying the anisotropy of the circuit response, we find weak anisotropy for $B < B^*$ and increasingly strong anisotropy for $B > B^*$ resulting in a pronounced two-lobe structure in polar plot of frequency versus field angle.\r\nStrong resemblance between the field dependence of dissipation and superfluid density hints at a hidden signature of the Bogoliubov-Fermi surface that is burried in the dissipation data.\r\n\r\nIn the second study, we realize a parametric amplifier with a Josephson field effect transistor as the active element.\r\nThe device's modest construction consists of a gated SNS weak link embedded at the center of a coplanar waveguide resonator.\r\nBy applying a gate voltage, the resonant frequency is field-effect tunable over a range of 2 GHz.\r\nModelling the JoFET minimally as a parallel RL circuit, the dissipation introduced by the JoFET can be quantitatively related to the gate voltage.\r\nWe observed gate-tunable Kerr nonlinearity qualitatively in line with expectation.\r\nThe JoFET amplifier has 20 dB of gain, 4 MHz of instantaneous bandwidth, and a 1dB compression point of -125.5 dBm when operated at a fixed resonant frequency.\r\nIn general, the signal-to-noise ratio is improved by 5-7 dB when the JoFET amplifier is activated compared.\r\nThe noise of the measurement chain and insertion loss of relevant circuit elements are calibrated to determine the expected and the real noise performance of the JoFET amplifier.\r\nAs a quantification of the noise performance, the measured total input-referred noise of the JoFET amplifier is in good agreement with the estimated expectation which takes device loss into account.\r\nWe found that the noise performance of the device reported in this document approaches one photon of total input-referred added noise which is the quantum limit imposed in nondegenerate parametric amplifier.","lang":"eng"}],"oa_version":"Published Version","article_processing_charge":"No","page":"80","citation":{"ista":"Phan DT. 2023. Resonant microwave spectroscopy of Al-InAs. Institute of Science and Technology Austria.","apa":"Phan, D. T. (2023). <i>Resonant microwave spectroscopy of Al-InAs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/14547\">https://doi.org/10.15479/14547</a>","short":"D.T. Phan, Resonant Microwave Spectroscopy of Al-InAs, Institute of Science and Technology Austria, 2023.","ieee":"D. T. Phan, “Resonant microwave spectroscopy of Al-InAs,” Institute of Science and Technology Austria, 2023.","ama":"Phan DT. Resonant microwave spectroscopy of Al-InAs. 2023. doi:<a href=\"https://doi.org/10.15479/14547\">10.15479/14547</a>","chicago":"Phan, Duc T. “Resonant Microwave Spectroscopy of Al-InAs.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/14547\">https://doi.org/10.15479/14547</a>.","mla":"Phan, Duc T. <i>Resonant Microwave Spectroscopy of Al-InAs</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/14547\">10.15479/14547</a>."},"date_updated":"2026-07-08T08:38:43Z","oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Resonant microwave spectroscopy of Al-InAs","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"Bio"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"10851","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"13264"}]},"date_published":"2023-11-16T00:00:00Z","ddc":["530"],"date_created":"2023-11-17T13:45:26Z","publication_identifier":{"issn":["2663-337X"]},"keyword":["superconductor-semiconductor","superconductivity","Al","InAs","p-wave","superconductivity","JPA","microwave"],"year":"2023","author":[{"first_name":"Duc T","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","last_name":"Phan","full_name":"Phan, Duc T"}],"OA_place":"publisher","publisher":"Institute of Science and Technology Austria","tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"alternative_title":["ISTA Thesis"],"status":"public","file":[{"file_id":"14548","access_level":"open_access","date_updated":"2023-11-22T09:46:06Z","content_type":"application/pdf","file_name":"Phan_Thesis_pdfa.pdf","date_created":"2023-11-17T13:36:44Z","relation":"main_file","creator":"pduc","checksum":"db0c37d213bc002125bd59690e9db246","file_size":34828019},{"file_size":279319709,"creator":"pduc","checksum":"8d3bd6afa279a0078ffd13e06bb6d56d","relation":"source_file","date_created":"2023-11-17T13:44:53Z","file_name":"dissertation_src.zip","content_type":"application/zip","access_level":"closed","date_updated":"2023-11-17T13:47:54Z","file_id":"14549"}],"department":[{"_id":"GradSch"},{"_id":"AnHi"}],"has_accepted_license":"1","corr_author":"1","publication_status":"published"},{"status":"public","arxiv":1,"dataavailabilitystatement":"Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.","corr_author":"1","external_id":{"arxiv":["2212.01266"],"isi":["001051044600008"]},"publication_status":"published","department":[{"_id":"OnHo"}],"article_type":"original","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.01266","open_access":"1"}],"title":"Monitoring and active stabilization of laser injection locking using beam ellipticity","issue":"15","date_published":"2023-07-21T00:00:00Z","publication_identifier":{"issn":["0146-9592"],"eissn":["1539-4794"]},"researchdata_availability":"upon request","isi":1,"date_created":"2024-01-08T13:01:46Z","quality_controlled":"1","author":[{"id":"4328fa4c-f128-11eb-9611-c107b0fe4d51","first_name":"Umang","full_name":"Mishra, Umang","last_name":"Mishra"},{"last_name":"Li","full_name":"Li, Vyacheslav","first_name":"Vyacheslav","id":"3A4FAA92-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wald","full_name":"Wald, Sebastian","orcid":"0000-0002-5869-1604","id":"133F200A-B015-11E9-AD41-0EDAE5697425","first_name":"Sebastian"},{"full_name":"Agafonova, Sofya","last_name":"Agafonova","orcid":"0000-0003-0582-2946","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","first_name":"Sofya"},{"full_name":"Diorico, Fritz R","last_name":"Diorico","orcid":"0000-0002-4947-8924","id":"2E054C4C-F248-11E8-B48F-1D18A9856A87","first_name":"Fritz R"},{"first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","full_name":"Hosten, Onur","last_name":"Hosten"}],"publisher":"Optica Publishing Group","intvolume":"        48","das_tickbox":"1","supplementarymaterial":"no","keyword":["Atomic and Molecular Physics","and Optics"],"year":"2023","publication":"Optics Letters","_id":"14749","doi":"10.1364/ol.495553","abstract":[{"lang":"eng","text":"We unveil a powerful method for the stabilization of laser injection locking based on sensing variations in the output beam ellipticity of an optically seeded laser. The effect arises due to an interference between the seeding beam and the injected laser output. We demonstrate the method for a commercial semiconductor laser without the need for any internal changes to the readily operational injection locked laser system that was used. The method can also be used to increase the mode-hop free tuning range of lasers, and has the potential to fill a void in the low-noise laser industry."}],"oa_version":"Preprint","article_processing_charge":"No","type":"journal_article","page":"3973-3976","citation":{"mla":"Mishra, Umang, et al. “Monitoring and Active Stabilization of Laser Injection Locking Using Beam Ellipticity.” <i>Optics Letters</i>, vol. 48, no. 15, Optica Publishing Group, 2023, pp. 3973–76, doi:<a href=\"https://doi.org/10.1364/ol.495553\">10.1364/ol.495553</a>.","chicago":"Mishra, Umang, Vyacheslav Li, Sebastian Wald, Sofia Agafonova, Fritz R Diorico, and Onur Hosten. “Monitoring and Active Stabilization of Laser Injection Locking Using Beam Ellipticity.” <i>Optics Letters</i>. Optica Publishing Group, 2023. <a href=\"https://doi.org/10.1364/ol.495553\">https://doi.org/10.1364/ol.495553</a>.","ama":"Mishra U, Li V, Wald S, Agafonova S, Diorico FR, Hosten O. Monitoring and active stabilization of laser injection locking using beam ellipticity. <i>Optics Letters</i>. 2023;48(15):3973-3976. doi:<a href=\"https://doi.org/10.1364/ol.495553\">10.1364/ol.495553</a>","ieee":"U. Mishra, V. Li, S. Wald, S. Agafonova, F. R. Diorico, and O. Hosten, “Monitoring and active stabilization of laser injection locking using beam ellipticity,” <i>Optics Letters</i>, vol. 48, no. 15. Optica Publishing Group, pp. 3973–3976, 2023.","short":"U. Mishra, V. Li, S. Wald, S. Agafonova, F.R. Diorico, O. Hosten, Optics Letters 48 (2023) 3973–3976.","ista":"Mishra U, Li V, Wald S, Agafonova S, Diorico FR, Hosten O. 2023. Monitoring and active stabilization of laser injection locking using beam ellipticity. Optics Letters. 48(15), 3973–3976.","apa":"Mishra, U., Li, V., Wald, S., Agafonova, S., Diorico, F. R., &#38; Hosten, O. (2023). Monitoring and active stabilization of laser injection locking using beam ellipticity. <i>Optics Letters</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/ol.495553\">https://doi.org/10.1364/ol.495553</a>"},"oa":1,"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","date_updated":"2026-07-08T08:41:47Z","month":"07","language":[{"iso":"eng"}],"volume":48,"day":"21"},{"year":"2023","supplementarymaterial":"yes","intvolume":"       107","das_tickbox":"0","publisher":"American Physical Society","author":[{"first_name":"Sofya","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","orcid":"0000-0003-0582-2946","full_name":"Agafonova, Sofya","last_name":"Agafonova"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"},{"last_name":"Volosniev","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem"}],"quality_controlled":"1","date_created":"2023-07-16T22:01:10Z","isi":1,"researchdata_availability":"no","ec_funded":1,"publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"date_published":"2023-06-20T00:00:00Z","title":"Finite-range bias in fitting three-body loss to the zero-range model","issue":"6","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2302.01022"}],"scopus_import":"1","article_type":"letter_note","department":[{"_id":"MiLe"},{"_id":"OnHo"}],"corr_author":"1","external_id":{"arxiv":["2302.01022"],"isi":["001019748000005"]},"publication_status":"published","arxiv":1,"status":"public","article_number":"L061304","day":"20","volume":107,"language":[{"iso":"eng"}],"month":"06","date_updated":"2026-07-08T08:30:05Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","oa":1,"acknowledgement":"We thank Jan Arlt, Hans-Werner Hammer, and Karsten Riisager for useful discussions. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","citation":{"chicago":"Agafonova, Sofia, Mikhail Lemeshko, and Artem Volosniev. “Finite-Range Bias in Fitting Three-Body Loss to the Zero-Range Model.” <i>Physical Review A</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">https://doi.org/10.1103/PhysRevA.107.L061304</a>.","mla":"Agafonova, Sofia, et al. “Finite-Range Bias in Fitting Three-Body Loss to the Zero-Range Model.” <i>Physical Review A</i>, vol. 107, no. 6, L061304, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">10.1103/PhysRevA.107.L061304</a>.","ama":"Agafonova S, Lemeshko M, Volosniev A. Finite-range bias in fitting three-body loss to the zero-range model. <i>Physical Review A</i>. 2023;107(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">10.1103/PhysRevA.107.L061304</a>","ieee":"S. Agafonova, M. Lemeshko, and A. Volosniev, “Finite-range bias in fitting three-body loss to the zero-range model,” <i>Physical Review A</i>, vol. 107, no. 6. American Physical Society, 2023.","ista":"Agafonova S, Lemeshko M, Volosniev A. 2023. Finite-range bias in fitting three-body loss to the zero-range model. Physical Review A. 107(6), L061304.","apa":"Agafonova, S., Lemeshko, M., &#38; Volosniev, A. (2023). Finite-range bias in fitting three-body loss to the zero-range model. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">https://doi.org/10.1103/PhysRevA.107.L061304</a>","short":"S. Agafonova, M. Lemeshko, A. Volosniev, Physical Review A 107 (2023)."},"project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","call_identifier":"H2020"}],"type":"journal_article","article_processing_charge":"No","oa_version":"Preprint","_id":"13233","abstract":[{"lang":"eng","text":"We study the impact of finite-range physics on the zero-range-model analysis of three-body recombination in ultracold atoms. We find that temperature dependence of the zero-range parameters can vary from one set of measurements to another as it may be driven by the distribution of error bars in the experiment, and not by the underlying three-body physics. To study finite-temperature effects in three-body recombination beyond the zero-range physics, we introduce and examine a finite-range model based upon a hyperspherical formalism. The systematic error discussed in this Letter may provide a significant contribution to the error bars of measured three-body parameters."}],"doi":"10.1103/PhysRevA.107.L061304","publication":"Physical Review A"},{"author":[{"full_name":"Phan, Duc T","last_name":"Phan","first_name":"Duc T","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Falthansl-Scheinecker, Paul","last_name":"Falthansl-Scheinecker","id":"85b43b21-15b2-11ec-abd3-e2c252cc2285","first_name":"Paul"},{"id":"4328fa4c-f128-11eb-9611-c107b0fe4d51","first_name":"Umang","last_name":"Mishra","full_name":"Mishra, Umang"},{"full_name":"Strickland, W. M.","last_name":"Strickland","first_name":"W. M."},{"first_name":"D.","last_name":"Langone","full_name":"Langone, D."},{"first_name":"J.","full_name":"Shabani, J.","last_name":"Shabani"},{"full_name":"Higginbotham, Andrew P","orcid":"0000-0003-2607-2363","last_name":"Higginbotham","first_name":"Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87"}],"publisher":"American Physical Society","supplementarymaterial":"yes","intvolume":"        19","das_tickbox":"1","year":"2023","publication_identifier":{"eissn":["2331-7019"]},"researchdata_availability":"yes (supplementary data)","date_created":"2023-07-23T22:01:12Z","quality_controlled":"1","isi":1,"date_published":"2023-06-09T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","id":"14547","status":"public"}]},"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"scopus_import":"1","article_type":"original","main_file_link":[{"url":"https://arxiv.org/abs/2206.05746","open_access":"1"}],"title":"Gate-tunable superconductor-semiconductor parametric amplifier","issue":"6","corr_author":"1","external_id":{"isi":["001012022600004"],"arxiv":["2206.05746"]},"publication_status":"published","department":[{"_id":"AnHi"},{"_id":"OnHo"}],"arxiv":1,"dataavailabilitystatement":"The raw data and the plotting code are available in the Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevApplied.19.064032. Further data are available upon reasonable request.","article_number":"064032","status":"public","volume":19,"day":"09","month":"06","language":[{"iso":"eng"}],"acknowledgement":"We thank Shyam Shankar for helpful feedback on the manuscript. We gratefully acknowledge the support of the ISTA nanofabrication facility, the Miba Machine Shop, and the eMachine Shop. The NYU team acknowledges support from Army Research Office Grant No. W911NF2110303.","oa":1,"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","date_updated":"2026-07-08T08:38:44Z","citation":{"ieee":"D. T. Phan <i>et al.</i>, “Gate-tunable superconductor-semiconductor parametric amplifier,” <i>Physical Review Applied</i>, vol. 19, no. 6. American Physical Society, 2023.","apa":"Phan, D. T., Falthansl-Scheinecker, P., Mishra, U., Strickland, W. M., Langone, D., Shabani, J., &#38; Higginbotham, A. P. (2023). Gate-tunable superconductor-semiconductor parametric amplifier. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">https://doi.org/10.1103/PhysRevApplied.19.064032</a>","ista":"Phan DT, Falthansl-Scheinecker P, Mishra U, Strickland WM, Langone D, Shabani J, Higginbotham AP. 2023. Gate-tunable superconductor-semiconductor parametric amplifier. Physical Review Applied. 19(6), 064032.","short":"D.T. Phan, P. Falthansl-Scheinecker, U. Mishra, W.M. Strickland, D. Langone, J. Shabani, A.P. Higginbotham, Physical Review Applied 19 (2023).","chicago":"Phan, Duc T, Paul Falthansl-Scheinecker, Umang Mishra, W. M. Strickland, D. Langone, J. Shabani, and Andrew P Higginbotham. “Gate-Tunable Superconductor-Semiconductor Parametric Amplifier.” <i>Physical Review Applied</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">https://doi.org/10.1103/PhysRevApplied.19.064032</a>.","mla":"Phan, Duc T., et al. “Gate-Tunable Superconductor-Semiconductor Parametric Amplifier.” <i>Physical Review Applied</i>, vol. 19, no. 6, 064032, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">10.1103/PhysRevApplied.19.064032</a>.","ama":"Phan DT, Falthansl-Scheinecker P, Mishra U, et al. Gate-tunable superconductor-semiconductor parametric amplifier. <i>Physical Review Applied</i>. 2023;19(6). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">10.1103/PhysRevApplied.19.064032</a>"},"doi":"10.1103/PhysRevApplied.19.064032","_id":"13264","abstract":[{"lang":"eng","text":"We build a parametric amplifier with a Josephson field-effect transistor (JoFET) as the active element. The resonant frequency of the device is field-effect tunable over a range of 2 GHz. The JoFET amplifier has 20 dB of gain, 4 MHz of instantaneous bandwidth, and a 1-dB compression point of -125.5 dBm when operated at a fixed resonance frequency.\r\n\r\n"}],"oa_version":"Preprint","article_processing_charge":"No","type":"journal_article","publication":"Physical Review Applied"},{"volume":256,"day":"01","month":"09","language":[{"iso":"eng"}],"_id":"22162","abstract":[{"lang":"eng","text":"Given a bipartite graph G, the graphical matrix space SG consists of\r\nmatrices whose non-zero entries can only be at those positions corresponding to edges in G. Tutte (J. London Math. Soc., 1947), Edmonds\r\n(J. Res. Nat. Bur. Standards Sect. B, 1967) and Lov´asz (FCT, 1979) observed connections between perfect matchings in G and full-rank matrices\r\nin SG. Dieudonn´e (Arch. Math., 1948) proved a tight upper bound on\r\nthe dimensions of those matrix spaces containing only singular matrices.\r\nThe starting point of this paper is a simultaneous generalization of these\r\ntwo classical results: we show that the largest dimension over subspaces\r\nof SG containing only singular matrices is equal to the maximum size over\r\nsubgraphs of G without perfect matchings, based on Meshulam’s proof of\r\nDieudonn´e’s result (Quart. J. Math., 1985).\r\nStarting from this result, we go on to establish more connections\r\nbetween properties of graphs and matrix spaces. For example, we\r\nestablish connections between acyclicity and nilpotency, between strong\r\nconnectivity and irreducibility, and between isomorphism and\r\nconjugacy/congruence. For each connection, we study three types of correspondences, namely the basic correspondence, the inherited correspondence (for subgraphs and subspaces), and the induced correspondence\r\n(for induced subgraphs and restrictions). Some correspondences lead to\r\nintriguing generalizations of classical results, such as Dieudonn´e’s result\r\nmentioned above, and a celebrated theorem of Gerstenhaber regarding the\r\nlargest dimension of nil matrix spaces (Amer. J. Math., 1958).\r\nFinally, we show some implications of our results to quantum information and present open problems in computational complexity motivated\r\nby these results."}],"doi":"10.1007/s11856-023-2515-7","oa_version":"Preprint","article_processing_charge":"No","OA_type":"green","type":"journal_article","publication":"Israel Journal of Mathematics","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-08T10:44:50Z","page":"513-580","citation":{"ama":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. Connections between graphs and matrix spaces. <i>Israel Journal of Mathematics</i>. 2023;256(2):513-580. doi:<a href=\"https://doi.org/10.1007/s11856-023-2515-7\">10.1007/s11856-023-2515-7</a>","mla":"Li, Yinan, et al. “Connections between Graphs and Matrix Spaces.” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2, Springer Nature, 2023, pp. 513–80, doi:<a href=\"https://doi.org/10.1007/s11856-023-2515-7\">10.1007/s11856-023-2515-7</a>.","chicago":"Li, Yinan, Youming Qiao, Avi Wigderson, Yuval Wigderson, and Chuanqi Zhang. “Connections between Graphs and Matrix Spaces.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-023-2515-7\">https://doi.org/10.1007/s11856-023-2515-7</a>.","short":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, C. Zhang, Israel Journal of Mathematics 256 (2023) 513–580.","ista":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. 2023. Connections between graphs and matrix spaces. Israel Journal of Mathematics. 256(2), 513–580.","apa":"Li, Y., Qiao, Y., Wigderson, A., Wigderson, Y., &#38; Zhang, C. (2023). Connections between graphs and matrix spaces. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-023-2515-7\">https://doi.org/10.1007/s11856-023-2515-7</a>","ieee":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, and C. Zhang, “Connections between graphs and matrix spaces,” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2. Springer Nature, pp. 513–580, 2023."},"date_published":"2023-09-01T00:00:00Z","scopus_import":"1","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2206.04815"}],"title":"Connections between graphs and matrix spaces","issue":"2","OA_place":"repository","author":[{"first_name":"Yinan","last_name":"Li","full_name":"Li, Yinan"},{"first_name":"Youming","full_name":"Qiao, Youming","last_name":"Qiao"},{"first_name":"Avi","last_name":"Wigderson","full_name":"Wigderson, Avi"},{"last_name":"Wigderson","full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"},{"first_name":"Chuanqi","full_name":"Zhang, Chuanqi","last_name":"Zhang"}],"publisher":"Springer Nature","intvolume":"       256","year":"2023","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"quality_controlled":"1","date_created":"2026-06-29T10:52:37Z","arxiv":1,"status":"public","extern":"1","external_id":{"arxiv":["2206.04815"]},"publication_status":"published"},{"issue":"4","title":"Three early problems on size Ramsey numbers","scopus_import":"1","article_type":"original","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2111.05420","open_access":"1"}],"date_published":"2023-08-01T00:00:00Z","quality_controlled":"1","date_created":"2026-06-29T10:51:32Z","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"intvolume":"        43","year":"2023","author":[{"first_name":"David","last_name":"Conlon","full_name":"Conlon, David"},{"first_name":"Jacob","full_name":"Fox, Jacob","last_name":"Fox"},{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","last_name":"Wigderson","full_name":"Wigderson, Yuval"}],"OA_place":"repository","publisher":"Springer Nature","status":"public","arxiv":1,"publication_status":"published","external_id":{"arxiv":["2111.05420"]},"extern":"1","language":[{"iso":"eng"}],"month":"08","volume":43,"day":"01","publication":"Combinatorica","OA_type":"green","type":"journal_article","doi":"10.1007/s00493-023-00034-7","_id":"22159","abstract":[{"lang":"eng","text":"The size Ramsey number of a graph H is defined as the minimum number of edges in a graph G such that there is a monochromatic copy of H in every two-coloring of E(G). The size Ramsey number was introduced by Erdős, Faudree, Rousseau, and Schelp in 1978 and they ended their foundational paper by asking whether one can determine up to a constant factor the size Ramsey numbers of three families of graphs: complete bipartite graphs, book graphs (obtained by adding many common neighbors to the vertices of a clique), and starburst graphs (obtained by adding many pendant edges to each vertex of a clique). In this paper, we completely resolve the latter two questions and make substantial progress on the first by determining the size Ramsey number of Ks,t up to a constant factor for all t=Ω(s log s)."}],"article_processing_charge":"No","oa_version":"Preprint","page":"743-768","citation":{"ieee":"D. Conlon, J. Fox, and Y. Wigderson, “Three early problems on size Ramsey numbers,” <i>Combinatorica</i>, vol. 43, no. 4. Springer Nature, pp. 743–768, 2023.","short":"D. Conlon, J. Fox, Y. Wigderson, Combinatorica 43 (2023) 743–768.","apa":"Conlon, D., Fox, J., &#38; Wigderson, Y. (2023). Three early problems on size Ramsey numbers. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>","ista":"Conlon D, Fox J, Wigderson Y. 2023. Three early problems on size Ramsey numbers. Combinatorica. 43(4), 743–768.","mla":"Conlon, David, et al. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>, vol. 43, no. 4, Springer Nature, 2023, pp. 743–68, doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>.","chicago":"Conlon, David, Jacob Fox, and Yuval Wigderson. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>.","ama":"Conlon D, Fox J, Wigderson Y. Three early problems on size Ramsey numbers. <i>Combinatorica</i>. 2023;43(4):743-768. doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>"},"date_updated":"2026-07-08T10:34:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"volume":120,"day":"21","language":[{"iso":"eng"}],"month":"11","file_date_updated":"2023-12-11T12:45:12Z","date_updated":"2026-07-13T12:30:49Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"acknowledgement":"We thank Prof. C. Nazaret and Prof. J.-P. Mazat for sharing the code of their mitochondrial model. We also thank G. Miesenböck, E. Marder, L. Abbott, A. Kempf, P. Hasenhuetl, W. Podlaski, F. Zenke, E. Agnes, P. Bozelos, J. Watson, B. Confavreux, and G. Christodoulou, and the rest of the Vogels Lab for their feedback. This work was funded by Wellcome Trust and Royal Society Sir Henry Dale Research Fellowship (WT100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z), and a UK Research and Innovation, Biotechnology and Biological Sciences Research Council grant (UKRI-BBSRC BB/N019512/1).","citation":{"mla":"Chintaluri, Chaitanya, and Tim P. Vogels. “Metabolically Regulated Spiking Could Serve Neuronal Energy Homeostasis and Protect from Reactive Oxygen Species.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 120, no. 48, e2306525120, National Academy of Sciences, 2023, doi:<a href=\"https://doi.org/10.1073/pnas.2306525120\">10.1073/pnas.2306525120</a>.","chicago":"Chintaluri, Chaitanya, and Tim P Vogels. “Metabolically Regulated Spiking Could Serve Neuronal Energy Homeostasis and Protect from Reactive Oxygen Species.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2023. <a href=\"https://doi.org/10.1073/pnas.2306525120\">https://doi.org/10.1073/pnas.2306525120</a>.","ama":"Chintaluri C, Vogels TP. Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2023;120(48). doi:<a href=\"https://doi.org/10.1073/pnas.2306525120\">10.1073/pnas.2306525120</a>","ieee":"C. Chintaluri and T. P. Vogels, “Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 120, no. 48. National Academy of Sciences, 2023.","short":"C. Chintaluri, T.P. Vogels, Proceedings of the National Academy of Sciences of the United States of America 120 (2023).","apa":"Chintaluri, C., &#38; Vogels, T. P. (2023). Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2306525120\">https://doi.org/10.1073/pnas.2306525120</a>","ista":"Chintaluri C, Vogels TP. 2023. Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species. Proceedings of the National Academy of Sciences of the United States of America. 120(48), e2306525120."},"OA_type":"hybrid","type":"journal_article","project":[{"_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","grant_number":"214316/Z/18/Z"}],"_id":"14666","doi":"10.1073/pnas.2306525120","abstract":[{"text":"So-called spontaneous activity is a central hallmark of most nervous systems. Such non-causal firing is contrary to the tenet of spikes as a means of communication, and its purpose remains unclear. We propose that self-initiated firing can serve as a release valve to protect neurons from the toxic conditions arising in mitochondria from lower-than-baseline energy consumption. To demonstrate the viability of our hypothesis, we built a set of models that incorporate recent experimental results indicating homeostatic control of metabolic products—Adenosine triphosphate (ATP), adenosine diphosphate (ADP), and reactive oxygen species (ROS)—by changes in firing. We explore the relationship of metabolic cost of spiking with its effect on the temporal patterning of spikes and reproduce experimentally observed changes in intrinsic firing in the fruitfly dorsal fan-shaped body neuron in a model with ROS-modulated potassium channels. We also show that metabolic spiking homeostasis can produce indefinitely sustained avalanche dynamics in cortical circuits. Our theory can account for key features of neuronal activity observed in many studies ranging from ion channel function all the way to resting state dynamics. We finish with a set of experimental predictions that would confirm an integrated, crucial role for metabolically regulated spiking and firmly link metabolic homeostasis and neuronal function.","lang":"eng"}],"oa_version":"Published Version","article_processing_charge":"Yes (in subscription journal)","publication":"Proceedings of the National Academy of Sciences of the United States of America","intvolume":"       120","das_tickbox":"1","year":"2023","author":[{"first_name":"Chaitanya","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","orcid":"0000-0003-4252-1608","full_name":"Chintaluri, Chaitanya","last_name":"Chintaluri"},{"orcid":"0000-0003-3295-6181","last_name":"Vogels","full_name":"Vogels, Tim P","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P"}],"OA_place":"publisher","publisher":"National Academy of Sciences","ddc":["570"],"isi":1,"quality_controlled":"1","date_created":"2023-12-10T23:01:00Z","pmid":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"related_material":{"link":[{"url":"https://github.com/ccluri/metabolic_spiking","relation":"software"}]},"date_published":"2023-11-21T00:00:00Z","title":"Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species","issue":"48","scopus_import":"1","article_type":"original","department":[{"_id":"TiVo"}],"has_accepted_license":"1","external_id":{"pmid":["37988463"],"isi":["001157389000005"]},"publication_status":"published","corr_author":"1","file":[{"file_id":"14678","date_updated":"2023-12-11T12:45:12Z","access_level":"open_access","file_name":"2023_PNAS_Chintaluri.pdf","content_type":"application/pdf","success":1,"date_created":"2023-12-11T12:45:12Z","relation":"main_file","file_size":16891602,"checksum":"bf4ec38602a70dae4338077a5a4d497f","creator":"dernst"}],"tmp":{"short":"CC BY (4.0)","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)"},"article_number":"e2306525120","status":"public"},{"external_id":{"arxiv":["2105.09194"]},"publication_status":"published","extern":"1","status":"public","arxiv":1,"publication_identifier":{"issn":["0364-9024"],"eissn":["1097-0118"]},"date_created":"2026-06-29T10:53:26Z","quality_controlled":"1","publisher":"Wiley","author":[{"first_name":"Jacob","last_name":"Fox","full_name":"Fox, Jacob"},{"last_name":"Wigderson","full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval"}],"OA_place":"repository","keyword":["chromatic threshold","graph removal lemma","homomorphism threshold","minimum degree conditions"],"year":"2023","intvolume":"       102","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2105.09194","open_access":"1"}],"scopus_import":"1","article_type":"original","issue":"4","title":"Minimum degree and the graph removal lemma","date_published":"2023-04-01T00:00:00Z","citation":{"short":"J. Fox, Y. Wigderson, Journal of Graph Theory 102 (2023) 648–665.","apa":"Fox, J., &#38; Wigderson, Y. (2023). Minimum degree and the graph removal lemma. <i>Journal of Graph Theory</i>. Wiley. <a href=\"https://doi.org/10.1002/jgt.22891\">https://doi.org/10.1002/jgt.22891</a>","ista":"Fox J, Wigderson Y. 2023. Minimum degree and the graph removal lemma. Journal of Graph Theory. 102(4), 648–665.","ieee":"J. Fox and Y. Wigderson, “Minimum degree and the graph removal lemma,” <i>Journal of Graph Theory</i>, vol. 102, no. 4. Wiley, pp. 648–665, 2023.","ama":"Fox J, Wigderson Y. Minimum degree and the graph removal lemma. <i>Journal of Graph Theory</i>. 2023;102(4):648-665. doi:<a href=\"https://doi.org/10.1002/jgt.22891\">10.1002/jgt.22891</a>","mla":"Fox, Jacob, and Yuval Wigderson. “Minimum Degree and the Graph Removal Lemma.” <i>Journal of Graph Theory</i>, vol. 102, no. 4, Wiley, 2023, pp. 648–65, doi:<a href=\"https://doi.org/10.1002/jgt.22891\">10.1002/jgt.22891</a>.","chicago":"Fox, Jacob, and Yuval Wigderson. “Minimum Degree and the Graph Removal Lemma.” <i>Journal of Graph Theory</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/jgt.22891\">https://doi.org/10.1002/jgt.22891</a>."},"page":"648-665","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-14T08:24:20Z","publication":"Journal of Graph Theory","article_processing_charge":"No","oa_version":"Preprint","abstract":[{"lang":"eng","text":"The clique removal lemma says that for every ≥r 3 andε > 0, there exists some δ > 0 so that every n‐vertex graph G with fewer than δnr copies of K r can be made K r ‐free by removing at most εn2 edges. The dependence of δ on ε in this result is notoriously difficult to determine: it is known that δ−1 must be at least super‐polynomial in ε−1, and that it is at most of tower type in εlog −1. We prove that if one imposes an appropriate minimum degree condition on G, then one can actually take δ to be a linear function of ε in the clique removal lemma. Moreover, we determine the threshold for such a minimum degree requirement, showing that above this threshold we have linear bounds, whereas below the threshold the bounds are once again super‐polynomial, as in the unrestricted removal lemma. We also investigate this question for other graphs besides cliques, and prove some general results about how minimum degree conditions affect the bounds in the graph removal lemma."}],"_id":"22164","doi":"10.1002/jgt.22891","type":"journal_article","OA_type":"green","month":"04","language":[{"iso":"eng"}],"day":"01","volume":102},{"extern":"1","external_id":{"arxiv":["2110.14483"]},"publication_status":"published","arxiv":1,"status":"public","publisher":"Cambridge University Press","author":[{"first_name":"David","last_name":"Conlon","full_name":"Conlon, David"},{"first_name":"Jacob","full_name":"Fox, Jacob","last_name":"Fox"},{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","full_name":"Wigderson, Yuval","last_name":"Wigderson"}],"OA_place":"repository","keyword":["Ramsey theory","book graphs","Ramsey goodness"],"year":"2023","intvolume":"        32","publication_identifier":{"issn":["0963-5483"],"eissn":["1469-2163"]},"quality_controlled":"1","date_created":"2026-06-29T10:53:47Z","date_published":"2023-05-01T00:00:00Z","mathsc":["05C55","05D10"],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2110.14483"}],"article_type":"original","scopus_import":"1","issue":"3","title":"Off-diagonal book Ramsey numbers","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"date_updated":"2026-07-14T08:27:40Z","citation":{"mla":"Conlon, David, et al. “Off-Diagonal Book Ramsey Numbers.” <i>Combinatorics, Probability and Computing</i>, vol. 32, no. 3, Cambridge University Press, 2023, pp. 516–45, doi:<a href=\"https://doi.org/10.1017/s0963548322000360\">10.1017/s0963548322000360</a>.","chicago":"Conlon, David, Jacob Fox, and Yuval Wigderson. “Off-Diagonal Book Ramsey Numbers.” <i>Combinatorics, Probability and Computing</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/s0963548322000360\">https://doi.org/10.1017/s0963548322000360</a>.","ama":"Conlon D, Fox J, Wigderson Y. Off-diagonal book Ramsey numbers. <i>Combinatorics, Probability and Computing</i>. 2023;32(3):516-545. doi:<a href=\"https://doi.org/10.1017/s0963548322000360\">10.1017/s0963548322000360</a>","ieee":"D. Conlon, J. Fox, and Y. Wigderson, “Off-diagonal book Ramsey numbers,” <i>Combinatorics, Probability and Computing</i>, vol. 32, no. 3. Cambridge University Press, pp. 516–545, 2023.","short":"D. Conlon, J. Fox, Y. Wigderson, Combinatorics, Probability and Computing 32 (2023) 516–545.","apa":"Conlon, D., Fox, J., &#38; Wigderson, Y. (2023). Off-diagonal book Ramsey numbers. <i>Combinatorics, Probability and Computing</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/s0963548322000360\">https://doi.org/10.1017/s0963548322000360</a>","ista":"Conlon D, Fox J, Wigderson Y. 2023. Off-diagonal book Ramsey numbers. Combinatorics, Probability and Computing. 32(3), 516–545."},"page":"516-545","oa_version":"Preprint","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The book graph 𝐵(𝑘)\r\n𝑛 consists of 𝑛 copies of 𝐾𝑘+1 joined along a common 𝐾𝑘. In the prequel to this paper, we studied the diagonal Ramsey number 𝑟⁡(𝐵(𝑘)\r\n𝑛,𝐵(𝑘)\r\n𝑛). Here we consider the natural off-diagonal variant 𝑟⁡(𝐵(𝑘)\r\n𝑐⁢𝑛,𝐵(𝑘)\r\n𝑛) for fixed 𝑐 ∈(0,1]. In this more general setting, we show that an interesting dichotomy emerges: for very small 𝑐, a simple 𝑘-partite construction dictates the Ramsey function and all nearly-extremal colourings are close to being 𝑘-partite, while, for 𝑐 bounded away from 0, random colourings of an appropriate density are asymptotically optimal and all nearly-extremal colourings are quasirandom. Our investigations also open up a range of questions about what happens for intermediate values of 𝑐.\r\n\r\n"}],"_id":"22165","doi":"10.1017/s0963548322000360","type":"journal_article","OA_type":"green","publication":"Combinatorics, Probability and Computing","day":"01","volume":32,"language":[{"iso":"eng"}],"month":"05"},{"date_published":"2023-01-01T00:00:00Z","scopus_import":"1","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2207.07775"}],"title":"Ramsey multiplicity and the Turán coloring","author":[{"last_name":"Fox","full_name":"Fox, Jacob","first_name":"Jacob"},{"full_name":"Wigderson, Yuval","last_name":"Wigderson","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"OA_place":"repository","publisher":"Alliance of Diamond Open Access Journals","year":"2023","publication_identifier":{"eissn":["2517-5599"]},"date_created":"2026-06-29T10:55:46Z","quality_controlled":"1","arxiv":1,"status":"public","extern":"1","publication_status":"published","external_id":{"arxiv":["2207.07775"]},"day":"01","language":[{"iso":"eng"}],"month":"01","_id":"22170","doi":"10.19086/aic.2023.2","abstract":[{"text":"Extending an earlier conjecture of Erdős, Burr and Rosta conjectured that among all two-colorings of the edges of a complete graph, the uniformly random coloring asymptotically minimizes the number of monochromatic copies of any fixed graph H. This conjecture was disproved independently by Sidorenko and Thomason. The first author later found quantitatively stronger counterexamples, using the Turán coloring, in which one of the two colors spans a balanced complete multipartite graph.\r\nWe prove that the Turán coloring is extremal for an infinite family of graphs, and that it is the unique extremal coloring. This yields the first determination of the Ramsey multiplicity constant of a graph for which the Burr--Rosta conjecture fails.\r\nWe also prove an analogous three-color result. In this case, our result is conditional on a certain natural conjecture on the behavior of two-color Ramsey numbers.","lang":"eng"}],"article_processing_charge":"No","oa_version":"Preprint","OA_type":"green","type":"journal_article","publication":"Advances in Combinatorics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"date_updated":"2026-07-14T08:45:53Z","citation":{"ieee":"J. Fox and Y. Wigderson, “Ramsey multiplicity and the Turán coloring,” <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals, 2023.","apa":"Fox, J., &#38; Wigderson, Y. (2023). Ramsey multiplicity and the Turán coloring. <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals. <a href=\"https://doi.org/10.19086/aic.2023.2\">https://doi.org/10.19086/aic.2023.2</a>","ista":"Fox J, Wigderson Y. 2023. Ramsey multiplicity and the Turán coloring. Advances in Combinatorics.","short":"J. Fox, Y. Wigderson, Advances in Combinatorics (2023).","chicago":"Fox, Jacob, and Yuval Wigderson. “Ramsey Multiplicity and the Turán Coloring.” <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals, 2023. <a href=\"https://doi.org/10.19086/aic.2023.2\">https://doi.org/10.19086/aic.2023.2</a>.","mla":"Fox, Jacob, and Yuval Wigderson. “Ramsey Multiplicity and the Turán Coloring.” <i>Advances in Combinatorics</i>, Alliance of Diamond Open Access Journals, 2023, doi:<a href=\"https://doi.org/10.19086/aic.2023.2\">10.19086/aic.2023.2</a>.","ama":"Fox J, Wigderson Y. Ramsey multiplicity and the Turán coloring. <i>Advances in Combinatorics</i>. 2023. doi:<a href=\"https://doi.org/10.19086/aic.2023.2\">10.19086/aic.2023.2</a>"}}]