[{"citation":{"mla":"Buri, Pascal, et al. <i>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.”</i> Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8402426\">10.5281/ZENODO.8402426</a>.","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, <a href=\"https://doi.org/10.5281/ZENODO.8402426\">10.5281/ZENODO.8402426</a>.","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:<a href=\"https://doi.org/10.5281/ZENODO.8402426\">10.5281/ZENODO.8402426</a>","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. <a href=\"https://doi.org/10.5281/ZENODO.8402426\">https://doi.org/10.5281/ZENODO.8402426</a>.","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. <a href=\"https://doi.org/10.5281/ZENODO.8402426\">https://doi.org/10.5281/ZENODO.8402426</a>","ieee":"P. Buri <i>et al.</i>, “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.","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)."},"month":"10","author":[{"last_name":"Buri","first_name":"Pascal","full_name":"Buri, Pascal"},{"full_name":"Fatichi, Simone","first_name":"Simone","last_name":"Fatichi"},{"full_name":"Shaw, Thomas","first_name":"Thomas","last_name":"Shaw","id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","orcid":"0000-0001-7640-6152"},{"full_name":"Miles, Evan ","first_name":"Evan ","last_name":"Miles"},{"full_name":"McCarthy, Michael","first_name":"Michael","last_name":"McCarthy","id":"22a2674a-61ce-11ee-94b5-d18813baf16f"},{"id":"001b0422-8d15-11ed-bc51-cab6c037a228","last_name":"Fyffe","first_name":"Catriona Louise","full_name":"Fyffe, Catriona Louise"},{"full_name":"Fugger, Stefan","first_name":"Stefan","last_name":"Fugger"},{"last_name":"Ren","full_name":"Ren, Shaoting","first_name":"Shaoting"},{"last_name":"Kneib","first_name":"Marin","full_name":"Kneib, Marin"},{"last_name":"Jouberton","full_name":"Jouberton, Achille","first_name":"Achille"},{"last_name":"Steiner","first_name":"Jakob","full_name":"Steiner, Jakob"},{"last_name":"Fujita","full_name":"Fujita, Koji","first_name":"Koji"},{"orcid":"0000-0002-5554-8087","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca","first_name":"Francesca"}],"date_updated":"2025-09-09T13:15:39Z","status":"public","publisher":"Zenodo","license":"https://creativecommons.org/publicdomain/zero/1.0/","main_file_link":[{"url":"https://10.5281/ZENODO.8402426","open_access":"1"}],"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"}],"date_published":"2023-10-03T00:00:00Z","year":"2023","has_accepted_license":"1","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\"","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"14487"}]},"doi":"10.5281/ZENODO.8402426","department":[{"_id":"FrPe"}],"type":"research_data_reference","fulldoi":"https://doi.org/10.5281/ZENODO.8402426","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"article_processing_charge":"No","tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"date_created":"2023-11-07T08:01:39Z","day":"03","ddc":["550"],"_id":"14494","oa_version":"Published Version"},{"_id":"14499","scopus_import":"1","oa_version":"Published Version","corr_author":"1","language":[{"iso":"eng"}],"day":"24","date_created":"2023-11-07T09:02:48Z","ddc":["510"],"oa":1,"publication_status":"published","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"project":[{"grant_number":"101076777","name":"Randomness and structure in combinatorics","_id":"bd95085b-d553-11ed-ba76-e55d3349be45"}],"volume":11,"fulldoi":"https://doi.org/10.1017/fmp.2023.17","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Analysis"],"doi":"10.1017/fmp.2023.17","file_date_updated":"2023-11-07T09:16:23Z","department":[{"_id":"MaKw"}],"article_type":"original","date_published":"2023-08-24T00:00:00Z","publication_identifier":{"issn":["2050-5086"]},"external_id":{"arxiv":["2208.02874"],"isi":["001123866200001"]},"status":"public","publisher":"Cambridge University Press","quality_controlled":"1","citation":{"ieee":"M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” <i>Forum of Mathematics, Pi</i>, vol. 11. Cambridge University Press, 2023.","short":"M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (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.” <i>Forum of Mathematics, Pi</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/fmp.2023.17\">https://doi.org/10.1017/fmp.2023.17</a>.","apa":"Kwan, M. A., Sah, A., Sauermann, L., &#38; Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics, Pi</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fmp.2023.17\">https://doi.org/10.1017/fmp.2023.17</a>","ama":"Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics, Pi</i>. 2023;11. doi:<a href=\"https://doi.org/10.1017/fmp.2023.17\">10.1017/fmp.2023.17</a>","mla":"Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” <i>Forum of Mathematics, Pi</i>, vol. 11, e21, Cambridge University Press, 2023, doi:<a href=\"https://doi.org/10.1017/fmp.2023.17\">10.1017/fmp.2023.17</a>.","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."},"isi":1,"author":[{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan"},{"last_name":"Sah","full_name":"Sah, Ashwin","first_name":"Ashwin"},{"last_name":"Sauermann","full_name":"Sauermann, Lisa","first_name":"Lisa"},{"first_name":"Mehtaab","full_name":"Sawhney, Mehtaab","last_name":"Sawhney"}],"article_number":"e21","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.","article_processing_charge":"Yes","type":"journal_article","has_accepted_license":"1","intvolume":"        11","title":"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture","abstract":[{"lang":"eng","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."}],"year":"2023","publication":"Forum of Mathematics, Pi","file":[{"creator":"dernst","success":1,"relation":"main_file","date_created":"2023-11-07T09:16:23Z","file_size":1218719,"content_type":"application/pdf","checksum":"54b824098d59073cc87a308d458b0a3e","access_level":"open_access","file_id":"14500","file_name":"2023_ForumMathematics_Kwan.pdf","date_updated":"2023-11-07T09:16:23Z"}],"month":"08","date_updated":"2025-09-09T13:16:15Z","arxiv":1},{"related_material":{"record":[{"id":"13238","relation":"part_of_dissertation","status":"deleted"},{"id":"9969","status":"public","relation":"part_of_dissertation"},{"id":"14490","status":"public","relation":"part_of_dissertation"}]},"title":"Advances in efficiency and privacy in payment channel network analysis","has_accepted_license":"1","year":"2023","abstract":[{"lang":"eng","text":"Payment channel networks are a promising approach to improve the scalability bottleneck\r\nof cryptocurrencies. Two design principles behind payment channel networks are\r\nefficiency and privacy. Payment channel networks improve efficiency by allowing users\r\nto transact in a peer-to-peer fashion along multi-hop routes in the network, avoiding\r\nthe lengthy process of consensus on the blockchain. Transacting over payment channel\r\nnetworks also improves privacy as these transactions are not broadcast to the blockchain.\r\nDespite the influx of recent protocols built on top of payment channel networks and\r\ntheir analysis, a common shortcoming of many of these protocols is that they typically\r\nfocus only on either improving efficiency or privacy, but not both. Another limitation\r\non the efficiency front is that the models used to model actions, costs and utilities of\r\nusers are limited or come with unrealistic assumptions.\r\nThis thesis aims to address some of the shortcomings of recent protocols and algorithms\r\non payment channel networks, particularly in their privacy and efficiency aspects. We\r\nfirst present a payment route discovery protocol based on hub labelling and private\r\ninformation retrieval that hides the route query and is also efficient. We then present\r\na rebalancing protocol that formulates the rebalancing problem as a linear program\r\nand solves the linear program using multiparty computation so as to hide the channel\r\nbalances. The rebalancing solution as output by our protocol is also globally optimal.\r\nWe go on to develop more realistic models of the action space, costs, and utilities of\r\nboth existing and new users that want to join the network. In each of these settings,\r\nwe also develop algorithms to optimise the utility of these users with good guarantees\r\non the approximation and competitive ratios."}],"alternative_title":["ISTA Thesis"],"date_updated":"2026-04-07T13:29:45Z","file":[{"relation":"source_file","creator":"cchlebak","content_type":"application/x-zip-compressed","checksum":"521c72818d720a52b377207b2ee87b6a","file_size":3037720,"date_created":"2023-11-23T10:29:55Z","file_id":"14598","access_level":"closed","date_updated":"2023-11-23T10:29:55Z","file_name":"thesis_yeo.zip"},{"date_created":"2023-11-23T10:30:08Z","file_size":2717256,"content_type":"application/pdf","checksum":"0ed5d16899687aecf13d843c9878c9f2","creator":"cchlebak","relation":"main_file","success":1,"file_name":"thesis_yeo.pdf","date_updated":"2023-11-23T10:30:08Z","access_level":"open_access","file_id":"14599"}],"month":"11","supervisor":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"article_processing_charge":"No","type":"dissertation","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"doi":"10.15479/14506","file_date_updated":"2023-11-23T10:30:08Z","publication_identifier":{"issn":["2663-337X"]},"date_published":"2023-11-10T00:00:00Z","publisher":"Institute of Science and Technology Austria","status":"public","page":"162","OA_place":"publisher","author":[{"orcid":"0009-0001-3676-4809","last_name":"Yeo","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X","first_name":"Michelle X"}],"citation":{"mla":"Yeo, Michelle X. <i>Advances in Efficiency and Privacy in Payment Channel Network Analysis</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/14506\">10.15479/14506</a>.","ista":"Yeo MX. 2023. Advances in efficiency and privacy in payment channel network analysis. Institute of Science and Technology Austria.","ama":"Yeo MX. Advances in efficiency and privacy in payment channel network analysis. 2023. doi:<a href=\"https://doi.org/10.15479/14506\">10.15479/14506</a>","chicago":"Yeo, Michelle X. “Advances in Efficiency and Privacy in Payment Channel Network Analysis.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/14506\">https://doi.org/10.15479/14506</a>.","apa":"Yeo, M. X. (2023). <i>Advances in efficiency and privacy in payment channel network analysis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/14506\">https://doi.org/10.15479/14506</a>","ieee":"M. X. Yeo, “Advances in efficiency and privacy in payment channel network analysis,” Institute of Science and Technology Austria, 2023.","short":"M.X. Yeo, Advances in Efficiency and Privacy in Payment Channel Network Analysis, Institute of Science and Technology Austria, 2023."},"degree_awarded":"PhD","oa_version":"Published Version","corr_author":"1","language":[{"iso":"eng"}],"_id":"14506","ddc":["000"],"ec_funded":1,"date_created":"2023-11-10T08:10:43Z","day":"10","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"publication_status":"published","oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","fulldoi":"https://doi.org/10.15479/14506"},{"oa":1,"publication_status":"published","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"volume":1042,"fulldoi":"https://doi.org/10.1016/j.physrep.2023.10.004","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"14513","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","day":"29","date_created":"2023-11-12T23:00:54Z","ec_funded":1,"status":"public","publisher":"Elsevier","quality_controlled":"1","isi":1,"citation":{"apa":"Mistakidis, S. I., Volosniev, A., Barfknecht, R. E., Fogarty, T., Busch, T., Foerster, A., … Zinner, N. T. (2023). Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. <i>Physics Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">https://doi.org/10.1016/j.physrep.2023.10.004</a>","chicago":"Mistakidis, S. I., Artem Volosniev, R. E. Barfknecht, T. Fogarty, Th Busch, A. Foerster, P. Schmelcher, and N. T. Zinner. “Few-Body Bose Gases in Low Dimensions - A Laboratory for Quantum Dynamics.” <i>Physics Reports</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">https://doi.org/10.1016/j.physrep.2023.10.004</a>.","short":"S.I. Mistakidis, A. Volosniev, R.E. Barfknecht, T. Fogarty, T. Busch, A. Foerster, P. Schmelcher, N.T. Zinner, Physics Reports 1042 (2023) 1–108.","ieee":"S. I. Mistakidis <i>et al.</i>, “Few-body Bose gases in low dimensions - A laboratory for quantum dynamics,” <i>Physics Reports</i>, vol. 1042. Elsevier, pp. 1–108, 2023.","ista":"Mistakidis SI, Volosniev A, Barfknecht RE, Fogarty T, Busch T, Foerster A, Schmelcher P, Zinner NT. 2023. Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. Physics Reports. 1042, 1–108.","mla":"Mistakidis, S. I., et al. “Few-Body Bose Gases in Low Dimensions - A Laboratory for Quantum Dynamics.” <i>Physics Reports</i>, vol. 1042, Elsevier, 2023, pp. 1–108, doi:<a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">10.1016/j.physrep.2023.10.004</a>.","ama":"Mistakidis SI, Volosniev A, Barfknecht RE, et al. Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. <i>Physics Reports</i>. 2023;1042:1-108. doi:<a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">10.1016/j.physrep.2023.10.004</a>"},"page":"1-108","author":[{"last_name":"Mistakidis","full_name":"Mistakidis, S. I.","first_name":"S. I."},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev","orcid":"0000-0003-0393-5525","first_name":"Artem","full_name":"Volosniev, Artem"},{"full_name":"Barfknecht, R. E.","first_name":"R. E.","last_name":"Barfknecht"},{"full_name":"Fogarty, T.","first_name":"T.","last_name":"Fogarty"},{"last_name":"Busch","full_name":"Busch, Th","first_name":"Th"},{"first_name":"A.","full_name":"Foerster, A.","last_name":"Foerster"},{"first_name":"P.","full_name":"Schmelcher, P.","last_name":"Schmelcher"},{"full_name":"Zinner, N. T.","first_name":"N. T.","last_name":"Zinner"}],"doi":"10.1016/j.physrep.2023.10.004","department":[{"_id":"MiLe"}],"article_type":"original","date_published":"2023-11-29T00:00:00Z","external_id":{"arxiv":["2202.11071"],"isi":["001109871200001"]},"publication_identifier":{"issn":["0370-1573"]},"article_processing_charge":"No","type":"journal_article","acknowledgement":"This review could not have been written without the many fruitful discussions and great collaborations with colleagues throughout the years, there are too many to mention. Here we acknowledge conversations regarding the context of the review with Joachim Brand, Fabian Brauneis, Adolfo del Campo, Alberto Cappellaro, Panagiotis Giannakeas, Tommaso Macrí, Oleksandr Marchukov, Lukas Rammelmüller and Manuel Valiente. S. I. M. acknowledges support from the NSF through a grant for ITAMP at Harvard University. T.F. acknowledges support from JSPS KAKENHI Grant Number JP23K03290 and T.F. and Th.B. acknowledge support from the Okinawa Institute for Science and Technology Graduate University, and JST Grant Number JPMJPF2221. A.F. and R. E. B. acknowledge support from CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico) - Edital Universal 406563/2021-7. A. G. V. acknowledges support by European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. P. S. is supported by the Cluster of Excellence ‘Advanced Imaging of Matter’ of the Deutsche Forschungsgemeinschaft (DFG) - EXC2056 - project ID 390715994. N. T. Z. is partially supported by the Independent Research Fund Denmark .","publication":"Physics Reports","month":"11","arxiv":1,"date_updated":"2025-09-09T13:16:58Z","intvolume":"      1042","title":"Few-body Bose gases in low dimensions - A laboratory for quantum dynamics","abstract":[{"text":"Cold atomic gases have become a paradigmatic system for exploring fundamental physics, which at the same time allows for applications in quantum technologies. The accelerating developments in the field have led to a highly advanced set of engineering techniques that, for example, can tune interactions, shape the external geometry, select among a large set of atomic species with different properties, or control the number of atoms. In particular, it is possible to operate in lower dimensions and drive atomic systems into the strongly correlated regime. In this review, we discuss recent advances in few-body cold atom systems confined in low dimensions from a theoretical viewpoint. We mainly focus on bosonic systems in one dimension and provide an introduction to the static properties before we review the state-of-the-art research into quantum dynamical processes stimulated by the presence of correlations. Besides discussing the fundamental physical phenomena arising in these systems, we also provide an overview of the calculational and numerical tools and methods that are commonly used, thus delivering a balanced and comprehensive overview of the field. We conclude by giving an outlook on possible future directions that are interesting to explore in these correlated systems.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2202.11071","open_access":"1"}],"year":"2023"},{"abstract":[{"text":"Most natural and engineered information-processing systems transmit information via signals that vary in time. Computing the information transmission rate or the information encoded in the temporal characteristics of these signals requires the mutual information between the input and output signals as a function of time, i.e., between the input and output trajectories. Yet, this is notoriously difficult because of the high-dimensional nature of the trajectory space, and all existing techniques require approximations. We present an exact Monte Carlo technique called path weight sampling (PWS) that, for the first time, makes it possible to compute the mutual information between input and output trajectories for any stochastic system that is described by a master equation. The principal idea is to use the master equation to evaluate the exact conditional probability of an individual output trajectory for a given input trajectory and average this via Monte Carlo sampling in trajectory space to obtain the mutual information. We present three variants of PWS, which all generate the trajectories using the standard stochastic simulation algorithm. While direct PWS is a brute-force method, Rosenbluth-Rosenbluth PWS exploits the analogy between signal trajectory sampling and polymer sampling, and thermodynamic integration PWS is based on a reversible work calculation in trajectory space. PWS also makes it possible to compute the mutual information between input and output trajectories for systems with hidden internal states as well as systems with feedback from output to input. Applying PWS to the bacterial chemotaxis system, consisting of 182 coupled chemical reactions, demonstrates not only that the scheme is highly efficient but also that the number of receptor clusters is much smaller than hitherto believed, while their size is much larger.","lang":"eng"}],"year":"2023","intvolume":"        13","title":"Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories","has_accepted_license":"1","publication":"Physical Review X","date_updated":"2025-09-09T13:18:24Z","arxiv":1,"file":[{"content_type":"application/pdf","checksum":"32574aeebcca7347a4152c611b66b3d5","date_created":"2023-11-13T09:00:19Z","file_size":1595223,"relation":"main_file","success":1,"creator":"dernst","file_name":"2023_PhysReviewX_Reinhardt.pdf","date_updated":"2023-11-13T09:00:19Z","access_level":"open_access","file_id":"14522"}],"month":"10","acknowledgement":"We thank Bela Mulder, Tom Shimizu, Fotios Avgidis, Peter Bolhuis, and Daan Frenkel for useful discussions and a careful reading of the manuscript, and we thank Age Tjalma for support with obtaining the Gaussian approximation of the chemotaxis system. This work is part of the Dutch Research Council (NWO) and was performed at the research institute AMOLF. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 885065) and was\r\nfinancially supported by NWO through the “Building a Synthetic Cell (BaSyC)” Gravitation Grant (024.003.019).","issue":"4","article_number":"041017","type":"journal_article","article_processing_charge":"Yes","article_type":"original","publication_identifier":{"eissn":["2160-3308"]},"external_id":{"arxiv":["2203.03461"],"isi":["001122894200001"]},"date_published":"2023-10-26T00:00:00Z","department":[{"_id":"GaTk"}],"file_date_updated":"2023-11-13T09:00:19Z","doi":"10.1103/PhysRevX.13.041017","citation":{"apa":"Reinhardt, M., Tkačik, G., &#38; Ten Wolde, P. R. (2023). Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">https://doi.org/10.1103/PhysRevX.13.041017</a>","chicago":"Reinhardt, Manuel, Gašper Tkačik, and Pieter Rein Ten Wolde. “Path Weight Sampling: Exact Monte Carlo Computation of the Mutual Information between Stochastic Trajectories.” <i>Physical Review X</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">https://doi.org/10.1103/PhysRevX.13.041017</a>.","short":"M. Reinhardt, G. Tkačik, P.R. Ten Wolde, Physical Review X 13 (2023).","ieee":"M. Reinhardt, G. Tkačik, and P. R. Ten Wolde, “Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories,” <i>Physical Review X</i>, vol. 13, no. 4. American Physical Society, 2023.","ista":"Reinhardt M, Tkačik G, Ten Wolde PR. 2023. Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. Physical Review X. 13(4), 041017.","mla":"Reinhardt, Manuel, et al. “Path Weight Sampling: Exact Monte Carlo Computation of the Mutual Information between Stochastic Trajectories.” <i>Physical Review X</i>, vol. 13, no. 4, 041017, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">10.1103/PhysRevX.13.041017</a>.","ama":"Reinhardt M, Tkačik G, Ten Wolde PR. Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. <i>Physical Review X</i>. 2023;13(4). doi:<a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">10.1103/PhysRevX.13.041017</a>"},"isi":1,"quality_controlled":"1","author":[{"first_name":"Manuel","full_name":"Reinhardt, Manuel","last_name":"Reinhardt"},{"full_name":"Tkačik, Gašper","first_name":"Gašper","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"},{"full_name":"Ten Wolde, Pieter Rein","first_name":"Pieter Rein","last_name":"Ten Wolde"}],"status":"public","publisher":"American Physical Society","date_created":"2023-11-12T23:00:55Z","day":"26","ddc":["530"],"_id":"14515","oa_version":"Published Version","language":[{"iso":"eng"}],"scopus_import":"1","fulldoi":"https://doi.org/10.1103/PhysRevX.13.041017","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":13},{"author":[{"full_name":"Beaver, Donald","first_name":"Donald","last_name":"Beaver"},{"full_name":"Kelkar, Mahimna","first_name":"Mahimna","last_name":"Kelkar"},{"full_name":"Lewi, Kevin","first_name":"Kevin","last_name":"Lewi"},{"full_name":"Nikolaenko, Valeria","first_name":"Valeria","last_name":"Nikolaenko"},{"last_name":"Sonnino","full_name":"Sonnino, Alberto","first_name":"Alberto"},{"first_name":"Konstantinos","full_name":"Chalkias, Konstantinos","last_name":"Chalkias"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Naurois","first_name":"Ladi De","full_name":"Naurois, Ladi De"},{"last_name":"Roy","first_name":"Arnab","full_name":"Roy, Arnab"}],"citation":{"ieee":"D. Beaver <i>et al.</i>, “STROBE: Streaming Threshold Random Beacons,” in <i>5th Conference on Advances in Financial Technologies</i>, Princeton, NJ, United States, 2023, vol. 282.","short":"D. Beaver, M. Kelkar, K. Lewi, V. Nikolaenko, A. Sonnino, K. Chalkias, E. Kokoris Kogias, L.D. Naurois, A. Roy, in:, 5th Conference on Advances in Financial Technologies, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","chicago":"Beaver, Donald, Mahimna Kelkar, Kevin Lewi, Valeria Nikolaenko, Alberto Sonnino, Konstantinos Chalkias, Eleftherios Kokoris Kogias, Ladi De Naurois, and Arnab Roy. “STROBE: Streaming Threshold Random Beacons.” In <i>5th Conference on Advances in Financial Technologies</i>, Vol. 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">https://doi.org/10.4230/LIPIcs.AFT.2023.7</a>.","apa":"Beaver, D., Kelkar, M., Lewi, K., Nikolaenko, V., Sonnino, A., Chalkias, K., … Roy, A. (2023). STROBE: Streaming Threshold Random Beacons. In <i>5th Conference on Advances in Financial Technologies</i> (Vol. 282). Princeton, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">https://doi.org/10.4230/LIPIcs.AFT.2023.7</a>","ama":"Beaver D, Kelkar M, Lewi K, et al. STROBE: Streaming Threshold Random Beacons. In: <i>5th Conference on Advances in Financial Technologies</i>. Vol 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">10.4230/LIPIcs.AFT.2023.7</a>","mla":"Beaver, Donald, et al. “STROBE: Streaming Threshold Random Beacons.” <i>5th Conference on Advances in Financial Technologies</i>, vol. 282, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">10.4230/LIPIcs.AFT.2023.7</a>.","ista":"Beaver D, Kelkar M, Lewi K, Nikolaenko V, Sonnino A, Chalkias K, Kokoris Kogias E, Naurois LD, Roy A. 2023. STROBE: Streaming Threshold Random Beacons. 5th Conference on Advances in Financial Technologies. AFT: Conference on Advances in Financial Technologies, LIPIcs, vol. 282, 7."},"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","publication_identifier":{"isbn":["9783959773034"],"issn":["1868-8969"]},"date_published":"2023-10-01T00:00:00Z","department":[{"_id":"ElKo"}],"file_date_updated":"2023-11-13T08:44:34Z","doi":"10.4230/LIPIcs.AFT.2023.7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.4230/LIPIcs.AFT.2023.7","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":282,"conference":{"location":"Princeton, NJ, United States","end_date":"2023-10-25","name":"AFT: Conference on Advances in Financial Technologies","start_date":"2023-10-23"},"publication_status":"published","oa":1,"ddc":["000"],"date_created":"2023-11-12T23:00:55Z","day":"01","oa_version":"Published Version","language":[{"iso":"eng"}],"corr_author":"1","scopus_import":"1","_id":"14516","alternative_title":["LIPIcs"],"date_updated":"2024-10-09T21:07:17Z","file":[{"content_type":"application/pdf","checksum":"c1f98831cb5149d6c030c41999e6e960","date_created":"2023-11-13T08:44:34Z","file_size":793495,"success":1,"relation":"main_file","creator":"dernst","file_name":"2023_LIPIcs_Beaver.pdf","date_updated":"2023-11-13T08:44:34Z","access_level":"open_access","file_id":"14521"}],"month":"10","publication":"5th Conference on Advances in Financial Technologies","year":"2023","main_file_link":[{"url":"https://eprint.iacr.org/2021/1643","open_access":"1"}],"abstract":[{"lang":"eng","text":"We revisit decentralized random beacons with a focus on practical distributed applications. Decentralized random beacons (Beaver and So, Eurocrypt'93) provide the functionality for n parties to generate an unpredictable sequence of bits in a way that cannot be biased, which is useful for any decentralized protocol requiring trusted randomness. Existing beacon constructions are highly inefficient in practical settings where protocol parties need to rejoin after crashes or disconnections, and more significantly where smart contracts may rely on arbitrary index points in high-volume streams. For this, we introduce a new notion of history-generating decentralized random beacons (HGDRBs). Roughly, the history-generation property of HGDRBs allows for previous beacon outputs to be efficiently generated knowing only the current value and the public key. At application layers, history-generation supports registering a sparser set of on-chain values if desired, so that apps like lotteries can utilize on-chain values without incurring high-frequency costs, enjoying all the benefits of DRBs implemented off-chain or with decoupled, special-purpose chains. Unlike rollups, HG is tailored specifically to recovering and verifying pseudorandom bit sequences and thus enjoys unique optimizations investigated in this work. We introduce STROBE: an efficient HGDRB construction which generalizes the original squaring-based RSA approach of Beaver and So. STROBE enjoys several useful properties that make it suited for practical applications that use beacons: 1) history-generating: it can regenerate and verify high-throughput beacon streams, supporting sparse (thus cost-effective) ledger entries; 2) concisely self-verifying: NIZK-free, with state and validation employing a single ring element; 3) eco-friendly: stake-based rather than work based; 4) unbounded: refresh-free, addressing limitations of Beaver and So; 5) delay-free: results are immediately available. 6) storage-efficient: the last beacon suffices to derive all past outputs, thus O(1) storage requirements for nodes serving the whole history."}],"intvolume":"       282","title":"STROBE: Streaming Threshold Random Beacons","has_accepted_license":"1","type":"conference","article_processing_charge":"Yes","acknowledgement":"Work done when all the authors were at Novi Research, Meta.","article_number":"7"},{"issue":"4","acknowledgement":"This work was supported by the Austrian Science Fund (FWF) through BeyondC (F7105), the European Research Council under Grant Agreement No. 758053 (ERC StG QUNNECT) and a NOMIS foundation research grant. M.Z. was the recipient of a SAIA scholarship, E.R. of\r\na DOC fellowship of the Austrian Academy of Sciences, and M.P. of a Pöttinger scholarship at IST Austria. S.B. acknowledges support from Marie Skłodowska Curie Program No. 707438 (MSC-IF SUPEREOM). J.M.F. acknowledges support from the Horizon Europe Program HORIZON-CL4-2022-QUANTUM-01-SGA via Project No. 101113946 OpenSuperQPlus100 and the ISTA Nanofabrication Facility.","article_number":"044054","type":"journal_article","article_processing_charge":"No","year":"2023","main_file_link":[{"url":"https://arxiv.org/abs/2206.14104","open_access":"1"}],"abstract":[{"text":"State-of-the-art transmon qubits rely on large capacitors, which systematically improve their coherence due to reduced surface-loss participation. However, this approach increases both the footprint and the parasitic cross-coupling and is ultimately limited by radiation losses—a potential roadblock for scaling up quantum processors to millions of qubits. In this work we present transmon qubits with sizes as low as 36 × 39 µm2 with  100-nm-wide vacuum-gap capacitors that are micromachined from commercial silicon-on-insulator wafers and shadow evaporated with aluminum. We achieve a vacuum participation ratio up to 99.6% in an in-plane design that is compatible with standard coplanar circuits. Qubit relaxationtime measurements for small gaps with high zero-point electric field variance of up to 22 V/m reveal a double exponential decay indicating comparably strong qubit interaction with long-lived two-level systems. The exceptionally high selectivity of up to 20 dB to the superconductor-vacuum interface allows us to precisely back out the sub-single-photon dielectric loss tangent of aluminum oxide previously exposed to ambient conditions. In terms of future scaling potential, we achieve a ratio of qubit quality factor to a footprint area equal to 20 µm−2, which is comparable with the highest T1 devices relying on larger geometries, a value that could improve substantially for lower surface-loss superconductors. ","lang":"eng"}],"related_material":{"record":[{"id":"14520","status":"public","relation":"research_data"}]},"intvolume":"        20","title":"Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses","month":"10","date_updated":"2026-06-03T07:16:02Z","arxiv":1,"publication":"Physical Review Applied","ec_funded":1,"acknowledged_ssus":[{"_id":"NanoFab"}],"date_created":"2023-11-12T23:00:55Z","day":"20","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","corr_author":"1","_id":"14517","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1103/PhysRevApplied.20.044054","volume":20,"project":[{"_id":"26336814-B435-11E9-9278-68D0E5697425","name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","grant_number":"758053"},{"name":"Protected states of quantum matter","_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2"},{"name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics","_id":"258047B6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"707438"},{"grant_number":"101080139","_id":"bdb7cfc1-d553-11ed-ba76-d2eaab167738","name":"Open Superconducting Quantum Computers (OpenSuperQPlus)"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","grant_number":"F07105"}],"publication_status":"published","oa":1,"date_published":"2023-10-20T00:00:00Z","external_id":{"isi":["001095315600001"],"arxiv":["2206.14104"]},"publication_identifier":{"eissn":["2331-7019"]},"article_type":"original","doi":"10.1103/PhysRevApplied.20.044054","department":[{"_id":"JoFi"}],"author":[{"orcid":"0009-0005-0878-3032","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","last_name":"Zemlicka","first_name":"Martin","full_name":"Zemlicka, Martin"},{"full_name":"Redchenko, Elena","first_name":"Elena","last_name":"Redchenko","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Matilda","full_name":"Peruzzo, Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo","orcid":"0000-0002-3415-4628"},{"orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","last_name":"Hassani","first_name":"Farid","full_name":"Hassani, Farid"},{"first_name":"Andrea","full_name":"Trioni, Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","last_name":"Trioni"},{"first_name":"Shabir","full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","last_name":"Barzanjeh","orcid":"0000-0003-0415-1423"},{"full_name":"Fink, Johannes M","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"}],"quality_controlled":"1","isi":1,"citation":{"ieee":"M. Zemlicka <i>et al.</i>, “Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses,” <i>Physical Review Applied</i>, vol. 20, no. 4. American Physical Society, 2023.","short":"M. Zemlicka, E. Redchenko, M. Peruzzo, F. Hassani, A. Trioni, S. Barzanjeh, J.M. Fink, Physical Review Applied 20 (2023).","chicago":"Zemlicka, Martin, Elena Redchenko, Matilda Peruzzo, Farid Hassani, Andrea Trioni, Shabir Barzanjeh, and Johannes M Fink. “Compact Vacuum-Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” <i>Physical Review Applied</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">https://doi.org/10.1103/PhysRevApplied.20.044054</a>.","apa":"Zemlicka, M., Redchenko, E., Peruzzo, M., Hassani, F., Trioni, A., Barzanjeh, S., &#38; Fink, J. M. (2023). Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">https://doi.org/10.1103/PhysRevApplied.20.044054</a>","ama":"Zemlicka M, Redchenko E, Peruzzo M, et al. Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. <i>Physical Review Applied</i>. 2023;20(4). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">10.1103/PhysRevApplied.20.044054</a>","mla":"Zemlicka, Martin, et al. “Compact Vacuum-Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” <i>Physical Review Applied</i>, vol. 20, no. 4, 044054, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">10.1103/PhysRevApplied.20.044054</a>.","ista":"Zemlicka M, Redchenko E, Peruzzo M, Hassani F, Trioni A, Barzanjeh S, Fink JM. 2023. Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. Physical Review Applied. 20(4), 044054."},"publisher":"American Physical Society","status":"public"},{"fulldoi":"https://doi.org/10.3233/FAIA230264","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","tmp":{"short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"volume":372,"conference":{"location":"Krakow, Poland","end_date":"2023-10-04","name":"ECAI: European Conference on Artificial Intelligence","start_date":"2023-09-30"},"project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"day":"28","date_created":"2023-11-12T23:00:56Z","ec_funded":1,"ddc":["000"],"_id":"14518","oa_version":"Published Version","corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","citation":{"short":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148.","ieee":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in <i>Frontiers in Artificial Intelligence and Applications</i>, Krakow, Poland, 2023, vol. 372, pp. 141–148.","apa":"Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., &#38; Zikelic, D. (2023). Reachability poorman discrete-bidding games. In <i>Frontiers in Artificial Intelligence and Applications</i> (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press. <a href=\"https://doi.org/10.3233/FAIA230264\">https://doi.org/10.3233/FAIA230264</a>","chicago":"Avni, Guy, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, and Dorde Zikelic. “Reachability Poorman Discrete-Bidding Games.” In <i>Frontiers in Artificial Intelligence and Applications</i>, 372:141–48. IOS Press, 2023. <a href=\"https://doi.org/10.3233/FAIA230264\">https://doi.org/10.3233/FAIA230264</a>.","ama":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. Reachability poorman discrete-bidding games. In: <i>Frontiers in Artificial Intelligence and Applications</i>. Vol 372. IOS Press; 2023:141-148. doi:<a href=\"https://doi.org/10.3233/FAIA230264\">10.3233/FAIA230264</a>","ista":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications. ECAI: European Conference on Artificial Intelligence vol. 372, 141–148.","mla":"Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.” <i>Frontiers in Artificial Intelligence and Applications</i>, vol. 372, IOS Press, 2023, pp. 141–48, doi:<a href=\"https://doi.org/10.3233/FAIA230264\">10.3233/FAIA230264</a>."},"quality_controlled":"1","page":"141-148","author":[{"first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","first_name":"Tobias","full_name":"Meggendorfer, Tobias"},{"last_name":"Sadhukhan","full_name":"Sadhukhan, Suman","first_name":"Suman"},{"last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef"},{"first_name":"Dorde","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic"}],"status":"public","publisher":"IOS Press","publication_identifier":{"issn":["0922-6389"],"isbn":["9781643684369"]},"external_id":{"arxiv":["2307.15218"]},"date_published":"2023-09-28T00:00:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"doi":"10.3233/FAIA230264","file_date_updated":"2023-11-13T10:16:10Z","type":"conference","article_processing_charge":"No","acknowledgement":"This research was supported in part by ISF grant no. 1679/21, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie Grant Agreement No. 665385.","publication":"Frontiers in Artificial Intelligence and Applications","arxiv":1,"date_updated":"2025-03-31T16:01:09Z","month":"09","file":[{"file_name":"2023_FAIA_Avni.pdf","date_updated":"2023-11-13T10:16:10Z","access_level":"open_access","file_id":"14529","content_type":"application/pdf","checksum":"1390ca38480fa4cf286b0f1a42e8c12f","date_created":"2023-11-13T10:16:10Z","file_size":501011,"success":1,"relation":"main_file","creator":"dernst"}],"abstract":[{"text":"We consider bidding games, a class of two-player zero-sum graph games. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit bids, and the higher bidder moves the token, where we break bidding ties in favor of Player 1. Player 1 wins the game iff the token visits a designated target vertex. We consider, for the first time, poorman discrete-bidding in which the granularity of the bids is restricted and the higher bid is paid to the bank. Previous work either did not impose granularity restrictions or considered Richman bidding (bids are paid to the opponent). While the latter mechanisms are technically more accessible, the former is more appealing from a practical standpoint. Our study focuses on threshold budgets, which is the necessary and sufficient initial budget required for Player 1 to ensure winning against a given Player 2 budget. We first show existence of thresholds. In DAGs, we show that threshold budgets can be approximated with error bounds by thresholds under continuous-bidding and that they exhibit a periodic behavior. We identify closed-form solutions in special cases. We implement and experiment with an algorithm to find threshold budgets.","lang":"eng"}],"year":"2023","intvolume":"       372","title":"Reachability poorman discrete-bidding games","has_accepted_license":"1"},{"ddc":["530"],"date_created":"2023-11-13T09:12:11Z","day":"08","oa_version":"Published Version","_id":"14523","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data_reference","fulldoi":"https://doi.org/10.5281/ZENODO.8329143","oa":1,"article_processing_charge":"No","year":"2023","date_published":"2023-09-08T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.8329143","open_access":"1"}],"abstract":[{"text":"see Readme file","lang":"eng"}],"department":[{"_id":"ScWa"}],"related_material":{"record":[{"id":"14514","status":"public","relation":"used_in_publication"}]},"doi":"10.5281/ZENODO.8329143","title":"SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: v1.0.1","date_updated":"2025-09-09T13:19:07Z","author":[{"first_name":"Jack","full_name":"Binysh, Jack","last_name":"Binysh"},{"first_name":"Indrajit","full_name":"Chakraborty, Indrajit","last_name":"Chakraborty"},{"first_name":"Mykyta","full_name":"Chubynsky, Mykyta","last_name":"Chubynsky"},{"id":"b6798902-eea0-11ea-9cbc-a8e14286c631","last_name":"Diaz Melian","first_name":"Vicente L","full_name":"Diaz Melian, Vicente L"},{"full_name":"Waitukaitis, Scott R","first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176"},{"last_name":"Sprittles","full_name":"Sprittles, James","first_name":"James"},{"full_name":"Souslov, Anton","first_name":"Anton","last_name":"Souslov"}],"month":"09","citation":{"chicago":"Binysh, Jack, Indrajit Chakraborty, Mykyta Chubynsky, Vicente L Diaz Melian, Scott R Waitukaitis, James Sprittles, and Anton Souslov. “SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: V1.0.1.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8329143\">https://doi.org/10.5281/ZENODO.8329143</a>.","apa":"Binysh, J., Chakraborty, I., Chubynsky, M., Diaz Melian, V. L., Waitukaitis, S. R., Sprittles, J., &#38; Souslov, A. (2023). SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: v1.0.1. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8329143\">https://doi.org/10.5281/ZENODO.8329143</a>","ieee":"J. Binysh <i>et al.</i>, “SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: v1.0.1.” Zenodo, 2023.","short":"J. Binysh, I. Chakraborty, M. Chubynsky, V.L. Diaz Melian, S.R. Waitukaitis, J. Sprittles, A. Souslov, (2023).","mla":"Binysh, Jack, et al. <i>SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: V1.0.1</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8329143\">10.5281/ZENODO.8329143</a>.","ista":"Binysh J, Chakraborty I, Chubynsky M, Diaz Melian VL, Waitukaitis SR, Sprittles J, Souslov A. 2023. SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: v1.0.1, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8329143\">10.5281/ZENODO.8329143</a>.","ama":"Binysh J, Chakraborty I, Chubynsky M, et al. SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: v1.0.1. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8329143\">10.5281/ZENODO.8329143</a>"},"publisher":"Zenodo","status":"public"},{"month":"11","file":[{"file_size":36743942,"date_created":"2023-11-15T09:52:54Z","content_type":"application/pdf","checksum":"52e1d0ab6c1abe59c82dfe8c9ff5f83a","creator":"mriedl","success":1,"relation":"main_file","date_updated":"2023-11-15T09:52:54Z","file_name":"Thesis_Riedl_2023_corr.pdf","file_id":"14536","access_level":"open_access"}],"date_updated":"2026-04-07T13:29:13Z","alternative_title":["ISTA Thesis"],"abstract":[{"text":"Most motions of many-body systems at any scale in nature with sufficient degrees of freedom tend to be chaotic; reaching from the orbital motion of planets, the air currents in our atmosphere, down to the water flowing through our pipelines or the movement of a population of bacteria. To the observer it is therefore intriguing when a moving collective exhibits order. Collective motion of flocks of birds, schools of fish or swarms of self-propelled particles or robots have been studied extensively over the past decades but the mechanisms involved in the transition from chaos to order remain unclear. Here, the interactions, that in most systems give rise to chaos, sustain order.  In this thesis we investigate mechanisms that preserve, destabilize or lead to the ordered state. We show that endothelial cells migrating in circular confinements transition to a collective rotating state and concomitantly synchronize the frequencies of nucleating actin waves within individual cells. Consequently, the frequency dependent cell migration speed uniformizes across the population. Complementary to the WAVE dependent nucleation of traveling actin waves, we show that in leukocytes the actin polymerization depending on WASp generates pushing forces locally at stationary patches. Next, in pipe flows, we study methods to disrupt the self--sustaining cycle of turbulence and therefore relaminarize the flow. While we find in pulsating flow conditions that turbulence emerges through a helical instability during the decelerating phase. Finally, we show quantitatively in brain slices of mice that wild-type control neurons can compensate the migratory deficits of a genetically modified neuronal sub--population in the developing cortex.  ","lang":"eng"}],"year":"2023","has_accepted_license":"1","title":"Synchronization in collectively moving active matter","related_material":{"record":[{"id":"461","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10791"},{"relation":"part_of_dissertation","status":"public","id":"7932"},{"relation":"part_of_dissertation","status":"public","id":"10703"},{"id":"12726","relation":"old_edition","status":"public"}]},"type":"dissertation","article_processing_charge":"No","supervisor":[{"full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754"}],"degree_awarded":"PhD","citation":{"ama":"Riedl M. Synchronization in collectively moving active matter. 2023. doi:<a href=\"https://doi.org/10.15479/14530\">10.15479/14530</a>","mla":"Riedl, Michael. <i>Synchronization in Collectively Moving Active Matter</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/14530\">10.15479/14530</a>.","ista":"Riedl M. 2023. Synchronization in collectively moving active matter. Institute of Science and Technology Austria.","ieee":"M. Riedl, “Synchronization in collectively moving active matter,” Institute of Science and Technology Austria, 2023.","short":"M. Riedl, Synchronization in Collectively Moving Active Matter, Institute of Science and Technology Austria, 2023.","chicago":"Riedl, Michael. “Synchronization in Collectively Moving Active Matter.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/14530\">https://doi.org/10.15479/14530</a>.","apa":"Riedl, M. (2023). <i>Synchronization in collectively moving active matter</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/14530\">https://doi.org/10.15479/14530</a>"},"page":"260","OA_place":"publisher","author":[{"full_name":"Riedl, Michael","first_name":"Michael","orcid":"0000-0003-4844-6311","last_name":"Riedl","id":"3BE60946-F248-11E8-B48F-1D18A9856A87"}],"status":"public","publisher":"Institute of Science and Technology Austria","date_published":"2023-11-16T00:00:00Z","publication_identifier":{"issn":["2663-337X"]},"keyword":["Synchronization","Collective Movement","Active Matter","Cell Migration","Active Colloids"],"file_date_updated":"2023-11-15T09:52:54Z","doi":"10.15479/14530","department":[{"_id":"GradSch"},{"_id":"MiSi"}],"fulldoi":"https://doi.org/10.15479/14530","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","oa":1,"day":"16","date_created":"2023-11-15T09:59:03Z","ddc":["530","570"],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"Bio"}],"_id":"14530","language":[{"iso":"eng"}],"corr_author":"1","oa_version":"Updated Version"},{"oa":1,"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.15479/14539","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"14539","corr_author":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","day":"15","date_created":"2023-11-15T13:39:10Z","ddc":["000"],"ec_funded":1,"status":"public","publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","citation":{"apa":"Zikelic, D. (2023). <i>Automated verification and control of infinite state stochastic systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/14539\">https://doi.org/10.15479/14539</a>","chicago":"Zikelic, Dorde. “Automated Verification and Control of Infinite State Stochastic Systems.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/14539\">https://doi.org/10.15479/14539</a>.","short":"D. Zikelic, Automated Verification and Control of Infinite State Stochastic Systems, Institute of Science and Technology Austria, 2023.","ieee":"D. Zikelic, “Automated verification and control of infinite state stochastic systems,” Institute of Science and Technology Austria, 2023.","ista":"Zikelic D. 2023. Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria.","mla":"Zikelic, Dorde. <i>Automated Verification and Control of Infinite State Stochastic Systems</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/14539\">10.15479/14539</a>.","ama":"Zikelic D. Automated verification and control of infinite state stochastic systems. 2023. doi:<a href=\"https://doi.org/10.15479/14539\">10.15479/14539</a>"},"page":"256","author":[{"orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde"}],"OA_place":"publisher","doi":"10.15479/14539","file_date_updated":"2023-11-15T13:44:24Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"date_published":"2023-11-15T00:00:00Z","publication_identifier":{"isbn":["978-3-99078-036-7"],"issn":["2663-337X"]},"article_processing_charge":"No","type":"dissertation","supervisor":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"month":"11","file":[{"access_level":"open_access","file_id":"14540","file_name":"main.pdf","date_updated":"2023-11-15T13:43:28Z","creator":"cchlebak","success":1,"relation":"main_file","date_created":"2023-11-15T13:43:28Z","file_size":2116426,"checksum":"f23e002b0059ca78e1fbb864da52dd7e","content_type":"application/pdf"},{"date_created":"2023-11-15T13:44:24Z","file_size":35884057,"checksum":"80ca37618a3c7b59866875f8be9b15ed","content_type":"application/x-zip-compressed","creator":"cchlebak","relation":"source_file","file_name":"thesis_source.zip","date_updated":"2023-11-15T13:44:24Z","access_level":"closed","file_id":"14541"}],"date_updated":"2026-04-07T13:27:56Z","alternative_title":["ISTA Thesis"],"title":"Automated verification and control of infinite state stochastic systems","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10414"},{"id":"12000","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9644"},{"status":"public","relation":"part_of_dissertation","id":"12511"},{"status":"public","relation":"part_of_dissertation","id":"14600"},{"relation":"part_of_dissertation","status":"public","id":"14601"},{"id":"1194","relation":"part_of_dissertation","status":"public"}]},"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":[{"text":"Stochastic systems provide a formal framework for modelling and quantifying uncertainty in systems and have been widely adopted in many application domains. Formal\r\nverification and control of finite state stochastic systems, a subfield of formal methods\r\nalso known as probabilistic model checking, is well studied. In contrast, formal verification and control of infinite state stochastic systems have received comparatively\r\nless attention. However, infinite state stochastic systems commonly arise in practice.\r\nFor instance, probabilistic models that contain continuous probability distributions such\r\nas normal or uniform, or stochastic dynamical systems which are a classical model for\r\ncontrol under uncertainty, both give rise to infinite state systems.\r\nThe goal of this thesis is to contribute to laying theoretical and algorithmic foundations\r\nof fully automated formal verification and control of infinite state stochastic systems,\r\nwith a particular focus on systems that may be executed over a long or infinite time.\r\nWe consider formal verification of infinite state stochastic systems in the setting of\r\nstatic analysis of probabilistic programs and formal control in the setting of controller\r\nsynthesis in stochastic dynamical systems. For both problems, we present some of the\r\nfirst fully automated methods for probabilistic (a.k.a. quantitative) reachability and\r\nsafety analysis applicable to infinite time horizon systems. We also advance the state\r\nof the art of probability 1 (a.k.a. qualitative) reachability analysis for both problems.\r\nFinally, for formal controller synthesis in stochastic dynamical systems, we present a\r\nnovel framework for learning neural network control policies in stochastic dynamical\r\nsystems with formal guarantees on correctness with respect to quantitative reachability,\r\nsafety or reach-avoid specifications.\r\n","lang":"eng"}],"year":"2023"},{"_id":"14551","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","corr_author":"1","date_created":"2023-11-19T23:00:54Z","day":"15","ec_funded":1,"ddc":["570"],"publication_status":"published","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"project":[{"_id":"62935a00-2b32-11ec-9570-eff30fa39068","name":"Quantitative analysis of DNA methylation maintenance with chromatin","call_identifier":"H2020","grant_number":"725746"}],"volume":14,"fulldoi":"https://doi.org/10.1016/j.cels.2023.10.007","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1016/j.cels.2023.10.007","file_date_updated":"2023-11-20T11:22:52Z","department":[{"_id":"DaZi"}],"article_type":"original","date_published":"2023-11-15T00:00:00Z","publication_identifier":{"eissn":["2405-4720"],"issn":["2405-4712"]},"external_id":{"isi":["001113459100001"],"pmid":["37944515"]},"status":"public","publisher":"Elsevier","quality_controlled":"1","citation":{"ista":"Briffa A, Hollwey E, Shahzad Z, Moore JD, Lyons DB, Howard M, Zilberman D. 2023. Millennia-long epigenetic fluctuations generate intragenic DNA methylation variance in Arabidopsis populations. Cell Systems. 14(11), 953–967.","mla":"Briffa, Amy, et al. “Millennia-Long Epigenetic Fluctuations Generate Intragenic DNA Methylation Variance in Arabidopsis Populations.” <i>Cell Systems</i>, vol. 14, no. 11, Elsevier, 2023, pp. 953–67, doi:<a href=\"https://doi.org/10.1016/j.cels.2023.10.007\">10.1016/j.cels.2023.10.007</a>.","ama":"Briffa A, Hollwey E, Shahzad Z, et al. Millennia-long epigenetic fluctuations generate intragenic DNA methylation variance in Arabidopsis populations. <i>Cell Systems</i>. 2023;14(11):953-967. doi:<a href=\"https://doi.org/10.1016/j.cels.2023.10.007\">10.1016/j.cels.2023.10.007</a>","apa":"Briffa, A., Hollwey, E., Shahzad, Z., Moore, J. D., Lyons, D. B., Howard, M., &#38; Zilberman, D. (2023). Millennia-long epigenetic fluctuations generate intragenic DNA methylation variance in Arabidopsis populations. <i>Cell Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cels.2023.10.007\">https://doi.org/10.1016/j.cels.2023.10.007</a>","chicago":"Briffa, Amy, Elizabeth Hollwey, Zaigham Shahzad, Jonathan D. Moore, David B. Lyons, Martin Howard, and Daniel Zilberman. “Millennia-Long Epigenetic Fluctuations Generate Intragenic DNA Methylation Variance in Arabidopsis Populations.” <i>Cell Systems</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.cels.2023.10.007\">https://doi.org/10.1016/j.cels.2023.10.007</a>.","short":"A. Briffa, E. Hollwey, Z. Shahzad, J.D. Moore, D.B. Lyons, M. Howard, D. Zilberman, Cell Systems 14 (2023) 953–967.","ieee":"A. Briffa <i>et al.</i>, “Millennia-long epigenetic fluctuations generate intragenic DNA methylation variance in Arabidopsis populations,” <i>Cell Systems</i>, vol. 14, no. 11. Elsevier, pp. 953–967, 2023."},"isi":1,"page":"953-967","author":[{"last_name":"Briffa","first_name":"Amy","full_name":"Briffa, Amy"},{"full_name":"Hollwey, Elizabeth","first_name":"Elizabeth","last_name":"Hollwey","id":"b8c4f54b-e484-11eb-8fdc-a54df64ef6dd"},{"last_name":"Shahzad","first_name":"Zaigham","full_name":"Shahzad, Zaigham"},{"last_name":"Moore","first_name":"Jonathan D.","full_name":"Moore, Jonathan D."},{"full_name":"Lyons, David B.","first_name":"David B.","last_name":"Lyons"},{"last_name":"Howard","full_name":"Howard, Martin","first_name":"Martin"},{"first_name":"Daniel","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman"}],"acknowledgement":"We would like to thank Xiaoqi Feng, Ander Movilla Miangolarra, and Suzanne de Bruijn for discussions. This work was supported by BBSRC Institute Strategic Programme GEN (BB/P013511/1) to M.H. and D.Z. and by a European Research Council grant MaintainMeth (725746) to D.Z.","issue":"11","article_processing_charge":"Yes (via OA deal)","type":"journal_article","pmid":1,"has_accepted_license":"1","intvolume":"        14","title":"Millennia-long epigenetic fluctuations generate intragenic DNA methylation variance in Arabidopsis populations","abstract":[{"lang":"eng","text":"Methylation of CG dinucleotides (mCGs), which regulates eukaryotic genome functions, is epigenetically propagated by Dnmt1/MET1 methyltransferases. How mCG is established and transmitted across generations despite imperfect enzyme fidelity is unclear. Whether mCG variation in natural populations is governed by genetic or epigenetic inheritance also remains mysterious. Here, we show that MET1 de novo activity, which is enhanced by existing proximate methylation, seeds and stabilizes mCG in Arabidopsis thaliana genes. MET1 activity is restricted by active demethylation and suppressed by histone variant H2A.Z, producing localized mCG patterns. Based on these observations, we develop a stochastic mathematical model that precisely recapitulates mCG inheritance dynamics and predicts intragenic mCG patterns and their population-scale variation given only CG site spacing. Our results demonstrate that intragenic mCG establishment, inheritance, and variance constitute a unified epigenetic process, revealing that intragenic mCG undergoes large, millennia-long epigenetic fluctuations and can therefore mediate evolution on this timescale."}],"year":"2023","publication":"Cell Systems","file":[{"file_size":5587897,"date_created":"2023-11-20T11:22:52Z","checksum":"101fdac59e6f1102d68ef91f2b5bd51a","content_type":"application/pdf","creator":"dernst","success":1,"relation":"main_file","date_updated":"2023-11-20T11:22:52Z","file_name":"2023_CellSystems_Briffa.pdf","file_id":"14580","access_level":"open_access"}],"month":"11","date_updated":"2025-09-09T13:28:50Z"},{"year":"2023","abstract":[{"lang":"eng","text":"Interactions between plants and herbivores are central in most ecosystems, but their strength is highly variable. The amount of variability within a system is thought to influence most aspects of plant-herbivore biology, from ecological stability to plant defense evolution. Our understanding of what influences variability, however, is limited by sparse data. We collected standardized surveys of herbivory for 503 plant species at 790 sites across 116° of latitude. With these data, we show that within-population variability in herbivory increases with latitude, decreases with plant size, and is phylogenetically structured. Differences in the magnitude of variability are thus central to how plant-herbivore biology varies across macroscale gradients. We argue that increased focus on interaction variability will advance understanding of patterns of life on Earth."}],"main_file_link":[{"open_access":"1","url":"https://centaur.reading.ac.uk/113962/1/adh8830_CombinedPDF_v6.pdf"}],"related_material":{"record":[{"id":"14579","status":"public","relation":"research_data"}]},"intvolume":"       382","title":"Plant size, latitude, and phylogeny explain within-population variability in herbivory","date_updated":"2025-09-09T13:23:56Z","month":"11","publication":"Science","issue":"6671","acknowledgement":"The authors acknowledge funding for central project coordination from NSF Research Coordination Network grant DEB-2203582; the Ecology, Evolution, and Behavior Program at Michigan State University; and AgBioResearch at Michigan State University. Site-specific funding is listed in the supplementary materials.","pmid":1,"type":"journal_article","OA_type":"green","article_processing_charge":"No","publication_identifier":{"eissn":["1095-9203"]},"external_id":{"isi":["001138596500033"],"pmid":["37943897"]},"date_published":"2023-11-09T00:00:00Z","article_type":"original","department":[{"_id":"NiBa"}],"doi":"10.1126/science.adh8830","OA_place":"repository","author":[{"last_name":"Robinson","full_name":"Robinson, M. L.","first_name":"M. L."},{"full_name":"Hahn, P. G.","first_name":"P. G.","last_name":"Hahn"},{"full_name":"Inouye, B. D.","first_name":"B. D.","last_name":"Inouye"},{"last_name":"Underwood","first_name":"N.","full_name":"Underwood, N."},{"first_name":"S. R.","full_name":"Whitehead, S. R.","last_name":"Whitehead"},{"first_name":"K. C.","full_name":"Abbott, K. C.","last_name":"Abbott"},{"first_name":"E. M.","full_name":"Bruna, E. M.","last_name":"Bruna"},{"full_name":"Cacho, N. I.","first_name":"N. I.","last_name":"Cacho"},{"first_name":"L. A.","full_name":"Dyer, L. A.","last_name":"Dyer"},{"first_name":"L.","full_name":"Abdala-Roberts, L.","last_name":"Abdala-Roberts"},{"first_name":"W. J.","full_name":"Allen, W. J.","last_name":"Allen"},{"last_name":"Andrade","first_name":"J. F.","full_name":"Andrade, J. F."},{"full_name":"Angulo, D. F.","first_name":"D. F.","last_name":"Angulo"},{"full_name":"Anjos, D.","first_name":"D.","last_name":"Anjos"},{"first_name":"D. N.","full_name":"Anstett, D. N.","last_name":"Anstett"},{"last_name":"Bagchi","full_name":"Bagchi, R.","first_name":"R."},{"first_name":"S.","full_name":"Bagchi, S.","last_name":"Bagchi"},{"first_name":"M.","full_name":"Barbosa, M.","last_name":"Barbosa"},{"last_name":"Barrett","first_name":"S.","full_name":"Barrett, S."},{"first_name":"Carina","full_name":"Baskett, Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87","last_name":"Baskett","orcid":"0000-0002-7354-8574"},{"full_name":"Ben-Simchon, E.","first_name":"E.","last_name":"Ben-Simchon"},{"full_name":"Bloodworth, K. J.","first_name":"K. J.","last_name":"Bloodworth"},{"full_name":"Bronstein, J. L.","first_name":"J. L.","last_name":"Bronstein"},{"full_name":"Buckley, Y. M.","first_name":"Y. M.","last_name":"Buckley"},{"full_name":"Burghardt, K. T.","first_name":"K. T.","last_name":"Burghardt"},{"first_name":"C.","full_name":"Bustos-Segura, C.","last_name":"Bustos-Segura"},{"full_name":"Calixto, E. S.","first_name":"E. S.","last_name":"Calixto"},{"full_name":"Carvalho, R. L.","first_name":"R. L.","last_name":"Carvalho"},{"full_name":"Castagneyrol, B.","first_name":"B.","last_name":"Castagneyrol"},{"full_name":"Chiuffo, M. C.","first_name":"M. C.","last_name":"Chiuffo"},{"last_name":"Cinoğlu","first_name":"D.","full_name":"Cinoğlu, D."},{"last_name":"Cinto Mejía","full_name":"Cinto Mejía, E.","first_name":"E."},{"last_name":"Cock","first_name":"M. C.","full_name":"Cock, M. C."},{"last_name":"Cogni","first_name":"R.","full_name":"Cogni, R."},{"first_name":"O. L.","full_name":"Cope, O. L.","last_name":"Cope"},{"last_name":"Cornelissen","full_name":"Cornelissen, T.","first_name":"T."},{"last_name":"Cortez","full_name":"Cortez, D. R.","first_name":"D. R."},{"last_name":"Crowder","full_name":"Crowder, D. W.","first_name":"D. W."},{"first_name":"C.","full_name":"Dallstream, C.","last_name":"Dallstream"},{"full_name":"Dáttilo, W.","first_name":"W.","last_name":"Dáttilo"},{"last_name":"Davis","full_name":"Davis, J. K.","first_name":"J. K."},{"first_name":"R. D.","full_name":"Dimarco, R. D.","last_name":"Dimarco"},{"full_name":"Dole, H. E.","first_name":"H. E.","last_name":"Dole"},{"first_name":"I. N.","full_name":"Egbon, I. N.","last_name":"Egbon"},{"last_name":"Eisenring","full_name":"Eisenring, M.","first_name":"M."},{"full_name":"Ejomah, A.","first_name":"A.","last_name":"Ejomah"},{"last_name":"Elderd","first_name":"B. D.","full_name":"Elderd, B. D."},{"last_name":"Endara","first_name":"M. J.","full_name":"Endara, M. J."},{"first_name":"M. D.","full_name":"Eubanks, M. D.","last_name":"Eubanks"},{"last_name":"Everingham","full_name":"Everingham, S. E.","first_name":"S. E."},{"last_name":"Farah","full_name":"Farah, K. N.","first_name":"K. N."},{"last_name":"Farias","first_name":"R. P.","full_name":"Farias, R. P."},{"last_name":"Fernandes","first_name":"A. P.","full_name":"Fernandes, A. P."},{"first_name":"G. W.","full_name":"Fernandes, G. W.","last_name":"Fernandes"},{"last_name":"Ferrante","first_name":"M.","full_name":"Ferrante, M."},{"last_name":"Finn","full_name":"Finn, A.","first_name":"A."},{"first_name":"G. A.","full_name":"Florjancic, G. A.","last_name":"Florjancic"},{"full_name":"Forister, M. L.","first_name":"M. L.","last_name":"Forister"},{"last_name":"Fox","first_name":"Q. N.","full_name":"Fox, Q. N."},{"full_name":"Frago, E.","first_name":"E.","last_name":"Frago"},{"first_name":"F. M.","full_name":"França, F. M.","last_name":"França"},{"full_name":"Getman-Pickering, A. S.","first_name":"A. S.","last_name":"Getman-Pickering"},{"last_name":"Getman-Pickering","full_name":"Getman-Pickering, Z.","first_name":"Z."},{"full_name":"Gianoli, E.","first_name":"E.","last_name":"Gianoli"},{"full_name":"Gooden, B.","first_name":"B.","last_name":"Gooden"},{"full_name":"Gossner, M. M.","first_name":"M. M.","last_name":"Gossner"},{"last_name":"Greig","first_name":"K. A.","full_name":"Greig, K. A."},{"last_name":"Gripenberg","first_name":"S.","full_name":"Gripenberg, S."},{"last_name":"Groenteman","full_name":"Groenteman, R.","first_name":"R."},{"last_name":"Grof-Tisza","first_name":"P.","full_name":"Grof-Tisza, P."},{"first_name":"N.","full_name":"Haack, N.","last_name":"Haack"},{"last_name":"Hahn","first_name":"L.","full_name":"Hahn, L."},{"first_name":"S. M.","full_name":"Haq, S. M.","last_name":"Haq"},{"full_name":"Helms, A. M.","first_name":"A. M.","last_name":"Helms"},{"last_name":"Hennecke","first_name":"J.","full_name":"Hennecke, J."},{"first_name":"S. L.","full_name":"Hermann, S. L.","last_name":"Hermann"},{"last_name":"Holeski","full_name":"Holeski, L. M.","first_name":"L. M."},{"full_name":"Holm, S.","first_name":"S.","last_name":"Holm"},{"first_name":"M. C.","full_name":"Hutchinson, M. C.","last_name":"Hutchinson"},{"full_name":"Jackson, E. E.","first_name":"E. E.","last_name":"Jackson"},{"last_name":"Kagiya","full_name":"Kagiya, S.","first_name":"S."},{"full_name":"Kalske, A.","first_name":"A.","last_name":"Kalske"},{"last_name":"Kalwajtys","full_name":"Kalwajtys, M.","first_name":"M."},{"full_name":"Karban, R.","first_name":"R.","last_name":"Karban"},{"last_name":"Kariyat","full_name":"Kariyat, R.","first_name":"R."},{"last_name":"Keasar","full_name":"Keasar, T.","first_name":"T."},{"last_name":"Kersch-Becker","full_name":"Kersch-Becker, M. F.","first_name":"M. F."},{"last_name":"Kharouba","first_name":"H. M.","full_name":"Kharouba, H. M."},{"last_name":"Kim","full_name":"Kim, T. N.","first_name":"T. N."},{"first_name":"D. M.","full_name":"Kimuyu, D. M.","last_name":"Kimuyu"},{"full_name":"Kluse, J.","first_name":"J.","last_name":"Kluse"},{"last_name":"Koerner","full_name":"Koerner, S. E.","first_name":"S. E."},{"last_name":"Komatsu","full_name":"Komatsu, K. J.","first_name":"K. J."},{"first_name":"S.","full_name":"Krishnan, S.","last_name":"Krishnan"},{"last_name":"Laihonen","first_name":"M.","full_name":"Laihonen, M."},{"first_name":"L.","full_name":"Lamelas-López, L.","last_name":"Lamelas-López"},{"last_name":"Lascaleia","first_name":"M. C.","full_name":"Lascaleia, M. C."},{"full_name":"Lecomte, N.","first_name":"N.","last_name":"Lecomte"},{"full_name":"Lehn, C. R.","first_name":"C. R.","last_name":"Lehn"},{"last_name":"Li","first_name":"X.","full_name":"Li, X."},{"last_name":"Lindroth","full_name":"Lindroth, R. L.","first_name":"R. L."},{"last_name":"Lopresti","first_name":"E. F.","full_name":"Lopresti, E. F."},{"last_name":"Losada","first_name":"M.","full_name":"Losada, M."},{"full_name":"Louthan, A. M.","first_name":"A. M.","last_name":"Louthan"},{"first_name":"V. J.","full_name":"Luizzi, V. J.","last_name":"Luizzi"},{"last_name":"Lynch","full_name":"Lynch, S. C.","first_name":"S. C."},{"full_name":"Lynn, J. S.","first_name":"J. S.","last_name":"Lynn"},{"last_name":"Lyon","full_name":"Lyon, N. J.","first_name":"N. J."},{"first_name":"L. F.","full_name":"Maia, L. F.","last_name":"Maia"},{"full_name":"Maia, R. A.","first_name":"R. A.","last_name":"Maia"},{"first_name":"T. L.","full_name":"Mannall, T. L.","last_name":"Mannall"},{"last_name":"Martin","first_name":"B. S.","full_name":"Martin, B. S."},{"first_name":"T. J.","full_name":"Massad, T. J.","last_name":"Massad"},{"last_name":"Mccall","first_name":"A. C.","full_name":"Mccall, A. C."},{"last_name":"Mcgurrin","full_name":"Mcgurrin, K.","first_name":"K."},{"first_name":"A. C.","full_name":"Merwin, A. C.","last_name":"Merwin"},{"first_name":"Z.","full_name":"Mijango-Ramos, Z.","last_name":"Mijango-Ramos"},{"first_name":"C. H.","full_name":"Mills, C. H.","last_name":"Mills"},{"last_name":"Moles","full_name":"Moles, A. T.","first_name":"A. T."},{"first_name":"C. M.","full_name":"Moore, C. M.","last_name":"Moore"},{"last_name":"Moreira","full_name":"Moreira, X.","first_name":"X."},{"full_name":"Morrison, C. R.","first_name":"C. R.","last_name":"Morrison"},{"last_name":"Moshobane","first_name":"M. C.","full_name":"Moshobane, M. C."},{"first_name":"A.","full_name":"Muola, A.","last_name":"Muola"},{"last_name":"Nakadai","full_name":"Nakadai, R.","first_name":"R."},{"full_name":"Nakajima, K.","first_name":"K.","last_name":"Nakajima"},{"last_name":"Novais","first_name":"S.","full_name":"Novais, S."},{"first_name":"C. O.","full_name":"Ogbebor, C. O.","last_name":"Ogbebor"},{"first_name":"H.","full_name":"Ohsaki, H.","last_name":"Ohsaki"},{"last_name":"Pan","full_name":"Pan, V. S.","first_name":"V. S."},{"first_name":"N. A.","full_name":"Pardikes, N. A.","last_name":"Pardikes"},{"last_name":"Pareja","first_name":"M.","full_name":"Pareja, M."},{"last_name":"Parthasarathy","first_name":"N.","full_name":"Parthasarathy, N."},{"first_name":"R. R.","full_name":"Pawar, R. R.","last_name":"Pawar"},{"first_name":"Q.","full_name":"Paynter, Q.","last_name":"Paynter"},{"full_name":"Pearse, I. S.","first_name":"I. S.","last_name":"Pearse"},{"last_name":"Penczykowski","first_name":"R. M.","full_name":"Penczykowski, R. M."},{"first_name":"A. A.","full_name":"Pepi, A. A.","last_name":"Pepi"},{"first_name":"C. C.","full_name":"Pereira, C. C.","last_name":"Pereira"},{"last_name":"Phartyal","full_name":"Phartyal, S. S.","first_name":"S. S."},{"full_name":"Piper, F. I.","first_name":"F. I.","last_name":"Piper"},{"last_name":"Poveda","first_name":"K.","full_name":"Poveda, K."},{"last_name":"Pringle","first_name":"E. G.","full_name":"Pringle, E. G."},{"last_name":"Puy","first_name":"J.","full_name":"Puy, J."},{"first_name":"T.","full_name":"Quijano, T.","last_name":"Quijano"},{"first_name":"C.","full_name":"Quintero, C.","last_name":"Quintero"},{"last_name":"Rasmann","full_name":"Rasmann, S.","first_name":"S."},{"first_name":"C.","full_name":"Rosche, C.","last_name":"Rosche"},{"last_name":"Rosenheim","first_name":"L. Y.","full_name":"Rosenheim, L. Y."},{"last_name":"Rosenheim","first_name":"J. A.","full_name":"Rosenheim, J. A."},{"full_name":"Runyon, J. B.","first_name":"J. B.","last_name":"Runyon"},{"last_name":"Sadeh","first_name":"A.","full_name":"Sadeh, A."},{"last_name":"Sakata","first_name":"Y.","full_name":"Sakata, Y."},{"last_name":"Salcido","full_name":"Salcido, D. M.","first_name":"D. M."},{"last_name":"Salgado-Luarte","full_name":"Salgado-Luarte, C.","first_name":"C."},{"last_name":"Santos","full_name":"Santos, B. A.","first_name":"B. A."},{"full_name":"Sapir, Y.","first_name":"Y.","last_name":"Sapir"},{"first_name":"Y.","full_name":"Sasal, Y.","last_name":"Sasal"},{"full_name":"Sato, Y.","first_name":"Y.","last_name":"Sato"},{"last_name":"Sawant","full_name":"Sawant, M.","first_name":"M."},{"first_name":"H.","full_name":"Schroeder, H.","last_name":"Schroeder"},{"full_name":"Schumann, I.","first_name":"I.","last_name":"Schumann"},{"full_name":"Segoli, M.","first_name":"M.","last_name":"Segoli"},{"first_name":"H.","full_name":"Segre, H.","last_name":"Segre"},{"last_name":"Shelef","full_name":"Shelef, O.","first_name":"O."},{"last_name":"Shinohara","full_name":"Shinohara, N.","first_name":"N."},{"last_name":"Singh","full_name":"Singh, R. P.","first_name":"R. P."},{"last_name":"Smith","first_name":"D. S.","full_name":"Smith, D. S."},{"last_name":"Sobral","first_name":"M.","full_name":"Sobral, M."},{"full_name":"Stotz, G. C.","first_name":"G. C.","last_name":"Stotz"},{"last_name":"Tack","first_name":"A. J.M.","full_name":"Tack, A. J.M."},{"last_name":"Tayal","full_name":"Tayal, M.","first_name":"M."},{"last_name":"Tooker","first_name":"J. F.","full_name":"Tooker, J. F."},{"last_name":"Torrico-Bazoberry","full_name":"Torrico-Bazoberry, D.","first_name":"D."},{"last_name":"Tougeron","first_name":"K.","full_name":"Tougeron, K."},{"first_name":"A. M.","full_name":"Trowbridge, A. M.","last_name":"Trowbridge"},{"first_name":"S.","full_name":"Utsumi, S.","last_name":"Utsumi"},{"full_name":"Uyi, O.","first_name":"O.","last_name":"Uyi"},{"last_name":"Vaca-Uribe","first_name":"J. L.","full_name":"Vaca-Uribe, J. L."},{"last_name":"Valtonen","full_name":"Valtonen, A.","first_name":"A."},{"last_name":"Van Dijk","full_name":"Van Dijk, L. J.A.","first_name":"L. J.A."},{"last_name":"Vandvik","first_name":"V.","full_name":"Vandvik, V."},{"last_name":"Villellas","full_name":"Villellas, J.","first_name":"J."},{"first_name":"L. P.","full_name":"Waller, L. P.","last_name":"Waller"},{"first_name":"M. G.","full_name":"Weber, M. G.","last_name":"Weber"},{"full_name":"Yamawo, A.","first_name":"A.","last_name":"Yamawo"},{"last_name":"Yim","first_name":"S.","full_name":"Yim, S."},{"full_name":"Zarnetske, P. L.","first_name":"P. L.","last_name":"Zarnetske"},{"last_name":"Zehr","full_name":"Zehr, L. N.","first_name":"L. N."},{"first_name":"Z.","full_name":"Zhong, Z.","last_name":"Zhong"},{"full_name":"Wetzel, W. C.","first_name":"W. C.","last_name":"Wetzel"}],"page":"679-683","citation":{"ama":"Robinson ML, Hahn PG, Inouye BD, et al. Plant size, latitude, and phylogeny explain within-population variability in herbivory. <i>Science</i>. 2023;382(6671):679-683. doi:<a href=\"https://doi.org/10.1126/science.adh8830\">10.1126/science.adh8830</a>","mla":"Robinson, M. L., et al. “Plant Size, Latitude, and Phylogeny Explain within-Population Variability in Herbivory.” <i>Science</i>, vol. 382, no. 6671, AAAS, 2023, pp. 679–83, doi:<a href=\"https://doi.org/10.1126/science.adh8830\">10.1126/science.adh8830</a>.","ista":"Robinson ML et al. 2023. Plant size, latitude, and phylogeny explain within-population variability in herbivory. Science. 382(6671), 679–683.","ieee":"M. L. Robinson <i>et al.</i>, “Plant size, latitude, and phylogeny explain within-population variability in herbivory,” <i>Science</i>, vol. 382, no. 6671. AAAS, pp. 679–683, 2023.","short":"M.L. Robinson, P.G. Hahn, B.D. Inouye, N. Underwood, S.R. Whitehead, K.C. Abbott, E.M. Bruna, N.I. Cacho, L.A. Dyer, L. Abdala-Roberts, W.J. Allen, J.F. Andrade, D.F. Angulo, D. Anjos, D.N. Anstett, R. Bagchi, S. Bagchi, M. Barbosa, S. Barrett, C. Baskett, E. Ben-Simchon, K.J. Bloodworth, J.L. Bronstein, Y.M. Buckley, K.T. Burghardt, C. Bustos-Segura, E.S. Calixto, R.L. Carvalho, B. Castagneyrol, M.C. Chiuffo, D. Cinoğlu, E. Cinto Mejía, M.C. Cock, R. Cogni, O.L. Cope, T. Cornelissen, D.R. Cortez, D.W. Crowder, C. Dallstream, W. Dáttilo, J.K. Davis, R.D. Dimarco, H.E. Dole, I.N. Egbon, M. Eisenring, A. Ejomah, B.D. Elderd, M.J. Endara, M.D. Eubanks, S.E. Everingham, K.N. Farah, R.P. Farias, A.P. Fernandes, G.W. Fernandes, M. Ferrante, A. Finn, G.A. Florjancic, M.L. Forister, Q.N. Fox, E. Frago, F.M. França, A.S. Getman-Pickering, Z. Getman-Pickering, E. Gianoli, B. Gooden, M.M. Gossner, K.A. Greig, S. Gripenberg, R. Groenteman, P. Grof-Tisza, N. Haack, L. Hahn, S.M. Haq, A.M. Helms, J. Hennecke, S.L. Hermann, L.M. Holeski, S. Holm, M.C. Hutchinson, E.E. Jackson, S. Kagiya, A. Kalske, M. Kalwajtys, R. Karban, R. Kariyat, T. Keasar, M.F. Kersch-Becker, H.M. Kharouba, T.N. Kim, D.M. Kimuyu, J. Kluse, S.E. Koerner, K.J. Komatsu, S. Krishnan, M. Laihonen, L. Lamelas-López, M.C. Lascaleia, N. Lecomte, C.R. Lehn, X. Li, R.L. Lindroth, E.F. Lopresti, M. Losada, A.M. Louthan, V.J. Luizzi, S.C. Lynch, J.S. Lynn, N.J. Lyon, L.F. Maia, R.A. Maia, T.L. Mannall, B.S. Martin, T.J. Massad, A.C. Mccall, K. Mcgurrin, A.C. Merwin, Z. Mijango-Ramos, C.H. Mills, A.T. Moles, C.M. Moore, X. Moreira, C.R. Morrison, M.C. Moshobane, A. Muola, R. Nakadai, K. Nakajima, S. Novais, C.O. Ogbebor, H. Ohsaki, V.S. Pan, N.A. Pardikes, M. Pareja, N. Parthasarathy, R.R. Pawar, Q. Paynter, I.S. Pearse, R.M. Penczykowski, A.A. Pepi, C.C. Pereira, S.S. Phartyal, F.I. Piper, K. Poveda, E.G. Pringle, J. Puy, T. Quijano, C. Quintero, S. Rasmann, C. Rosche, L.Y. Rosenheim, J.A. Rosenheim, J.B. Runyon, A. Sadeh, Y. Sakata, D.M. Salcido, C. Salgado-Luarte, B.A. Santos, Y. Sapir, Y. Sasal, Y. Sato, M. Sawant, H. Schroeder, I. Schumann, M. Segoli, H. Segre, O. Shelef, N. Shinohara, R.P. Singh, D.S. Smith, M. Sobral, G.C. Stotz, A.J.M. Tack, M. Tayal, J.F. Tooker, D. Torrico-Bazoberry, K. Tougeron, A.M. Trowbridge, S. Utsumi, O. Uyi, J.L. Vaca-Uribe, A. Valtonen, L.J.A. Van Dijk, V. Vandvik, J. Villellas, L.P. Waller, M.G. Weber, A. Yamawo, S. Yim, P.L. Zarnetske, L.N. Zehr, Z. Zhong, W.C. Wetzel, Science 382 (2023) 679–683.","chicago":"Robinson, M. L., P. G. Hahn, B. D. Inouye, N. Underwood, S. R. Whitehead, K. C. Abbott, E. M. Bruna, et al. “Plant Size, Latitude, and Phylogeny Explain within-Population Variability in Herbivory.” <i>Science</i>. AAAS, 2023. <a href=\"https://doi.org/10.1126/science.adh8830\">https://doi.org/10.1126/science.adh8830</a>.","apa":"Robinson, M. L., Hahn, P. G., Inouye, B. D., Underwood, N., Whitehead, S. R., Abbott, K. C., … Wetzel, W. C. (2023). Plant size, latitude, and phylogeny explain within-population variability in herbivory. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.adh8830\">https://doi.org/10.1126/science.adh8830</a>"},"isi":1,"quality_controlled":"1","publisher":"AAAS","status":"public","day":"09","date_created":"2023-11-19T23:00:54Z","language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","_id":"14552","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1126/science.adh8830","volume":382,"oa":1,"publication_status":"published"},{"quality_controlled":"1","citation":{"mla":"Fedotova, Ekaterina, et al. “Continuous-Variable Quantum Tomography of High-Amplitude States.” <i>Physical Review A</i>, vol. 108, no. 4, 042430, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevA.108.042430\">10.1103/PhysRevA.108.042430</a>.","ista":"Fedotova E, Kuznetsov N, Tiunov E, Ulanov AE, Lvovsky AI. 2023. Continuous-variable quantum tomography of high-amplitude states. Physical Review A. 108(4), 042430.","ama":"Fedotova E, Kuznetsov N, Tiunov E, Ulanov AE, Lvovsky AI. Continuous-variable quantum tomography of high-amplitude states. <i>Physical Review A</i>. 2023;108(4). doi:<a href=\"https://doi.org/10.1103/PhysRevA.108.042430\">10.1103/PhysRevA.108.042430</a>","chicago":"Fedotova, Ekaterina, Nikolai Kuznetsov, Egor Tiunov, A. E. Ulanov, and A. I. Lvovsky. “Continuous-Variable Quantum Tomography of High-Amplitude States.” <i>Physical Review A</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevA.108.042430\">https://doi.org/10.1103/PhysRevA.108.042430</a>.","apa":"Fedotova, E., Kuznetsov, N., Tiunov, E., Ulanov, A. E., &#38; Lvovsky, A. I. (2023). Continuous-variable quantum tomography of high-amplitude states. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.108.042430\">https://doi.org/10.1103/PhysRevA.108.042430</a>","ieee":"E. Fedotova, N. Kuznetsov, E. Tiunov, A. E. Ulanov, and A. I. Lvovsky, “Continuous-variable quantum tomography of high-amplitude states,” <i>Physical Review A</i>, vol. 108, no. 4. American Physical Society, 2023.","short":"E. Fedotova, N. Kuznetsov, E. Tiunov, A.E. Ulanov, A.I. Lvovsky, Physical Review A 108 (2023)."},"author":[{"orcid":"0000-0001-7242-015X","id":"c1bea5e1-878e-11ee-9dff-d7404e4422ab","last_name":"Fedotova","first_name":"Ekaterina","full_name":"Fedotova, Ekaterina"},{"last_name":"Kuznetsov","full_name":"Kuznetsov, Nikolai","first_name":"Nikolai"},{"last_name":"Tiunov","full_name":"Tiunov, Egor","first_name":"Egor"},{"last_name":"Ulanov","full_name":"Ulanov, A. E.","first_name":"A. E."},{"first_name":"A. I.","full_name":"Lvovsky, A. I.","last_name":"Lvovsky"}],"status":"public","publisher":"American Physical Society","article_type":"original","date_published":"2023-10-30T00:00:00Z","external_id":{"arxiv":["2212.07406"]},"publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"doi":"10.1103/PhysRevA.108.042430","department":[{"_id":"JoFi"}],"fulldoi":"https://doi.org/10.1103/PhysRevA.108.042430","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","volume":108,"day":"30","date_created":"2023-11-19T23:00:54Z","_id":"14553","scopus_import":"1","oa_version":"Preprint","corr_author":"1","language":[{"iso":"eng"}],"publication":"Physical Review A","month":"10","arxiv":1,"date_updated":"2024-10-09T21:07:19Z","abstract":[{"lang":"eng","text":"Quantum state tomography is an essential component of modern quantum technology. In application to continuous-variable harmonic-oscillator systems, such as the electromagnetic field, existing tomography methods typically reconstruct the state in discrete bases, and are hence limited to states with relatively low amplitudes and energies. Here, we overcome this limitation by utilizing a feed-forward neural network to obtain the density matrix directly in the continuous position basis. An important benefit of our approach is the ability to choose specific regions in the phase space for detailed reconstruction. This results in a relatively slow scaling of the amount of resources required for the reconstruction with the state amplitude, and hence allows us to dramatically increase the range of amplitudes accessible with our method."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2212.07406"}],"year":"2023","title":"Continuous-variable quantum tomography of high-amplitude states","intvolume":"       108","type":"journal_article","article_processing_charge":"No","issue":"4","article_number":"042430"},{"fulldoi":"https://doi.org/10.1051/m2an/2023077","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"publication_status":"published","volume":57,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"},{"grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"date_created":"2023-11-19T23:00:55Z","day":"01","ec_funded":1,"ddc":["510"],"_id":"14554","scopus_import":"1","corr_author":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"ieee":"F. Cornalba and T. Shardlow, “The regularised inertial Dean’ Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime,” <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>, vol. 57, no. 5. EDP Sciences, pp. 3061–3090, 2023.","short":"F. Cornalba, T. Shardlow, ESAIM: Mathematical Modelling and Numerical Analysis 57 (2023) 3061–3090.","chicago":"Cornalba, Federico, and Tony Shardlow. “The Regularised Inertial Dean’ Kawasaki Equation: Discontinuous Galerkin Approximation and Modelling for Low-Density Regime.” <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>. EDP Sciences, 2023. <a href=\"https://doi.org/10.1051/m2an/2023077\">https://doi.org/10.1051/m2an/2023077</a>.","apa":"Cornalba, F., &#38; Shardlow, T. (2023). The regularised inertial Dean’ Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime. <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/m2an/2023077\">https://doi.org/10.1051/m2an/2023077</a>","ama":"Cornalba F, Shardlow T. The regularised inertial Dean’ Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime. <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>. 2023;57(5):3061-3090. doi:<a href=\"https://doi.org/10.1051/m2an/2023077\">10.1051/m2an/2023077</a>","mla":"Cornalba, Federico, and Tony Shardlow. “The Regularised Inertial Dean’ Kawasaki Equation: Discontinuous Galerkin Approximation and Modelling for Low-Density Regime.” <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>, vol. 57, no. 5, EDP Sciences, 2023, pp. 3061–90, doi:<a href=\"https://doi.org/10.1051/m2an/2023077\">10.1051/m2an/2023077</a>.","ista":"Cornalba F, Shardlow T. 2023. The regularised inertial Dean’ Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime. ESAIM: Mathematical Modelling and Numerical Analysis. 57(5), 3061–3090."},"isi":1,"author":[{"full_name":"Cornalba, Federico","first_name":"Federico","last_name":"Cornalba","id":"2CEB641C-A400-11E9-A717-D712E6697425","orcid":"0000-0002-6269-5149"},{"first_name":"Tony","full_name":"Shardlow, Tony","last_name":"Shardlow"}],"page":"3061-3090","status":"public","publisher":"EDP Sciences","article_type":"original","date_published":"2023-09-01T00:00:00Z","publication_identifier":{"issn":["2822-7840"],"eissn":["2804-7214"]},"external_id":{"isi":["001087237700001"]},"file_date_updated":"2023-11-20T08:34:57Z","doi":"10.1051/m2an/2023077","department":[{"_id":"JuFi"}],"type":"journal_article","article_processing_charge":"Yes (in subscription journal)","acknowledgement":"The authors thank the anonymous referees for their careful reading of the manuscript and their\r\nvaluable suggestions. FC gratefully acknowledges funding from the Austrian Science Fund (FWF) through the project F65, and from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411 (the latter funding source covered the first part of this project).","issue":"5","publication":"ESAIM: Mathematical Modelling and Numerical Analysis","file":[{"checksum":"3aef1475b1882c8dec112df9a5167c39","content_type":"application/pdf","file_size":1508534,"date_created":"2023-11-20T08:34:57Z","success":1,"relation":"main_file","creator":"dernst","date_updated":"2023-11-20T08:34:57Z","file_name":"2023_ESAIM_Cornalba.pdf","file_id":"14560","access_level":"open_access"}],"month":"09","date_updated":"2025-09-09T13:21:05Z","abstract":[{"lang":"eng","text":"The Regularised Inertial Dean–Kawasaki model (RIDK) – introduced by the authors and J. Zimmer in earlier works – is a nonlinear stochastic PDE capturing fluctuations around the meanfield limit for large-scale particle systems in both particle density and momentum density. We focus on the following two aspects. Firstly, we set up a Discontinuous Galerkin (DG) discretisation scheme for the RIDK model: we provide suitable definitions of numerical fluxes at the interface of the mesh elements which are consistent with the wave-type nature of the RIDK model and grant stability of the simulations, and we quantify the rate of convergence in mean square to the continuous RIDK model. Secondly, we introduce modifications of the RIDK model in order to preserve positivity of the density (such a feature only holds in a “high-probability sense” for the original RIDK model). By means of numerical simulations, we show that the modifications lead to physically realistic and positive density profiles. In one case, subject to additional regularity constraints, we also prove positivity. Finally, we present an application of our methodology to a system of diffusing and reacting particles. Our Python code is available in open-source format."}],"year":"2023","has_accepted_license":"1","intvolume":"        57","title":"The regularised inertial Dean' Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime","related_material":{"link":[{"relation":"software","url":"https://github.com/tonyshardlow/RIDK-FD"}]}},{"intvolume":"        11","title":"The excitable nature of polymerizing actin and the Belousov-Zhabotinsky reaction","has_accepted_license":"1","year":"2023","abstract":[{"text":"The intricate regulatory processes behind actin polymerization play a crucial role in cellular biology, including essential mechanisms such as cell migration or cell division. However, the self-organizing principles governing actin polymerization are still poorly understood. In this perspective article, we compare the Belousov-Zhabotinsky (BZ) reaction, a classic and well understood chemical oscillator known for its self-organizing spatiotemporal dynamics, with the excitable dynamics of polymerizing actin. While the BZ reaction originates from the domain of inorganic chemistry, it shares remarkable similarities with actin polymerization, including the characteristic propagating waves, which are influenced by geometry and external fields, and the emergent collective behavior. Starting with a general description of emerging patterns, we elaborate on single droplets or cell-level dynamics, the influence of geometric confinements and conclude with collective interactions. Comparing these two systems sheds light on the universal nature of self-organization principles in both living and inanimate systems.","lang":"eng"}],"date_updated":"2025-09-09T13:22:00Z","month":"10","file":[{"content_type":"application/pdf","checksum":"61857fc3ebf019354932e7ee684658ce","date_created":"2023-11-20T08:41:15Z","file_size":2047622,"success":1,"relation":"main_file","creator":"dernst","file_name":"2023_FrontiersCellDevBio_Riedl.pdf","date_updated":"2023-11-20T08:41:15Z","access_level":"open_access","file_id":"14561"}],"publication":"Frontiers in Cell and Developmental Biology","article_number":"1287420","acknowledgement":"The author(s) declare that no financial support was received for the research, authorship, and/or publication of this article.","article_processing_charge":"Yes","pmid":1,"type":"journal_article","department":[{"_id":"MiSi"}],"file_date_updated":"2023-11-20T08:41:15Z","doi":"10.3389/fcell.2023.1287420","external_id":{"isi":["001100762800001"],"pmid":["38020899"]},"publication_identifier":{"eissn":["2296-634X"]},"date_published":"2023-10-31T00:00:00Z","article_type":"original","publisher":"Frontiers","status":"public","author":[{"id":"3BE60946-F248-11E8-B48F-1D18A9856A87","last_name":"Riedl","orcid":"0000-0003-4844-6311","first_name":"Michael","full_name":"Riedl, Michael"},{"first_name":"Michael K","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","orcid":"0000-0002-6620-9179"}],"citation":{"ieee":"M. Riedl and M. K. Sixt, “The excitable nature of polymerizing actin and the Belousov-Zhabotinsky reaction,” <i>Frontiers in Cell and Developmental Biology</i>, vol. 11. Frontiers, 2023.","short":"M. Riedl, M.K. Sixt, Frontiers in Cell and Developmental Biology 11 (2023).","chicago":"Riedl, Michael, and Michael K Sixt. “The Excitable Nature of Polymerizing Actin and the Belousov-Zhabotinsky Reaction.” <i>Frontiers in Cell and Developmental Biology</i>. Frontiers, 2023. <a href=\"https://doi.org/10.3389/fcell.2023.1287420\">https://doi.org/10.3389/fcell.2023.1287420</a>.","apa":"Riedl, M., &#38; Sixt, M. K. (2023). The excitable nature of polymerizing actin and the Belousov-Zhabotinsky reaction. <i>Frontiers in Cell and Developmental Biology</i>. Frontiers. <a href=\"https://doi.org/10.3389/fcell.2023.1287420\">https://doi.org/10.3389/fcell.2023.1287420</a>","ama":"Riedl M, Sixt MK. The excitable nature of polymerizing actin and the Belousov-Zhabotinsky reaction. <i>Frontiers in Cell and Developmental Biology</i>. 2023;11. doi:<a href=\"https://doi.org/10.3389/fcell.2023.1287420\">10.3389/fcell.2023.1287420</a>","mla":"Riedl, Michael, and Michael K. Sixt. “The Excitable Nature of Polymerizing Actin and the Belousov-Zhabotinsky Reaction.” <i>Frontiers in Cell and Developmental Biology</i>, vol. 11, 1287420, Frontiers, 2023, doi:<a href=\"https://doi.org/10.3389/fcell.2023.1287420\">10.3389/fcell.2023.1287420</a>.","ista":"Riedl M, Sixt MK. 2023. The excitable nature of polymerizing actin and the Belousov-Zhabotinsky reaction. Frontiers in Cell and Developmental Biology. 11, 1287420."},"isi":1,"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"corr_author":"1","scopus_import":"1","_id":"14555","ddc":["570"],"date_created":"2023-11-19T23:00:55Z","day":"31","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":11,"oa":1,"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.3389/fcell.2023.1287420"},{"isi":1,"citation":{"ama":"Berdan EL, Barton NH, Butlin R, et al. How chromosomal inversions reorient the evolutionary process. <i>Journal of Evolutionary Biology</i>. 2023;36(12). doi:<a href=\"https://doi.org/10.1111/jeb.14242\">10.1111/jeb.14242</a>","ista":"Berdan EL, Barton NH, Butlin R, Charlesworth B, Faria R, Fragata I, Gilbert KJ, Jay P, Kapun M, Lotterhos KE, Mérot C, Durmaz Mitchell E, Pascual M, Peichel CL, Rafajlović M, Westram AM, Schaeffer SW, Johannesson K, Flatt T. 2023. How chromosomal inversions reorient the evolutionary process. Journal of Evolutionary Biology. 36(12), 14242.","mla":"Berdan, Emma L., et al. “How Chromosomal Inversions Reorient the Evolutionary Process.” <i>Journal of Evolutionary Biology</i>, vol. 36, no. 12, 14242, Wiley, 2023, doi:<a href=\"https://doi.org/10.1111/jeb.14242\">10.1111/jeb.14242</a>.","short":"E.L. Berdan, N.H. Barton, R. Butlin, B. Charlesworth, R. Faria, I. Fragata, K.J. Gilbert, P. Jay, M. Kapun, K.E. Lotterhos, C. Mérot, E. Durmaz Mitchell, M. Pascual, C.L. Peichel, M. Rafajlović, A.M. Westram, S.W. Schaeffer, K. Johannesson, T. Flatt, Journal of Evolutionary Biology 36 (2023).","ieee":"E. L. Berdan <i>et al.</i>, “How chromosomal inversions reorient the evolutionary process,” <i>Journal of Evolutionary Biology</i>, vol. 36, no. 12. Wiley, 2023.","apa":"Berdan, E. L., Barton, N. H., Butlin, R., Charlesworth, B., Faria, R., Fragata, I., … Flatt, T. (2023). How chromosomal inversions reorient the evolutionary process. <i>Journal of Evolutionary Biology</i>. Wiley. <a href=\"https://doi.org/10.1111/jeb.14242\">https://doi.org/10.1111/jeb.14242</a>","chicago":"Berdan, Emma L., Nicholas H Barton, Roger Butlin, Brian Charlesworth, Rui Faria, Inês Fragata, Kimberly J. Gilbert, et al. “How Chromosomal Inversions Reorient the Evolutionary Process.” <i>Journal of Evolutionary Biology</i>. Wiley, 2023. <a href=\"https://doi.org/10.1111/jeb.14242\">https://doi.org/10.1111/jeb.14242</a>."},"quality_controlled":"1","author":[{"last_name":"Berdan","full_name":"Berdan, Emma L.","first_name":"Emma L."},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","full_name":"Barton, Nicholas H"},{"first_name":"Roger","full_name":"Butlin, Roger","last_name":"Butlin"},{"last_name":"Charlesworth","first_name":"Brian","full_name":"Charlesworth, Brian"},{"first_name":"Rui","full_name":"Faria, Rui","last_name":"Faria"},{"full_name":"Fragata, Inês","first_name":"Inês","last_name":"Fragata"},{"first_name":"Kimberly J.","full_name":"Gilbert, Kimberly J.","last_name":"Gilbert"},{"last_name":"Jay","first_name":"Paul","full_name":"Jay, Paul"},{"full_name":"Kapun, Martin","first_name":"Martin","last_name":"Kapun"},{"first_name":"Katie E.","full_name":"Lotterhos, Katie E.","last_name":"Lotterhos"},{"last_name":"Mérot","full_name":"Mérot, Claire","first_name":"Claire"},{"first_name":"Esra","full_name":"Durmaz Mitchell, Esra","last_name":"Durmaz Mitchell"},{"first_name":"Marta","full_name":"Pascual, Marta","last_name":"Pascual"},{"last_name":"Peichel","full_name":"Peichel, Catherine L.","first_name":"Catherine L."},{"first_name":"Marina","full_name":"Rafajlović, Marina","last_name":"Rafajlović"},{"full_name":"Westram, Anja M","first_name":"Anja M","orcid":"0000-0003-1050-4969","last_name":"Westram","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schaeffer","full_name":"Schaeffer, Stephen W.","first_name":"Stephen W."},{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"},{"first_name":"Thomas","full_name":"Flatt, Thomas","last_name":"Flatt"}],"status":"public","publisher":"Wiley","article_type":"review","external_id":{"pmid":["37942504"],"isi":["001098690500001"]},"publication_identifier":{"eissn":["1420-9101"],"issn":["1010-061X"]},"date_published":"2023-12-01T00:00:00Z","department":[{"_id":"NiBa"}],"file_date_updated":"2024-07-16T08:16:31Z","doi":"10.1111/jeb.14242","fulldoi":"https://doi.org/10.1111/jeb.14242","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","oa":1,"tmp":{"short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"volume":36,"date_created":"2023-11-19T23:00:55Z","day":"01","ddc":["570"],"_id":"14556","oa_version":"Published Version","language":[{"iso":"eng"}],"scopus_import":"1","publication":"Journal of Evolutionary Biology","date_updated":"2025-09-09T13:22:35Z","file":[{"file_size":1401726,"date_created":"2024-07-16T08:16:31Z","content_type":"application/pdf","checksum":"93ae4fa700aab8646bc62f0adeed8f8f","creator":"dernst","relation":"main_file","success":1,"date_updated":"2024-07-16T08:16:31Z","file_name":"2023_JourEvolutionaryBio_Berdan.pdf","file_id":"17253","access_level":"open_access"}],"month":"12","abstract":[{"text":"Inversions are structural mutations that reverse the sequence of a chromosome segment and reduce the effective rate of recombination in the heterozygous state. They play a major role in adaptation, as well as in other evolutionary processes such as speciation. Although inversions have been studied since the 1920s, they remain difficult to investigate because the reduced recombination conferred by them strengthens the effects of drift and hitchhiking, which in turn can obscure signatures of selection. Nonetheless, numerous inversions have been found to be under selection. Given recent advances in population genetic theory and empirical study, here we review how different mechanisms of selection affect the evolution of inversions. A key difference between inversions and other mutations, such as single nucleotide variants, is that the fitness of an inversion may be affected by a larger number of frequently interacting processes. This considerably complicates the analysis of the causes underlying the evolution of inversions. We discuss the extent to which these mechanisms can be disentangled, and by which approach.","lang":"eng"}],"year":"2023","intvolume":"        36","title":"How chromosomal inversions reorient the evolutionary process","has_accepted_license":"1","type":"journal_article","pmid":1,"article_processing_charge":"Yes (in subscription journal)","acknowledgement":"We are grateful to two referees and Luke Holman for valuable comments on a previous version of our manuscript. This paper was conceived at the ESEB Progress Meeting ‘Disentangling neutral versus adaptive evolution in chromosomal inversions’, organized by ELB, KJ and TF and held at Tjärnö Marine Laboratory (Sweden) between 28 February and 3 March 2022. We are indebted to ESEB for sponsoring our workshop and to the following funding bodies for supporting our research: ERC AdG 101055327 to NHB; Swedish Research Council (VR) 2018-03695 and Leverhulme Trust RPG-2021-141 to RKB; Fundação para a Ciência e a Tecnologia (FCT) contract 2020.00275.CEECIND and research project PTDC/BIA-1232 EVL/1614/2021 to RF; Fundação para a Ciência e a Tecnologia (FCT) junior researcher contract CEECIND/02616/2018 to IF; Swiss National Science Foundation (SNSF) Ambizione #PZ00P3_185952 to KJG; National Science Foundation NSF-OCE 2043905 and NSF-DEB 1655701 to KEL; Swiss National Science Foundation (SNSF) 310030_204681 to CLP; Swedish Research Council (VR) 2021-05243 to MR; Norwegian Research Council grant 315287 to AMW; Swiss National Science Foundation (SNSF) 31003A-182262 and FZEB-0-214654 to TF. We also thank Luca Ferretti for the discussion and Eliane Zinn (Flatt lab) for help with reference formatting.","issue":"12","article_number":"14242"},{"date_updated":"2025-09-09T13:23:12Z","month":"11","publication":"Quaestiones Mathematicae","intvolume":"        46","title":"Epimorphisms and closure operators of categories of semilattices","year":"2023","abstract":[{"lang":"eng","text":"Motivated by a problem posed in [10], we investigate the closure operators of the category SLatt of join semilattices and its subcategory SLattO of join semilattices with bottom element. In particular, we show that there are only finitely many closure operators of both categories, and provide a complete classification. We use this result to deduce the known fact that epimorphisms of SLatt and SLattO are surjective. We complement the paper with two different proofs of this result using either generators or Isbell’s zigzag theorem."}],"article_processing_charge":"No","type":"journal_article","issue":"S1","acknowledgement":"The first and second named authors are members of GNSAGA – INdAM.\r\nThe third named author was supported by the FWF Grant, Project number I4245–N35","publisher":"Taylor & Francis","status":"public","page":"191-221","author":[{"first_name":"D.","full_name":"Dikranjan, D.","last_name":"Dikranjan"},{"first_name":"A.","full_name":"Giordano Bruno, A.","last_name":"Giordano Bruno"},{"full_name":"Zava, Nicolò","first_name":"Nicolò","last_name":"Zava","id":"c8b3499c-7a77-11eb-b046-aa368cbbf2ad","orcid":"0000-0001-8686-1888"}],"citation":{"ieee":"D. Dikranjan, A. Giordano Bruno, and N. Zava, “Epimorphisms and closure operators of categories of semilattices,” <i>Quaestiones Mathematicae</i>, vol. 46, no. S1. Taylor &#38; Francis, pp. 191–221, 2023.","short":"D. Dikranjan, A. Giordano Bruno, N. Zava, Quaestiones Mathematicae 46 (2023) 191–221.","chicago":"Dikranjan, D., A. Giordano Bruno, and Nicolò Zava. “Epimorphisms and Closure Operators of Categories of Semilattices.” <i>Quaestiones Mathematicae</i>. Taylor &#38; Francis, 2023. <a href=\"https://doi.org/10.2989/16073606.2023.2247731\">https://doi.org/10.2989/16073606.2023.2247731</a>.","apa":"Dikranjan, D., Giordano Bruno, A., &#38; Zava, N. (2023). Epimorphisms and closure operators of categories of semilattices. <i>Quaestiones Mathematicae</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.2989/16073606.2023.2247731\">https://doi.org/10.2989/16073606.2023.2247731</a>","ama":"Dikranjan D, Giordano Bruno A, Zava N. Epimorphisms and closure operators of categories of semilattices. <i>Quaestiones Mathematicae</i>. 2023;46(S1):191-221. doi:<a href=\"https://doi.org/10.2989/16073606.2023.2247731\">10.2989/16073606.2023.2247731</a>","mla":"Dikranjan, D., et al. “Epimorphisms and Closure Operators of Categories of Semilattices.” <i>Quaestiones Mathematicae</i>, vol. 46, no. S1, Taylor &#38; Francis, 2023, pp. 191–221, doi:<a href=\"https://doi.org/10.2989/16073606.2023.2247731\">10.2989/16073606.2023.2247731</a>.","ista":"Dikranjan D, Giordano Bruno A, Zava N. 2023. Epimorphisms and closure operators of categories of semilattices. Quaestiones Mathematicae. 46(S1), 191–221."},"isi":1,"quality_controlled":"1","department":[{"_id":"HeEd"}],"doi":"10.2989/16073606.2023.2247731","publication_identifier":{"eissn":["1727-933X"],"issn":["1607-3606"]},"external_id":{"isi":["001098712000006"]},"date_published":"2023-11-01T00:00:00Z","article_type":"original","volume":46,"project":[{"call_identifier":"FWF","_id":"26AD5D90-B435-11E9-9278-68D0E5697425","name":"Algebraic Footprints of Geometric Features in Homology","grant_number":"I04245"}],"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.2989/16073606.2023.2247731","oa_version":"None","language":[{"iso":"eng"}],"scopus_import":"1","_id":"14557","date_created":"2023-11-19T23:00:55Z","day":"01"},{"author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"},{"first_name":"Xiaowei","full_name":"Wu, Xiaowei","last_name":"Wu"}],"page":"1132-1192","quality_controlled":"1","citation":{"ieee":"S. Bhattacharya, M. Henzinger, D. Nanongkai, and X. Wu, “Deterministic near-optimal approximation algorithms for dynamic set cover,” <i>SIAM Journal on Computing</i>, vol. 52, no. 5. Society for Industrial and Applied Mathematics, pp. 1132–1192, 2023.","short":"S. Bhattacharya, M. Henzinger, D. Nanongkai, X. Wu, SIAM Journal on Computing 52 (2023) 1132–1192.","chicago":"Bhattacharya, Sayan, Monika Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.” <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/21M1428649\">https://doi.org/10.1137/21M1428649</a>.","apa":"Bhattacharya, S., Henzinger, M., Nanongkai, D., &#38; Wu, X. (2023). Deterministic near-optimal approximation algorithms for dynamic set cover. <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21M1428649\">https://doi.org/10.1137/21M1428649</a>","ama":"Bhattacharya S, Henzinger M, Nanongkai D, Wu X. Deterministic near-optimal approximation algorithms for dynamic set cover. <i>SIAM Journal on Computing</i>. 2023;52(5):1132-1192. doi:<a href=\"https://doi.org/10.1137/21M1428649\">10.1137/21M1428649</a>","mla":"Bhattacharya, Sayan, et al. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.” <i>SIAM Journal on Computing</i>, vol. 52, no. 5, Society for Industrial and Applied Mathematics, 2023, pp. 1132–92, doi:<a href=\"https://doi.org/10.1137/21M1428649\">10.1137/21M1428649</a>.","ista":"Bhattacharya S, Henzinger M, Nanongkai D, Wu X. 2023. Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. 52(5), 1132–1192."},"isi":1,"publisher":"Society for Industrial and Applied Mathematics","status":"public","date_published":"2023-10-01T00:00:00Z","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"external_id":{"isi":["001116719500002"]},"article_type":"original","doi":"10.1137/21M1428649","department":[{"_id":"MoHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1137/21M1428649","volume":52,"project":[{"name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","grant_number":"101019564"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"},{"name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"publication_status":"published","ec_funded":1,"day":"01","date_created":"2023-11-19T23:00:56Z","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"None","_id":"14558","month":"10","date_updated":"2025-09-09T13:19:49Z","publication":"SIAM Journal on Computing","year":"2023","abstract":[{"text":"n the dynamic minimum set cover problem, the challenge is to minimize the update time while guaranteeing a close-to-optimal min{O(log n), f} approximation factor. (Throughout, n, m, f , and C are parameters denoting the maximum number of elements, the number of sets, the frequency, and the cost range.) In the high-frequency range, when f = Ω(log n) , this was achieved by a deterministic O(log n) -approximation algorithm with O(f log n) amortized update time by Gupta et al. [Online and dynamic algorithms for set cover, in Proceedings STOC 2017, ACM, pp. 537–550]. In this paper we consider the low-frequency range, when f = O(log n) , and obtain deterministic algorithms with a (1 + ∈)f -approximation ratio and the following guarantees on the update time. (1)  O ((f/∈)-log(Cn)) amortized update time: Prior to our work, the best approximation ratio guaranteed by deterministic algorithms was O(f2) of Bhattacharya, Henzinger, and Italiano [Design of dynamic algorithms via primal-dual method, in Proceedings ICALP 2015, Springer, pp. 206–218]. In contrast, the only result with O(f) -approximation was that of Abboud et al. [Dynamic set cover: Improved algorithms and lower bounds, in Proceedings STOC 2019, ACM, pp. 114–125], who designed a randomized (1+∈)f -approximation algorithm with  amortized update time. (2) O(f2/∈3 + (f/∈2).logC) amortized update time: This result improves the above update time bound for most values of f\r\n in the low-frequency range, i.e., f=o(log n) . It is also the first result that is independent of m\r\n and n. It subsumes the constant amortized update time of Bhattacharya and Kulkarni [Deterministically maintaining a (2 + ∈) -approximate minimum vertex cover in O(1/∈2) amortized update time, in Proceedings SODA 2019, SIAM, pp. 1872–1885] for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1). (3) O((f/∈3).log2(Cn)) worst-case update time: No nontrivial worst-case update time was previously known for the dynamic set cover problem. Our bound subsumes and improves by a logarithmic factor the O(log3n/poly (∈)) \r\n worst-case update time for the unweighted dynamic vertex cover problem (i.e., when f = 2\r\n and C =1) of Bhattacharya, Henzinger, and Nanongkai [Fully dynamic approximate maximum matching and minimum vertex cover in O(log3)n worst case update time, in Proceedings SODA 2017, SIAM, pp. 470–489]. We achieve our results via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. Prior work in dynamic algorithms that employs the primal-dual approach uses a local update scheme that maintains relaxed complementary slackness conditions for every set. For our first result we use instead a global update scheme that does not always maintain complementary slackness conditions. For our second result we combine the global and the local update schema. To achieve our third result we use a hierarchy of background schedulers. It is an interesting open question whether this background scheduler technique can also be used to transform algorithms with amortized running time bounds into algorithms with worst-case running time bounds.","lang":"eng"}],"title":"Deterministic near-optimal approximation algorithms for dynamic set cover","intvolume":"        52","type":"journal_article","article_processing_charge":"No","issue":"5","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grants 715672 and\r\n101019564 ``The Design of Modern Fully Dynamic Data Structures (MoDynStruct)\"\") and from the Engineering and Physical Sciences Research Council, UK (EPSRC) under grant EP/S03353X/1. The second author was also supported by the Austrian Science Fund (FWF) project ``Fast Algorithms for a Reactive Network Layer (ReactNet),\"\" P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020--2024, project ``Static and Dynamic Hierarchical Graph Decompositions,\"\"I 5982-N, and project Z 422-N. The third author was also supported by the Swedish Research Council (Reg. No. 2015-04659). The fourth author was also supported by the Science and Technology Development Fund (FDCT), Macau SAR (file 0014/2022/AFJ, 0085/2022/A, 0143/2020/A3, and SKL-IOTSC-2021-2023)."},{"doi":"10.1007/978-3-031-45329-8_17","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_published":"2023-10-22T00:00:00Z","external_id":{"arxiv":["2210.05304"],"isi":["001456127300017"]},"publication_identifier":{"isbn":["9783031453281"],"issn":["0302-9743"],"eissn":["1611-3349"]},"status":"public","publisher":"Springer Nature","quality_controlled":"1","isi":1,"citation":{"ama":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. Learning provably stabilizing neural controllers for discrete-time stochastic systems. In: <i>21st International Symposium on Automated Technology for Verification and Analysis</i>. Vol 14215. Springer Nature; 2023:357-379. doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>","ista":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379.","mla":"Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>.","short":"M. Ansaripour, K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, 21st International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2023, pp. 357–379.","ieee":"M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.","apa":"Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In <i>21st International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>","chicago":"Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, 14215:357–79. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>."},"author":[{"last_name":"Ansaripour","full_name":"Ansaripour, Matin","first_name":"Matin"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"full_name":"Zikelic, Dorde","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"page":"357-379","_id":"14559","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","corr_author":"1","day":"22","date_created":"2023-11-19T23:00:56Z","ec_funded":1,"oa":1,"publication_status":"published","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"volume":14215,"conference":{"name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2023-10-24","location":"Singapore, Singapore","end_date":"2023-10-27"},"fulldoi":"https://doi.org/10.1007/978-3-031-45329-8_17","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"     14215","title":"Learning provably stabilizing neural controllers for discrete-time stochastic systems","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2210.05304"}],"abstract":[{"text":"We consider the problem of learning control policies in discrete-time stochastic systems which guarantee that the system stabilizes within some specified stabilization region with probability 1. Our approach is based on the novel notion of stabilizing ranking supermartingales (sRSMs) that we introduce in this work. Our sRSMs overcome the limitation of methods proposed in previous works whose applicability is restricted to systems in which the stabilizing region cannot be left once entered under any control policy. We present a learning procedure that learns a control policy together with an sRSM that formally certifies probability 1 stability, both learned as neural networks. We show that this procedure can also be adapted to formally verifying that, under a given Lipschitz continuous control policy, the stochastic system stabilizes within some stabilizing region with probability 1. Our experimental evaluation shows that our learning procedure can successfully learn provably stabilizing policies in practice.","lang":"eng"}],"year":"2023","publication":"21st International Symposium on Automated Technology for Verification and Analysis","month":"10","alternative_title":["LNCS"],"date_updated":"2025-09-09T13:20:26Z","arxiv":1,"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","article_processing_charge":"No","type":"conference"}]