[{"oa_version":"None","abstract":[{"lang":"eng","text":"Animals exhibit a variety of behavioural defences against socially transmitted parasites. These defences evolved to increase host fitness by avoiding, resisting or tolerating infection.\r\nBecause they can occur in both infected individuals and their uninfected social partners, these defences often have important consequences for the social group.\r\nHere, we discuss the evolution and ecology of anti-parasite behavioural defences across a taxonomically wide social spectrum, considering colonial groups, stable groups, transitional groups and solitary animals.\r\nWe discuss avoidance, resistance and tolerance behaviours across these social group structures, identifying how social complexity, group composition and interdependent social relationships may contribute to the expression and evolution of behavioural strategies.\r\nFinally, we outline avenues for further investigation such as approaches to quantify group-level responses, and the connection of the physiological and behavioural response to parasites in different social contexts."}],"month":"04","intvolume":" 37","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1365-2435"],"issn":["0269-8463"]},"publication_status":"published","volume":37,"issue":"4","_id":"12765","status":"public","article_type":"review","type":"journal_article","date_updated":"2023-10-04T11:50:15Z","department":[{"_id":"SyCr"}],"publisher":"British Ecological Society","quality_controlled":"1","day":"01","publication":"Functional Ecology","isi":1,"year":"2023","doi":"10.1111/1365-2435.14310","date_published":"2023-04-01T00:00:00Z","date_created":"2023-03-26T22:01:09Z","page":"809-820","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Stockmaier, Sebastian, Yuko Ulrich, Gregory F. Albery, Sylvia Cremer, and Patricia C. Lopes. “Behavioural Defences against Parasites across Host Social Structures.” Functional Ecology. British Ecological Society, 2023. https://doi.org/10.1111/1365-2435.14310.","ista":"Stockmaier S, Ulrich Y, Albery GF, Cremer S, Lopes PC. 2023. Behavioural defences against parasites across host social structures. Functional Ecology. 37(4), 809–820.","mla":"Stockmaier, Sebastian, et al. “Behavioural Defences against Parasites across Host Social Structures.” Functional Ecology, vol. 37, no. 4, British Ecological Society, 2023, pp. 809–20, doi:10.1111/1365-2435.14310.","ama":"Stockmaier S, Ulrich Y, Albery GF, Cremer S, Lopes PC. Behavioural defences against parasites across host social structures. Functional Ecology. 2023;37(4):809-820. doi:10.1111/1365-2435.14310","apa":"Stockmaier, S., Ulrich, Y., Albery, G. F., Cremer, S., & Lopes, P. C. (2023). Behavioural defences against parasites across host social structures. Functional Ecology. British Ecological Society. https://doi.org/10.1111/1365-2435.14310","ieee":"S. Stockmaier, Y. Ulrich, G. F. Albery, S. Cremer, and P. C. Lopes, “Behavioural defences against parasites across host social structures,” Functional Ecology, vol. 37, no. 4. British Ecological Society, pp. 809–820, 2023.","short":"S. Stockmaier, Y. Ulrich, G.F. Albery, S. Cremer, P.C. Lopes, Functional Ecology 37 (2023) 809–820."},"title":"Behavioural defences against parasites across host social structures","author":[{"full_name":"Stockmaier, Sebastian","last_name":"Stockmaier","first_name":"Sebastian"},{"full_name":"Ulrich, Yuko","last_name":"Ulrich","first_name":"Yuko"},{"first_name":"Gregory F.","last_name":"Albery","full_name":"Albery, Gregory F."},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"},{"last_name":"Lopes","full_name":"Lopes, Patricia C.","first_name":"Patricia C."}],"external_id":{"isi":["000948940500001"]},"article_processing_charge":"No"},{"publication":"Discrete Mathematics","day":"01","year":"2023","date_created":"2023-02-26T23:01:00Z","doi":"10.1016/j.disc.2023.113363","date_published":"2023-06-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Ivanov G, Köse S. 2023. Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 346(6), 113363.","chicago":"Ivanov, Grigory, and Seyda Köse. “Erdős-Ko-Rado and Hilton-Milner Theorems for Two-Forms.” Discrete Mathematics. Elsevier, 2023. https://doi.org/10.1016/j.disc.2023.113363.","apa":"Ivanov, G., & Köse, S. (2023). Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2023.113363","ama":"Ivanov G, Köse S. Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 2023;346(6). doi:10.1016/j.disc.2023.113363","ieee":"G. Ivanov and S. Köse, “Erdős-Ko-Rado and Hilton-Milner theorems for two-forms,” Discrete Mathematics, vol. 346, no. 6. Elsevier, 2023.","short":"G. Ivanov, S. Köse, Discrete Mathematics 346 (2023).","mla":"Ivanov, Grigory, and Seyda Köse. “Erdős-Ko-Rado and Hilton-Milner Theorems for Two-Forms.” Discrete Mathematics, vol. 346, no. 6, 113363, Elsevier, 2023, doi:10.1016/j.disc.2023.113363."},"title":"Erdős-Ko-Rado and Hilton-Milner theorems for two-forms","article_processing_charge":"No","external_id":{"arxiv":["2201.10892"]},"author":[{"id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","first_name":"Grigory","full_name":"Ivanov, Grigory","last_name":"Ivanov"},{"full_name":"Köse, Seyda","last_name":"Köse","first_name":"Seyda","id":"8ba3170d-dc85-11ea-9058-c4251c96a6eb"}],"article_number":"113363","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0012-365X"]},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"13331"}]},"volume":346,"issue":"6","oa_version":"Preprint","abstract":[{"text":"The celebrated Erdős–Ko–Rado theorem about the maximal size of an intersecting family of r-element subsets of was extended to the setting of exterior algebra in [5, Theorem 2.3] and in [6, Theorem 1.4]. However, the equality case has not been settled yet. In this short note, we show that the extension of the Erdős–Ko–Rado theorem and the characterization of the equality case therein, as well as those of the Hilton–Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms follow from a folklore puzzle about possible arrangements of an intersecting family of lines.","lang":"eng"}],"intvolume":" 346","month":"06","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2201.10892","open_access":"1"}],"scopus_import":"1","date_updated":"2023-10-04T11:54:57Z","department":[{"_id":"UlWa"},{"_id":"GradSch"}],"_id":"12680","status":"public","type":"journal_article","article_type":"letter_note"},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"We are grateful to the authors of [25] for sharing with us their insights and preliminary numerical results. We are especially thankful to Stephen Shenker for very valuable advice over several email communications. Helpful comments on the manuscript from Peter Forrester and from the anonymous referees are also acknowledged.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nLászló Erdős: Partially supported by ERC Advanced Grant \"RMTBeyond\" No. 101020331. Dominik Schröder: Supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation.","doi":"10.1007/s00220-023-04692-y","date_published":"2023-07-01T00:00:00Z","date_created":"2023-04-02T22:01:11Z","page":"1665-1700","day":"01","publication":"Communications in Mathematical Physics","isi":1,"has_accepted_license":"1","year":"2023","project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020"}],"title":"On the spectral form factor for random matrices","author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000957343500001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). On the spectral form factor for random matrices. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-023-04692-y","ama":"Cipolloni G, Erdös L, Schröder DJ. On the spectral form factor for random matrices. Communications in Mathematical Physics. 2023;401:1665-1700. doi:10.1007/s00220-023-04692-y","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Communications in Mathematical Physics 401 (2023) 1665–1700.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “On the spectral form factor for random matrices,” Communications in Mathematical Physics, vol. 401. Springer Nature, pp. 1665–1700, 2023.","mla":"Cipolloni, Giorgio, et al. “On the Spectral Form Factor for Random Matrices.” Communications in Mathematical Physics, vol. 401, Springer Nature, 2023, pp. 1665–700, doi:10.1007/s00220-023-04692-y.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2023. On the spectral form factor for random matrices. Communications in Mathematical Physics. 401, 1665–1700.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “On the Spectral Form Factor for Random Matrices.” Communications in Mathematical Physics. Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04692-y."},"month":"07","intvolume":" 401","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In the physics literature the spectral form factor (SFF), the squared Fourier transform of the empirical eigenvalue density, is the most common tool to test universality for disordered quantum systems, yet previous mathematical results have been restricted only to two exactly solvable models (Forrester in J Stat Phys 183:33, 2021. https://doi.org/10.1007/s10955-021-02767-5, Commun Math Phys 387:215–235, 2021. https://doi.org/10.1007/s00220-021-04193-w). We rigorously prove the physics prediction on SFF up to an intermediate time scale for a large class of random matrices using a robust method, the multi-resolvent local laws. Beyond Wigner matrices we also consider the monoparametric ensemble and prove that universality of SFF can already be triggered by a single random parameter, supplementing the recently proven Wigner–Dyson universality (Cipolloni et al. in Probab Theory Relat Fields, 2021. https://doi.org/10.1007/s00440-022-01156-7) to larger spectral scales. Remarkably, extensive numerics indicates that our formulas correctly predict the SFF in the entire slope-dip-ramp regime, as customarily called in physics."}],"volume":401,"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14397","checksum":"72057940f76654050ca84a221f21786c","success":1,"creator":"dernst","date_updated":"2023-10-04T12:09:18Z","file_size":859967,"date_created":"2023-10-04T12:09:18Z","file_name":"2023_CommMathPhysics_Cipolloni.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"publication_status":"published","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"12792","department":[{"_id":"LaEr"}],"file_date_updated":"2023-10-04T12:09:18Z","ddc":["510"],"date_updated":"2023-10-04T12:10:31Z"},{"year":"2023","isi":1,"has_accepted_license":"1","publication":"Discrete and Computational Geometry","day":"01","page":"376-405","date_created":"2023-03-05T23:01:06Z","date_published":"2023-09-01T00:00:00Z","doi":"10.1007/s00454-022-00476-8","acknowledgement":"We thank the anonymous reviewers for many helpful comments and suggestions, which led to substantial improvements of the paper. The first two authors were supported by the Austrian Science Fund (FWF) grant number P 29984-N35 and W1230. The first author was partly supported by an Austrian Marshall Plan Scholarship, and by the Brummer & Partners MathDataLab. A conference version of this paper was presented at the 37th International Symposium on Computational Geometry (SoCG 2021). Open access funding provided by the Royal Institute of Technology.","oa":1,"quality_controlled":"1","publisher":"Springer Nature","citation":{"ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2023. Computing the multicover bifiltration. Discrete and Computational Geometry. 70, 376–405.","chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00476-8.","apa":"Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2023). Computing the multicover bifiltration. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00476-8","ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. Discrete and Computational Geometry. 2023;70:376-405. doi:10.1007/s00454-022-00476-8","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 376–405, 2023.","short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, Discrete and Computational Geometry 70 (2023) 376–405.","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 376–405, doi:10.1007/s00454-022-00476-8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2103.07823"],"isi":["000936496800001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Corbet","full_name":"Corbet, René","first_name":"René"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"},{"first_name":"Michael","last_name":"Lesnick","full_name":"Lesnick, Michael"},{"last_name":"Osang","orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"title":"Computing the multicover bifiltration","publication_status":"published","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"12715","checksum":"71ce7e59f7ee4620acc704fecca620c2","success":1,"creator":"cchlebak","date_updated":"2023-03-07T14:40:14Z","file_size":1359323,"date_created":"2023-03-07T14:40:14Z","file_name":"2023_DisCompGeo_Corbet.pdf"}],"volume":70,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"9605"}]},"abstract":[{"lang":"eng","text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 70","month":"09","date_updated":"2023-10-04T12:03:40Z","ddc":["000"],"department":[{"_id":"HeEd"}],"file_date_updated":"2023-03-07T14:40:14Z","_id":"12709","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public"},{"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"ec_funded":1,"volume":7,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Kleinjohann (Archiv der Mathematik 35(1):574–582, 1980; Mathematische Zeitschrift 176(3), 327–344, 1981) and Bangert (Archiv der Mathematik 38(1):54–57, 1982) extended the reach rch(S) from subsets S of Euclidean space to the reach rchM(S) of subsets S of Riemannian manifolds M, where M is smooth (we’ll assume at least C3). Bangert showed that sets of positive reach in Euclidean space and Riemannian manifolds are very similar. In this paper we introduce a slight variant of Kleinjohann’s and Bangert’s extension and quantify the similarity between sets of positive reach in Euclidean space and Riemannian manifolds in a new way: Given p∈M and q∈S, we bound the local feature size (a local version of the reach) of its lifting to the tangent space via the inverse exponential map (exp−1p(S)) at q, assuming that rchM(S) and the geodesic distance dM(p,q) are bounded. These bounds are motivated by the importance of the reach and local feature size to manifold learning, topological inference, and triangulating manifolds and the fact that intrinsic approaches circumvent the curse of dimensionality."}],"intvolume":" 7","month":"09","main_file_link":[{"open_access":"1","url":"https://inserm.hal.science/INRIA-SACLAY/hal-04083524v1"}],"scopus_import":"1","date_updated":"2023-10-04T12:07:18Z","department":[{"_id":"HeEd"}],"_id":"12763","status":"public","type":"journal_article","article_type":"original","publication":"Journal of Applied and Computational Topology","day":"01","year":"2023","date_created":"2023-03-26T22:01:08Z","doi":"10.1007/s41468-023-00116-x","date_published":"2023-09-01T00:00:00Z","page":"619-641","acknowledgement":"We thank Eddie Aamari, David Cohen-Steiner, Isa Costantini, Fred Chazal, Ramsay Dyer, André Lieutier, and Alef Sterk for discussion and Pierre Pansu for encouragement. We further acknowledge the anonymous reviewers whose comments helped improve the exposition.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). The first author is further supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. The second author is supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 and the Austrian science fund (FWF) M-3073.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Boissonnat JD, Wintraecken M. 2023. The reach of subsets of manifolds. Journal of Applied and Computational Topology. 7, 619–641.","chicago":"Boissonnat, Jean Daniel, and Mathijs Wintraecken. “The Reach of Subsets of Manifolds.” Journal of Applied and Computational Topology. Springer Nature, 2023. https://doi.org/10.1007/s41468-023-00116-x.","apa":"Boissonnat, J. D., & Wintraecken, M. (2023). The reach of subsets of manifolds. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-023-00116-x","ama":"Boissonnat JD, Wintraecken M. The reach of subsets of manifolds. Journal of Applied and Computational Topology. 2023;7:619-641. doi:10.1007/s41468-023-00116-x","ieee":"J. D. Boissonnat and M. Wintraecken, “The reach of subsets of manifolds,” Journal of Applied and Computational Topology, vol. 7. Springer Nature, pp. 619–641, 2023.","short":"J.D. Boissonnat, M. Wintraecken, Journal of Applied and Computational Topology 7 (2023) 619–641.","mla":"Boissonnat, Jean Daniel, and Mathijs Wintraecken. “The Reach of Subsets of Manifolds.” Journal of Applied and Computational Topology, vol. 7, Springer Nature, 2023, pp. 619–41, doi:10.1007/s41468-023-00116-x."},"title":"The reach of subsets of manifolds","article_processing_charge":"No","author":[{"first_name":"Jean Daniel","last_name":"Boissonnat","full_name":"Boissonnat, Jean Daniel"},{"last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}]},{"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"article_number":"17","author":[{"full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac","full_name":"Sarac, Naci E"}],"external_id":{"arxiv":["2307.06016"]},"article_processing_charge":"No","title":"Safety and liveness of quantitative automata","citation":{"mla":"Boker, Udi, et al. “Safety and Liveness of Quantitative Automata.” 34th International Conference on Concurrency Theory, vol. 279, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.17.","short":"U. Boker, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness of quantitative automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279.","ama":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.17","apa":"Boker, U., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Safety and liveness of quantitative automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17","chicago":"Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17.","ista":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness of quantitative automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"We thank Christof Löding for pointing us to some results on PSpace-hardess of universality problems and the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093 and the Israel Science Foundation grant 2410/22.","date_published":"2023-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2023.17","date_created":"2023-07-14T10:00:15Z","has_accepted_license":"1","year":"2023","day":"01","publication":"34th International Conference on Concurrency Theory","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2023-09-18","end_date":"2023-09-23","location":"Antwerp, Belgium","name":"CONCUR: Conference on Concurrency Theory"},"status":"public","_id":"13221","file_date_updated":"2023-07-14T12:03:48Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2023-10-09T07:14:03Z","ddc":["000"],"alternative_title":["LIPIcs"],"month":"09","intvolume":" 279","abstract":[{"text":"The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications.","lang":"eng"}],"oa_version":"Published Version","volume":279,"ec_funded":1,"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772990"]},"publication_status":"published","file":[{"date_updated":"2023-07-14T12:03:48Z","file_size":755529,"creator":"esarac","date_created":"2023-07-14T12:03:48Z","file_name":"CONCUR23.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"d40e57a04448ea5c77d7e1cfb9590a81","file_id":"13224","success":1}],"language":[{"iso":"eng"}]},{"title":"Generalized surface multifractality in two-dimensional disordered systems","article_processing_charge":"No","external_id":{"arxiv":["2306.09455"]},"author":[{"first_name":"Serafim","id":"41e64307-6672-11ee-b9ad-cc7a0075a479","last_name":"Babkin","full_name":"Babkin, Serafim","orcid":"0009-0003-7382-8036"},{"full_name":"Karcher, Jonas F.","last_name":"Karcher","first_name":"Jonas F."},{"full_name":"Burmistrov, Igor S.","last_name":"Burmistrov","first_name":"Igor S."},{"last_name":"Mirlin","full_name":"Mirlin, Alexander D.","first_name":"Alexander D."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Babkin, S., Karcher, J. F., Burmistrov, I. S., & Mirlin, A. D. (2023). Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.108.104205","ama":"Babkin S, Karcher JF, Burmistrov IS, Mirlin AD. Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. 2023;108(10). doi:10.1103/PhysRevB.108.104205","ieee":"S. Babkin, J. F. Karcher, I. S. Burmistrov, and A. D. Mirlin, “Generalized surface multifractality in two-dimensional disordered systems,” Physical Review B, vol. 108, no. 10. American Physical Society, 2023.","short":"S. Babkin, J.F. Karcher, I.S. Burmistrov, A.D. Mirlin, Physical Review B 108 (2023).","mla":"Babkin, Serafim, et al. “Generalized Surface Multifractality in Two-Dimensional Disordered Systems.” Physical Review B, vol. 108, no. 10, 104205, American Physical Society, 2023, doi:10.1103/PhysRevB.108.104205.","ista":"Babkin S, Karcher JF, Burmistrov IS, Mirlin AD. 2023. Generalized surface multifractality in two-dimensional disordered systems. Physical Review B. 108(10), 104205.","chicago":"Babkin, Serafim, Jonas F. Karcher, Igor S. Burmistrov, and Alexander D. Mirlin. “Generalized Surface Multifractality in Two-Dimensional Disordered Systems.” Physical Review B. American Physical Society, 2023. https://doi.org/10.1103/PhysRevB.108.104205."},"article_number":"104205","date_created":"2023-10-08T22:01:17Z","date_published":"2023-09-01T00:00:00Z","doi":"10.1103/PhysRevB.108.104205","publication":"Physical Review B","day":"01","year":"2023","oa":1,"quality_controlled":"1","publisher":"American Physical Society","acknowledgement":"We thank Ilya Gruzberg for many illuminating discussions. S.S.B., J.F.K., and A.D.M. acknowledge support by the Deutsche Forschungsgemeinschaft (DFG) via the Grant\r\nNo. MI 658/14-1. I.S.B. acknowledges support from Russian Science Foundation (Grant No. 22-42-04416).","department":[{"_id":"MaSe"}],"date_updated":"2023-10-09T07:09:30Z","status":"public","article_type":"original","type":"journal_article","_id":"14406","volume":108,"issue":"10","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"intvolume":" 108","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2306.09455"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"Recently, a concept of generalized multifractality, which characterizes fluctuations and correlations of critical eigenstates, was introduced and explored for all 10 symmetry classes of disordered systems. Here, by using the nonlinear sigma-model (\r\nNL\r\nσ\r\nM\r\n) field theory, we extend the theory of generalized multifractality to boundaries of systems at criticality. Our numerical simulations on two-dimensional systems of symmetry classes A, C, and AII fully confirm the analytical predictions of pure-scaling observables and Weyl symmetry relations between critical exponents of surface generalized multifractality. This demonstrates the validity of the \r\nNL\r\nσ\r\nM\r\n for the description of Anderson-localization critical phenomena, not only in the bulk but also on the boundary. The critical exponents strongly violate generalized parabolicity, in analogy with earlier results for the bulk, corroborating the conclusion that the considered Anderson-localization critical points are not described by conformal field theories. We further derive relations between generalized surface multifractal spectra and linear combinations of Lyapunov exponents of a strip in quasi-one-dimensional geometry, which hold under the assumption of invariance with respect to a logarithmic conformal map. Our numerics demonstrate that these relations hold with an excellent accuracy. Taken together, our results indicate an intriguing situation: the conformal invariance is broken but holds partially at critical points of Anderson localization.","lang":"eng"}]},{"alternative_title":["LNCS"],"quality_controlled":"1","publisher":"Springer Nature","scopus_import":"1","intvolume":" 14068","month":"08","abstract":[{"text":"This paper focuses on the implementation details of the baseline methods and a recent lightweight conditional model extrapolation algorithm LIMES [5] for streaming data under class-prior shift. LIMES achieves superior performance over the baseline methods, especially concerning the minimum-across-day accuracy, which is important for the users of the system. In this work, the key measures to facilitate reproducibility and enhance the credibility of the results are described.","lang":"eng"}],"oa_version":"None","page":"67-73","date_created":"2023-10-08T22:01:18Z","doi":"10.1007/978-3-031-40773-4_6","date_published":"2023-08-20T00:00:00Z","volume":14068,"publication_status":"published","year":"2023","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031407727"],"issn":["0302-9743"]},"publication":"International Workshop on Reproducible Research in Pattern Recognition","language":[{"iso":"eng"}],"day":"20","conference":{"location":"Montreal, Canada","end_date":"2022-08-21","start_date":"2022-08-21","name":"RRPR: Reproducible Research in Pattern Recognition"},"type":"conference","status":"public","_id":"14410","article_processing_charge":"No","author":[{"first_name":"Paulina","last_name":"Tomaszewska","full_name":"Tomaszewska, Paulina"},{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"department":[{"_id":"ChLa"}],"title":"On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift","date_updated":"2023-10-09T06:48:02Z","citation":{"short":"P. Tomaszewska, C. Lampert, in:, International Workshop on Reproducible Research in Pattern Recognition, Springer Nature, 2023, pp. 67–73.","ieee":"P. Tomaszewska and C. Lampert, “On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift,” in International Workshop on Reproducible Research in Pattern Recognition, Montreal, Canada, 2023, vol. 14068, pp. 67–73.","apa":"Tomaszewska, P., & Lampert, C. (2023). On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. In International Workshop on Reproducible Research in Pattern Recognition (Vol. 14068, pp. 67–73). Montreal, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-40773-4_6","ama":"Tomaszewska P, Lampert C. On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. In: International Workshop on Reproducible Research in Pattern Recognition. Vol 14068. Springer Nature; 2023:67-73. doi:10.1007/978-3-031-40773-4_6","mla":"Tomaszewska, Paulina, and Christoph Lampert. “On the Implementation of Baselines and Lightweight Conditional Model Extrapolation (LIMES) under Class-Prior Shift.” International Workshop on Reproducible Research in Pattern Recognition, vol. 14068, Springer Nature, 2023, pp. 67–73, doi:10.1007/978-3-031-40773-4_6.","ista":"Tomaszewska P, Lampert C. 2023. On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. International Workshop on Reproducible Research in Pattern Recognition. RRPR: Reproducible Research in Pattern Recognition, LNCS, vol. 14068, 67–73.","chicago":"Tomaszewska, Paulina, and Christoph Lampert. “On the Implementation of Baselines and Lightweight Conditional Model Extrapolation (LIMES) under Class-Prior Shift.” In International Workshop on Reproducible Research in Pattern Recognition, 14068:67–73. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-40773-4_6."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"file_date_updated":"2023-10-09T07:42:45Z","department":[{"_id":"ToHe"}],"date_updated":"2023-10-09T07:43:44Z","ddc":["000"],"conference":{"location":"Antwerp, Belgium","end_date":"2023-09-22","start_date":"2023-09-19","name":"CONCUR: Conference on Concurrency Theory"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","status":"public","_id":"14405","ec_funded":1,"volume":279,"publication_status":"published","publication_identifier":{"isbn":["9783959772990"],"issn":["18688969"]},"language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"14413","checksum":"215765e40454d806174ac0a223e8d6fa","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_LIPcs_Bartocci.pdf","date_created":"2023-10-09T07:42:45Z","creator":"dernst","file_size":795790,"date_updated":"2023-10-09T07:42:45Z"}],"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 279","month":"09","abstract":[{"text":"We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic formula specifies relations between sequences of variable values in different system executions. Unlike HyperLTL, hypernode logic takes an asynchronous view on execution traces by constraining the values and the order of value changes of each variable without correlating the timing of the changes. Different execution traces are synchronized solely through the transitions of hypernode automata. Hypernode automata naturally combine asynchronicity at the node level with synchronicity at the transition level. We show that the model-checking problem for hypernode automata is decidable over action-labeled Kripke structures, whose actions induce transitions of the specification automata. For this reason, hypernode automaton is a suitable formalism for specifying and verifying asynchronous hyperproperties, such as declassifying observational determinism in multi-threaded programs.","lang":"eng"}],"oa_version":"Published Version","external_id":{"arxiv":["2305.02836"]},"article_processing_charge":"Yes","author":[{"last_name":"Bartocci","full_name":"Bartocci, Ezio","first_name":"Ezio"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"first_name":"Ana","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4","last_name":"Oliveira da Costa","full_name":"Oliveira da Costa, Ana","orcid":"0000-0002-8741-5799"}],"title":"Hypernode automata","citation":{"ista":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. 2023. Hypernode automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 21.","chicago":"Bartocci, Ezio, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21.","short":"E. Bartocci, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"E. Bartocci, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279.","ama":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.21","apa":"Bartocci, E., Henzinger, T. A., Nickovic, D., & Oliveira da Costa, A. (2023). Hypernode automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21","mla":"Bartocci, Ezio, et al. “Hypernode Automata.” 34th International Conference on Concurrency Theory, vol. 279, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.21."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"article_number":"21","date_created":"2023-10-08T22:01:16Z","date_published":"2023-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2023.21","year":"2023","has_accepted_license":"1","publication":"34th International Conference on Concurrency Theory","day":"01","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project\r\nSpyCoDe F8502, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant\r\nVAMOS 101020093."},{"abstract":[{"lang":"eng","text":"We prove that the mesoscopic linear statistics ∑if(na(σi−z0)) of the eigenvalues {σi}i of large n×n non-Hermitian random matrices with complex centred i.i.d. entries are asymptotically Gaussian for any H20-functions f around any point z0 in the bulk of the spectrum on any mesoscopic scale 0Probability Theory and Related Fields. Springer Nature, 2023. https://doi.org/10.1007/s00440-023-01229-1.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2023. Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields.","mla":"Cipolloni, Giorgio, et al. “Mesoscopic Central Limit Theorem for Non-Hermitian Random Matrices.” Probability Theory and Related Fields, Springer Nature, 2023, doi:10.1007/s00440-023-01229-1.","ama":"Cipolloni G, Erdös L, Schröder DJ. Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields. 2023. doi:10.1007/s00440-023-01229-1","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). Mesoscopic central limit theorem for non-Hermitian random matrices. Probability Theory and Related Fields. Springer Nature. https://doi.org/10.1007/s00440-023-01229-1","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability Theory and Related Fields (2023).","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Mesoscopic central limit theorem for non-Hermitian random matrices,” Probability Theory and Related Fields. Springer Nature, 2023."},"date_updated":"2023-10-09T07:19:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2210.12060"]},"article_processing_charge":"No","author":[{"last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","last_name":"Schröder","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J"}],"title":"Mesoscopic central limit theorem for non-Hermitian random matrices","department":[{"_id":"LaEr"}]}]