[{"isi":1,"title":"The infinitesimal model with dominance","_id":"14452","status":"public","abstract":[{"text":"The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and an environmental component, and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the parental traits. In previous work, we showed that when trait values are determined by the sum of a large number of additive Mendelian factors, each of small effect, one can justify the infinitesimal model as a limit of Mendelian inheritance. In this paper, we show that this result extends to include dominance. We define the model in terms of classical quantities of quantitative genetics, before justifying it as a limit of Mendelian inheritance as the number, M, of underlying loci tends to infinity. As in the additive case, the multivariate normal distribution of trait values across the pedigree can be expressed in terms of variance components in an ancestral population and probabilities of identity by descent determined by the pedigree. Now, with just first-order dominance effects, we require two-, three-, and four-way identities. We also show that, even if we condition on parental trait values, the “shared” and “residual” components of trait values within each family will be asymptotically normally distributed as the number of loci tends to infinity, with an error of order 1/M−−√. We illustrate our results with some numerical examples.","lang":"eng"}],"oa":1,"date_created":"2023-10-29T23:01:15Z","oa_version":"Published Version","scopus_import":"1","date_updated":"2025-09-09T13:07:07Z","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"101055327","name":"Understanding the evolution of continuous genomes","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00"}],"year":"2023","publication_status":"published","type":"journal_article","external_id":{"arxiv":["2211.03515"],"isi":["001148042000008"]},"doi":"10.1093/genetics/iyad133","has_accepted_license":"1","volume":225,"publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"quality_controlled":"1","month":"10","article_type":"original","author":[{"last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Etheridge, Alison M.","last_name":"Etheridge","first_name":"Alison M."},{"full_name":"Véber, Amandine","first_name":"Amandine","last_name":"Véber"}],"ec_funded":1,"acknowledgement":"NHB was supported in part by ERC Grants 250152 and 101055327. AV was partly supported by the chaire Modélisation Mathématique et Biodiversité of Veolia Environment—Ecole Polytechnique—Museum National d’Histoire Naturelle—Fondation X.","related_material":{"record":[{"status":"public","relation":"research_data","id":"12949"}]},"department":[{"_id":"NiBa"}],"publication":"Genetics","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"ddc":["570"],"arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Oxford University Press","file":[{"creator":"dernst","file_name":"2023_Genetics_Barton.pdf","file_id":"14469","date_created":"2023-10-30T12:57:53Z","relation":"main_file","checksum":"3f65b1fbe813e2f4dbb5d2b5e891844a","success":1,"content_type":"application/pdf","date_updated":"2023-10-30T12:57:53Z","access_level":"open_access","file_size":1439032}],"citation":{"ama":"Barton NH, Etheridge AM, Véber A. The infinitesimal model with dominance. Genetics. 2023;225(2). doi:10.1093/genetics/iyad133","chicago":"Barton, Nicholas H, Alison M. Etheridge, and Amandine Véber. “The Infinitesimal Model with Dominance.” Genetics. Oxford University Press, 2023. https://doi.org/10.1093/genetics/iyad133.","ista":"Barton NH, Etheridge AM, Véber A. 2023. The infinitesimal model with dominance. Genetics. 225(2), iyad133.","ieee":"N. H. Barton, A. M. Etheridge, and A. Véber, “The infinitesimal model with dominance,” Genetics, vol. 225, no. 2. Oxford University Press, 2023.","short":"N.H. Barton, A.M. Etheridge, A. Véber, Genetics 225 (2023).","mla":"Barton, Nicholas H., et al. “The Infinitesimal Model with Dominance.” Genetics, vol. 225, no. 2, iyad133, Oxford University Press, 2023, doi:10.1093/genetics/iyad133.","apa":"Barton, N. H., Etheridge, A. M., & Véber, A. (2023). The infinitesimal model with dominance. Genetics. Oxford University Press. https://doi.org/10.1093/genetics/iyad133"},"issue":"2","intvolume":" 225","article_number":"iyad133","file_date_updated":"2023-10-30T12:57:53Z","day":"01","date_published":"2023-10-01T00:00:00Z","article_processing_charge":"Yes (in subscription journal)"},{"has_accepted_license":"1","volume":15,"doi":"10.1029/2022MS003477","external_id":{"isi":["001084933600001"]},"type":"journal_article","month":"10","quality_controlled":"1","article_type":"original","publication_identifier":{"eissn":["1942-2466"]},"publication":"Journal of Advances in Modeling Earth Systems","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["550"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"author":[{"full_name":"Abramian, Sophie","first_name":"Sophie","last_name":"Abramian"},{"full_name":"Muller, Caroline J","first_name":"Caroline J","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350"},{"full_name":"Risi, Camille","last_name":"Risi","first_name":"Camille"}],"department":[{"_id":"CaMu"}],"acknowledgement":"The authors gratefully acknowledge funding from the European Research Council under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). This work is also supported by a PhD fellowship funded by the Ecole Normale Supérieure de Paris-Saclay. Authors are also grateful to Benjamin Filider, who was of great help and support in the development of ideas. Eventually, we would like to thank Martin Singh, John M. Peters and an anonymous reviewer for their valuable comments and suggestions, which greatly improved the quality of the manuscript.","file_date_updated":"2023-10-30T13:31:42Z","article_number":"e2022MS003477","article_processing_charge":"Yes","day":"01","date_published":"2023-10-01T00:00:00Z","citation":{"apa":"Abramian, S., Muller, C. J., & Risi, C. (2023). Extreme precipitation in tropical squall lines. Journal of Advances in Modeling Earth Systems. Wiley. https://doi.org/10.1029/2022MS003477","mla":"Abramian, Sophie, et al. “Extreme Precipitation in Tropical Squall Lines.” Journal of Advances in Modeling Earth Systems, vol. 15, no. 10, e2022MS003477, Wiley, 2023, doi:10.1029/2022MS003477.","chicago":"Abramian, Sophie, Caroline J Muller, and Camille Risi. “Extreme Precipitation in Tropical Squall Lines.” Journal of Advances in Modeling Earth Systems. Wiley, 2023. https://doi.org/10.1029/2022MS003477.","ista":"Abramian S, Muller CJ, Risi C. 2023. Extreme precipitation in tropical squall lines. Journal of Advances in Modeling Earth Systems. 15(10), e2022MS003477.","ieee":"S. Abramian, C. J. Muller, and C. Risi, “Extreme precipitation in tropical squall lines,” Journal of Advances in Modeling Earth Systems, vol. 15, no. 10. Wiley, 2023.","ama":"Abramian S, Muller CJ, Risi C. Extreme precipitation in tropical squall lines. Journal of Advances in Modeling Earth Systems. 2023;15(10). doi:10.1029/2022MS003477","short":"S. Abramian, C.J. Muller, C. Risi, Journal of Advances in Modeling Earth Systems 15 (2023)."},"file":[{"file_id":"14470","file_name":"2023_JAMES_Abramian.pdf","creator":"dernst","date_created":"2023-10-30T13:31:42Z","checksum":"43e6a1a35b663843c7d3f8d0caaca1a5","relation":"main_file","success":1,"date_updated":"2023-10-30T13:31:42Z","content_type":"application/pdf","access_level":"open_access","file_size":1975210}],"publisher":"Wiley","intvolume":" 15","issue":"10","isi":1,"date_created":"2023-10-29T23:01:15Z","oa":1,"abstract":[{"text":"Squall lines are substantially influenced by the interaction of low-level shear with cold pools associated with convective downdrafts. Beyond an optimal shear amplitude, squall lines tend to orient themselves at an angle with respect to the low-level shear. While the mechanisms behind squall line orientation seem to be increasingly well understood, uncertainties remain on the implications of this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4) show that long lived mesoscale convective systems, including squall lines, are disproportionately involved in rainfall extremes in the tropics. This article investigates the influence of the interaction between low-level shear and squall line outflow on squall line generated precipitation extrema in the tropics. Using a cloud resolving model, simulated squall lines in radiative convective equilibrium amid a shear-dominated regime (super optimal), a balanced regime (optimal), and an outflow dominated regime (suboptimal). Our results show that precipitation extremes in squall lines are 40% more intense in the case of optimal shear and remain 30% superior in the superoptimal regime relative to a disorganized case. With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020, https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates control the amplification of precipitation extremes in tropical squall lines, mainly due to its change in vertical mass flux (dynamic component). The reduction of dilution by entrainment explains half of this change, consistent with Mulholland et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained by increased cloud-base velocity intensity in optimal and superoptimal squall lines.","lang":"eng"}],"title":"Extreme precipitation in tropical squall lines","_id":"14453","status":"public","date_updated":"2024-11-05T09:00:44Z","oa_version":"Published Version","scopus_import":"1","publication_status":"published","project":[{"_id":"629205d8-2b32-11ec-9570-e1356ff73576","call_identifier":"H2020","grant_number":"805041","name":"Organization of CLoUdS, and implications of Tropical cyclones and for the Energetics of the tropics, in current and waRming climate"}],"year":"2023"},{"year":"2023","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"page":"291-311","publication_status":"published","oa_version":"Preprint","scopus_import":"1","conference":{"name":"RV: Conference on Runtime Verification","end_date":"2023-10-06","location":"Thessaloniki, Greece","start_date":"2023-10-03"},"date_updated":"2025-04-14T07:55:55Z","_id":"14454","status":"public","title":"Monitoring algorithmic fairness under partial observations","date_created":"2023-10-29T23:01:15Z","oa":1,"abstract":[{"lang":"eng","text":"As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and starts in the stationary distribution, with a bound on its mixing time being known. These assumptions enable us to estimate a given property for the entire distribution of possible executions of the monitored POMC, by observing only a single execution. Our monitors observe a long run of the system and, after each new observation, output updated PAC-estimates of how fair or biased the system is. The monitors are computationally lightweight and, using a prototype implementation, we demonstrate their effectiveness on several real-world examples."}],"corr_author":"1","intvolume":" 14245","citation":{"apa":"Henzinger, T. A., Kueffner, K., & Mallik, K. (2023). Monitoring algorithmic fairness under partial observations. In 23rd International Conference on Runtime Verification (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature. https://doi.org/10.1007/978-3-031-44267-4_15","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial Observations.” 23rd International Conference on Runtime Verification, vol. 14245, Springer Nature, 2023, pp. 291–311, doi:10.1007/978-3-031-44267-4_15.","short":"T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference on Runtime Verification, Springer Nature, 2023, pp. 291–311.","ista":"Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness under partial observations. 23rd International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311.","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness under Partial Observations.” In 23rd International Conference on Runtime Verification, 14245:291–311. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44267-4_15.","ieee":"T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness under partial observations,” in 23rd International Conference on Runtime Verification, Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.","ama":"Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under partial observations. In: 23rd International Conference on Runtime Verification. Vol 14245. Springer Nature; 2023:291-311. doi:10.1007/978-3-031-44267-4_15"},"publisher":"Springer Nature","article_processing_charge":"No","date_published":"2023-10-01T00:00:00Z","day":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2308.00341"}],"department":[{"_id":"ToHe"}],"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","ec_funded":1,"author":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","last_name":"Kueffner","first_name":"Konstantin","full_name":"Kueffner, Konstantin"},{"full_name":"Mallik, Kaushik","first_name":"Kaushik","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475"}],"arxiv":1,"publication":"23rd International Conference on Runtime Verification","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"publication_identifier":{"isbn":["9783031442667"],"issn":["0302-9743"],"eissn":["1611-3349"]},"month":"10","quality_controlled":"1","external_id":{"arxiv":["2308.00341"]},"type":"conference","volume":14245,"doi":"10.1007/978-3-031-44267-4_15"},{"date_created":"2023-10-29T23:01:16Z","oa":1,"status":"public","_id":"14455","title":"Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment","isi":1,"publication_status":"published","year":"2023","pmid":1,"date_updated":"2023-12-13T13:06:07Z","oa_version":"Published Version","scopus_import":"1","article_type":"letter_note","quality_controlled":"1","month":"10","publication_identifier":{"eissn":["1664-0640"]},"doi":"10.3389/fpsyt.2023.1287879","volume":14,"has_accepted_license":"1","type":"journal_article","external_id":{"isi":["001084841700001"],"pmid":["37854442"]},"date_published":"2023-10-03T00:00:00Z","day":"03","article_processing_charge":"Yes","file_date_updated":"2023-10-30T12:48:40Z","article_number":"1287879","intvolume":" 14","file":[{"date_updated":"2023-10-30T12:48:40Z","success":1,"content_type":"application/pdf","access_level":"open_access","file_size":147878,"relation":"main_file","checksum":"0a76373e9a4c0fc199f80380de257e86","date_created":"2023-10-30T12:48:40Z","creator":"dernst","file_name":"2023_FrontiersPsychiatry_Narzisi.pdf","file_id":"14468"}],"publisher":"Frontiers","citation":{"apa":"Narzisi, A., Halladay, A., Masi, G., Novarino, G., & Lord, C. (2023). Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment. Frontiers in Psychiatry. Frontiers. https://doi.org/10.3389/fpsyt.2023.1287879","mla":"Narzisi, Antonio, et al. “Tempering Expectations: Considerations on the Current State of Stem Cells Therapy for Autism Treatment.” Frontiers in Psychiatry, vol. 14, 1287879, Frontiers, 2023, doi:10.3389/fpsyt.2023.1287879.","ieee":"A. Narzisi, A. Halladay, G. Masi, G. Novarino, and C. Lord, “Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment,” Frontiers in Psychiatry, vol. 14. Frontiers, 2023.","ista":"Narzisi A, Halladay A, Masi G, Novarino G, Lord C. 2023. Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment. Frontiers in Psychiatry. 14, 1287879.","chicago":"Narzisi, Antonio, Alycia Halladay, Gabriele Masi, Gaia Novarino, and Catherine Lord. “Tempering Expectations: Considerations on the Current State of Stem Cells Therapy for Autism Treatment.” Frontiers in Psychiatry. Frontiers, 2023. https://doi.org/10.3389/fpsyt.2023.1287879.","ama":"Narzisi A, Halladay A, Masi G, Novarino G, Lord C. Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment. Frontiers in Psychiatry. 2023;14. doi:10.3389/fpsyt.2023.1287879","short":"A. Narzisi, A. Halladay, G. Masi, G. Novarino, C. Lord, Frontiers in Psychiatry 14 (2023)."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Frontiers in Psychiatry","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"acknowledgement":"The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. This work has been partially supported by Italian Ministry of Health Grant RC2023 (and the 5 × 1,000 voluntary contributions). The authors thank the children and their families with whom they work daily.","department":[{"_id":"GaNo"}],"author":[{"full_name":"Narzisi, Antonio","first_name":"Antonio","last_name":"Narzisi"},{"first_name":"Alycia","last_name":"Halladay","full_name":"Halladay, Alycia"},{"full_name":"Masi, Gabriele","first_name":"Gabriele","last_name":"Masi"},{"full_name":"Novarino, Gaia","last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178"},{"full_name":"Lord, Catherine","last_name":"Lord","first_name":"Catherine"}]},{"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031435867"]},"alternative_title":["LNCS"],"month":"09","quality_controlled":"1","external_id":{"arxiv":["2307.10847"],"isi":["001162288800024"]},"type":"conference","volume":14292,"doi":"10.1007/978-3-031-43587-4_24","intvolume":" 14292","citation":{"mla":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” 24th International Symposium on Fundamentals of Computation Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.","apa":"Křišťan, J. M., & Svoboda, J. (2023). Shortest dominating set reconfiguration under token sliding. In 24th International Symposium on Fundamentals of Computation Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-43587-4_24","short":"J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals of Computation Theory, Springer Nature, 2023, pp. 333–347.","ama":"Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token sliding. In: 24th International Symposium on Fundamentals of Computation Theory. Vol 14292. Springer Nature; 2023:333-347. doi:10.1007/978-3-031-43587-4_24","ista":"Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under token sliding. 24th International Symposium on Fundamentals of Computation Theory. FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347.","chicago":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” In 24th International Symposium on Fundamentals of Computation Theory, 14292:333–47. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-43587-4_24.","ieee":"J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under token sliding,” in 24th International Symposium on Fundamentals of Computation Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347."},"publisher":"Springer Nature","article_processing_charge":"No","day":"21","date_published":"2023-09-21T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.10847"}],"department":[{"_id":"KrCh"}],"related_material":{"link":[{"url":"https://doi.org/10.1007/978-3-031-43587-4_31","relation":"erratum"}]},"author":[{"first_name":"Jan Matyáš","last_name":"Křišťan","full_name":"Křišťan, Jan Matyáš"},{"first_name":"Jakub","last_name":"Svoboda","full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"}],"arxiv":1,"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"24th International Symposium on Fundamentals of Computation Theory","_id":"14456","status":"public","title":"Shortest dominating set reconfiguration under token sliding","oa":1,"date_created":"2023-10-29T23:01:16Z","abstract":[{"lang":"eng","text":"In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the TOKEN SLIDING model. In this problem, a graph is provided along with its two dominating sets, which can be imagined as tokens placed on vertices. The objective is to find a shortest sequence of dominating sets that transforms one set into the other, with each set in the sequence resulting from sliding a single token in the previous set. While identifying any sequence has been well studied, our work presents the first polynomial algorithms for this optimization variant in the context of dominating sets."}],"isi":1,"year":"2023","publication_status":"published","page":"333-347","oa_version":"Preprint","scopus_import":"1","conference":{"start_date":"2023-09-18","location":"Trier, Germany","name":"FCT: Fundamentals of Computation Theory","end_date":"2023-09-21"},"date_updated":"2025-09-09T13:07:40Z"},{"author":[{"orcid":"0000-0003-2027-5549","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","last_name":"Hoffmann","first_name":"Charlotte","full_name":"Hoffmann, Charlotte"},{"full_name":"Simkin, Mark","last_name":"Simkin","first_name":"Mark"}],"department":[{"_id":"KrPi"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publication":"8th International Conference on Cryptology and Information Security in Latin America","citation":{"ieee":"C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret sharing,” in 8th International Conference on Cryptology and Information Security in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228.","chicago":"Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” In 8th International Conference on Cryptology and Information Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11.","ista":"Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret sharing. 8th International Conference on Cryptology and Information Security in Latin America. LATINCRYPT: Cryptology and Information Security in Latin America, LNCS, vol. 14168, 215–228.","ama":"Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing. In: 8th International Conference on Cryptology and Information Security in Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11","short":"C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and Information Security in Latin America, Springer Nature, 2023, pp. 215–228.","apa":"Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient secret sharing. In 8th International Conference on Cryptology and Information Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer Nature. https://doi.org/10.1007/978-3-031-44469-2_11","mla":"Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” 8th International Conference on Cryptology and Information Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28, doi:10.1007/978-3-031-44469-2_11."},"publisher":"Springer Nature","intvolume":" 14168","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/1017"}],"day":"01","date_published":"2023-10-01T00:00:00Z","external_id":{"isi":["001157041900011"]},"type":"conference","volume":14168,"doi":"10.1007/978-3-031-44469-2_11","alternative_title":["LNCS"],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031444685"]},"month":"10","quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","date_updated":"2025-09-09T13:09:21Z","conference":{"location":"Quito, Ecuador","start_date":"2023-10-03","end_date":"2023-10-06","name":"LATINCRYPT: Cryptology and Information Security in Latin America"},"year":"2023","publication_status":"published","page":"215-228","isi":1,"corr_author":"1","title":"Stronger lower bounds for leakage-resilient secret sharing","_id":"14457","status":"public","oa":1,"date_created":"2023-10-29T23:01:16Z","abstract":[{"lang":"eng","text":"Threshold secret sharing allows a dealer to split a secret s into n shares, such that any t shares allow for reconstructing s, but no t-1 shares reveal any information about s. Leakage-resilient secret sharing requires that the secret remains hidden, even when an adversary additionally obtains a limited amount of leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy leakage-resilience, where a random subset of leakages is replaced by uniformly random noise. We prove a lower bound for Shamir’s secret sharing, similar to that of Nielsen and Simkin, which holds even when a constant fraction of leakages is replaced by random noise. To this end, we first prove a lower bound on the share size of any noisy-leakage-resilient sharing scheme. We then use this lower bound to show that there exist universal constants c1, c2, such that for sufficiently large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random noise.\r\n\r\n\r\n\r\n"}]},{"ec_funded":1,"author":[{"id":"66374281-f394-11eb-9cf6-869147deecc0","first_name":"Mahdi","last_name":"Nikdan","full_name":"Nikdan, Mahdi"},{"full_name":"Pegolotti, Tommaso","last_name":"Pegolotti","first_name":"Tommaso"},{"full_name":"Iofinova, Eugenia B","first_name":"Eugenia B","last_name":"Iofinova","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221"},{"id":"47beb3a5-07b5-11eb-9b87-b108ec578218","last_name":"Kurtic","first_name":"Eldar","full_name":"Kurtic, Eldar"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"}],"acknowledgement":"We would like to thank Elias Frantar for his valuable assistance and support at the outset of this project, and the anonymous ICML and SNN reviewers for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant 805223 ScaleML. ","department":[{"_id":"DaAl"}],"publication":"Proceedings of the 40th International Conference on Machine Learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"arxiv":1,"publisher":"ML Research Press","citation":{"short":"M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 26215–26227.","ieee":"M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.","chicago":"Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” In Proceedings of the 40th International Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.","ista":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.","ama":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:26215-26227.","apa":"Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A. (2023). SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United States: ML Research Press.","mla":"Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27."},"intvolume":" 202","day":"30","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.04852","open_access":"1"}],"date_published":"2023-07-30T00:00:00Z","article_processing_charge":"No","type":"conference","external_id":{"arxiv":["2302.04852"]},"volume":202,"publication_identifier":{"eissn":["2640-3498"]},"alternative_title":["PMLR"],"quality_controlled":"1","month":"07","scopus_import":"1","oa_version":"Preprint","date_updated":"2025-04-14T07:49:12Z","conference":{"start_date":"2023-07-23","location":"Honolulu, Hawaii, HI, United States","name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29"},"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"year":"2023","publication_status":"published","page":"26215-26227","corr_author":"1","title":"SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge","status":"public","_id":"14460","abstract":[{"text":"We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware.","lang":"eng"}],"oa":1,"date_created":"2023-10-29T23:01:17Z"},{"department":[{"_id":"DaAl"}],"acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), as well as experimental support from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl. AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT), the support of Fondation Hadamard with a PRMO grant, and the support of CNRS with a CoopIntEER IEA grant (project ALFRED).","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"17490"}]},"acknowledged_ssus":[{"_id":"ScienComp"}],"ec_funded":1,"author":[{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","first_name":"Ilia","full_name":"Markov, Ilia"},{"full_name":"Vladu, Adrian","last_name":"Vladu","first_name":"Adrian"},{"full_name":"Guo, Qi","first_name":"Qi","last_name":"Guo"},{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"arxiv":1,"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the 40th International Conference on Machine Learning","intvolume":" 202","citation":{"apa":"Markov, I., Vladu, A., Guo, Q., & Alistarh, D.-A. (2023). Quantized distributed training of large models with convergence guarantees. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 24020–24044). Honolulu, Hawaii, HI, United States: ML Research Press.","mla":"Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence Guarantees.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 24020–44.","short":"I. Markov, A. Vladu, Q. Guo, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 24020–24044.","chicago":"Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In Proceedings of the 40th International Conference on Machine Learning, 202:24020–44. ML Research Press, 2023.","ieee":"I. Markov, A. Vladu, Q. Guo, and D.-A. Alistarh, “Quantized distributed training of large models with convergence guarantees,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 24020–24044.","ista":"Markov I, Vladu A, Guo Q, Alistarh D-A. 2023. Quantized distributed training of large models with convergence guarantees. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 24020–24044.","ama":"Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of large models with convergence guarantees. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:24020-24044."},"publisher":"ML Research Press","article_processing_charge":"No","date_published":"2023-07-30T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.02390","open_access":"1"}],"day":"30","external_id":{"arxiv":["2302.02390"]},"type":"conference","volume":202,"alternative_title":["PMLR"],"publication_identifier":{"eissn":["2640-3498"]},"month":"07","quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23"},"date_updated":"2026-04-07T13:00:54Z","year":"2023","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"page":"24020-24044","publication_status":"published","corr_author":"1","_id":"14461","status":"public","title":"Quantized distributed training of large models with convergence guarantees","oa":1,"date_created":"2023-10-29T23:01:17Z","abstract":[{"lang":"eng","text":"Communication-reduction techniques are a popular way to improve scalability in data-parallel training of deep neural networks (DNNs). The recent emergence of large language models such as GPT has created the need for new approaches to exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training is highly popular, yet it still encounters scalability bottlenecks. One reason is that applying compression techniques to FSDP is challenging: as the vast majority of the communication involves the model’s weights, direct compression alters convergence and leads to accuracy loss. We present QSDP, a variant of FSDP which supports both gradient and weight quantization with theoretical guarantees, is simple to implement and has essentially no overheads. To derive QSDP we prove that a natural modification of SGD achieves convergence even when we only maintain quantized weights, and thus the domain over which we train consists of quantized points and is, therefore, highly non-convex. We validate this approach by training GPT-family models with up to 1.3 billion parameters on a multi-node cluster. Experiments show that QSDP preserves model accuracy, while completely removing the communication bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x."}]},{"corr_author":"1","status":"public","_id":"14462","title":"Constant matters: Fine-grained error bound on differentially private continual observation","oa":1,"date_created":"2023-10-29T23:01:17Z","abstract":[{"lang":"eng","text":"We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error."}],"oa_version":"Published Version","scopus_import":"1","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23"},"date_updated":"2026-06-18T17:35:42Z","year":"2023","project":[{"name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"publication_status":"published","page":"10072-10092","external_id":{"arxiv":["2202.11205"]},"type":"conference","volume":202,"alternative_title":["PMLR"],"publication_identifier":{"eissn":["2640-3498"]},"month":"07","quality_controlled":"1","department":[{"_id":"MoHe"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was funded by Decanal Research Grant. A part of this work was done when JU was visiting Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia, Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta, and Sarvagya Upadhyay for useful discussions.","author":[{"last_name":"Fichtenberger","first_name":"Hendrik","full_name":"Fichtenberger, Hendrik"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Upadhyay, Jalaj","last_name":"Upadhyay","first_name":"Jalaj"}],"ec_funded":1,"arxiv":1,"publication":"Proceedings of the 40th International Conference on Machine Learning","ddc":["000"],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 202","citation":{"apa":"Fichtenberger, H., Henzinger, M., & Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.","mla":"Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.","ista":"Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained error bound on differentially private continual observation. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10072–10092.","ieee":"H. Fichtenberger, M. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.","chicago":"Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In Proceedings of the 40th International Conference on Machine Learning, 202:10072–92. ML Research Press, 2023.","ama":"Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10072-10092.","short":"H. Fichtenberger, M. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092."},"publisher":"ML Research Press","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf"}],"day":"30","date_published":"2023-07-30T00:00:00Z"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2205.11637"}],"day":"05","date_published":"2023-10-05T00:00:00Z","article_processing_charge":"No","issue":"7","intvolume":" 34","publisher":"World Scientific Publishing","citation":{"chicago":"Ambrus, Áron, Mónika Csikós, Gergely Kiss, János Pach, and Gábor Somlai. “Optimal Embedded and Enclosing Isosceles Triangles.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2023. https://doi.org/10.1142/S012905412342008X.","ieee":"Á. Ambrus, M. Csikós, G. Kiss, J. Pach, and G. Somlai, “Optimal embedded and enclosing isosceles triangles,” International Journal of Foundations of Computer Science, vol. 34, no. 7. World Scientific Publishing, pp. 737–760, 2023.","ista":"Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. 2023. Optimal embedded and enclosing isosceles triangles. International Journal of Foundations of Computer Science. 34(7), 737–760.","ama":"Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. Optimal embedded and enclosing isosceles triangles. International Journal of Foundations of Computer Science. 2023;34(7):737-760. doi:10.1142/S012905412342008X","short":"Á. Ambrus, M. Csikós, G. Kiss, J. Pach, G. Somlai, International Journal of Foundations of Computer Science 34 (2023) 737–760.","apa":"Ambrus, Á., Csikós, M., Kiss, G., Pach, J., & Somlai, G. (2023). Optimal embedded and enclosing isosceles triangles. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S012905412342008X","mla":"Ambrus, Áron, et al. “Optimal Embedded and Enclosing Isosceles Triangles.” International Journal of Foundations of Computer Science, vol. 34, no. 7, World Scientific Publishing, 2023, pp. 737–60, doi:10.1142/S012905412342008X."},"language":[{"iso":"eng"}],"publication":"International Journal of Foundations of Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"department":[{"_id":"HeEd"}],"author":[{"first_name":"Áron","last_name":"Ambrus","full_name":"Ambrus, Áron"},{"full_name":"Csikós, Mónika","first_name":"Mónika","last_name":"Csikós"},{"full_name":"Kiss, Gergely","first_name":"Gergely","last_name":"Kiss"},{"id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"last_name":"Somlai","first_name":"Gábor","full_name":"Somlai, Gábor"}],"article_type":"original","quality_controlled":"1","month":"10","publication_identifier":{"eissn":["1793-6373"],"issn":["0129-0541"]},"doi":"10.1142/S012905412342008X","volume":34,"type":"journal_article","external_id":{"arxiv":["2205.11637"],"isi":["001080874400001"]},"publication_status":"published","page":"737-760","year":"2023","date_updated":"2023-12-13T13:04:55Z","oa_version":"Preprint","scopus_import":"1","abstract":[{"text":"Given a triangle Δ, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of Δ with respect to area and perimeter. This problem was initially posed by Nandakumar [17, 22] and was first studied by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present paper, we prove that for any triangle Δ, every maximum area isosceles triangle embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter enclosing triangles is different: there are infinite families of triangles Δ whose minimum perimeter isosceles containers do not share a side and an angle with Δ.","lang":"eng"}],"oa":1,"date_created":"2023-10-29T23:01:18Z","status":"public","_id":"14464","title":"Optimal embedded and enclosing isosceles triangles","isi":1},{"intvolume":" 974","file":[{"checksum":"17c64c1fb0d5f73252364bf98b0b9e1a","relation":"main_file","date_updated":"2024-02-15T09:05:21Z","success":1,"content_type":"application/pdf","file_size":2804641,"access_level":"open_access","file_id":"14996","creator":"dernst","file_name":"2023_JourFluidMechanics_Marensi.pdf","date_created":"2024-02-15T09:05:21Z"}],"publisher":"Cambridge University Press","citation":{"short":"E. Marensi, G. Yalniz, B. Hof, Journal of Fluid Mechanics 974 (2023).","chicago":"Marensi, Elena, Gökhan Yalniz, and Björn Hof. “Dynamics and Proliferation of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” Journal of Fluid Mechanics. Cambridge University Press, 2023. https://doi.org/10.1017/jfm.2023.780.","ieee":"E. Marensi, G. Yalniz, and B. Hof, “Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows,” Journal of Fluid Mechanics, vol. 974. Cambridge University Press, 2023.","ista":"Marensi E, Yalniz G, Hof B. 2023. Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics. 974, A21.","ama":"Marensi E, Yalniz G, Hof B. Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics. 2023;974. doi:10.1017/jfm.2023.780","apa":"Marensi, E., Yalniz, G., & Hof, B. (2023). Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2023.780","mla":"Marensi, Elena, et al. “Dynamics and Proliferation of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” Journal of Fluid Mechanics, vol. 974, A21, Cambridge University Press, 2023, doi:10.1017/jfm.2023.780."},"day":"10","date_published":"2023-11-10T00:00:00Z","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2024-02-15T09:05:21Z","article_number":"A21","related_material":{"record":[{"id":"19684","status":"public","relation":"dissertation_contains"}]},"acknowledgement":"E.M. acknowledges funding from the ISTplus fellowship programme. G.Y. and B.H. acknowledge a grant from the Simons Foundation (662960, BH).","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"author":[{"orcid":"0000-0001-7173-4923","id":"0BE7553A-1004-11EA-B805-18983DDC885E","last_name":"Marensi","first_name":"Elena","full_name":"Marensi, Elena"},{"orcid":"0000-0002-8490-9312","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","last_name":"Yalniz","first_name":"Gökhan","full_name":"Yalniz, Gökhan"},{"orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn","full_name":"Hof, Björn"}],"keyword":["turbulence","transition to turbulence","patterns"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Journal of Fluid Mechanics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"language":[{"iso":"eng"}],"arxiv":1,"publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"article_type":"original","quality_controlled":"1","month":"11","type":"journal_article","external_id":{"arxiv":["2212.12406"],"isi":["001088363700001"]},"doi":"10.1017/jfm.2023.780","has_accepted_license":"1","volume":974,"year":"2023","project":[{"name":"Revisiting the Turbulence Problem Using Statistical Mechanics","grant_number":"662960","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"publication_status":"published","oa_version":"Published Version","scopus_import":"1","date_updated":"2026-04-07T11:47:05Z","_id":"14466","status":"public","title":"Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows","abstract":[{"text":"The first long-lived turbulent structures observable in planar shear flows take the form of localized stripes, inclined with respect to the mean flow direction. The dynamics of these stripes is central to transition, and recent studies proposed an analogy to directed percolation where the stripes’ proliferation is ultimately responsible for the turbulence becoming sustained. In the present study we focus on the internal stripe dynamics as well as on the eventual stripe expansion, and we compare the underlying mechanisms in pressure- and shear-driven planar flows, respectively, plane-Poiseuille and plane-Couette flow. Despite the similarities of the overall laminar–turbulence patterns, the stripe proliferation processes in the two cases are fundamentally different. Starting from the growth and sustenance of individual stripes, we find that in plane-Couette flow new streaks are created stochastically throughout the stripe whereas in plane-Poiseuille flow streak creation is deterministic and occurs locally at the downstream tip. Because of the up/downstream symmetry, Couette stripes, in contrast to Poiseuille stripes, have two weak and two strong laminar turbulent interfaces. These differences in symmetry as well as in internal growth give rise to two fundamentally different stripe splitting mechanisms. In plane-Poiseuille flow splitting is connected to the elongational growth of the original stripe, and it results from a break-off/shedding of the stripe's tail. In plane-Couette flow splitting follows from a broadening of the original stripe and a division along the stripe into two slimmer stripes.","lang":"eng"}],"oa":1,"date_created":"2023-10-30T09:32:28Z","corr_author":"1","isi":1},{"type":"research_data","doi":"10.15479/AT:ISTA:14472","corr_author":"1","has_accepted_license":"1","title":"Stress granules plug and stabilize damaged endolysosomal membranes","status":"public","_id":"14472","abstract":[{"lang":"eng","text":"Data related to the following paper:\r\n\"Stress granules plug and stabilize damaged endolysosomal membranes\" (https://doi.org/10.1038/s41586-023-06726-w)\r\n\r\nAbstract: \r\nEndomembrane damage represents a form of stress that is detrimental for eukaryotic cells. To cope with this threat, cells possess mechanisms that repair the damage and restore cellular homeostasis. Endomembrane damage also results in organelle instability and the mechanisms by which cells stabilize damaged endomembranes to enable membrane repair remains unknown. In this work we use a minimal coarse-grained molecular dynamics system to explore how lipid vesicles undergoing poration in a protein-rich medium can be plugged and stabilised by condensate formation. The solution of proteins in and out of the vesicle is described by beads dispersed in implicit solvent. The membrane is described as a one-bead-thick fluid elastic layer of mechanical properties that mimic biological membranes. We tune the interactions between solution beads in the different compartments to capture the differences between the cytoplasmic and endosomal protein solutions and explore how the system responds to different degrees of membrane poration. We find that, in the right interaction regime, condensates form rapidly at the damage site upon solution mixing and act as a plug that prevents futher mixing and destabilisation of the vesicle. Further, when the condensate can interact with the membrane (wetting interactions) we find that it mediates pore sealing and membrane repair. This research is part of the work published in \"Stress granules plug and stabilize damaged endolysosomal membranes\", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w."}],"oa":1,"date_created":"2023-10-30T16:38:32Z","month":"10","author":[{"id":"3adeca52-9313-11ed-b1ac-c170b2505714","full_name":"Vanhille-Campos, Christian Eduardo","first_name":"Christian Eduardo","last_name":"Vanhille-Campos"},{"orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","last_name":"Šarić","full_name":"Šarić, Anđela"}],"oa_version":"Published Version","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"14610"}]},"department":[{"_id":"AnSa"}],"ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-09-09T13:30:33Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"publisher":"Institute of Science and Technology Austria","file":[{"file_name":"SGporecondensation-main.zip","creator":"ipalaia","file_id":"14473","date_created":"2023-10-30T16:31:08Z","relation":"main_file","checksum":"a18706e952e8660c51ede52a167270b7","success":1,"date_updated":"2023-10-30T16:31:08Z","content_type":"application/zip","access_level":"open_access","file_size":62821432},{"date_created":"2023-10-31T08:57:50Z","file_name":"README.txt","creator":"dernst","file_id":"14474","content_type":"text/plain","date_updated":"2023-10-31T08:57:50Z","success":1,"access_level":"open_access","file_size":1697,"checksum":"389eab31c6509dbc05795017fb618758","relation":"main_file"}],"citation":{"short":"C.E. Vanhille-Campos, A. Šarić, (2023).","ieee":"C. E. Vanhille-Campos and A. Šarić, “Stress granules plug and stabilize damaged endolysosomal membranes.” Institute of Science and Technology Austria, 2023.","chicago":"Vanhille-Campos, Christian Eduardo, and Anđela Šarić. “Stress Granules Plug and Stabilize Damaged Endolysosomal Membranes.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:14472.","ista":"Vanhille-Campos CE, Šarić A. 2023. Stress granules plug and stabilize damaged endolysosomal membranes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14472.","ama":"Vanhille-Campos CE, Šarić A. Stress granules plug and stabilize damaged endolysosomal membranes. 2023. doi:10.15479/AT:ISTA:14472","apa":"Vanhille-Campos, C. E., & Šarić, A. (2023). Stress granules plug and stabilize damaged endolysosomal membranes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:14472","mla":"Vanhille-Campos, Christian Eduardo, and Anđela Šarić. Stress Granules Plug and Stabilize Damaged Endolysosomal Membranes. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:14472."},"year":"2023","file_date_updated":"2023-10-31T08:57:50Z","date_published":"2023-10-31T00:00:00Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","day":"31","article_processing_charge":"No"},{"_id":"14484","status":"public","title":"Control of tissue development by morphogens","abstract":[{"lang":"eng","text":"Intercellular signaling molecules, known as morphogens, act at a long range in developing tissues to provide spatial information and control properties such as cell fate and tissue growth. The production, transport, and removal of morphogens shape their concentration profiles in time and space. Downstream signaling cascades and gene regulatory networks within cells then convert the spatiotemporal morphogen profiles into distinct cellular responses. Current challenges are to understand the diverse molecular and cellular mechanisms underlying morphogen gradient formation, as well as the logic of downstream regulatory circuits involved in morphogen interpretation. This knowledge, combining experimental and theoretical results, is essential to understand emerging properties of morphogen-controlled systems, such as robustness and scaling."}],"oa":1,"date_created":"2023-11-05T23:00:53Z","corr_author":"1","isi":1,"year":"2023","project":[{"grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425"},{"name":"Mechanisms of tissue size regulation in spinal cord development","grant_number":"101044579","_id":"bd7e737f-d553-11ed-ba76-d69ffb5ee3aa"},{"_id":"059DF620-7A3F-11EA-A408-12923DDC885E","grant_number":"F7802","name":"Stem Cell Modulation in Neural Development and Regeneration/ P02-Morphogen control of growth and pattern in the spinal cord"}],"pmid":1,"publication_status":"published","page":"91-121","oa_version":"Published Version","scopus_import":"1","date_updated":"2025-12-30T10:57:08Z","publication_identifier":{"eissn":["1530-8995"],"issn":["1081-0706"]},"article_type":"review","quality_controlled":"1","month":"10","type":"journal_article","external_id":{"isi":["001082823000006"],"pmid":["37418774"]},"doi":"10.1146/annurev-cellbio-020823-011522","volume":39,"has_accepted_license":"1","intvolume":" 39","publisher":"Annual Reviews","file":[{"file_id":"14491","creator":"dernst","file_name":"2023_AnnualReviews_Kicheva.pdf","date_created":"2023-11-06T09:47:50Z","checksum":"461726014cf5907010afbd418d3c13ec","relation":"main_file","date_updated":"2023-11-06T09:47:50Z","content_type":"application/pdf","success":1,"file_size":434819,"access_level":"open_access"}],"citation":{"apa":"Kicheva, A., & Briscoe, J. (2023). Control of tissue development by morphogens. Annual Review of Cell and Developmental Biology. Annual Reviews. https://doi.org/10.1146/annurev-cellbio-020823-011522","mla":"Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.” Annual Review of Cell and Developmental Biology, vol. 39, Annual Reviews, 2023, pp. 91–121, doi:10.1146/annurev-cellbio-020823-011522.","short":"A. Kicheva, J. Briscoe, Annual Review of Cell and Developmental Biology 39 (2023) 91–121.","chicago":"Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.” Annual Review of Cell and Developmental Biology. Annual Reviews, 2023. https://doi.org/10.1146/annurev-cellbio-020823-011522.","ieee":"A. Kicheva and J. Briscoe, “Control of tissue development by morphogens,” Annual Review of Cell and Developmental Biology, vol. 39. Annual Reviews, pp. 91–121, 2023.","ista":"Kicheva A, Briscoe J. 2023. Control of tissue development by morphogens. Annual Review of Cell and Developmental Biology. 39, 91–121.","ama":"Kicheva A, Briscoe J. Control of tissue development by morphogens. Annual Review of Cell and Developmental Biology. 2023;39:91-121. doi:10.1146/annurev-cellbio-020823-011522"},"date_published":"2023-10-16T00:00:00Z","day":"16","article_processing_charge":"Yes (in subscription journal)","file_date_updated":"2023-11-06T09:47:50Z","acknowledgement":"We are grateful to Zena Hadjivasiliou for comments on this article. A.K. is supported by grants from the European Research Council under the European Union (EU) Horizon 2020 research and innovation program (680037) and Horizon Europe (101044579), and the Austrian Science Fund (F78) (Stem Cell Modulation). J.B. is supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (CC001051), the UK Medical Research Council (CC001051), and the Wellcome Trust (CC001051), and by a grant from the European Research Council under the EU Horizon 2020 research and innovation program (742138).","department":[{"_id":"AnKi"}],"ec_funded":1,"author":[{"id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna","last_name":"Kicheva","first_name":"Anna"},{"first_name":"James","last_name":"Briscoe","full_name":"Briscoe, James"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Annual Review of Cell and Developmental Biology"},{"date_updated":"2024-10-09T21:07:14Z","conference":{"end_date":"2023-10-13","name":"DISC: Symposium on Distributed Computing","start_date":"2023-10-09","location":"L'Aquila, Italy"},"scopus_import":"1","oa_version":"Published Version","publication_status":"published","year":"2023","corr_author":"1","date_created":"2023-11-05T23:00:53Z","oa":1,"abstract":[{"text":"Batching is a technique that stores multiple keys/values in each node of a data structure. In sequential search data structures, batching reduces latency by reducing the number of cache misses and shortening the chain of pointers to dereference. Applying batching to concurrent data structures is challenging, because it is difficult to maintain the search property and keep contention low in the presence of batching.\r\nIn this paper, we present a general methodology for leveraging batching in concurrent search data structures, called BatchBoost. BatchBoost builds a search data structure from distinct \"data\" and \"index\" layers. The data layer’s purpose is to store a batch of key/value pairs in each of its nodes. The index layer uses an unmodified concurrent search data structure to route operations to a position in the data layer that is \"close\" to where the corresponding key should exist. The requirements on the index and data layers are low: with minimal effort, we were able to compose three highly scalable concurrent search data structures based on three original data structures as the index layers with a batched version of the Lazy List as the data layer. The resulting BatchBoost data structures provide significant performance improvements over their original counterparts.","lang":"eng"}],"title":"Brief announcement: BatchBoost: Universal batching for concurrent data structures","_id":"14485","status":"public","language":[{"iso":"eng"}],"ddc":["000"],"publication":"37th International Symposium on Distributed Computing","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Aksenov, Vitaly","last_name":"Aksenov","first_name":"Vitaly"},{"first_name":"Michael","last_name":"Anoprenko","full_name":"Anoprenko, Michael"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","full_name":"Fedorov, Alexander","first_name":"Alexander","last_name":"Fedorov"},{"full_name":"Spear, Michael","first_name":"Michael","last_name":"Spear"}],"department":[{"_id":"GradSch"}],"article_number":"35","file_date_updated":"2023-11-06T11:45:21Z","article_processing_charge":"Yes","date_published":"2023-10-01T00:00:00Z","day":"01","citation":{"ama":"Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost: Universal batching for concurrent data structures. In: 37th International Symposium on Distributed Computing. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.DISC.2023.35","chicago":"Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” In 37th International Symposium on Distributed Computing, Vol. 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.DISC.2023.35.","ista":"Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost: Universal batching for concurrent data structures. 37th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 281, 35.","ieee":"V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement: BatchBoost: Universal batching for concurrent data structures,” in 37th International Symposium on Distributed Computing, L’Aquila, Italy, 2023, vol. 281.","short":"V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","mla":"Aksenov, Vitaly, et al. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” 37th International Symposium on Distributed Computing, vol. 281, 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.DISC.2023.35.","apa":"Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In 37th International Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"file_size":646665,"access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2023-11-06T11:45:21Z","relation":"main_file","checksum":"d9f8d2915cccdf2df5905b7cd1b4a560","date_created":"2023-11-06T11:45:21Z","file_name":"2023_LIPIcs_Aksenov.pdf","creator":"dernst","file_id":"14492"}],"intvolume":" 281","has_accepted_license":"1","volume":281,"doi":"10.4230/LIPIcs.DISC.2023.35","type":"conference","month":"10","quality_controlled":"1","alternative_title":["LIPIcs"],"publication_identifier":{"isbn":["9783959773010"],"issn":["1868-8969"]}},{"publisher":"American Physical Society","file":[{"checksum":"cb8de8fed6e09df1a18bd5a5aec5c55c","relation":"main_file","file_size":1127522,"access_level":"open_access","content_type":"application/pdf","date_updated":"2023-11-07T07:52:46Z","success":1,"file_id":"14493","file_name":"2023_PhysReviewResearch_Koutentakis.pdf","creator":"dernst","date_created":"2023-11-07T07:52:46Z"}],"citation":{"ama":"Koutentakis G, Ghazaryan A, Lemeshko M. Rotor lattice model of ferroelectric large polarons. Physical Review Research. 2023;5(4). doi:10.1103/PhysRevResearch.5.043016","ieee":"G. Koutentakis, A. Ghazaryan, and M. Lemeshko, “Rotor lattice model of ferroelectric large polarons,” Physical Review Research, vol. 5, no. 4. American Physical Society, 2023.","ista":"Koutentakis G, Ghazaryan A, Lemeshko M. 2023. Rotor lattice model of ferroelectric large polarons. Physical Review Research. 5(4), 043016.","chicago":"Koutentakis, Georgios, Areg Ghazaryan, and Mikhail Lemeshko. “Rotor Lattice Model of Ferroelectric Large Polarons.” Physical Review Research. American Physical Society, 2023. https://doi.org/10.1103/PhysRevResearch.5.043016.","short":"G. Koutentakis, A. Ghazaryan, M. Lemeshko, Physical Review Research 5 (2023).","mla":"Koutentakis, Georgios, et al. “Rotor Lattice Model of Ferroelectric Large Polarons.” Physical Review Research, vol. 5, no. 4, 043016, American Physical Society, 2023, doi:10.1103/PhysRevResearch.5.043016.","apa":"Koutentakis, G., Ghazaryan, A., & Lemeshko, M. (2023). Rotor lattice model of ferroelectric large polarons. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.5.043016"},"issue":"4","intvolume":" 5","article_number":"043016","file_date_updated":"2023-11-07T07:52:46Z","date_published":"2023-10-05T00:00:00Z","day":"05","article_processing_charge":"Yes","author":[{"id":"d7b23d3a-9e21-11ec-b482-f76739596b95","first_name":"Georgios","last_name":"Koutentakis","full_name":"Koutentakis, Georgios"},{"id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg","first_name":"Areg","last_name":"Ghazaryan"},{"last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"acknowledgement":"We thank Zh. Alpichshev, A. Volosniev, and A. V. Zampetaki for fruitful discussions and comments. This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","department":[{"_id":"MiLe"}],"language":[{"iso":"eng"}],"ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Physical Review Research","arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"issn":["2643-1564"]},"quality_controlled":"1","month":"10","article_type":"original","type":"journal_article","external_id":{"arxiv":["2301.09875"]},"doi":"10.1103/PhysRevResearch.5.043016","volume":5,"has_accepted_license":"1","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"},{"name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"year":"2023","publication_status":"published","scopus_import":"1","oa_version":"Published Version","date_updated":"2025-04-14T07:48:54Z","title":"Rotor lattice model of ferroelectric large polarons","status":"public","_id":"14486","abstract":[{"lang":"eng","text":"We present a minimal model of ferroelectric large polarons, which are suggested as one of the mechanisms responsible for the unique charge transport properties of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions lead to long-range ferroelectric ordering of rotors, which strongly affects the carrier mobility. In the nonperturbative regime, where our theory cannot be reduced to any of the earlier models, we reveal that the polaron is characterized by large coherence length and a roughly tenfold increase of the effective mass as compared to the bare mass. These results are in good agreement with other theoretical predictions for ferroelectric polarons. Our model establishes a general phenomenological framework for ferroelectric polarons providing the starting point for future studies of their role in the transport properties of hybrid organic-inorganic perovskites."}],"date_created":"2023-11-05T23:00:53Z","oa":1,"corr_author":"1"},{"publication_identifier":{"issn":["0043-1397"],"eissn":["1944-7973"]},"quality_controlled":"1","month":"10","article_type":"original","type":"journal_article","external_id":{"isi":["001091989600005"]},"doi":"10.1029/2022WR033841","volume":59,"has_accepted_license":"1","publisher":"Wiley","file":[{"date_created":"2023-11-07T08:10:44Z","file_id":"14495","creator":"dernst","file_name":"2023_WaterResourcesResearch_Buri.pdf","content_type":"application/pdf","success":1,"date_updated":"2023-11-07T08:10:44Z","file_size":5554901,"access_level":"open_access","checksum":"7ba9c87228dc09029b16bc800a0ef1a1","relation":"main_file"}],"citation":{"apa":"Buri, P., Fatichi, S., Shaw, T., Miles, E. S., McCarthy, M., Fyffe, C. L., … Pellicciotti, F. (2023). Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. Water Resources Research. Wiley. https://doi.org/10.1029/2022WR033841","mla":"Buri, Pascal, et al. “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” Water Resources Research, vol. 59, no. 10, e2022WR033841, Wiley, 2023, doi:10.1029/2022WR033841.","short":"P. Buri, S. Fatichi, T. Shaw, E.S. Miles, M. McCarthy, C.L. Fyffe, S. Fugger, S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, Water Resources Research 59 (2023).","ista":"Buri P, Fatichi S, Shaw T, Miles ES, McCarthy M, Fyffe CL, Fugger S, Ren S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. Water Resources Research. 59(10), e2022WR033841.","chicago":"Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan S. Miles, Michael McCarthy, Catriona Louise Fyffe, Stefan Fugger, et al. “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” Water Resources Research. Wiley, 2023. https://doi.org/10.1029/2022WR033841.","ieee":"P. Buri et al., “Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment,” Water Resources Research, vol. 59, no. 10. Wiley, 2023.","ama":"Buri P, Fatichi S, Shaw T, et al. Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. Water Resources Research. 2023;59(10). doi:10.1029/2022WR033841"},"issue":"10","intvolume":" 59","file_date_updated":"2023-11-07T08:10:44Z","article_number":"e2022WR033841","date_published":"2023-10-25T00:00:00Z","day":"25","article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Buri","first_name":"Pascal","full_name":"Buri, Pascal"},{"full_name":"Fatichi, Simone","last_name":"Fatichi","first_name":"Simone"},{"full_name":"Shaw, Thomas","last_name":"Shaw","first_name":"Thomas","id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","orcid":"0000-0001-7640-6152"},{"first_name":"Evan S.","last_name":"Miles","full_name":"Miles, Evan S."},{"last_name":"Mccarthy","first_name":"Michael","full_name":"Mccarthy, Michael","id":"22a2674a-61ce-11ee-94b5-d18813baf16f"},{"id":"001b0422-8d15-11ed-bc51-cab6c037a228","full_name":"Fyffe, Catriona Louise","last_name":"Fyffe","first_name":"Catriona Louise"},{"full_name":"Fugger, Stefan","first_name":"Stefan","last_name":"Fugger"},{"first_name":"Shaoting","last_name":"Ren","full_name":"Ren, Shaoting"},{"first_name":"Marin","last_name":"Kneib","full_name":"Kneib, Marin"},{"full_name":"Jouberton, Achille","last_name":"Jouberton","first_name":"Achille"},{"last_name":"Steiner","first_name":"Jakob","full_name":"Steiner, Jakob"},{"first_name":"Koji","last_name":"Fujita","full_name":"Fujita, Koji"},{"last_name":"Pellicciotti","first_name":"Francesca","full_name":"Pellicciotti, Francesca","orcid":"0000-0002-5554-8087","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"acknowledgement":"This project has received funding from the JSPS-SNSF (Japan Society for the Promotion of Science and Swiss National Science Foundation) Bilateral Programmes project (HOPE, High-ele-vation precipitation in High Mountain Asia; Grant 183633), and the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers in High Mountain Asia; Grant 772751). We want to thank in particular T. Gurung, S. Joshi, J. Shea, W. Immerzeel, and others involved, as well as ICIMOD, for their efforts over the past years in observing the meteorology of the Langtang catchment, collecting and organizing the data and making them publicly available. We also thank the National Geographic Society (Grant NGS-61784R-19) and the Mount Everest Foundation (reference 19-24) for providing fieldwork funding for C. L. Fyffe. We thank T. Kramer for help with the WSL Hyperion cluster. We are grate-ful for comments by three anonymous reviewers and the Associate Editor, who greatly helped to improve the manuscript further. Open access funding provided by ETH-Bereich Forschungsanstalten.","related_material":{"record":[{"status":"public","relation":"research_data","id":"14494"}]},"department":[{"_id":"FrPe"}],"ddc":["550"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Water Resources Research","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"title":"Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment","_id":"14487","status":"public","abstract":[{"text":"High Mountain Asia (HMA) is among the most vulnerable water towers globally and yet future projections of water availability in and from its high-mountain catchments remain uncertain, as their hydrologic response to ongoing environmental changes is complex. Mechanistic modeling approaches incorporating cryospheric, hydrological, and vegetation processes in high spatial, temporal, and physical detail have never been applied for high-elevation catchments of HMA. We use a land surface model at high spatial and temporal resolution (100 m and hourly) to simulate the coupled dynamics of energy, water, and vegetation for the 350 km2 Langtang catchment (Nepal). We compare our model outputs for one hydrological year against a large set of observations to gain insight into the partitioning of the water balance at the subseasonal scale and across elevation bands. During the simulated hydrological year, we find that evapotranspiration is a key component of the total water balance, as it causes about the equivalent of 20% of all the available precipitation or 154% of the water production from glacier melt in the basin to return directly to the atmosphere. The depletion of the cryospheric water budget is dominated by snow melt, but at high elevations is primarily dictated by snow and ice sublimation. Snow sublimation is the dominant vapor flux (49%) at the catchment scale, accounting for the equivalent of 11% of snowfall, 17% of snowmelt, and 75% of ice melt, respectively. We conclude that simulations should consider sublimation and other evaporative fluxes explicitly, as otherwise water balance estimates can be ill-quantified.","lang":"eng"}],"date_created":"2023-11-05T23:00:53Z","oa":1,"isi":1,"year":"2023","publication_status":"published","oa_version":"Published Version","scopus_import":"1","date_updated":"2025-09-09T13:15:40Z"},{"year":"2023","publication_status":"published","scopus_import":"1","oa_version":"Preprint","date_updated":"2025-09-09T13:13:18Z","title":"Microwave-optics entanglement via cavity optomagnomechanics","_id":"14489","status":"public","oa":1,"date_created":"2023-11-05T23:00:54Z","abstract":[{"text":"Microwave-optics entanglement is a vital component for building hybrid quantum networks. Here, a new mechanism for preparing stationary entanglement between microwave and optical cavity fields in a cavity optomagnomechanical system is proposed. It consists of a magnon mode in a ferrimagnetic crystal that couples directly to a microwave cavity mode via the magnetic dipole interaction and indirectly to an optical cavity through the deformation displacement of the crystal. The mechanical displacement is induced by the magnetostrictive force and coupled to the optical cavity via radiation pressure. Both the opto- and magnomechanical couplings are dispersive. Magnon–phonon entanglement is created via magnomechanical parametric down-conversion, which is further distributed to optical and microwave photons via simultaneous optomechanical beamsplitter interaction and electromagnonic state-swap interaction, yielding stationary microwave-optics entanglement. The microwave-optics entanglement is robust against thermal noise, which will find broad potential applications in quantum networks and quantum information processing with hybrid quantum systems.","lang":"eng"}],"isi":1,"citation":{"ieee":"Z. Y. Fan, L. Qiu, S. Gröblacher, and J. Li, “Microwave-optics entanglement via cavity optomagnomechanics,” Laser and Photonics Reviews, vol. 17, no. 12. Wiley, 2023.","chicago":"Fan, Zhi Yuan, Liu Qiu, Simon Gröblacher, and Jie Li. “Microwave-Optics Entanglement via Cavity Optomagnomechanics.” Laser and Photonics Reviews. Wiley, 2023. https://doi.org/10.1002/lpor.202200866.","ista":"Fan ZY, Qiu L, Gröblacher S, Li J. 2023. Microwave-optics entanglement via cavity optomagnomechanics. Laser and Photonics Reviews. 17(12), 2200866.","ama":"Fan ZY, Qiu L, Gröblacher S, Li J. Microwave-optics entanglement via cavity optomagnomechanics. Laser and Photonics Reviews. 2023;17(12). doi:10.1002/lpor.202200866","short":"Z.Y. Fan, L. Qiu, S. Gröblacher, J. Li, Laser and Photonics Reviews 17 (2023).","apa":"Fan, Z. Y., Qiu, L., Gröblacher, S., & Li, J. (2023). Microwave-optics entanglement via cavity optomagnomechanics. Laser and Photonics Reviews. Wiley. https://doi.org/10.1002/lpor.202200866","mla":"Fan, Zhi Yuan, et al. “Microwave-Optics Entanglement via Cavity Optomagnomechanics.” Laser and Photonics Reviews, vol. 17, no. 12, 2200866, Wiley, 2023, doi:10.1002/lpor.202200866."},"publisher":"Wiley","intvolume":" 17","issue":"12","article_number":"2200866","article_processing_charge":"No","date_published":"2023-12-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2208.10703","open_access":"1"}],"day":"01","author":[{"first_name":"Zhi Yuan","last_name":"Fan","full_name":"Fan, Zhi Yuan"},{"full_name":"Qiu, Liu","first_name":"Liu","last_name":"Qiu","id":"45e99c0d-1eb1-11eb-9b96-ed8ab2983cac","orcid":"0000-0003-4345-4267"},{"first_name":"Simon","last_name":"Gröblacher","full_name":"Gröblacher, Simon"},{"first_name":"Jie","last_name":"Li","full_name":"Li, Jie"}],"department":[{"_id":"JoFi"}],"acknowledgement":"This work was supported by the National Key Research and Development Program of China (Grant no. 2022YFA1405200), the National Natural Science Foundation of China (Nos. 92265202), and the European Research Council (ERC CoG Q-ECHOS, 101001005).","arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publication":"Laser and Photonics Reviews","publication_identifier":{"eissn":["1863-8899"],"issn":["1863-8880"]},"month":"12","quality_controlled":"1","article_type":"original","external_id":{"arxiv":["2208.10703"],"isi":["001088860000001"]},"type":"journal_article","volume":17,"doi":"10.1002/lpor.202200866"},{"arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"43rd International Conference on Distributed Computing Systems","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"acknowledgement":"The work was partially supported by the Austrian Science Fund (FWF) through the project CoRaF (grant 2020388). It was also partially supported by NCN Grant 2019/35/B/ST6/04138 and ERC Grant 885666.","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14506"}]},"author":[{"full_name":"Avarikioti, Zeta","first_name":"Zeta","last_name":"Avarikioti"},{"full_name":"Lizurej, Tomasz","last_name":"Lizurej","first_name":"Tomasz"},{"full_name":"Michalak, Tomasz","last_name":"Michalak","first_name":"Tomasz"},{"full_name":"Yeo, Michelle X","last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809"}],"article_processing_charge":"No","day":"11","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.16006","open_access":"1"}],"date_published":"2023-10-11T00:00:00Z","intvolume":" 2023","citation":{"short":"Z. Avarikioti, T. Lizurej, T. Michalak, M.X. Yeo, in:, 43rd International Conference on Distributed Computing Systems, IEEE, 2023, pp. 603–613.","ama":"Avarikioti Z, Lizurej T, Michalak T, Yeo MX. Lightning creation games. In: 43rd International Conference on Distributed Computing Systems. Vol 2023. IEEE; 2023:603-613. doi:10.1109/ICDCS57875.2023.00037","chicago":"Avarikioti, Zeta, Tomasz Lizurej, Tomasz Michalak, and Michelle X Yeo. “Lightning Creation Games.” In 43rd International Conference on Distributed Computing Systems, 2023:603–13. IEEE, 2023. https://doi.org/10.1109/ICDCS57875.2023.00037.","ieee":"Z. Avarikioti, T. Lizurej, T. Michalak, and M. X. Yeo, “Lightning creation games,” in 43rd International Conference on Distributed Computing Systems, Hong Kong, China, 2023, vol. 2023, pp. 603–613.","ista":"Avarikioti Z, Lizurej T, Michalak T, Yeo MX. 2023. Lightning creation games. 43rd International Conference on Distributed Computing Systems. ICDCS: International Conference on Distributed Computing Systems vol. 2023, 603–613.","mla":"Avarikioti, Zeta, et al. “Lightning Creation Games.” 43rd International Conference on Distributed Computing Systems, vol. 2023, IEEE, 2023, pp. 603–13, doi:10.1109/ICDCS57875.2023.00037.","apa":"Avarikioti, Z., Lizurej, T., Michalak, T., & Yeo, M. X. (2023). Lightning creation games. In 43rd International Conference on Distributed Computing Systems (Vol. 2023, pp. 603–613). Hong Kong, China: IEEE. https://doi.org/10.1109/ICDCS57875.2023.00037"},"publisher":"IEEE","volume":2023,"doi":"10.1109/ICDCS57875.2023.00037","external_id":{"arxiv":["2306.16006"],"isi":["001081242600053"]},"type":"conference","month":"10","quality_controlled":"1","publication_identifier":{"eissn":["2575-8411"],"isbn":["9798350339864"]},"conference":{"end_date":"2023-07-21","name":"ICDCS: International Conference on Distributed Computing Systems","location":"Hong Kong, China","start_date":"2023-07-18"},"date_updated":"2026-04-07T13:29:44Z","oa_version":"Preprint","scopus_import":"1","publication_status":"published","page":"603-613","year":"2023","isi":1,"date_created":"2023-11-05T23:00:54Z","oa":1,"abstract":[{"lang":"eng","text":"Payment channel networks (PCNs) are a promising solution to the scalability problem of cryptocurrencies. Any two users connected by a payment channel in the network can theoretically send an unbounded number of instant, costless transactions between them. Users who are not directly connected can also transact with each other in a multi-hop fashion. In this work, we study the incentive structure behind the creation of payment channel networks, particularly from the point of view of a single user that wants to join the network. We define a utility function for a new user in terms of expected revenue, expected fees, and the cost of creating channels, and then provide constant factor approximation algorithms that optimise the utility function given a certain budget. Additionally, we take a step back from a single user to the whole network and examine the parameter spaces under which simple graph topologies form a Nash equilibrium."}],"_id":"14490","status":"public","title":"Lightning creation games"},{"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"ddc":["550"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-09-09T13:15:39Z","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14487"}]},"department":[{"_id":"FrPe"}],"author":[{"last_name":"Buri","first_name":"Pascal","full_name":"Buri, Pascal"},{"full_name":"Fatichi, Simone","last_name":"Fatichi","first_name":"Simone"},{"full_name":"Shaw, Thomas","last_name":"Shaw","first_name":"Thomas","id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","orcid":"0000-0001-7640-6152"},{"first_name":"Evan ","last_name":"Miles","full_name":"Miles, Evan "},{"full_name":"McCarthy, Michael","first_name":"Michael","last_name":"McCarthy","id":"22a2674a-61ce-11ee-94b5-d18813baf16f"},{"id":"001b0422-8d15-11ed-bc51-cab6c037a228","full_name":"Fyffe, Catriona Louise","last_name":"Fyffe","first_name":"Catriona Louise"},{"last_name":"Fugger","first_name":"Stefan","full_name":"Fugger, Stefan"},{"full_name":"Ren, Shaoting","last_name":"Ren","first_name":"Shaoting"},{"full_name":"Kneib, Marin","first_name":"Marin","last_name":"Kneib"},{"full_name":"Jouberton, Achille","last_name":"Jouberton","first_name":"Achille"},{"full_name":"Steiner, Jakob","first_name":"Jakob","last_name":"Steiner"},{"full_name":"Fujita, Koji","first_name":"Koji","last_name":"Fujita"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","orcid":"0000-0002-5554-8087"}],"oa_version":"Published Version","day":"03","date_published":"2023-10-03T00:00:00Z","main_file_link":[{"url":"https://10.5281/ZENODO.8402426","open_access":"1"}],"article_processing_charge":"No","year":"2023","publisher":"Zenodo","citation":{"mla":"Buri, Pascal, et al. Model Output Data to “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High Elevation Catchment.” Zenodo, 2023, doi:10.5281/ZENODO.8402426.","apa":"Buri, P., Fatichi, S., Shaw, T., Miles, E., McCarthy, M., Fyffe, C. L., … Pellicciotti, F. (2023). Model output data to “Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.” Zenodo. https://doi.org/10.5281/ZENODO.8402426","short":"P. Buri, S. Fatichi, T. Shaw, E. Miles, M. McCarthy, C.L. Fyffe, S. Fugger, S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, (2023).","ama":"Buri P, Fatichi S, Shaw T, et al. Model output data to “Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.” 2023. doi:10.5281/ZENODO.8402426","ista":"Buri P, Fatichi S, Shaw T, Miles E, McCarthy M, Fyffe CL, Fugger S, Ren S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Model output data to ‘Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment’, Zenodo, 10.5281/ZENODO.8402426.","chicago":"Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan Miles, Michael McCarthy, Catriona Louise Fyffe, Stefan Fugger, et al. “Model Output Data to ‘Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High Elevation Catchment.’” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8402426.","ieee":"P. Buri et al., “Model output data to ‘Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.’” Zenodo, 2023."},"doi":"10.5281/ZENODO.8402426","has_accepted_license":"1","type":"research_data_reference","abstract":[{"lang":"eng","text":"We provide i) gridded initial conditions (.tif), ii) modeled gridded monthly outputs (.tif), and iii) modeled hourly outputs at the station locations (.txt) for the hydrological year 2019. Information about the variables and units can be found in the figures (.png) associated to each dataset. Details about the datasets can be found in the original publication by Buri and others (2023).\r\n\r\nBuri, P., Fatichi, S., Shaw, T. E., Miles, E. S., McCarthy, M. J., Fyffe, C. L., ... & Pellicciotti, F. (2023). Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High‐Elevation Catchment. Water Resources Research, 59(10), e2022WR033841. DOI: 10.1029/2022WR033841"}],"month":"10","date_created":"2023-11-07T08:01:39Z","oa":1,"_id":"14494","status":"public","title":"Model output data to \"Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment\""},{"_id":"14499","status":"public","title":"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture","abstract":[{"text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.\r\n\r\nThe proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes.","lang":"eng"}],"date_created":"2023-11-07T09:02:48Z","oa":1,"corr_author":"1","isi":1,"year":"2023","project":[{"_id":"bd95085b-d553-11ed-ba76-e55d3349be45","grant_number":"101076777","name":"Randomness and structure in combinatorics"}],"publication_status":"published","oa_version":"Published Version","scopus_import":"1","date_updated":"2025-09-09T13:16:15Z","publication_identifier":{"issn":["2050-5086"]},"article_type":"original","quality_controlled":"1","month":"08","type":"journal_article","external_id":{"isi":["001123866200001"],"arxiv":["2208.02874"]},"doi":"10.1017/fmp.2023.17","has_accepted_license":"1","volume":11,"intvolume":" 11","file":[{"access_level":"open_access","file_size":1218719,"date_updated":"2023-11-07T09:16:23Z","content_type":"application/pdf","success":1,"relation":"main_file","checksum":"54b824098d59073cc87a308d458b0a3e","date_created":"2023-11-07T09:16:23Z","file_id":"14500","file_name":"2023_ForumMathematics_Kwan.pdf","creator":"dernst"}],"publisher":"Cambridge University Press","citation":{"ama":"Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 2023;11. doi:10.1017/fmp.2023.17","ieee":"M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi, vol. 11. Cambridge University Press, 2023.","chicago":"Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi. Cambridge University Press, 2023. https://doi.org/10.1017/fmp.2023.17.","ista":"Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11, e21.","short":"M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (2023).","mla":"Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi, vol. 11, e21, Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.","apa":"Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17"},"day":"24","date_published":"2023-08-24T00:00:00Z","article_processing_charge":"Yes","article_number":"e21","file_date_updated":"2023-11-07T09:16:23Z","acknowledgement":"Kwan was supported for part of this work by ERC Starting Grant ‘RANDSTRUCT’ No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-2141064. Sah was supported by the PD Soros Fellowship. Sauermann was supported by NSF Award DMS-2100157, and for part of this work by a Sloan Research Fellowship.","department":[{"_id":"MaKw"}],"author":[{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","full_name":"Kwan, Matthew Alan"},{"full_name":"Sah, Ashwin","first_name":"Ashwin","last_name":"Sah"},{"first_name":"Lisa","last_name":"Sauermann","full_name":"Sauermann, Lisa"},{"full_name":"Sawhney, Mehtaab","last_name":"Sawhney","first_name":"Mehtaab"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Analysis"],"ddc":["510"],"publication":"Forum of Mathematics, Pi","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"arxiv":1}]