[{"date_created":"2023-02-12T23:00:59Z","doi":"10.1038/s41559-023-01981-6","date_published":"2023-03-01T00:00:00Z","page":"450-460","publication":"Nature Ecology and Evolution","day":"01","year":"2023","has_accepted_license":"1","isi":1,"oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"We thank B. M. Steinwender, N. V. Meyling and J. Eilenberg for the fungal strains; J. Anaya-Rojas for statistical advice; the Social Immunity team at ISTA for ant collection and experimental help, in particular H. Leitner, and the ISTA Lab Support Facility for general laboratory support; D. Ebert, H. Schulenburg and J. Heinze for continued project discussion; and M. Sixt, R. Roemhild and the Social Immunity team for comments on the manuscript. The study was funded by the German Research Foundation (CR118/3-1) within the Framework of the Priority Program SPP 1399, and the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme (No. 771402; EPIDEMICSonCHIP), both to S.C.","title":"Pathogen evasion of social immunity","external_id":{"isi":["000924572800001"],"pmid":["36732670"]},"article_processing_charge":"No","author":[{"first_name":"Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","last_name":"Stock","full_name":"Stock, Miriam"},{"first_name":"Barbara","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","last_name":"Milutinovic","orcid":"0000-0002-8214-4758","full_name":"Milutinovic, Barbara"},{"first_name":"Michaela","id":"953894f3-25bd-11ec-8556-f70a9d38ef60","last_name":"Hönigsberger","full_name":"Hönigsberger, Michaela"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse","full_name":"Grasse, Anna V"},{"id":"39523C54-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Wiesenhofer","full_name":"Wiesenhofer, Florian"},{"first_name":"Niklas","id":"2AC57FAC-F248-11E8-B48F-1D18A9856A87","full_name":"Kampleitner, Niklas","last_name":"Kampleitner"},{"id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","first_name":"Madhumitha","last_name":"Narasimhan","orcid":"0000-0002-8600-0671","full_name":"Narasimhan, Madhumitha"},{"first_name":"Thomas","last_name":"Schmitt","full_name":"Schmitt, Thomas"},{"last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"M. Stock, B. Milutinovic, M. Hönigsberger, A.V. Grasse, F. Wiesenhofer, N. Kampleitner, M. Narasimhan, T. Schmitt, S. Cremer, Nature Ecology and Evolution 7 (2023) 450–460.","ieee":"M. Stock et al., “Pathogen evasion of social immunity,” Nature Ecology and Evolution, vol. 7. Springer Nature, pp. 450–460, 2023.","ama":"Stock M, Milutinovic B, Hönigsberger M, et al. Pathogen evasion of social immunity. Nature Ecology and Evolution. 2023;7:450-460. doi:10.1038/s41559-023-01981-6","apa":"Stock, M., Milutinovic, B., Hönigsberger, M., Grasse, A. V., Wiesenhofer, F., Kampleitner, N., … Cremer, S. (2023). Pathogen evasion of social immunity. Nature Ecology and Evolution. Springer Nature. https://doi.org/10.1038/s41559-023-01981-6","mla":"Stock, Miriam, et al. “Pathogen Evasion of Social Immunity.” Nature Ecology and Evolution, vol. 7, Springer Nature, 2023, pp. 450–60, doi:10.1038/s41559-023-01981-6.","ista":"Stock M, Milutinovic B, Hönigsberger M, Grasse AV, Wiesenhofer F, Kampleitner N, Narasimhan M, Schmitt T, Cremer S. 2023. Pathogen evasion of social immunity. Nature Ecology and Evolution. 7, 450–460.","chicago":"Stock, Miriam, Barbara Milutinovic, Michaela Hönigsberger, Anna V Grasse, Florian Wiesenhofer, Niklas Kampleitner, Madhumitha Narasimhan, Thomas Schmitt, and Sylvia Cremer. “Pathogen Evasion of Social Immunity.” Nature Ecology and Evolution. Springer Nature, 2023. https://doi.org/10.1038/s41559-023-01981-6."},"project":[{"_id":"2649B4DE-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Epidemics in ant societies on a chip","grant_number":"771402"},{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1"}],"ec_funded":1,"related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/how-sneaky-germs-hide-from-ants/","description":"News on ISTA website"}]},"volume":7,"language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2023-08-16T11:54:59Z","file_size":1600499,"date_created":"2023-08-16T11:54:59Z","file_name":"2023_NatureEcoEvo_Stock.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14069","checksum":"8244f4650a0e7aeea488d1bcd4a31702","success":1}],"publication_status":"published","publication_identifier":{"eissn":["2397-334X"]},"intvolume":" 7","month":"03","scopus_import":"1","oa_version":"Published Version","pmid":1,"acknowledged_ssus":[{"_id":"LifeSc"}],"abstract":[{"lang":"eng","text":"Treating sick group members is a hallmark of collective disease defence in vertebrates and invertebrates alike. Despite substantial effects on pathogen fitness and epidemiology, it is still largely unknown how pathogens react to the selection pressure imposed by care intervention. Using social insects and pathogenic fungi, we here performed a serial passage experiment in the presence or absence of colony members, which provide social immunity by grooming off infectious spores from exposed individuals. We found specific effects on pathogen diversity, virulence and transmission. Under selection of social immunity, pathogens invested into higher spore production, but spores were less virulent. Notably, they also elicited a lower grooming response in colony members, compared with spores from the individual host selection lines. Chemical spore analysis suggested that the spores from social selection lines escaped the caregivers’ detection by containing lower levels of ergosterol, a key fungal membrane component. Experimental application of chemically pure ergosterol indeed induced sanitary grooming, supporting its role as a microbe-associated cue triggering host social immunity against fungal pathogens. By reducing this detection cue, pathogens were able to evade the otherwise very effective collective disease defences of their social hosts."}],"department":[{"_id":"SyCr"},{"_id":"LifeSc"},{"_id":"JiFr"}],"file_date_updated":"2023-08-16T11:54:59Z","ddc":["570"],"date_updated":"2023-08-16T11:55:48Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"12543"},{"publisher":"Oxford University Press","quality_controlled":"1","oa":1,"acknowledgement":"We thank the Vicoso and Barton groups and ISTA Scientific Computing Unit. We also thank two anonymous reviewers for their valuable comments. This work was supported by the European Research Council under the European Union’s Horizon 2020 research and innovation program (grant agreements no. 715257 and no. 716117).","doi":"10.1093/evlett/qrac004","date_published":"2023-02-01T00:00:00Z","date_created":"2023-02-06T13:59:12Z","day":"01","publication":"Evolution Letters","has_accepted_license":"1","isi":1,"year":"2023","project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"call_identifier":"H2020","_id":"250BDE62-B435-11E9-9278-68D0E5697425","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution","grant_number":"715257"}],"article_number":"qrac004","title":"Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution","author":[{"id":"353FAC84-AE61-11E9-8BFC-00D3E5697425","first_name":"Andrea","full_name":"Mrnjavac, Andrea","last_name":"Mrnjavac"},{"orcid":"0000-0002-6246-1465","full_name":"Khudiakova, Kseniia","last_name":"Khudiakova","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","first_name":"Kseniia"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["001021692200001"],"pmid":["37065438"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Mrnjavac, Andrea, Kseniia Khudiakova, Nicholas H Barton, and Beatriz Vicoso. “Slower-X: Reduced Efficiency of Selection in the Early Stages of X Chromosome Evolution.” Evolution Letters. Oxford University Press, 2023. https://doi.org/10.1093/evlett/qrac004.","ista":"Mrnjavac A, Khudiakova K, Barton NH, Vicoso B. 2023. Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. 7(1), qrac004.","mla":"Mrnjavac, Andrea, et al. “Slower-X: Reduced Efficiency of Selection in the Early Stages of X Chromosome Evolution.” Evolution Letters, vol. 7, no. 1, qrac004, Oxford University Press, 2023, doi:10.1093/evlett/qrac004.","ieee":"A. Mrnjavac, K. Khudiakova, N. H. Barton, and B. Vicoso, “Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution,” Evolution Letters, vol. 7, no. 1. Oxford University Press, 2023.","short":"A. Mrnjavac, K. Khudiakova, N.H. Barton, B. Vicoso, Evolution Letters 7 (2023).","ama":"Mrnjavac A, Khudiakova K, Barton NH, Vicoso B. Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. 2023;7(1). doi:10.1093/evlett/qrac004","apa":"Mrnjavac, A., Khudiakova, K., Barton, N. H., & Vicoso, B. (2023). Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrac004"},"month":"02","intvolume":" 7","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"Differentiated X chromosomes are expected to have higher rates of adaptive divergence than autosomes, if new beneficial mutations are recessive (the “faster-X effect”), largely because these mutations are immediately exposed to selection in males. The evolution of X chromosomes after they stop recombining in males, but before they become hemizygous, has not been well explored theoretically. We use the diffusion approximation to infer substitution rates of beneficial and deleterious mutations under such a scenario. Our results show that selection is less efficient on diploid X loci than on autosomal and hemizygous X loci under a wide range of parameters. This “slower-X” effect is stronger for genes affecting primarily (or only) male fitness, and for sexually antagonistic genes. These unusual dynamics suggest that some of the peculiar features of X chromosomes, such as the differential accumulation of genes with sex-specific functions, may start arising earlier than previously appreciated."}],"volume":7,"issue":"1","ec_funded":1,"file":[{"file_name":"2023_EvLetters_Mrnjavac.pdf","date_created":"2023-08-16T11:43:33Z","creator":"dernst","file_size":2592189,"date_updated":"2023-08-16T11:43:33Z","success":1,"checksum":"a240a041cb9b9b7c8ba93a4706674a3f","file_id":"14068","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2056-3744"]},"publication_status":"published","status":"public","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"12521","department":[{"_id":"GradSch"},{"_id":"BeVi"}],"file_date_updated":"2023-08-16T11:43:33Z","ddc":["570"],"date_updated":"2023-08-16T11:44:32Z"},{"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-08-16T12:29:06Z","file_size":1787894,"creator":"dernst","date_created":"2023-08-16T12:29:06Z","file_name":"2023_CurrentOpinionNeurobio_Hippenmeyer.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"4d11c4ca87e6cbc4d2ac46d3225ea615","file_id":"14071","success":1}],"publication_status":"published","publication_identifier":{"issn":["0959-4388"]},"ec_funded":1,"issue":"4","volume":79,"pmid":1,"oa_version":"Published Version","abstract":[{"text":"How to generate a brain of correct size and with appropriate cell-type diversity during development is a major question in Neuroscience. In the developing neocortex, radial glial progenitor (RGP) cells are the main neural stem cells that produce cortical excitatory projection neurons, glial cells, and establish the prospective postnatal stem cell niche in the lateral ventricles. RGPs follow a tightly orchestrated developmental program that when disrupted can result in severe cortical malformations such as microcephaly and megalencephaly. The precise cellular and molecular mechanisms instructing faithful RGP lineage progression are however not well understood. This review will summarize recent conceptual advances that contribute to our understanding of the general principles of RGP lineage progression.","lang":"eng"}],"intvolume":" 79","month":"04","scopus_import":"1","ddc":["570"],"date_updated":"2023-08-16T12:30:25Z","department":[{"_id":"SiHi"}],"file_date_updated":"2023-08-16T12:29:06Z","_id":"12679","keyword":["General Neuroscience"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"review","type":"journal_article","publication":"Current Opinion in Neurobiology","day":"01","year":"2023","has_accepted_license":"1","isi":1,"date_created":"2023-02-26T12:24:21Z","doi":"10.1016/j.conb.2023.102695","date_published":"2023-04-01T00:00:00Z","acknowledgement":"I wish to thank all current and past members of the Hippenmeyer laboratory at ISTA for exciting discussions on the subject of this review. I apologize to colleagues whose work I could not cite and/or discuss in the frame of the available space. Work in the Hippenmeyer laboratory on the\r\ndiscussed topic is supported by ISTA institutional funds, FWF SFB F78 to S.H., and the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme (grant agree-ment no. 725780 LinPro) to SH.","oa":1,"publisher":"Elsevier","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Hippenmeyer, Simon. “Principles of Neural Stem Cell Lineage Progression: Insights from Developing Cerebral Cortex.” Current Opinion in Neurobiology. Elsevier, 2023. https://doi.org/10.1016/j.conb.2023.102695.","ista":"Hippenmeyer S. 2023. Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. 79(4), 102695.","mla":"Hippenmeyer, Simon. “Principles of Neural Stem Cell Lineage Progression: Insights from Developing Cerebral Cortex.” Current Opinion in Neurobiology, vol. 79, no. 4, 102695, Elsevier, 2023, doi:10.1016/j.conb.2023.102695.","ama":"Hippenmeyer S. Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. 2023;79(4). doi:10.1016/j.conb.2023.102695","apa":"Hippenmeyer, S. (2023). Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. Elsevier. https://doi.org/10.1016/j.conb.2023.102695","ieee":"S. Hippenmeyer, “Principles of neural stem cell lineage progression: Insights from developing cerebral cortex,” Current Opinion in Neurobiology, vol. 79, no. 4. Elsevier, 2023.","short":"S. Hippenmeyer, Current Opinion in Neurobiology 79 (2023)."},"title":"Principles of neural stem cell lineage progression: Insights from developing cerebral cortex","external_id":{"pmid":["36842274"],"isi":["000953497700001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"}],"article_number":"102695","project":[{"grant_number":"F07805","name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"},{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"issue":"4","volume":296,"publication_identifier":{"issn":["0025-584X"],"eissn":["1522-2616"]},"publication_status":"published","file":[{"file_name":"2023_MathNachrichten_Agresti.pdf","date_created":"2023-08-16T11:40:02Z","file_size":449280,"date_updated":"2023-08-16T11:40:02Z","creator":"dernst","success":1,"checksum":"6f099f1d064173784d1a27716a2cc795","file_id":"14067","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"04","intvolume":" 296","abstract":[{"text":"In this paper, we consider traces at initial times for functions with mixed time-space smoothness. Such results are often needed in the theory of evolution equations. Our result extends and unifies many previous results. Our main improvement is that we can allow general interpolation couples. The abstract results are applied to regularity problems for fractional evolution equations and stochastic evolution equations, where uniform trace estimates on the half-line are shown.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2023-08-16T11:40:02Z","department":[{"_id":"JuFi"}],"date_updated":"2023-08-16T11:41:42Z","ddc":["510"],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"status":"public","_id":"12429","page":"1319-1350","date_published":"2023-04-01T00:00:00Z","doi":"10.1002/mana.202100192","date_created":"2023-01-29T23:00:59Z","isi":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Mathematische Nachrichten","publisher":"Wiley","quality_controlled":"1","oa":1,"acknowledgement":"The first author has been partially supported by the Nachwuchsring—Network for the promotion of young scientists—at TU Kaiserslautern. The second and third authors were supported by the Vidi subsidy 639.032.427 of the Netherlands Organisation for Scientific Research (NWO).","author":[{"last_name":"Agresti","orcid":"0000-0002-9573-2962","full_name":"Agresti, Antonio","first_name":"Antonio","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72"},{"first_name":"Nick","full_name":"Lindemulder, Nick","last_name":"Lindemulder"},{"first_name":"Mark","last_name":"Veraar","full_name":"Veraar, Mark"}],"external_id":{"arxiv":["2104.05063"],"isi":["000914134900001"]},"article_processing_charge":"No","title":"On the trace embedding and its applications to evolution equations","citation":{"ista":"Agresti A, Lindemulder N, Veraar M. 2023. On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. 296(4), 1319–1350.","chicago":"Agresti, Antonio, Nick Lindemulder, and Mark Veraar. “On the Trace Embedding and Its Applications to Evolution Equations.” Mathematische Nachrichten. Wiley, 2023. https://doi.org/10.1002/mana.202100192.","ieee":"A. Agresti, N. Lindemulder, and M. Veraar, “On the trace embedding and its applications to evolution equations,” Mathematische Nachrichten, vol. 296, no. 4. Wiley, pp. 1319–1350, 2023.","short":"A. Agresti, N. Lindemulder, M. Veraar, Mathematische Nachrichten 296 (2023) 1319–1350.","apa":"Agresti, A., Lindemulder, N., & Veraar, M. (2023). On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. Wiley. https://doi.org/10.1002/mana.202100192","ama":"Agresti A, Lindemulder N, Veraar M. On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. 2023;296(4):1319-1350. doi:10.1002/mana.202100192","mla":"Agresti, Antonio, et al. “On the Trace Embedding and Its Applications to Evolution Equations.” Mathematische Nachrichten, vol. 296, no. 4, Wiley, 2023, pp. 1319–50, doi:10.1002/mana.202100192."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_published":"2023-01-09T00:00:00Z","doi":"10.1142/S0129055X2350006X","date_created":"2023-01-29T23:00:59Z","isi":1,"year":"2023","day":"09","publication":"Reviews in Mathematical Physics","quality_controlled":"1","publisher":"World Scientific Publishing","oa":1,"author":[{"full_name":"Falconi, Marco","last_name":"Falconi","first_name":"Marco"},{"last_name":"Leopold","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","first_name":"Nikolai K"},{"full_name":"Mitrouskas, David Johannes","last_name":"Mitrouskas","first_name":"David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d"},{"id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","first_name":"Sören P","orcid":"0000-0002-9166-5889","full_name":"Petrat, Sören P","last_name":"Petrat"}],"external_id":{"isi":["000909760300001"],"arxiv":["2110.00458"]},"article_processing_charge":"No","title":"Bogoliubov dynamics and higher-order corrections for the regularized Nelson model","citation":{"short":"M. Falconi, N.K. Leopold, D.J. Mitrouskas, S.P. Petrat, Reviews in Mathematical Physics 35 (2023).","ieee":"M. Falconi, N. K. Leopold, D. J. Mitrouskas, and S. P. Petrat, “Bogoliubov dynamics and higher-order corrections for the regularized Nelson model,” Reviews in Mathematical Physics, vol. 35, no. 4. World Scientific Publishing, 2023.","apa":"Falconi, M., Leopold, N. K., Mitrouskas, D. J., & Petrat, S. P. (2023). Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X2350006X","ama":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 2023;35(4). doi:10.1142/S0129055X2350006X","mla":"Falconi, Marco, et al. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics, vol. 35, no. 4, 2350006, World Scientific Publishing, 2023, doi:10.1142/S0129055X2350006X.","ista":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. 2023. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 35(4), 2350006.","chicago":"Falconi, Marco, Nikolai K Leopold, David Johannes Mitrouskas, and Sören P Petrat. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics. World Scientific Publishing, 2023. https://doi.org/10.1142/S0129055X2350006X."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2350006","volume":35,"issue":"4","publication_identifier":{"issn":["0129-055X"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2110.00458","open_access":"1"}],"month":"01","intvolume":" 35","abstract":[{"text":"We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"RoSe"}],"date_updated":"2023-08-16T11:47:27Z","type":"journal_article","article_type":"original","status":"public","_id":"12430"},{"month":"03","intvolume":" 3","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and make direct contact with human brain resting-state activity recordings via tractable inference of the model’s two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"volume":3,"ec_funded":1,"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"14073","checksum":"7c63b2b2edfd68aaffe96d70ca6a865a","success":1,"date_updated":"2023-08-16T12:39:57Z","file_size":4474284,"creator":"dernst","date_created":"2023-08-16T12:39:57Z","file_name":"2023_NatureCompScience_Lombardi.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2662-8457"]},"publication_status":"published","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"12762","department":[{"_id":"GaTk"},{"_id":"GradSch"}],"file_date_updated":"2023-08-16T12:39:57Z","ddc":["570"],"date_updated":"2023-08-16T12:41:53Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This research was funded in whole, or in part, by the Austrian Science Fund (FWF) (grant no. PT1013M03318 to F.L. and no. P34015 to G.T.). For the purpose of open access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 research and innovation program under the Marie Sklodowska-Curie action (grant agreement No. 754411 to F.L.).","date_published":"2023-03-20T00:00:00Z","doi":"10.1038/s43588-023-00410-9","date_created":"2023-03-26T22:01:08Z","page":"254-263","day":"20","publication":"Nature Computational Science","has_accepted_license":"1","year":"2023","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"M03318","name":"Functional Advantages of Critical Brain Dynamics","_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67"},{"grant_number":"P34015","name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"title":"Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain","author":[{"first_name":"Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","last_name":"Lombardi","full_name":"Lombardi, Fabrizio","orcid":"0000-0003-2623-5249"},{"first_name":"Selver","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","last_name":"Pepic","full_name":"Pepic, Selver"},{"first_name":"Oren","last_name":"Shriki","full_name":"Shriki, Oren"},{"last_name":"Tkačik","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706","last_name":"De Martino"}],"article_processing_charge":"No","external_id":{"arxiv":["2108.06686"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science. Springer Nature, 2023. https://doi.org/10.1038/s43588-023-00410-9.","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. 2023. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 3, 254–263.","mla":"Lombardi, Fabrizio, et al. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science, vol. 3, Springer Nature, 2023, pp. 254–63, doi:10.1038/s43588-023-00410-9.","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 2023;3:254-263. doi:10.1038/s43588-023-00410-9","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., & De Martino, D. (2023). Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-023-00410-9","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, Nature Computational Science 3 (2023) 254–263.","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain,” Nature Computational Science, vol. 3. Springer Nature, pp. 254–263, 2023."}},{"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"abstract":[{"lang":"eng","text":"The tight spatiotemporal coordination of signaling activity determining embryo\r\npatterning and the physical processes driving embryo morphogenesis renders\r\nembryonic development robust, such that key developmental processes can unfold\r\nrelatively normally even outside of the full embryonic context. For instance, embryonic\r\nstem cell cultures can recapitulate the hallmarks of gastrulation, i.e. break symmetry\r\nleading to germ layer formation and morphogenesis, in a very reduced environment.\r\nThis leads to questions on specific contributions of embryo-specific features, such as\r\nthe presence of extraembryonic tissues, which are inherently involved in gastrulation\r\nin the full embryonic context. To address this, we established zebrafish embryonic\r\nexplants without the extraembryonic yolk cell, an important player as a signaling\r\nsource and for morphogenesis during gastrulation, as a model of ex vivo development.\r\nWe found that dorsal-marginal determinants are required and sufficient in these\r\nexplants to form and pattern all three germ layers. However, formation of tissues,\r\nwhich require the highest Nodal-signaling levels, is variable, demonstrating a\r\ncontribution of extraembryonic tissues for reaching peak Nodal signaling levels.\r\nBlastoderm explants also undergo gastrulation-like axis elongation. We found that this\r\nelongation movement shows hallmarks of oriented mesendoderm cell intercalations\r\ntypically associated with dorsal tissues in the intact embryo. These are disrupted by\r\nuniform upregulation of BMP signaling activity and concomitant explant ventralization,\r\nsuggesting that tight spatial control of BMP signaling is a prerequisite for explant\r\nmorphogenesis. This control is achieved by Nodal signaling, which is critical for\r\neffectively downregulating BMP signaling in the mesendoderm, highlighting that Nodal\r\nsignaling is not only directly required for mesendoderm cell fate specification and\r\nmorphogenesis, but also by maintaining low levels of BMP signaling at the dorsal side.\r\nCollectively, we provide insights into the capacity and organization of signaling and\r\nmorphogenetic domains to recapitulate features of zebrafish gastrulation outside of\r\nthe full embryonic context."}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"05","degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663 - 337X"]},"language":[{"iso":"eng"}],"file":[{"embargo":"2024-05-05","checksum":"59b0303dc483f40a96a610a90aab7ee9","file_id":"12907","embargo_to":"open_access","content_type":"application/pdf","relation":"main_file","access_level":"closed","file_name":"Thesis_Schauer_final.pdf","date_created":"2023-05-05T13:01:14Z","file_size":31434230,"date_updated":"2023-05-05T13:01:14Z","creator":"aschauer"},{"checksum":"25f54e12479b6adaabd129a20568e6c1","file_id":"12908","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","access_level":"closed","file_name":"Thesis_Schauer_final.docx","date_created":"2023-05-05T13:04:15Z","file_size":43809109,"date_updated":"2023-05-05T13:04:15Z","creator":"aschauer"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"8966","relation":"part_of_dissertation"},{"id":"7888","status":"public","relation":"part_of_dissertation"}]},"_id":"12891","type":"dissertation","status":"public","date_updated":"2023-08-21T06:25:48Z","supervisor":[{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"ddc":["570"],"department":[{"_id":"GradSch"},{"_id":"CaHe"}],"file_date_updated":"2023-05-05T13:04:15Z","publisher":"Institute of Science and Technology Austria","year":"2023","has_accepted_license":"1","day":"05","page":"190","date_created":"2023-05-05T08:48:20Z","doi":"10.15479/at:ista:12891","date_published":"2023-05-05T00:00:00Z","project":[{"_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742573","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation"},{"_id":"26B1E39C-B435-11E9-9278-68D0E5697425","grant_number":"25239","name":"Mesendoderm specification in zebrafish: The role of extraembryonic tissues"}],"citation":{"ista":"Schauer A. 2023. Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues. Institute of Science and Technology Austria.","chicago":"Schauer, Alexandra. “Mesendoderm Formation in Zebrafish Gastrulation: The Role of Extraembryonic Tissues.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12891.","ieee":"A. Schauer, “Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues,” Institute of Science and Technology Austria, 2023.","short":"A. Schauer, Mesendoderm Formation in Zebrafish Gastrulation: The Role of Extraembryonic Tissues, Institute of Science and Technology Austria, 2023.","ama":"Schauer A. Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues. 2023. doi:10.15479/at:ista:12891","apa":"Schauer, A. (2023). Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12891","mla":"Schauer, Alexandra. Mesendoderm Formation in Zebrafish Gastrulation: The Role of Extraembryonic Tissues. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12891."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","author":[{"last_name":"Schauer","orcid":"0000-0001-7659-9142","full_name":"Schauer, Alexandra","first_name":"Alexandra","id":"30A536BA-F248-11E8-B48F-1D18A9856A87"}],"title":"Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues"},{"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","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\r\nAustrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”,\r\nI 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nThis work was done in part while Gramoz Goranci was at Institute for Theoretical Studies, ETH Zurich, Switzerland. There, he was supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation. We also thank Richard Peng, Thatchaphol Saranurak, Sebastian Forster and Sushant Sachdeva for helpful discussions, and the anonymous reviewers for their insightful comments.","date_created":"2023-08-20T22:01:14Z","doi":"10.4230/LIPIcs.ICALP.2023.69","date_published":"2023-07-01T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775 ","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"article_number":"69","article_processing_charge":"Yes","external_id":{"unknown":["2211.09606"]},"author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"}],"title":"Efficient data structures for incremental exact and approximate maximum flow","citation":{"apa":"Goranci, G., & Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69","ama":"Goranci G, Henzinger MH. Efficient data structures for incremental exact and approximate maximum flow. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.69","short":"G. Goranci, M.H. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","mla":"Goranci, Gramoz, and Monika H. Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.69.","ista":"Goranci G, Henzinger MH. 2023. Efficient data structures for incremental exact and approximate maximum flow. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 69.","chicago":"Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.69."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 261","month":"07","abstract":[{"text":"We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":261,"publication_status":"published","publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"language":[{"iso":"eng"}],"file":[{"file_size":875910,"date_updated":"2023-08-21T06:59:05Z","creator":"dernst","file_name":"2023_LIPIcsICALP_Goranci.pdf","date_created":"2023-08-21T06:59:05Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"074177e815a1656de5d4071c7a3dffa6","file_id":"14089"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2023-07-14","location":"Paderborn, Germany","start_date":"2023-07-10"},"type":"conference","status":"public","_id":"14085","department":[{"_id":"MoHe"}],"file_date_updated":"2023-08-21T06:59:05Z","date_updated":"2023-08-21T07:00:49Z","ddc":["000"]},{"file_date_updated":"2023-08-21T06:45:16Z","department":[{"_id":"VlKo"}],"ddc":["000","510"],"date_updated":"2023-08-21T06:49:11Z","status":"public","conference":{"end_date":"2023-07-14","location":"Paderborn, Germany","start_date":"2023-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","_id":"14084","volume":261,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"6dee0684245bb1c524b9c955db1e933d","file_id":"14088","creator":"dernst","file_size":917791,"date_updated":"2023-08-21T06:45:16Z","file_name":"2023_LIPIcsICALP_Harris.pdf","date_created":"2023-08-21T06:45:16Z"}],"publication_status":"published","publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"intvolume":" 261","month":"07","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"text":"A central problem in computational statistics is to convert a procedure for sampling combinatorial objects into a procedure for counting those objects, and vice versa. We will consider sampling problems which come from Gibbs distributions, which are families of probability distributions over a discrete space Ω with probability mass function of the form μ^Ω_β(ω) ∝ e^{β H(ω)} for β in an interval [β_min, β_max] and H(ω) ∈ {0} ∪ [1, n].\r\nThe partition function is the normalization factor Z(β) = ∑_{ω ∈ Ω} e^{β H(ω)}, and the log partition ratio is defined as q = (log Z(β_max))/Z(β_min)\r\nWe develop a number of algorithms to estimate the counts c_x using roughly Õ(q/ε²) samples for general Gibbs distributions and Õ(n²/ε²) samples for integer-valued distributions (ignoring some second-order terms and parameters), We show this is optimal up to logarithmic factors. We illustrate with improved algorithms for counting connected subgraphs and perfect matchings in a graph.","lang":"eng"}],"title":"Parameter estimation for Gibbs distributions","article_processing_charge":"Yes","external_id":{"arxiv":["2007.10824"]},"author":[{"full_name":"Harris, David G.","last_name":"Harris","first_name":"David G."},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 72.","chicago":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.72.","short":"D.G. Harris, V. Kolmogorov, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"D. G. Harris and V. Kolmogorov, “Parameter estimation for Gibbs distributions,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","apa":"Harris, D. G., & Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.72","ama":"Harris DG, Kolmogorov V. Parameter estimation for Gibbs distributions. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.72","mla":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.72."},"article_number":"72","date_created":"2023-08-20T22:01:14Z","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.72","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","year":"2023","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"We thank Heng Guo for helpful explanations of algorithms for sampling connected subgraphs and matchings, Maksym Serbyn for bringing to our attention the Wang-Landau algorithm and its use in physics."},{"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 261","month":"07","abstract":[{"text":"The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been investigated extensively due to its algorithmic properties and expressive power. Though tight approximation algorithms for general matroid constraints exist in theory, the running times of such algorithms typically scale quadratically, and are not practical for truly large scale settings. Recent progress has focused on fast algorithms for important classes of matroids given in explicit form. Currently, nearly-linear time algorithms only exist for graphic and partition matroids [Alina Ene and Huy L. Nguyen, 2019]. In this work, we develop algorithms for monotone submodular maximization constrained by graphic, transversal matroids, or laminar matroids in time near-linear in the size of their representation. Our algorithms achieve an optimal approximation of 1-1/e-ε and both generalize and accelerate the results of Ene and Nguyen [Alina Ene and Huy L. Nguyen, 2019]. In fact, the running time of our algorithm cannot be improved within the fast continuous greedy framework of Badanidiyuru and Vondrák [Ashwinkumar Badanidiyuru and Jan Vondrák, 2014].\r\nTo achieve near-linear running time, we make use of dynamic data structures that maintain bases with approximate maximum cardinality and weight under certain element updates. These data structures need to support a weight decrease operation and a novel Freeze operation that allows the algorithm to freeze elements (i.e. force to be contained) in its basis regardless of future data structure operations. For the laminar matroid, we present a new dynamic data structure using the top tree interface of Alstrup, Holm, de Lichtenberg, and Thorup [Stephen Alstrup et al., 2005] that maintains the maximum weight basis under insertions and deletions of elements in O(log n) time. This data structure needs to support certain subtree query and path update operations that are performed every insertion and deletion that are non-trivial to handle in conjunction. For the transversal matroid the Freeze operation corresponds to requiring the data structure to keep a certain set S of vertices matched, a property that we call S-stability. While there is a large body of work on dynamic matching algorithms, none are S-stable and maintain an approximate maximum weight matching under vertex updates. We give the first such algorithm for bipartite graphs with total running time linear (up to log factors) in the number of edges.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":261,"publication_status":"published","publication_identifier":{"isbn":["9783959772785"],"issn":["18688969"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2023_LIPIcsICALP_HenzingerM.pdf","date_created":"2023-08-21T07:04:36Z","file_size":930943,"date_updated":"2023-08-21T07:04:36Z","creator":"dernst","success":1,"checksum":"a5eef225014e003efbfbe4830fdd23cb","file_id":"14090","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2023-07-10","location":"Paderborn, Germany","end_date":"2023-07-14","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"type":"conference","status":"public","_id":"14086","department":[{"_id":"MoHe"}],"file_date_updated":"2023-08-21T07:04:36Z","date_updated":"2023-08-21T07:05:47Z","ddc":["000"],"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":" Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Jan Vondrák: Supported by NSF Award 2127781.","date_created":"2023-08-20T22:01:14Z","doi":"10.4230/LIPIcs.ICALP.2023.74","date_published":"2023-07-01T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 "}],"article_number":"74","external_id":{"arxiv":["2305.00122"]},"article_processing_charge":"Yes","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Liu","full_name":"Liu, Paul","first_name":"Paul"},{"last_name":"Vondrák","full_name":"Vondrák, Jan","first_name":"Jan"},{"first_name":"Da Wei","full_name":"Zheng, Da Wei","last_name":"Zheng"}],"title":"Faster submodular maximization for several classes of matroids","citation":{"mla":"Henzinger, Monika H., et al. “Faster Submodular Maximization for Several Classes of Matroids.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.74.","short":"M.H. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","apa":"Henzinger, M. H., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74","ama":"Henzinger MH, Liu P, Vondrák J, Zheng DW. Faster submodular maximization for several classes of matroids. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.74","chicago":"Henzinger, Monika H, Paul Liu, Jan Vondrák, and Da Wei Zheng. “Faster Submodular Maximization for Several Classes of Matroids.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.74.","ista":"Henzinger MH, Liu P, Vondrák J, Zheng DW. 2023. Faster submodular maximization for several classes of matroids. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 74."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]