[{"publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"corr_author":"1","arxiv":1,"ec_funded":1,"date_updated":"2025-09-09T13:12:02Z","title":"The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227"}],"publication_status":"published","isi":1,"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"},"date_published":"2023-11-01T00:00:00Z","external_id":{"arxiv":["2207.03156"],"isi":["001096217400007"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We study the Fröhlich polaron model in R3, and establish the subleading term in the strong coupling asymptotics of its ground state energy, corresponding to the quantum corrections to the classical energy determined by the Pekar approximation."}],"file":[{"file_name":"2023_CommMathPhysics_Brooks.pdf","date_created":"2023-10-31T12:21:39Z","success":1,"date_updated":"2023-10-31T12:21:39Z","creator":"dernst","access_level":"open_access","file_size":832375,"file_id":"14477","relation":"main_file","content_type":"application/pdf","checksum":"1ae49b39247cb6b40ff75997381581b8"}],"acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is acknowledged. Open access funding provided by Institute of Science and Technology (IST Austria).","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"M. Brooks, R. Seiringer, Communications in Mathematical Physics 404 (2023) 287–337.","chicago":"Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong Coupling: Part I - The Quantum Correction to the Classical Energy.” Communications in Mathematical Physics. Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04841-3.","apa":"Brooks, M., & Seiringer, R. (2023). The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-023-04841-3","mla":"Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong Coupling: Part I - The Quantum Correction to the Classical Energy.” Communications in Mathematical Physics, vol. 404, Springer Nature, 2023, pp. 287–337, doi:10.1007/s00220-023-04841-3.","ista":"Brooks M, Seiringer R. 2023. The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy. Communications in Mathematical Physics. 404, 287–337.","ama":"Brooks M, Seiringer R. The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy. Communications in Mathematical Physics. 2023;404:287-337. doi:10.1007/s00220-023-04841-3","ieee":"M. Brooks and R. Seiringer, “The Fröhlich Polaron at strong coupling: Part I - The quantum correction to the classical energy,” Communications in Mathematical Physics, vol. 404. Springer Nature, pp. 287–337, 2023."},"publication":"Communications in Mathematical Physics","oa":1,"month":"11","oa_version":"Published Version","status":"public","ddc":["510"],"_id":"14441","file_date_updated":"2023-10-31T12:21:39Z","scopus_import":"1","doi":"10.1007/s00220-023-04841-3","intvolume":" 404","author":[{"orcid":"0000-0002-6249-0928","full_name":"Brooks, Morris","last_name":"Brooks","first_name":"Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"date_created":"2023-10-22T22:01:13Z","volume":404,"article_type":"original","publisher":"Springer Nature","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"year":"2023","license":"https://creativecommons.org/licenses/by/4.0/","page":"287-337"},{"corr_author":"1","publication_identifier":{"issn":["1292-8941"],"eissn":["1292-895X"]},"arxiv":1,"date_published":"2023-10-01T00:00:00Z","external_id":{"arxiv":["2111.05952"],"pmid":["37819444"],"isi":["001187541900001"]},"isi":1,"publication_status":"published","title":"Mixtures of self-propelled particles interacting with asymmetric obstacles","date_updated":"2025-09-09T13:08:14Z","quality_controlled":"1","abstract":[{"lang":"eng","text":"In the presence of an obstacle, active particles condensate into a surface “wetting” layer due to persistent motion. If the obstacle is asymmetric, a rectification current arises in addition to wetting. Asymmetric geometries are therefore commonly used to concentrate microorganisms like bacteria and sperms. However, most studies neglect the fact that biological active matter is diverse, composed of individuals with distinct self-propulsions. Using simulations, we study a mixture of “fast” and “slow” active Brownian disks in two dimensions interacting with large half-disk obstacles. With this prototypical obstacle geometry, we analyze how the stationary collective behavior depends on the degree of self-propulsion “diversity,” defined as proportional to the difference between the self-propulsion speeds, while keeping the average self-propulsion speed fixed. A wetting layer rich in fast particles arises. The rectification current is amplified by speed diversity due to a superlinear dependence of rectification on self-propulsion speed, which arises from cooperative effects. Thus, the total rectification current cannot be obtained from an effective one-component active fluid with the same average self-propulsion speed, highlighting the importance of considering diversity in active matter."}],"OA_place":"repository","type":"journal_article","acknowledgement":"MR-V and RS are supported by Fondecyt Grant No. 1220536 and Millennium Science Initiative Program NCN19_170D of ANID, Chile. P.d.C. was supported by Scholarships Nos. 2021/10139-2 and 2022/13872-5 and ICTP-SAIFR Grant No. 2021/14335-0, all granted by São Paulo Research Foundation (FAPESP), Brazil.","pmid":1,"citation":{"short":"M.N. Rojas Vega, P. De Castro, R. Soto, The European Physical Journal E 46 (2023).","chicago":"Rojas Vega, Mauricio Nicolas, Pablo De Castro, and Rodrigo Soto. “Mixtures of Self-Propelled Particles Interacting with Asymmetric Obstacles.” The European Physical Journal E. Springer Nature, 2023. https://doi.org/10.1140/epje/s10189-023-00354-y.","apa":"Rojas Vega, M. N., De Castro, P., & Soto, R. (2023). Mixtures of self-propelled particles interacting with asymmetric obstacles. The European Physical Journal E. Springer Nature. https://doi.org/10.1140/epje/s10189-023-00354-y","mla":"Rojas Vega, Mauricio Nicolas, et al. “Mixtures of Self-Propelled Particles Interacting with Asymmetric Obstacles.” The European Physical Journal E, vol. 46, no. 10, 95, Springer Nature, 2023, doi:10.1140/epje/s10189-023-00354-y.","ista":"Rojas Vega MN, De Castro P, Soto R. 2023. Mixtures of self-propelled particles interacting with asymmetric obstacles. The European Physical Journal E. 46(10), 95.","ama":"Rojas Vega MN, De Castro P, Soto R. Mixtures of self-propelled particles interacting with asymmetric obstacles. The European Physical Journal E. 2023;46(10). doi:10.1140/epje/s10189-023-00354-y","ieee":"M. N. Rojas Vega, P. De Castro, and R. Soto, “Mixtures of self-propelled particles interacting with asymmetric obstacles,” The European Physical Journal E, vol. 46, no. 10. Springer Nature, 2023."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"The European Physical Journal E","month":"10","oa":1,"article_number":"95","_id":"14442","oa_version":"Preprint","status":"public","intvolume":" 46","doi":"10.1140/epje/s10189-023-00354-y","scopus_import":"1","volume":46,"date_created":"2023-10-22T22:01:13Z","author":[{"full_name":"Rojas Vega, Mauricio Nicolas","last_name":"Rojas Vega","first_name":"Mauricio Nicolas","id":"441e7207-f91f-11ec-b67c-9e6fe3d8fd6d"},{"full_name":"De Castro, Pablo","last_name":"De Castro","first_name":"Pablo"},{"first_name":"Rodrigo","last_name":"Soto","full_name":"Soto, Rodrigo"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2111.05952","open_access":"1"}],"day":"01","issue":"10","publisher":"Springer Nature","article_type":"original","department":[{"_id":"AnSa"}],"article_processing_charge":"No","year":"2023","language":[{"iso":"eng"}],"OA_type":"green"},{"publisher":"American Medical Association","article_type":"review","issue":"10","day":"01","article_processing_charge":"No","department":[{"_id":"GaNo"}],"language":[{"iso":"eng"}],"year":"2023","page":"1066-1074","month":"10","oa_version":"None","status":"public","_id":"14443","scopus_import":"1","doi":"10.1001/jamapsychiatry.2023.2996","intvolume":" 80","author":[{"last_name":"Schumann","full_name":"Schumann, Gunter","first_name":"Gunter"},{"first_name":"Ole A.","full_name":"Andreassen, Ole A.","last_name":"Andreassen"},{"first_name":"Tobias","full_name":"Banaschewski, Tobias","last_name":"Banaschewski"},{"last_name":"Calhoun","full_name":"Calhoun, Vince D.","first_name":"Vince D."},{"full_name":"Clinton, Nicholas","last_name":"Clinton","first_name":"Nicholas"},{"first_name":"Sylvane","full_name":"Desrivieres, Sylvane","last_name":"Desrivieres"},{"first_name":"Ragnhild Eek","full_name":"Brandlistuen, Ragnhild Eek","last_name":"Brandlistuen"},{"full_name":"Feng, Jianfeng","last_name":"Feng","first_name":"Jianfeng"},{"last_name":"Hese","full_name":"Hese, Soeren","first_name":"Soeren"},{"full_name":"Hitchen, Esther","last_name":"Hitchen","first_name":"Esther"},{"last_name":"Hoffmann","full_name":"Hoffmann, Per","first_name":"Per"},{"last_name":"Jia","full_name":"Jia, Tianye","first_name":"Tianye"},{"first_name":"Viktor","last_name":"Jirsa","full_name":"Jirsa, Viktor"},{"first_name":"Andre F.","last_name":"Marquand","full_name":"Marquand, Andre F."},{"first_name":"Frauke","full_name":"Nees, Frauke","last_name":"Nees"},{"last_name":"Nöthen","full_name":"Nöthen, Markus M.","first_name":"Markus M."},{"full_name":"Novarino, Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia"},{"first_name":"Elli","full_name":"Polemiti, Elli","last_name":"Polemiti"},{"last_name":"Ralser","full_name":"Ralser, Markus","first_name":"Markus"},{"full_name":"Rapp, Michael","last_name":"Rapp","first_name":"Michael"},{"first_name":"Kerstin","last_name":"Schepanski","full_name":"Schepanski, Kerstin"},{"first_name":"Tamara","full_name":"Schikowski, Tamara","last_name":"Schikowski"},{"first_name":"Mel","full_name":"Slater, Mel","last_name":"Slater"},{"first_name":"Peter","full_name":"Sommer, Peter","last_name":"Sommer"},{"last_name":"Stahl","full_name":"Stahl, Bernd Carsten","first_name":"Bernd Carsten"},{"first_name":"Paul M.","last_name":"Thompson","full_name":"Thompson, Paul M."},{"first_name":"Sven","full_name":"Twardziok, Sven","last_name":"Twardziok"},{"last_name":"Van Der Meer","full_name":"Van Der Meer, Dennis","first_name":"Dennis"},{"full_name":"Walter, Henrik","last_name":"Walter","first_name":"Henrik"},{"first_name":"Lars","full_name":"Westlye, Lars","last_name":"Westlye"}],"date_created":"2023-10-22T22:01:14Z","volume":80,"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ista":"Schumann G, Andreassen OA, Banaschewski T, Calhoun VD, Clinton N, Desrivieres S, Brandlistuen RE, Feng J, Hese S, Hitchen E, Hoffmann P, Jia T, Jirsa V, Marquand AF, Nees F, Nöthen MM, Novarino G, Polemiti E, Ralser M, Rapp M, Schepanski K, Schikowski T, Slater M, Sommer P, Stahl BC, Thompson PM, Twardziok S, Van Der Meer D, Walter H, Westlye L. 2023. Addressing global environmental challenges to mental health using population neuroscience: A review. JAMA Psychiatry. 80(10), 1066–1074.","mla":"Schumann, Gunter, et al. “Addressing Global Environmental Challenges to Mental Health Using Population Neuroscience: A Review.” JAMA Psychiatry, vol. 80, no. 10, American Medical Association, 2023, pp. 1066–74, doi:10.1001/jamapsychiatry.2023.2996.","ieee":"G. Schumann et al., “Addressing global environmental challenges to mental health using population neuroscience: A review,” JAMA Psychiatry, vol. 80, no. 10. American Medical Association, pp. 1066–1074, 2023.","ama":"Schumann G, Andreassen OA, Banaschewski T, et al. Addressing global environmental challenges to mental health using population neuroscience: A review. JAMA Psychiatry. 2023;80(10):1066-1074. doi:10.1001/jamapsychiatry.2023.2996","short":"G. Schumann, O.A. Andreassen, T. Banaschewski, V.D. Calhoun, N. Clinton, S. Desrivieres, R.E. Brandlistuen, J. Feng, S. Hese, E. Hitchen, P. Hoffmann, T. Jia, V. Jirsa, A.F. Marquand, F. Nees, M.M. Nöthen, G. Novarino, E. Polemiti, M. Ralser, M. Rapp, K. Schepanski, T. Schikowski, M. Slater, P. Sommer, B.C. Stahl, P.M. Thompson, S. Twardziok, D. Van Der Meer, H. Walter, L. Westlye, JAMA Psychiatry 80 (2023) 1066–1074.","apa":"Schumann, G., Andreassen, O. A., Banaschewski, T., Calhoun, V. D., Clinton, N., Desrivieres, S., … Westlye, L. (2023). Addressing global environmental challenges to mental health using population neuroscience: A review. JAMA Psychiatry. American Medical Association. https://doi.org/10.1001/jamapsychiatry.2023.2996","chicago":"Schumann, Gunter, Ole A. Andreassen, Tobias Banaschewski, Vince D. Calhoun, Nicholas Clinton, Sylvane Desrivieres, Ragnhild Eek Brandlistuen, et al. “Addressing Global Environmental Challenges to Mental Health Using Population Neuroscience: A Review.” JAMA Psychiatry. American Medical Association, 2023. https://doi.org/10.1001/jamapsychiatry.2023.2996."},"pmid":1,"publication":"JAMA Psychiatry","publication_identifier":{"eissn":["2168-6238"]},"date_updated":"2025-09-09T13:11:20Z","title":"Addressing global environmental challenges to mental health using population neuroscience: A review","publication_status":"published","date_published":"2023-10-01T00:00:00Z","isi":1,"external_id":{"isi":["001093447000016"],"pmid":["37610741"]},"abstract":[{"text":"Importance Climate change, pollution, urbanization, socioeconomic inequality, and psychosocial effects of the COVID-19 pandemic have caused massive changes in environmental conditions that affect brain health during the life span, both on a population level as well as on the level of the individual. How these environmental factors influence the brain, behavior, and mental illness is not well known.\r\nObservations A research strategy enabling population neuroscience to contribute to identify brain mechanisms underlying environment-related mental illness by leveraging innovative enrichment tools for data federation, geospatial observation, climate and pollution measures, digital health, and novel data integration techniques is described. This strategy can inform innovative treatments that target causal cognitive and molecular mechanisms of mental illness related to the environment. An example is presented of the environMENTAL Project that is leveraging federated cohort data of over 1.5 million European citizens and patients enriched with deep phenotyping data from large-scale behavioral neuroimaging cohorts to identify brain mechanisms related to environmental adversity underlying symptoms of depression, anxiety, stress, and substance misuse.\r\nConclusions and Relevance This research will lead to the development of objective biomarkers and evidence-based interventions that will significantly improve outcomes of environment-related mental illness.","lang":"eng"}],"quality_controlled":"1"},{"type":"journal_article","acknowledgement":"Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-1745302. Sah was supported by the PD Soros Fellowship. Simkin was supported by the Center of Mathematical Sciences and Applications at Harvard University.","publication":"Israel Journal of Mathematics","citation":{"chicago":"Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures in Latin Squares.” Israel Journal of Mathematics. Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2513-9.","apa":"Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9","short":"M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256 (2023) 363–416.","ieee":"M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416, 2023.","ama":"Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. Israel Journal of Mathematics. 2023;256(2):363-416. doi:10.1007/s11856-023-2513-9","ista":"Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares. Israel Journal of Mathematics. 256(2), 363–416.","mla":"Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"quality_controlled":"1","abstract":[{"text":"We prove several results about substructures in Latin squares. First, we explain how to adapt our recent work on high-girth Steiner triple systems to the setting of Latin squares, resolving a conjecture of Linial that there exist Latin squares with arbitrarily high girth. As a consequence, we see that the number of order- n Latin squares with no intercalate (i.e., no 2×2 Latin subsquare) is at least (e−9/4n−o(n))n2. Equivalently, P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN\r\n , where N is the number of intercalates in a uniformly random order- n Latin square. \r\nIn fact, extending recent work of Kwan, Sah, and Sawhney, we resolve the general large-deviation problem for intercalates in random Latin squares, up to constant factors in the exponent: for any constant 0<δ≤1 we have P[N≤(1−δ)EN]=exp(−Θ(n2)) and for any constant δ>0 we have P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). \r\nFinally, as an application of some new general tools for studying substructures in random Latin squares, we show that in almost all order- n Latin squares, the number of cuboctahedra (i.e., the number of pairs of possibly degenerate 2×2 submatrices with the same arrangement of symbols) is of order n4, which is the minimum possible. As observed by Gowers and Long, this number can be interpreted as measuring ``how associative'' the quasigroup associated with the Latin square is.","lang":"eng"}],"external_id":{"arxiv":["2202.05088"],"isi":["001081646400001"]},"isi":1,"date_published":"2023-09-01T00:00:00Z","publication_status":"published","title":"Substructures in Latin squares","date_updated":"2025-09-09T13:08:47Z","department":[{"_id":"MaKw"}],"article_processing_charge":"Yes (in subscription journal)","day":"01","issue":"2","publisher":"Springer Nature","article_type":"original","page":"363-416","year":"2023","language":[{"iso":"eng"}],"_id":"14444","oa_version":"Preprint","status":"public","month":"09","oa":1,"volume":256,"date_created":"2023-10-22T22:01:14Z","author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567"},{"first_name":"Ashwin","full_name":"Sah, Ashwin","last_name":"Sah"},{"full_name":"Sawhney, Mehtaab","last_name":"Sawhney","first_name":"Mehtaab"},{"full_name":"Simkin, Michael","last_name":"Simkin","first_name":"Michael"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2202.05088","open_access":"1"}],"intvolume":" 256","doi":"10.1007/s11856-023-2513-9","scopus_import":"1"},{"year":"2023","language":[{"iso":"eng"}],"page":"675-717","publisher":"Springer Nature","article_type":"original","issue":"2","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","department":[{"_id":"UlWa"}],"doi":"10.1007/s11856-023-2521-9","scopus_import":"1","intvolume":" 256","author":[{"full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"},{"first_name":"Pascal","id":"4C20D868-F248-11E8-B48F-1D18A9856A87","last_name":"Wild","full_name":"Wild, Pascal"}],"volume":256,"date_created":"2023-10-22T22:01:14Z","oa":1,"month":"09","file_date_updated":"2023-10-31T11:20:31Z","_id":"14445","ddc":["510"],"status":"public","oa_version":"Published Version","citation":{"ista":"Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717.","mla":"Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:10.1007/s11856-023-2521-9.","ama":"Wagner U, Wild P. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 2023;256(2):675-717. doi:10.1007/s11856-023-2521-9","ieee":"U. Wagner and P. Wild, “Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 675–717, 2023.","short":"U. Wagner, P. Wild, Israel Journal of Mathematics 256 (2023) 675–717.","chicago":"Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics. Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2521-9.","apa":"Wagner, U., & Wild, P. (2023). Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2521-9"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Israel Journal of Mathematics","file":[{"file_name":"2023_IsraelJourMath_Wagner.pdf","date_created":"2023-10-31T11:20:31Z","date_updated":"2023-10-31T11:20:31Z","success":1,"access_level":"open_access","creator":"dernst","file_size":623787,"file_id":"14475","relation":"main_file","content_type":"application/pdf","checksum":"fbb05619fe4b650f341cc730425dd9c3"}],"type":"journal_article","publication_status":"published","title":"Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes","date_updated":"2024-10-09T21:07:12Z","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"},"isi":1,"external_id":{"isi":["001081646400010"]},"date_published":"2023-09-01T00:00:00Z","quality_controlled":"1","abstract":[{"lang":"eng","text":"We prove the following quantitative Borsuk–Ulam-type result (an equivariant analogue of Gromov’s Topological Overlap Theorem): Let X be a free ℤ/2-complex of dimension d with coboundary expansion at least ηk in dimension 0 ≤ k < d. Then for every equivariant map F: X →ℤ/2 ℝd, the fraction of d-simplices σ of X with 0 ∈ F (σ) is at least 2−d Π d−1k=0ηk.\r\n\r\nAs an application, we show that for every sufficiently thick d-dimensional spherical building Y and every map f: Y → ℝ2d, we have f(σ) ∩ f(τ) ≠ ∅ for a constant fraction μd > 0 of pairs {σ, τ} of d-simplices of Y. In particular, such complexes are non-embeddable into ℝ2d, which proves a conjecture of Tancer and Vorwerk for sufficiently thick spherical buildings.\r\n\r\nWe complement these results by upper bounds on the coboundary expansion of two families of simplicial complexes; this indicates some limitations to the bounds one can obtain by straighforward applications of the quantitative Borsuk–Ulam theorem. Specifically, we prove\r\n\r\n• an upper bound of (d + 1)/2d on the normalized (d − 1)-th coboundary expansion constant of complete (d + 1)-partite d-dimensional complexes (under a mild divisibility assumption on the sizes of the parts); and\r\n\r\n• an upper bound of (d + 1)/2d + ε on the normalized (d − 1)-th coboundary expansion of the d-dimensional spherical building associated with GLd+2(Fq) for any ε > 0 and sufficiently large q. This disproves, in a rather strong sense, a conjecture of Lubotzky, Meshulam and Mozes."}],"corr_author":"1","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]}},{"issue":"4","day":"01","publisher":"Sciendo","article_type":"original","department":[{"_id":"ChLa"}],"has_accepted_license":"1","article_processing_charge":"Yes","language":[{"iso":"eng"}],"year":"2023","page":"175-183","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","month":"08","oa":1,"oa_version":"Published Version","status":"public","file_date_updated":"2023-10-31T12:07:23Z","_id":"14446","ddc":["510"],"intvolume":" 23","scopus_import":"1","doi":"10.2478/msr-2023-0023","date_created":"2023-10-22T22:01:15Z","volume":23,"author":[{"first_name":"Jozef","full_name":"Jakubík, Jozef","last_name":"Jakubík"},{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","first_name":"Phuong","last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong"},{"first_name":"Martina","full_name":"Chvosteková, Martina","last_name":"Chvosteková"},{"first_name":"Anna","last_name":"Krakovská","full_name":"Krakovská, Anna"}],"file":[{"file_size":2639783,"file_id":"14476","checksum":"b069cc10fa6a7c96b2bc9f728165f9e6","relation":"main_file","content_type":"application/pdf","file_name":"2023_MeasurementScienceRev_Jakubik.pdf","date_created":"2023-10-31T12:07:23Z","access_level":"open_access","creator":"dernst","success":1,"date_updated":"2023-10-31T12:07:23Z"}],"type":"journal_article","acknowledgement":"The work was supported by the Scientific Grant Agency of the Ministry of Education of the Slovak Republic and the Slovak Academy of Sciences, projects APVV-21-0216, VEGA2-0096-21 and VEGA 2-0023-22.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ieee":"J. Jakubík, M. Phuong, M. Chvosteková, and A. Krakovská, “Against the flow of time with multi-output models,” Measurement Science Review, vol. 23, no. 4. Sciendo, pp. 175–183, 2023.","ama":"Jakubík J, Phuong M, Chvosteková M, Krakovská A. Against the flow of time with multi-output models. Measurement Science Review. 2023;23(4):175-183. doi:10.2478/msr-2023-0023","ista":"Jakubík J, Phuong M, Chvosteková M, Krakovská A. 2023. Against the flow of time with multi-output models. Measurement Science Review. 23(4), 175–183.","mla":"Jakubík, Jozef, et al. “Against the Flow of Time with Multi-Output Models.” Measurement Science Review, vol. 23, no. 4, Sciendo, 2023, pp. 175–83, doi:10.2478/msr-2023-0023.","apa":"Jakubík, J., Phuong, M., Chvosteková, M., & Krakovská, A. (2023). Against the flow of time with multi-output models. Measurement Science Review. Sciendo. https://doi.org/10.2478/msr-2023-0023","chicago":"Jakubík, Jozef, Mary Phuong, Martina Chvosteková, and Anna Krakovská. “Against the Flow of Time with Multi-Output Models.” Measurement Science Review. Sciendo, 2023. https://doi.org/10.2478/msr-2023-0023.","short":"J. Jakubík, M. Phuong, M. Chvosteková, A. Krakovská, Measurement Science Review 23 (2023) 175–183."},"publication":"Measurement Science Review","publication_identifier":{"eissn":["1335-8871"]},"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"isi":1,"date_published":"2023-08-01T00:00:00Z","external_id":{"isi":["001070829600005"]},"date_updated":"2025-09-09T13:10:30Z","publication_status":"published","title":"Against the flow of time with multi-output models","abstract":[{"lang":"eng","text":"Recent work has paid close attention to the first principle of Granger causality, according to which cause precedes effect. In this context, the question may arise whether the detected direction of causality also reverses after the time reversal of unidirectionally coupled data. Recently, it has been shown that for unidirectionally causally connected autoregressive (AR) processes X → Y, after time reversal of data, the opposite causal direction Y → X is indeed detected, although typically as part of the bidirectional X↔ Y link. As we argue here, the answer is different when the measured data are not from AR processes but from linked deterministic systems. When the goal is the usual forward data analysis, cross-mapping-like approaches correctly detect X → Y, while Granger causality-like approaches, which should not be used for deterministic time series, detect causal independence X → Y. The results of backward causal analysis depend on the predictability of the reversed data. Unlike AR processes, observables from deterministic dynamical systems, even complex nonlinear ones, can be predicted well forward, while backward predictions can be difficult (notably when the time reversal of a function leads to one-to-many relations). To address this problem, we propose an approach based on models that provide multiple candidate predictions for the target, combined with a loss function that consideres only the best candidate. The resulting good forward and backward predictability supports the view that unidirectionally causally linked deterministic dynamical systems X → Y can be expected to detect the same link both before and after time reversal."}],"quality_controlled":"1"},{"intvolume":" 2023","doi":"10.1109/CVPR52729.2023.01153","scopus_import":"1","volume":2023,"date_created":"2023-10-22T22:01:16Z","author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2010.09567","open_access":"1"}],"month":"08","oa":1,"_id":"14448","status":"public","oa_version":"Preprint","year":"2023","language":[{"iso":"eng"}],"page":"11980-11989","day":"22","publisher":"IEEE","department":[{"_id":"VlKo"}],"article_processing_charge":"No","external_id":{"arxiv":["2010.09567"],"isi":["001062522104029"]},"isi":1,"date_published":"2023-08-22T00:00:00Z","title":"Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions","publication_status":"published","date_updated":"2025-09-09T13:09:58Z","quality_controlled":"1","abstract":[{"text":"We consider the problem of solving LP relaxations of MAP-MRF inference problems, and in particular the method proposed recently in [16], [35]. As a key computational subroutine, it uses a variant of the Frank-Wolfe (FW) method to minimize a smooth convex function over a combinatorial polytope. We propose an efficient implementation of this subroutine based on in-face Frank-Wolfe directions, introduced in [4] in a different context. More generally, we define an abstract data structure for a combinatorial subproblem that enables in-face FW directions, and describe its specialization for tree-structured MAP-MRF inference subproblems. Experimental results indicate that the resulting method is the current state-of-art LP solver for some classes of problems. Our code is available at pub.ist.ac.at/~vnk/papers/IN-FACE-FW.html.","lang":"eng"}],"corr_author":"1","publication_identifier":{"issn":["1063-6919"],"isbn":["9798350301298"]},"arxiv":1,"citation":{"mla":"Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.” Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2023, IEEE, 2023, pp. 11980–89, doi:10.1109/CVPR52729.2023.01153.","ista":"Kolmogorov V. 2023. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2023, 11980–11989.","ieee":"V. Kolmogorov, “Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vancouver, Canada, 2023, vol. 2023, pp. 11980–11989.","ama":"Kolmogorov V. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Vol 2023. IEEE; 2023:11980-11989. doi:10.1109/CVPR52729.2023.01153","short":"V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2023, pp. 11980–11989.","apa":"Kolmogorov, V. (2023). Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Vol. 2023, pp. 11980–11989). Vancouver, Canada: IEEE. https://doi.org/10.1109/CVPR52729.2023.01153","chicago":"Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.” In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2023:11980–89. IEEE, 2023. https://doi.org/10.1109/CVPR52729.2023.01153."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","end_date":"2023-06-24","start_date":"2023-06-17","location":"Vancouver, Canada"},"type":"conference"},{"day":"25","article_type":"original","publisher":"Frontiers","department":[{"_id":"ScienComp"}],"has_accepted_license":"1","article_processing_charge":"Yes","language":[{"iso":"eng"}],"year":"2023","month":"09","oa":1,"article_number":"1257002","oa_version":"Published Version","status":"public","_id":"14449","ddc":["000"],"file_date_updated":"2023-10-30T13:38:48Z","intvolume":" 14","scopus_import":"1","doi":"10.3389/fmicb.2023.1257002","date_created":"2023-10-22T22:01:16Z","volume":14,"author":[{"full_name":"D’Elia, Domenica","last_name":"D’Elia","first_name":"Domenica"},{"last_name":"Truu","full_name":"Truu, Jaak","first_name":"Jaak"},{"full_name":"Lahti, Leo","last_name":"Lahti","first_name":"Leo"},{"full_name":"Berland, Magali","last_name":"Berland","first_name":"Magali"},{"full_name":"Papoutsoglou, Georgios","last_name":"Papoutsoglou","first_name":"Georgios"},{"full_name":"Ceci, Michelangelo","last_name":"Ceci","first_name":"Michelangelo"},{"last_name":"Zomer","full_name":"Zomer, Aldert","first_name":"Aldert"},{"last_name":"Lopes","full_name":"Lopes, Marta B.","first_name":"Marta B."},{"full_name":"Ibrahimi, Eliana","last_name":"Ibrahimi","first_name":"Eliana"},{"first_name":"Aleksandra","full_name":"Gruca, Aleksandra","last_name":"Gruca"},{"first_name":"Alina","last_name":"Nechyporenko","full_name":"Nechyporenko, Alina"},{"first_name":"Marcus","last_name":"Frohme","full_name":"Frohme, Marcus"},{"first_name":"Thomas","full_name":"Klammsteiner, Thomas","last_name":"Klammsteiner"},{"first_name":"Enrique Carrillo De Santa","full_name":"Pau, Enrique Carrillo De Santa","last_name":"Pau"},{"first_name":"Laura Judith","last_name":"Marcos-Zambrano","full_name":"Marcos-Zambrano, Laura Judith"},{"first_name":"Karel","last_name":"Hron","full_name":"Hron, Karel"},{"full_name":"Pio, Gianvito","last_name":"Pio","first_name":"Gianvito"},{"first_name":"Andrea","full_name":"Simeon, Andrea","last_name":"Simeon"},{"first_name":"Ramona","last_name":"Suharoschi","full_name":"Suharoschi, Ramona"},{"first_name":"Isabel","last_name":"Moreno-Indias","full_name":"Moreno-Indias, Isabel"},{"last_name":"Temko","full_name":"Temko, Andriy","first_name":"Andriy"},{"first_name":"Miroslava","full_name":"Nedyalkova, Miroslava","last_name":"Nedyalkova"},{"last_name":"Apostol","full_name":"Apostol, Elena Simona","first_name":"Elena Simona"},{"full_name":"Truică, Ciprian Octavian","last_name":"Truică","first_name":"Ciprian Octavian"},{"first_name":"Rajesh","last_name":"Shigdel","full_name":"Shigdel, Rajesh"},{"full_name":"Telalović, Jasminka Hasić","last_name":"Telalović","first_name":"Jasminka Hasić"},{"first_name":"Erik","last_name":"Bongcam-Rudloff","full_name":"Bongcam-Rudloff, Erik"},{"first_name":"Piotr","last_name":"Przymus","full_name":"Przymus, Piotr"},{"first_name":"Naida Babić","last_name":"Jordamović","full_name":"Jordamović, Naida Babić"},{"first_name":"Laurent","last_name":"Falquet","full_name":"Falquet, Laurent"},{"last_name":"Tarazona","full_name":"Tarazona, Sonia","first_name":"Sonia"},{"first_name":"Alexia","full_name":"Sampri, Alexia","last_name":"Sampri"},{"last_name":"Isola","full_name":"Isola, Gaetano","first_name":"Gaetano"},{"last_name":"Pérez-Serrano","full_name":"Pérez-Serrano, David","first_name":"David"},{"first_name":"Vladimir","last_name":"Trajkovik","full_name":"Trajkovik, Vladimir"},{"full_name":"Klucar, Lubos","last_name":"Klucar","first_name":"Lubos"},{"first_name":"Tatjana","last_name":"Loncar-Turukalo","full_name":"Loncar-Turukalo, Tatjana"},{"last_name":"Havulinna","full_name":"Havulinna, Aki S.","first_name":"Aki S."},{"id":"837b2259-bcc9-11ed-a196-ae55927bc6e2","first_name":"Christian","last_name":"Jansen","full_name":"Jansen, Christian"},{"last_name":"Bertelsen","full_name":"Bertelsen, Randi J.","first_name":"Randi J."},{"full_name":"Claesson, Marcus Joakim","last_name":"Claesson","first_name":"Marcus Joakim"}],"file":[{"file_name":"2023_FrontiersMicrobiology_DElia.pdf","date_created":"2023-10-30T13:38:48Z","access_level":"open_access","creator":"dernst","date_updated":"2023-10-30T13:38:48Z","success":1,"file_size":505078,"file_id":"14471","checksum":"6c0acdd8fa111a699826957b8dff19d5","relation":"main_file","content_type":"application/pdf"}],"type":"journal_article","acknowledgement":"This study is based upon work from COST Action ML4Microbiome “Statistical and machine learning techniques in human microbiome studies” (CA18131), supported by COST (European Cooperation in Science and Technology), www.cost.eu. MB acknowledges support through the Metagenopolis grant ANR-11-DPBS-0001. IM-I acknowledges support by the “Miguel Servet Type II” program (CPII21/00013) of the ISCIII-Madrid (Spain), co-financed by the FEDER.\r\nThe authors are grateful to all COST Action CA18131 “Statistical and machine learning techniques in human microbiome studies” members for their contribution to the COST Action objectives, and to COST (European Cooperation in Science and Technology) for the economic support, www.cost.eu. WG2 and WG3 thank Emmanuelle Le Chatelier and Pauline Barbet (Université Paris-Saclay, INRAE, MetaGenoPolis, 78350, Jouy-en-Josas, France) for preparing the shotgun CRC benchmark dataset.","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"D’Elia D, Truu J, Lahti L, et al. Advancing microbiome research with machine learning: Key findings from the ML4Microbiome COST action. Frontiers in Microbiology. 2023;14. doi:10.3389/fmicb.2023.1257002","ieee":"D. D’Elia et al., “Advancing microbiome research with machine learning: Key findings from the ML4Microbiome COST action,” Frontiers in Microbiology, vol. 14. Frontiers, 2023.","mla":"D’Elia, Domenica, et al. “Advancing Microbiome Research with Machine Learning: Key Findings from the ML4Microbiome COST Action.” Frontiers in Microbiology, vol. 14, 1257002, Frontiers, 2023, doi:10.3389/fmicb.2023.1257002.","ista":"D’Elia D, Truu J, Lahti L, Berland M, Papoutsoglou G, Ceci M, Zomer A, Lopes MB, Ibrahimi E, Gruca A, Nechyporenko A, Frohme M, Klammsteiner T, Pau ECDS, Marcos-Zambrano LJ, Hron K, Pio G, Simeon A, Suharoschi R, Moreno-Indias I, Temko A, Nedyalkova M, Apostol ES, Truică CO, Shigdel R, Telalović JH, Bongcam-Rudloff E, Przymus P, Jordamović NB, Falquet L, Tarazona S, Sampri A, Isola G, Pérez-Serrano D, Trajkovik V, Klucar L, Loncar-Turukalo T, Havulinna AS, Jansen C, Bertelsen RJ, Claesson MJ. 2023. Advancing microbiome research with machine learning: Key findings from the ML4Microbiome COST action. Frontiers in Microbiology. 14, 1257002.","apa":"D’Elia, D., Truu, J., Lahti, L., Berland, M., Papoutsoglou, G., Ceci, M., … Claesson, M. J. (2023). Advancing microbiome research with machine learning: Key findings from the ML4Microbiome COST action. Frontiers in Microbiology. Frontiers. https://doi.org/10.3389/fmicb.2023.1257002","chicago":"D’Elia, Domenica, Jaak Truu, Leo Lahti, Magali Berland, Georgios Papoutsoglou, Michelangelo Ceci, Aldert Zomer, et al. “Advancing Microbiome Research with Machine Learning: Key Findings from the ML4Microbiome COST Action.” Frontiers in Microbiology. Frontiers, 2023. https://doi.org/10.3389/fmicb.2023.1257002.","short":"D. D’Elia, J. Truu, L. Lahti, M. Berland, G. Papoutsoglou, M. Ceci, A. Zomer, M.B. Lopes, E. Ibrahimi, A. Gruca, A. Nechyporenko, M. Frohme, T. Klammsteiner, E.C.D.S. Pau, L.J. Marcos-Zambrano, K. Hron, G. Pio, A. Simeon, R. Suharoschi, I. Moreno-Indias, A. Temko, M. Nedyalkova, E.S. Apostol, C.O. Truică, R. Shigdel, J.H. Telalović, E. Bongcam-Rudloff, P. Przymus, N.B. Jordamović, L. Falquet, S. Tarazona, A. Sampri, G. Isola, D. Pérez-Serrano, V. Trajkovik, L. Klucar, T. Loncar-Turukalo, A.S. Havulinna, C. Jansen, R.J. Bertelsen, M.J. Claesson, Frontiers in Microbiology 14 (2023)."},"publication":"Frontiers in Microbiology","publication_identifier":{"eissn":["1664-302X"]},"isi":1,"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"},"date_published":"2023-09-25T00:00:00Z","external_id":{"pmid":["37808321"],"isi":["001080536000001"]},"date_updated":"2023-12-13T13:07:21Z","publication_status":"published","title":"Advancing microbiome research with machine learning: Key findings from the ML4Microbiome COST action","quality_controlled":"1","abstract":[{"lang":"eng","text":"The rapid development of machine learning (ML) techniques has opened up the data-dense field of microbiome research for novel therapeutic, diagnostic, and prognostic applications targeting a wide range of disorders, which could substantially improve healthcare practices in the era of precision medicine. However, several challenges must be addressed to exploit the benefits of ML in this field fully. In particular, there is a need to establish “gold standard” protocols for conducting ML analysis experiments and improve interactions between microbiome researchers and ML experts. The Machine Learning Techniques in Human Microbiome Studies (ML4Microbiome) COST Action CA18131 is a European network established in 2019 to promote collaboration between discovery-oriented microbiome researchers and data-driven ML experts to optimize and standardize ML approaches for microbiome analysis. This perspective paper presents the key achievements of ML4Microbiome, which include identifying predictive and discriminatory ‘omics’ features, improving repeatability and comparability, developing automation procedures, and defining priority areas for the novel development of ML methods targeting the microbiome. The insights gained from ML4Microbiome will help to maximize the potential of ML in microbiome research and pave the way for new and improved healthcare practices."}]},{"department":[{"_id":"NiBa"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","day":"01","issue":"2","article_type":"original","publisher":"Oxford University Press","year":"2023","language":[{"iso":"eng"}],"article_number":"iyad133","_id":"14452","ddc":["570"],"file_date_updated":"2023-10-30T12:57:53Z","oa_version":"Published Version","status":"public","month":"10","oa":1,"volume":225,"related_material":{"record":[{"id":"12949","relation":"research_data","status":"public"}]},"date_created":"2023-10-29T23:01:15Z","author":[{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton"},{"full_name":"Etheridge, Alison M.","last_name":"Etheridge","first_name":"Alison M."},{"first_name":"Amandine","last_name":"Véber","full_name":"Véber, Amandine"}],"intvolume":" 225","doi":"10.1093/genetics/iyad133","scopus_import":"1","type":"journal_article","acknowledgement":"NHB was supported in part by ERC Grants 250152 and 101055327. AV was partly supported by the chaire Modélisation Mathématique et Biodiversité of Veolia Environment—Ecole Polytechnique—Museum National d’Histoire Naturelle—Fondation X.","file":[{"relation":"main_file","content_type":"application/pdf","checksum":"3f65b1fbe813e2f4dbb5d2b5e891844a","file_id":"14469","file_size":1439032,"success":1,"date_updated":"2023-10-30T12:57:53Z","access_level":"open_access","creator":"dernst","file_name":"2023_Genetics_Barton.pdf","date_created":"2023-10-30T12:57:53Z"}],"publication":"Genetics","citation":{"ama":"Barton NH, Etheridge AM, Véber A. The infinitesimal model with dominance. Genetics. 2023;225(2). doi:10.1093/genetics/iyad133","ieee":"N. H. Barton, A. M. Etheridge, and A. Véber, “The infinitesimal model with dominance,” Genetics, vol. 225, no. 2. Oxford University Press, 2023.","ista":"Barton NH, Etheridge AM, Véber A. 2023. The infinitesimal model with dominance. Genetics. 225(2), iyad133.","mla":"Barton, Nicholas H., et al. “The Infinitesimal Model with Dominance.” Genetics, vol. 225, no. 2, iyad133, Oxford University Press, 2023, doi:10.1093/genetics/iyad133.","chicago":"Barton, Nicholas H, Alison M. Etheridge, and Amandine Véber. “The Infinitesimal Model with Dominance.” Genetics. Oxford University Press, 2023. https://doi.org/10.1093/genetics/iyad133.","apa":"Barton, N. H., Etheridge, A. M., & Véber, A. (2023). The infinitesimal model with dominance. Genetics. Oxford University Press. https://doi.org/10.1093/genetics/iyad133","short":"N.H. Barton, A.M. Etheridge, A. Véber, Genetics 225 (2023)."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"ec_funded":1,"publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"abstract":[{"text":"The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and an environmental component, and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the parental traits. In previous work, we showed that when trait values are determined by the sum of a large number of additive Mendelian factors, each of small effect, one can justify the infinitesimal model as a limit of Mendelian inheritance. In this paper, we show that this result extends to include dominance. We define the model in terms of classical quantities of quantitative genetics, before justifying it as a limit of Mendelian inheritance as the number, M, of underlying loci tends to infinity. As in the additive case, the multivariate normal distribution of trait values across the pedigree can be expressed in terms of variance components in an ancestral population and probabilities of identity by descent determined by the pedigree. Now, with just first-order dominance effects, we require two-, three-, and four-way identities. We also show that, even if we condition on parental trait values, the “shared” and “residual” components of trait values within each family will be asymptotically normally distributed as the number of loci tends to infinity, with an error of order 1/M−−√. We illustrate our results with some numerical examples.","lang":"eng"}],"quality_controlled":"1","external_id":{"isi":["001148042000008"],"arxiv":["2211.03515"]},"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"},"date_published":"2023-10-01T00:00:00Z","isi":1,"project":[{"call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152"},{"grant_number":"101055327","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","name":"Understanding the evolution of continuous genomes"}],"title":"The infinitesimal model with dominance","publication_status":"published","date_updated":"2025-09-09T13:07:07Z"},{"date_published":"2023-10-01T00:00:00Z","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"},"external_id":{"isi":["001084933600001"]},"isi":1,"project":[{"grant_number":"805041","_id":"629205d8-2b32-11ec-9570-e1356ff73576","name":"Organization of CLoUdS, and implications of Tropical cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020"}],"title":"Extreme precipitation in tropical squall lines","publication_status":"published","date_updated":"2024-11-05T09:00:44Z","quality_controlled":"1","abstract":[{"text":"Squall lines are substantially influenced by the interaction of low-level shear with cold pools associated with convective downdrafts. Beyond an optimal shear amplitude, squall lines tend to orient themselves at an angle with respect to the low-level shear. While the mechanisms behind squall line orientation seem to be increasingly well understood, uncertainties remain on the implications of this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4) show that long lived mesoscale convective systems, including squall lines, are disproportionately involved in rainfall extremes in the tropics. This article investigates the influence of the interaction between low-level shear and squall line outflow on squall line generated precipitation extrema in the tropics. Using a cloud resolving model, simulated squall lines in radiative convective equilibrium amid a shear-dominated regime (super optimal), a balanced regime (optimal), and an outflow dominated regime (suboptimal). Our results show that precipitation extremes in squall lines are 40% more intense in the case of optimal shear and remain 30% superior in the superoptimal regime relative to a disorganized case. With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020, https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates control the amplification of precipitation extremes in tropical squall lines, mainly due to its change in vertical mass flux (dynamic component). The reduction of dilution by entrainment explains half of this change, consistent with Mulholland et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained by increased cloud-base velocity intensity in optimal and superoptimal squall lines.","lang":"eng"}],"publication_identifier":{"eissn":["1942-2466"]},"ec_funded":1,"citation":{"short":"S. Abramian, C.J. Muller, C. Risi, Journal of Advances in Modeling Earth Systems 15 (2023).","apa":"Abramian, S., Muller, C. J., & Risi, C. (2023). Extreme precipitation in tropical squall lines. Journal of Advances in Modeling Earth Systems. Wiley. https://doi.org/10.1029/2022MS003477","chicago":"Abramian, Sophie, Caroline J Muller, and Camille Risi. “Extreme Precipitation in Tropical Squall Lines.” Journal of Advances in Modeling Earth Systems. Wiley, 2023. https://doi.org/10.1029/2022MS003477.","mla":"Abramian, Sophie, et al. “Extreme Precipitation in Tropical Squall Lines.” Journal of Advances in Modeling Earth Systems, vol. 15, no. 10, e2022MS003477, Wiley, 2023, doi:10.1029/2022MS003477.","ista":"Abramian S, Muller CJ, Risi C. 2023. Extreme precipitation in tropical squall lines. Journal of Advances in Modeling Earth Systems. 15(10), e2022MS003477.","ieee":"S. Abramian, C. J. Muller, and C. Risi, “Extreme precipitation in tropical squall lines,” Journal of Advances in Modeling Earth Systems, vol. 15, no. 10. Wiley, 2023.","ama":"Abramian S, Muller CJ, Risi C. Extreme precipitation in tropical squall lines. Journal of Advances in Modeling Earth Systems. 2023;15(10). doi:10.1029/2022MS003477"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Advances in Modeling Earth Systems","file":[{"creator":"dernst","access_level":"open_access","success":1,"date_updated":"2023-10-30T13:31:42Z","file_name":"2023_JAMES_Abramian.pdf","date_created":"2023-10-30T13:31:42Z","checksum":"43e6a1a35b663843c7d3f8d0caaca1a5","relation":"main_file","content_type":"application/pdf","file_id":"14470","file_size":1975210}],"type":"journal_article","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). This work is also supported by a PhD fellowship funded by the Ecole Normale Supérieure de Paris-Saclay. Authors are also grateful to Benjamin Filider, who was of great help and support in the development of ideas. Eventually, we would like to thank Martin Singh, John M. Peters and an anonymous reviewer for their valuable comments and suggestions, which greatly improved the quality of the manuscript.","intvolume":" 15","doi":"10.1029/2022MS003477","scopus_import":"1","volume":15,"date_created":"2023-10-29T23:01:15Z","author":[{"first_name":"Sophie","full_name":"Abramian, Sophie","last_name":"Abramian"},{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","first_name":"Caroline J","full_name":"Muller, Caroline J","last_name":"Muller","orcid":"0000-0001-5836-5350"},{"last_name":"Risi","full_name":"Risi, Camille","first_name":"Camille"}],"month":"10","oa":1,"article_number":"e2022MS003477","_id":"14453","ddc":["550"],"file_date_updated":"2023-10-30T13:31:42Z","oa_version":"Published Version","status":"public","year":"2023","language":[{"iso":"eng"}],"day":"01","issue":"10","publisher":"Wiley","article_type":"original","department":[{"_id":"CaMu"}],"article_processing_charge":"Yes","has_accepted_license":"1"},{"publication_identifier":{"isbn":["9783031442667"],"issn":["0302-9743"],"eissn":["1611-3349"]},"corr_author":"1","ec_funded":1,"arxiv":1,"date_updated":"2025-04-14T07:55:55Z","publication_status":"published","title":"Monitoring algorithmic fairness under partial observations","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"external_id":{"arxiv":["2308.00341"]},"date_published":"2023-10-01T00:00:00Z","quality_controlled":"1","abstract":[{"lang":"eng","text":"As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and starts in the stationary distribution, with a bound on its mixing time being known. These assumptions enable us to estimate a given property for the entire distribution of possible executions of the monitored POMC, by observing only a single execution. Our monitors observe a long run of the system and, after each new observation, output updated PAC-estimates of how fair or biased the system is. The monitors are computationally lightweight and, using a prototype implementation, we demonstrate their effectiveness on several real-world examples."}],"alternative_title":["LNCS"],"type":"conference","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","conference":{"name":"RV: Conference on Runtime Verification","end_date":"2023-10-06","location":"Thessaloniki, Greece","start_date":"2023-10-03"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference on Runtime Verification, Springer Nature, 2023, pp. 291–311.","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness under Partial Observations.” In 23rd International Conference on Runtime Verification, 14245:291–311. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44267-4_15.","apa":"Henzinger, T. A., Kueffner, K., & Mallik, K. (2023). Monitoring algorithmic fairness under partial observations. In 23rd International Conference on Runtime Verification (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature. https://doi.org/10.1007/978-3-031-44267-4_15","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial Observations.” 23rd International Conference on Runtime Verification, vol. 14245, Springer Nature, 2023, pp. 291–311, doi:10.1007/978-3-031-44267-4_15.","ista":"Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness under partial observations. 23rd International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311.","ieee":"T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness under partial observations,” in 23rd International Conference on Runtime Verification, Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.","ama":"Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under partial observations. In: 23rd International Conference on Runtime Verification. Vol 14245. Springer Nature; 2023:291-311. doi:10.1007/978-3-031-44267-4_15"},"publication":"23rd International Conference on Runtime Verification","oa":1,"month":"10","oa_version":"Preprint","status":"public","_id":"14454","scopus_import":"1","doi":"10.1007/978-3-031-44267-4_15","intvolume":" 14245","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2308.00341","open_access":"1"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","orcid":"0000-0001-8974-2542","last_name":"Kueffner","full_name":"Kueffner, Konstantin"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","last_name":"Mallik"}],"date_created":"2023-10-29T23:01:15Z","volume":14245,"publisher":"Springer Nature","day":"01","article_processing_charge":"No","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"year":"2023","page":"291-311"},{"department":[{"_id":"GaNo"}],"article_processing_charge":"Yes","has_accepted_license":"1","day":"03","article_type":"letter_note","publisher":"Frontiers","year":"2023","language":[{"iso":"eng"}],"article_number":"1287879","file_date_updated":"2023-10-30T12:48:40Z","_id":"14455","ddc":["570"],"oa_version":"Published Version","status":"public","month":"10","oa":1,"volume":14,"date_created":"2023-10-29T23:01:16Z","author":[{"first_name":"Antonio","last_name":"Narzisi","full_name":"Narzisi, Antonio"},{"full_name":"Halladay, Alycia","last_name":"Halladay","first_name":"Alycia"},{"last_name":"Masi","full_name":"Masi, Gabriele","first_name":"Gabriele"},{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Catherine","full_name":"Lord, Catherine","last_name":"Lord"}],"intvolume":" 14","doi":"10.3389/fpsyt.2023.1287879","scopus_import":"1","type":"journal_article","acknowledgement":"The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. This work has been partially supported by Italian Ministry of Health Grant RC2023 (and the 5 × 1,000 voluntary contributions). The authors thank the children and their families with whom they work daily.","file":[{"checksum":"0a76373e9a4c0fc199f80380de257e86","relation":"main_file","content_type":"application/pdf","file_size":147878,"file_id":"14468","access_level":"open_access","creator":"dernst","date_updated":"2023-10-30T12:48:40Z","success":1,"file_name":"2023_FrontiersPsychiatry_Narzisi.pdf","date_created":"2023-10-30T12:48:40Z"}],"publication":"Frontiers in Psychiatry","pmid":1,"citation":{"ista":"Narzisi A, Halladay A, Masi G, Novarino G, Lord C. 2023. Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment. Frontiers in Psychiatry. 14, 1287879.","mla":"Narzisi, Antonio, et al. “Tempering Expectations: Considerations on the Current State of Stem Cells Therapy for Autism Treatment.” Frontiers in Psychiatry, vol. 14, 1287879, Frontiers, 2023, doi:10.3389/fpsyt.2023.1287879.","ama":"Narzisi A, Halladay A, Masi G, Novarino G, Lord C. Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment. Frontiers in Psychiatry. 2023;14. doi:10.3389/fpsyt.2023.1287879","ieee":"A. Narzisi, A. Halladay, G. Masi, G. Novarino, and C. Lord, “Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment,” Frontiers in Psychiatry, vol. 14. Frontiers, 2023.","short":"A. Narzisi, A. Halladay, G. Masi, G. Novarino, C. Lord, Frontiers in Psychiatry 14 (2023).","apa":"Narzisi, A., Halladay, A., Masi, G., Novarino, G., & Lord, C. (2023). Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment. Frontiers in Psychiatry. Frontiers. https://doi.org/10.3389/fpsyt.2023.1287879","chicago":"Narzisi, Antonio, Alycia Halladay, Gabriele Masi, Gaia Novarino, and Catherine Lord. “Tempering Expectations: Considerations on the Current State of Stem Cells Therapy for Autism Treatment.” Frontiers in Psychiatry. Frontiers, 2023. https://doi.org/10.3389/fpsyt.2023.1287879."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1664-0640"]},"quality_controlled":"1","isi":1,"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"},"external_id":{"pmid":["37854442"],"isi":["001084841700001"]},"date_published":"2023-10-03T00:00:00Z","title":"Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment","publication_status":"published","date_updated":"2023-12-13T13:06:07Z"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2307.10847","open_access":"1"}],"author":[{"first_name":"Jan Matyáš","last_name":"Křišťan","full_name":"Křišťan, Jan Matyáš"},{"orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"}],"date_created":"2023-10-29T23:01:16Z","related_material":{"link":[{"url":"https://doi.org/10.1007/978-3-031-43587-4_31","relation":"erratum"}]},"volume":14292,"scopus_import":"1","doi":"10.1007/978-3-031-43587-4_24","intvolume":" 14292","oa_version":"Preprint","status":"public","_id":"14456","oa":1,"month":"09","page":"333-347","language":[{"iso":"eng"}],"year":"2023","article_processing_charge":"No","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","day":"21","abstract":[{"lang":"eng","text":"In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the TOKEN SLIDING model. In this problem, a graph is provided along with its two dominating sets, which can be imagined as tokens placed on vertices. The objective is to find a shortest sequence of dominating sets that transforms one set into the other, with each set in the sequence resulting from sliding a single token in the previous set. While identifying any sequence has been well studied, our work presents the first polynomial algorithms for this optimization variant in the context of dominating sets."}],"quality_controlled":"1","date_updated":"2025-09-09T13:07:40Z","publication_status":"published","title":"Shortest dominating set reconfiguration under token sliding","date_published":"2023-09-21T00:00:00Z","isi":1,"external_id":{"arxiv":["2307.10847"],"isi":["001162288800024"]},"arxiv":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031435867"],"eissn":["1611-3349"]},"publication":"24th International Symposium on Fundamentals of Computation Theory","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"chicago":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” In 24th International Symposium on Fundamentals of Computation Theory, 14292:333–47. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-43587-4_24.","apa":"Křišťan, J. M., & Svoboda, J. (2023). Shortest dominating set reconfiguration under token sliding. In 24th International Symposium on Fundamentals of Computation Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-43587-4_24","short":"J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals of Computation Theory, Springer Nature, 2023, pp. 333–347.","ama":"Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token sliding. In: 24th International Symposium on Fundamentals of Computation Theory. Vol 14292. Springer Nature; 2023:333-347. doi:10.1007/978-3-031-43587-4_24","ieee":"J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under token sliding,” in 24th International Symposium on Fundamentals of Computation Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.","mla":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” 24th International Symposium on Fundamentals of Computation Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.","ista":"Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under token sliding. 24th International Symposium on Fundamentals of Computation Theory. FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347."},"type":"conference","conference":{"name":"FCT: Fundamentals of Computation Theory","end_date":"2023-09-21","start_date":"2023-09-18","location":"Trier, Germany"},"alternative_title":["LNCS"]},{"department":[{"_id":"KrPi"}],"article_processing_charge":"No","day":"01","publisher":"Springer Nature","page":"215-228","language":[{"iso":"eng"}],"year":"2023","oa_version":"Preprint","status":"public","_id":"14457","month":"10","oa":1,"date_created":"2023-10-29T23:01:16Z","volume":14168,"main_file_link":[{"url":"https://eprint.iacr.org/2023/1017","open_access":"1"}],"author":[{"id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","first_name":"Charlotte","full_name":"Hoffmann, Charlotte","last_name":"Hoffmann","orcid":"0000-0003-2027-5549"},{"full_name":"Simkin, Mark","last_name":"Simkin","first_name":"Mark"}],"intvolume":" 14168","scopus_import":"1","doi":"10.1007/978-3-031-44469-2_11","conference":{"name":"LATINCRYPT: Cryptology and Information Security in Latin America","start_date":"2023-10-03","location":"Quito, Ecuador","end_date":"2023-10-06"},"type":"conference","alternative_title":["LNCS"],"publication":"8th International Conference on Cryptology and Information Security in Latin America","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ista":"Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret sharing. 8th International Conference on Cryptology and Information Security in Latin America. LATINCRYPT: Cryptology and Information Security in Latin America, LNCS, vol. 14168, 215–228.","mla":"Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” 8th International Conference on Cryptology and Information Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28, doi:10.1007/978-3-031-44469-2_11.","ieee":"C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret sharing,” in 8th International Conference on Cryptology and Information Security in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228.","ama":"Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing. In: 8th International Conference on Cryptology and Information Security in Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11","short":"C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and Information Security in Latin America, Springer Nature, 2023, pp. 215–228.","chicago":"Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.” In 8th International Conference on Cryptology and Information Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11.","apa":"Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient secret sharing. In 8th International Conference on Cryptology and Information Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer Nature. https://doi.org/10.1007/978-3-031-44469-2_11"},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031444685"],"eissn":["1611-3349"]},"corr_author":"1","abstract":[{"text":"Threshold secret sharing allows a dealer to split a secret s into n shares, such that any t shares allow for reconstructing s, but no t-1 shares reveal any information about s. Leakage-resilient secret sharing requires that the secret remains hidden, even when an adversary additionally obtains a limited amount of leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy leakage-resilience, where a random subset of leakages is replaced by uniformly random noise. We prove a lower bound for Shamir’s secret sharing, similar to that of Nielsen and Simkin, which holds even when a constant fraction of leakages is replaced by random noise. To this end, we first prove a lower bound on the share size of any noisy-leakage-resilient sharing scheme. We then use this lower bound to show that there exist universal constants c1, c2, such that for sufficiently large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random noise.\r\n\r\n\r\n\r\n","lang":"eng"}],"quality_controlled":"1","external_id":{"isi":["001157041900011"]},"date_published":"2023-10-01T00:00:00Z","isi":1,"date_updated":"2025-09-09T13:09:21Z","publication_status":"published","title":"Stronger lower bounds for leakage-resilient secret sharing"},{"publication":"Proceedings of the 40th International Conference on Machine Learning","citation":{"mla":"Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.","ista":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.","ieee":"M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.","ama":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:26215-26227.","short":"M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 26215–26227.","apa":"Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A. (2023). SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United States: ML Research Press.","chicago":"Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” In Proceedings of the 40th International Conference on Machine Learning, 202:26215–27. ML Research Press, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We would like to thank Elias Frantar for his valuable assistance and support at the outset of this project, and the anonymous ICML and SNN reviewers for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant 805223 ScaleML. ","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2023-07-23","location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29"},"alternative_title":["PMLR"],"abstract":[{"lang":"eng","text":"We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware."}],"quality_controlled":"1","project":[{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223"}],"publication_status":"published","title":"SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge","date_updated":"2025-04-14T07:49:12Z","external_id":{"arxiv":["2302.04852"]},"date_published":"2023-07-30T00:00:00Z","arxiv":1,"ec_funded":1,"corr_author":"1","publication_identifier":{"eissn":["2640-3498"]},"page":"26215-26227","year":"2023","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"DaAl"}],"publisher":"ML Research Press","day":"30","author":[{"full_name":"Nikdan, Mahdi","last_name":"Nikdan","first_name":"Mahdi","id":"66374281-f394-11eb-9cf6-869147deecc0"},{"last_name":"Pegolotti","full_name":"Pegolotti, Tommaso","first_name":"Tommaso"},{"first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221","full_name":"Iofinova, Eugenia B","last_name":"Iofinova"},{"full_name":"Kurtic, Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2302.04852"}],"volume":202,"date_created":"2023-10-29T23:01:17Z","scopus_import":"1","intvolume":" 202","_id":"14460","status":"public","oa_version":"Preprint","oa":1,"month":"07"},{"publisher":"ML Research Press","day":"30","article_processing_charge":"No","department":[{"_id":"MoHe"}],"language":[{"iso":"eng"}],"year":"2023","page":"10072-10092","oa":1,"month":"07","oa_version":"Published Version","status":"public","_id":"14462","scopus_import":"1","intvolume":" 202","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf"}],"author":[{"first_name":"Hendrik","full_name":"Fichtenberger, Hendrik","last_name":"Fichtenberger"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Jalaj","full_name":"Upadhyay, Jalaj","last_name":"Upadhyay"}],"date_created":"2023-10-29T23:01:17Z","volume":202,"alternative_title":["PMLR"],"type":"conference","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was funded by Decanal Research Grant. A part of this work was done when JU was visiting Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia, Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta, and Sarvagya Upadhyay for useful discussions.","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29","start_date":"2023-07-23","location":"Honolulu, Hawaii, HI, United States"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.","ista":"Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained error bound on differentially private continual observation. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10072–10092.","ama":"Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10072-10092.","ieee":"H. Fichtenberger, M. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.","short":"H. Fichtenberger, M. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.","apa":"Fichtenberger, H., Henzinger, M., & Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.","chicago":"Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In Proceedings of the 40th International Conference on Machine Learning, 202:10072–92. ML Research Press, 2023."},"publication":"Proceedings of the 40th International Conference on Machine Learning","publication_identifier":{"eissn":["2640-3498"]},"corr_author":"1","ec_funded":1,"arxiv":1,"date_updated":"2025-05-19T10:59:58Z","title":"Constant matters: Fine-grained error bound on differentially private continual observation","publication_status":"published","project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"date_published":"2023-07-30T00:00:00Z","external_id":{"arxiv":["2202.11205"]},"abstract":[{"text":"We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error.","lang":"eng"}],"quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"Given a triangle Δ, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of Δ with respect to area and perimeter. This problem was initially posed by Nandakumar [17, 22] and was first studied by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present paper, we prove that for any triangle Δ, every maximum area isosceles triangle embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter enclosing triangles is different: there are infinite families of triangles Δ whose minimum perimeter isosceles containers do not share a side and an angle with Δ."}],"quality_controlled":"1","date_updated":"2023-12-13T13:04:55Z","publication_status":"published","title":"Optimal embedded and enclosing isosceles triangles","external_id":{"isi":["001080874400001"],"arxiv":["2205.11637"]},"date_published":"2023-10-05T00:00:00Z","isi":1,"arxiv":1,"publication_identifier":{"eissn":["1793-6373"],"issn":["0129-0541"]},"publication":"International Journal of Foundations of Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Ambrus, Áron, Mónika Csikós, Gergely Kiss, János Pach, and Gábor Somlai. “Optimal Embedded and Enclosing Isosceles Triangles.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2023. https://doi.org/10.1142/S012905412342008X.","apa":"Ambrus, Á., Csikós, M., Kiss, G., Pach, J., & Somlai, G. (2023). Optimal embedded and enclosing isosceles triangles. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S012905412342008X","short":"Á. Ambrus, M. Csikós, G. Kiss, J. Pach, G. Somlai, International Journal of Foundations of Computer Science 34 (2023) 737–760.","ama":"Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. Optimal embedded and enclosing isosceles triangles. International Journal of Foundations of Computer Science. 2023;34(7):737-760. doi:10.1142/S012905412342008X","ieee":"Á. Ambrus, M. Csikós, G. Kiss, J. Pach, and G. Somlai, “Optimal embedded and enclosing isosceles triangles,” International Journal of Foundations of Computer Science, vol. 34, no. 7. World Scientific Publishing, pp. 737–760, 2023.","mla":"Ambrus, Áron, et al. “Optimal Embedded and Enclosing Isosceles Triangles.” International Journal of Foundations of Computer Science, vol. 34, no. 7, World Scientific Publishing, 2023, pp. 737–60, doi:10.1142/S012905412342008X.","ista":"Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. 2023. Optimal embedded and enclosing isosceles triangles. International Journal of Foundations of Computer Science. 34(7), 737–760."},"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2205.11637"}],"author":[{"last_name":"Ambrus","full_name":"Ambrus, Áron","first_name":"Áron"},{"last_name":"Csikós","full_name":"Csikós, Mónika","first_name":"Mónika"},{"full_name":"Kiss, Gergely","last_name":"Kiss","first_name":"Gergely"},{"first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János","last_name":"Pach"},{"first_name":"Gábor","full_name":"Somlai, Gábor","last_name":"Somlai"}],"date_created":"2023-10-29T23:01:18Z","volume":34,"scopus_import":"1","doi":"10.1142/S012905412342008X","intvolume":" 34","oa_version":"Preprint","status":"public","_id":"14464","oa":1,"month":"10","page":"737-760","language":[{"iso":"eng"}],"year":"2023","article_processing_charge":"No","department":[{"_id":"HeEd"}],"article_type":"original","publisher":"World Scientific Publishing","issue":"7","day":"05"},{"date_created":"2023-10-30T16:38:32Z","related_material":{"record":[{"relation":"used_in_publication","id":"14610","status":"public"}]},"abstract":[{"text":"Data related to the following paper:\r\n\"Stress granules plug and stabilize damaged endolysosomal membranes\" (https://doi.org/10.1038/s41586-023-06726-w)\r\n\r\nAbstract: \r\nEndomembrane damage represents a form of stress that is detrimental for eukaryotic cells. To cope with this threat, cells possess mechanisms that repair the damage and restore cellular homeostasis. Endomembrane damage also results in organelle instability and the mechanisms by which cells stabilize damaged endomembranes to enable membrane repair remains unknown. In this work we use a minimal coarse-grained molecular dynamics system to explore how lipid vesicles undergoing poration in a protein-rich medium can be plugged and stabilised by condensate formation. The solution of proteins in and out of the vesicle is described by beads dispersed in implicit solvent. The membrane is described as a one-bead-thick fluid elastic layer of mechanical properties that mimic biological membranes. We tune the interactions between solution beads in the different compartments to capture the differences between the cytoplasmic and endosomal protein solutions and explore how the system responds to different degrees of membrane poration. We find that, in the right interaction regime, condensates form rapidly at the damage site upon solution mixing and act as a plug that prevents futher mixing and destabilisation of the vesicle. Further, when the condensate can interact with the membrane (wetting interactions) we find that it mediates pore sealing and membrane repair. This research is part of the work published in \"Stress granules plug and stabilize damaged endolysosomal membranes\", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w.","lang":"eng"}],"author":[{"last_name":"Vanhille-Campos","full_name":"Vanhille-Campos, Christian Eduardo","id":"3adeca52-9313-11ed-b1ac-c170b2505714","first_name":"Christian Eduardo"},{"last_name":"Šarić","full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela"}],"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"date_published":"2023-10-31T00:00:00Z","date_updated":"2025-09-09T13:30:33Z","doi":"10.15479/AT:ISTA:14472","title":"Stress granules plug and stabilize damaged endolysosomal membranes","status":"public","oa_version":"Published Version","ddc":["570"],"_id":"14472","file_date_updated":"2023-10-31T08:57:50Z","month":"10","oa":1,"corr_author":"1","license":"https://creativecommons.org/publicdomain/zero/1.0/","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Vanhille-Campos, C. E., & Šarić, A. (2023). Stress granules plug and stabilize damaged endolysosomal membranes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:14472","chicago":"Vanhille-Campos, Christian Eduardo, and Anđela Šarić. “Stress Granules Plug and Stabilize Damaged Endolysosomal Membranes.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:14472.","short":"C.E. Vanhille-Campos, A. Šarić, (2023).","ama":"Vanhille-Campos CE, Šarić A. Stress granules plug and stabilize damaged endolysosomal membranes. 2023. doi:10.15479/AT:ISTA:14472","ieee":"C. E. Vanhille-Campos and A. Šarić, “Stress granules plug and stabilize damaged endolysosomal membranes.” Institute of Science and Technology Austria, 2023.","ista":"Vanhille-Campos CE, Šarić A. 2023. Stress granules plug and stabilize damaged endolysosomal membranes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14472.","mla":"Vanhille-Campos, Christian Eduardo, and Anđela Šarić. Stress Granules Plug and Stabilize Damaged Endolysosomal Membranes. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:14472."},"department":[{"_id":"AnSa"}],"has_accepted_license":"1","type":"research_data","article_processing_charge":"No","day":"31","publisher":"Institute of Science and Technology Austria","file":[{"date_created":"2023-10-30T16:31:08Z","file_name":"SGporecondensation-main.zip","success":1,"date_updated":"2023-10-30T16:31:08Z","creator":"ipalaia","access_level":"open_access","file_id":"14473","file_size":62821432,"content_type":"application/zip","relation":"main_file","checksum":"a18706e952e8660c51ede52a167270b7"},{"file_id":"14474","file_size":1697,"checksum":"389eab31c6509dbc05795017fb618758","content_type":"text/plain","relation":"main_file","date_created":"2023-10-31T08:57:50Z","file_name":"README.txt","access_level":"open_access","creator":"dernst","success":1,"date_updated":"2023-10-31T08:57:50Z"}]},{"article_number":"35","_id":"14485","file_date_updated":"2023-11-06T11:45:21Z","ddc":["000"],"oa_version":"Published Version","status":"public","month":"10","oa":1,"volume":281,"date_created":"2023-11-05T23:00:53Z","author":[{"first_name":"Vitaly","last_name":"Aksenov","full_name":"Aksenov, Vitaly"},{"full_name":"Anoprenko, Michael","last_name":"Anoprenko","first_name":"Michael"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"last_name":"Spear","full_name":"Spear, Michael","first_name":"Michael"}],"intvolume":" 281","doi":"10.4230/LIPIcs.DISC.2023.35","scopus_import":"1","department":[{"_id":"GradSch"}],"article_processing_charge":"Yes","has_accepted_license":"1","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2023","language":[{"iso":"eng"}],"corr_author":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773010"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"Batching is a technique that stores multiple keys/values in each node of a data structure. In sequential search data structures, batching reduces latency by reducing the number of cache misses and shortening the chain of pointers to dereference. Applying batching to concurrent data structures is challenging, because it is difficult to maintain the search property and keep contention low in the presence of batching.\r\nIn this paper, we present a general methodology for leveraging batching in concurrent search data structures, called BatchBoost. BatchBoost builds a search data structure from distinct \"data\" and \"index\" layers. The data layer’s purpose is to store a batch of key/value pairs in each of its nodes. The index layer uses an unmodified concurrent search data structure to route operations to a position in the data layer that is \"close\" to where the corresponding key should exist. The requirements on the index and data layers are low: with minimal effort, we were able to compose three highly scalable concurrent search data structures based on three original data structures as the index layers with a batched version of the Lazy List as the data layer. The resulting BatchBoost data structures provide significant performance improvements over their original counterparts."}],"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"},"date_published":"2023-10-01T00:00:00Z","title":"Brief announcement: BatchBoost: Universal batching for concurrent data structures","publication_status":"published","date_updated":"2024-10-09T21:07:14Z","conference":{"end_date":"2023-10-13","start_date":"2023-10-09","location":"L'Aquila, Italy","name":"DISC: Symposium on Distributed Computing"},"type":"conference","alternative_title":["LIPIcs"],"file":[{"file_id":"14492","file_size":646665,"content_type":"application/pdf","relation":"main_file","checksum":"d9f8d2915cccdf2df5905b7cd1b4a560","date_created":"2023-11-06T11:45:21Z","file_name":"2023_LIPIcs_Aksenov.pdf","success":1,"date_updated":"2023-11-06T11:45:21Z","creator":"dernst","access_level":"open_access"}],"publication":"37th International Symposium on Distributed Computing","citation":{"ieee":"V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement: BatchBoost: Universal batching for concurrent data structures,” in 37th International Symposium on Distributed Computing, L’Aquila, Italy, 2023, vol. 281.","ama":"Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost: Universal batching for concurrent data structures. In: 37th International Symposium on Distributed Computing. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.DISC.2023.35","mla":"Aksenov, Vitaly, et al. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” 37th International Symposium on Distributed Computing, vol. 281, 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.DISC.2023.35.","ista":"Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost: Universal batching for concurrent data structures. 37th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 281, 35.","chicago":"Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” In 37th International Symposium on Distributed Computing, Vol. 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.DISC.2023.35.","apa":"Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In 37th International Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35","short":"V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"arxiv":1,"ec_funded":1,"corr_author":"1","publication_identifier":{"issn":["2643-1564"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present a minimal model of ferroelectric large polarons, which are suggested as one of the mechanisms responsible for the unique charge transport properties of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions lead to long-range ferroelectric ordering of rotors, which strongly affects the carrier mobility. In the nonperturbative regime, where our theory cannot be reduced to any of the earlier models, we reveal that the polaron is characterized by large coherence length and a roughly tenfold increase of the effective mass as compared to the bare mass. These results are in good agreement with other theoretical predictions for ferroelectric polarons. Our model establishes a general phenomenological framework for ferroelectric polarons providing the starting point for future studies of their role in the transport properties of hybrid organic-inorganic perovskites."}],"publication_status":"published","title":"Rotor lattice model of ferroelectric large polarons","project":[{"grant_number":"101034413","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"},{"grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"}],"date_updated":"2025-04-14T07:48:54Z","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"},"external_id":{"arxiv":["2301.09875"]},"date_published":"2023-10-05T00:00:00Z","acknowledgement":"We thank Zh. Alpichshev, A. Volosniev, and A. V. Zampetaki for fruitful discussions and comments. This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","type":"journal_article","file":[{"relation":"main_file","content_type":"application/pdf","checksum":"cb8de8fed6e09df1a18bd5a5aec5c55c","file_id":"14493","file_size":1127522,"date_updated":"2023-11-07T07:52:46Z","success":1,"access_level":"open_access","creator":"dernst","file_name":"2023_PhysReviewResearch_Koutentakis.pdf","date_created":"2023-11-07T07:52:46Z"}],"publication":"Physical Review Research","citation":{"ista":"Koutentakis G, Ghazaryan A, Lemeshko M. 2023. Rotor lattice model of ferroelectric large polarons. Physical Review Research. 5(4), 043016.","mla":"Koutentakis, Georgios, et al. “Rotor Lattice Model of Ferroelectric Large Polarons.” Physical Review Research, vol. 5, no. 4, 043016, American Physical Society, 2023, doi:10.1103/PhysRevResearch.5.043016.","ieee":"G. Koutentakis, A. Ghazaryan, and M. Lemeshko, “Rotor lattice model of ferroelectric large polarons,” Physical Review Research, vol. 5, no. 4. American Physical Society, 2023.","ama":"Koutentakis G, Ghazaryan A, Lemeshko M. Rotor lattice model of ferroelectric large polarons. Physical Review Research. 2023;5(4). doi:10.1103/PhysRevResearch.5.043016","short":"G. Koutentakis, A. Ghazaryan, M. Lemeshko, Physical Review Research 5 (2023).","chicago":"Koutentakis, Georgios, Areg Ghazaryan, and Mikhail Lemeshko. “Rotor Lattice Model of Ferroelectric Large Polarons.” Physical Review Research. American Physical Society, 2023. https://doi.org/10.1103/PhysRevResearch.5.043016.","apa":"Koutentakis, G., Ghazaryan, A., & Lemeshko, M. (2023). Rotor lattice model of ferroelectric large polarons. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.5.043016"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"_id":"14486","file_date_updated":"2023-11-07T07:52:46Z","oa_version":"Published Version","status":"public","article_number":"043016","oa":1,"month":"10","author":[{"last_name":"Koutentakis","full_name":"Koutentakis, Georgios","first_name":"Georgios","id":"d7b23d3a-9e21-11ec-b482-f76739596b95"},{"orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"volume":5,"date_created":"2023-11-05T23:00:53Z","doi":"10.1103/PhysRevResearch.5.043016","scopus_import":"1","intvolume":" 5","article_processing_charge":"Yes","has_accepted_license":"1","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","article_type":"original","issue":"4","day":"05","year":"2023","language":[{"iso":"eng"}]}]