[{"volume":151,"date_created":"2023-07-02T22:00:43Z","date_updated":"2023-11-14T13:07:09Z","author":[{"full_name":"Hua, Bobo","last_name":"Hua","first_name":"Bobo"},{"last_name":"Keller","first_name":"Matthias","full_name":"Keller, Matthias"},{"full_name":"Schwarz, Michael","first_name":"Michael","last_name":"Schwarz"},{"full_name":"Wirth, Melchior","orcid":"0000-0002-0519-4241","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth","first_name":"Melchior"}],"publisher":"American Mathematical Society","department":[{"_id":"JaMa"}],"publication_status":"published","acknowledgement":"The second author was supported by the priority program SPP2026 of the German Research Foundation (DFG). The fourth author was supported by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes) and by the German Research Foundation (DFG) via RTG 1523/2.","year":"2023","publication_identifier":{"issn":["0002-9939"],"eissn":["1088-6826"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.1090/proc/14361","quality_controlled":"1","isi":1,"external_id":{"isi":["000988204400001"],"arxiv":["1804.08353"]},"oa":1,"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1804.08353","open_access":"1"}],"issue":"8","abstract":[{"lang":"eng","text":"In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the associated operators on these graphs display similarities to elliptic operators on bounded domains in the continuum. Specifically, we prove lower bounds on the eigenvalue growth and show by examples that corresponding upper bounds cannot be established."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 151","status":"public","title":"Sobolev-type inequalities and eigenvalue growth on graphs with finite measure","_id":"13177","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2023-08-01T00:00:00Z","page":"3401-3414","article_type":"original","citation":{"short":"B. Hua, M. Keller, M. Schwarz, M. Wirth, Proceedings of the American Mathematical Society 151 (2023) 3401–3414.","mla":"Hua, Bobo, et al. “Sobolev-Type Inequalities and Eigenvalue Growth on Graphs with Finite Measure.” Proceedings of the American Mathematical Society, vol. 151, no. 8, American Mathematical Society, 2023, pp. 3401–14, doi:10.1090/proc/14361.","chicago":"Hua, Bobo, Matthias Keller, Michael Schwarz, and Melchior Wirth. “Sobolev-Type Inequalities and Eigenvalue Growth on Graphs with Finite Measure.” Proceedings of the American Mathematical Society. American Mathematical Society, 2023. https://doi.org/10.1090/proc/14361.","ama":"Hua B, Keller M, Schwarz M, Wirth M. Sobolev-type inequalities and eigenvalue growth on graphs with finite measure. Proceedings of the American Mathematical Society. 2023;151(8):3401-3414. doi:10.1090/proc/14361","apa":"Hua, B., Keller, M., Schwarz, M., & Wirth, M. (2023). Sobolev-type inequalities and eigenvalue growth on graphs with finite measure. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/14361","ieee":"B. Hua, M. Keller, M. Schwarz, and M. Wirth, “Sobolev-type inequalities and eigenvalue growth on graphs with finite measure,” Proceedings of the American Mathematical Society, vol. 151, no. 8. American Mathematical Society, pp. 3401–3414, 2023.","ista":"Hua B, Keller M, Schwarz M, Wirth M. 2023. Sobolev-type inequalities and eigenvalue growth on graphs with finite measure. Proceedings of the American Mathematical Society. 151(8), 3401–3414."},"publication":"Proceedings of the American Mathematical Society"},{"ec_funded":1,"publisher":"Society for Industrial and Applied Mathematics","department":[{"_id":"MoHe"}],"publication_status":"published","year":"2023","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).","volume":52,"date_updated":"2023-11-20T08:21:07Z","date_created":"2023-11-19T23:00:56Z","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"},{"full_name":"Wu, Xiaowei","first_name":"Xiaowei","last_name":"Wu"}],"publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"month":"10","project":[{"name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564"},{"grant_number":"P33775 ","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Wittgenstein Award - Monika Henzinger"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1137/21M1428649","type":"journal_article","issue":"5","abstract":[{"lang":"eng","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."}],"intvolume":" 52","title":"Deterministic near-optimal approximation algorithms for dynamic set cover","status":"public","_id":"14558","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","scopus_import":"1","article_processing_charge":"No","day":"01","page":"1132-1192","article_type":"original","citation":{"ama":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. 2023;52(5):1132-1192. doi:10.1137/21M1428649","ista":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. 2023. Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. 52(5), 1132–1192.","apa":"Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Wu, X. (2023). Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1428649","ieee":"S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Deterministic near-optimal approximation algorithms for dynamic set cover,” SIAM Journal on Computing, vol. 52, no. 5. Society for Industrial and Applied Mathematics, pp. 1132–1192, 2023.","mla":"Bhattacharya, Sayan, et al. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.” SIAM Journal on Computing, vol. 52, no. 5, Society for Industrial and Applied Mathematics, 2023, pp. 1132–92, doi:10.1137/21M1428649.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, SIAM Journal on Computing 52 (2023) 1132–1192.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/21M1428649."},"publication":"SIAM Journal on Computing","date_published":"2023-10-01T00:00:00Z"},{"volume":14215,"date_updated":"2023-11-20T08:30:20Z","date_created":"2023-11-19T23:00:56Z","author":[{"full_name":"Ansaripour, Matin","first_name":"Matin","last_name":"Ansaripour"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer Nature","publication_status":"published","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.","year":"2023","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-45329-8_17","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2023-10-27","start_date":"2023-10-24","location":"Singapore, Singapore"},"project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031453281"],"eissn":["1611-3349"]},"month":"10","oa_version":"None","intvolume":" 14215","title":"Learning provably stabilizing neural controllers for discrete-time stochastic systems","status":"public","_id":"14559","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2023-10-22T00:00:00Z","page":"357-379","citation":{"chicago":"Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In 21st International Symposium on Automated Technology for Verification and Analysis, 14215:357–79. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-45329-8_17.","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.","mla":"Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” 21st International Symposium on Automated Technology for Verification and Analysis, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:10.1007/978-3-031-45329-8_17.","apa":"Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In 21st International Symposium on Automated Technology for Verification and Analysis (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. https://doi.org/10.1007/978-3-031-45329-8_17","ieee":"M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in 21st International Symposium on Automated Technology for Verification and Analysis, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.","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.","ama":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. Learning provably stabilizing neural controllers for discrete-time stochastic systems. In: 21st International Symposium on Automated Technology for Verification and Analysis. Vol 14215. Springer Nature; 2023:357-379. doi:10.1007/978-3-031-45329-8_17"},"publication":"21st International Symposium on Automated Technology for Verification and Analysis","article_processing_charge":"No","day":"22","scopus_import":"1"},{"abstract":[{"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.","lang":"eng"}],"issue":"5","type":"journal_article","file":[{"file_id":"14560","relation":"main_file","success":1,"checksum":"3aef1475b1882c8dec112df9a5167c39","date_created":"2023-11-20T08:34:57Z","date_updated":"2023-11-20T08:34:57Z","access_level":"open_access","file_name":"2023_ESAIM_Cornalba.pdf","creator":"dernst","content_type":"application/pdf","file_size":1508534}],"oa_version":"Published Version","_id":"14554","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The regularised inertial Dean' Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime","status":"public","ddc":["510"],"intvolume":" 57","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","date_published":"2023-09-01T00:00:00Z","publication":"ESAIM: Mathematical Modelling and Numerical Analysis","citation":{"short":"F. Cornalba, T. Shardlow, ESAIM: Mathematical Modelling and Numerical Analysis 57 (2023) 3061–3090.","mla":"Cornalba, Federico, and Tony Shardlow. “The Regularised Inertial Dean’ Kawasaki Equation: Discontinuous Galerkin Approximation and Modelling for Low-Density Regime.” ESAIM: Mathematical Modelling and Numerical Analysis, vol. 57, no. 5, EDP Sciences, 2023, pp. 3061–90, doi:10.1051/m2an/2023077.","chicago":"Cornalba, Federico, and Tony Shardlow. “The Regularised Inertial Dean’ Kawasaki Equation: Discontinuous Galerkin Approximation and Modelling for Low-Density Regime.” ESAIM: Mathematical Modelling and Numerical Analysis. EDP Sciences, 2023. https://doi.org/10.1051/m2an/2023077.","ama":"Cornalba F, Shardlow T. The regularised inertial Dean’ Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime. ESAIM: Mathematical Modelling and Numerical Analysis. 2023;57(5):3061-3090. doi:10.1051/m2an/2023077","apa":"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. EDP Sciences. https://doi.org/10.1051/m2an/2023077","ieee":"F. Cornalba and T. Shardlow, “The regularised inertial Dean’ Kawasaki equation: Discontinuous Galerkin approximation and modelling for low-density regime,” ESAIM: Mathematical Modelling and Numerical Analysis, vol. 57, no. 5. EDP Sciences, pp. 3061–3090, 2023.","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."},"article_type":"original","page":"3061-3090","file_date_updated":"2023-11-20T08:34:57Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","author":[{"last_name":"Cornalba","first_name":"Federico","orcid":"0000-0002-6269-5149","id":"2CEB641C-A400-11E9-A717-D712E6697425","full_name":"Cornalba, Federico"},{"first_name":"Tony","last_name":"Shardlow","full_name":"Shardlow, Tony"}],"related_material":{"link":[{"url":"https://github.com/tonyshardlow/RIDK-FD","relation":"software"}]},"date_updated":"2023-11-20T08:38:47Z","date_created":"2023-11-19T23:00:55Z","volume":57,"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).","year":"2023","publication_status":"published","department":[{"_id":"JuFi"}],"publisher":"EDP Sciences","month":"09","publication_identifier":{"eissn":["2804-7214"],"issn":["2822-7840"]},"doi":"10.1051/m2an/2023077","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}]},{"type":"journal_article","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14556","title":"How chromosomal inversions reorient the evolutionary process","status":"public","ddc":["570"],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"08","citation":{"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., 14242.","ieee":"E. L. Berdan et al., “How chromosomal inversions reorient the evolutionary process,” Journal of Evolutionary Biology. 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. Journal of Evolutionary Biology. Wiley. https://doi.org/10.1111/jeb.14242","ama":"Berdan EL, Barton NH, Butlin R, et al. How chromosomal inversions reorient the evolutionary process. Journal of Evolutionary Biology. 2023. doi:10.1111/jeb.14242","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.” Journal of Evolutionary Biology. Wiley, 2023. https://doi.org/10.1111/jeb.14242.","mla":"Berdan, Emma L., et al. “How Chromosomal Inversions Reorient the Evolutionary Process.” Journal of Evolutionary Biology, 14242, Wiley, 2023, doi:10.1111/jeb.14242.","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 (2023)."},"publication":"Journal of Evolutionary Biology","article_type":"review","date_published":"2023-11-08T00:00:00Z","article_number":"14242","license":"https://creativecommons.org/licenses/by-nc/4.0/","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.","year":"2023","department":[{"_id":"NiBa"}],"publisher":"Wiley","publication_status":"epub_ahead","author":[{"full_name":"Berdan, Emma L.","first_name":"Emma L.","last_name":"Berdan"},{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"full_name":"Butlin, Roger","last_name":"Butlin","first_name":"Roger"},{"last_name":"Charlesworth","first_name":"Brian","full_name":"Charlesworth, Brian"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"last_name":"Fragata","first_name":"Inês","full_name":"Fragata, Inês"},{"full_name":"Gilbert, Kimberly J.","first_name":"Kimberly J.","last_name":"Gilbert"},{"last_name":"Jay","first_name":"Paul","full_name":"Jay, Paul"},{"last_name":"Kapun","first_name":"Martin","full_name":"Kapun, Martin"},{"full_name":"Lotterhos, Katie E.","last_name":"Lotterhos","first_name":"Katie E."},{"last_name":"Mérot","first_name":"Claire","full_name":"Mérot, Claire"},{"full_name":"Durmaz Mitchell, Esra","first_name":"Esra","last_name":"Durmaz Mitchell"},{"full_name":"Pascual, Marta","first_name":"Marta","last_name":"Pascual"},{"last_name":"Peichel","first_name":"Catherine L.","full_name":"Peichel, Catherine L."},{"last_name":"Rafajlović","first_name":"Marina","full_name":"Rafajlović, Marina"},{"first_name":"Anja M","last_name":"Westram","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M"},{"full_name":"Schaeffer, Stephen W.","first_name":"Stephen W.","last_name":"Schaeffer"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"},{"full_name":"Flatt, Thomas","last_name":"Flatt","first_name":"Thomas"}],"date_updated":"2023-11-20T08:51:09Z","date_created":"2023-11-19T23:00:55Z","publication_identifier":{"eissn":["1420-9101"],"issn":["1010-061X"]},"month":"11","tmp":{"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","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"main_file_link":[{"url":"https://doi.org/10.1111/jeb.14242","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1111/jeb.14242","language":[{"iso":"eng"}]}]