[{"type":"journal_article","scopus_import":"1","arxiv":1,"OA_type":"green","publication":"IEEE Transactions on Information Theory","intvolume":"        70","corr_author":"1","abstract":[{"text":"In this work we consider the list-decodability and list-recoverability of arbitrary q -ary codes, for all integer values of q ⩾ 2. A code is called ( p , L ) q -list-decodable if every radius pn Hamming ball contains less than L codewords; ( p , ℓ, L ) q -recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length ℓ and again stipulate that there be less than L codewords. Our main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate ( p , ℓ, L ) q -list-recoverable codes, the quantity we call the zero-rate threshold . Denoting this value by p *, we in fact show that codes correcting a p * + ε fraction of errors must have size O ε (1), i.e., independent of n . Such a result is typically referred to as a “Plotkin bound.” To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p * − ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery. Technically, proving the Plotkin bound boils down to demon-strating the Schur convexity of a certain function defined on the q -simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q -ary list-decoding; however, we point out that this earlier proof is flawed.","lang":"eng"}],"quality_controlled":"1","article_type":"original","volume":70,"doi":"10.1109/TIT.2024.3430842","oa":1,"date_updated":"2025-09-08T08:31:53Z","article_processing_charge":"No","date_published":"2024-09-01T00:00:00Z","author":[{"first_name":"Nicolas","last_name":"Resch","full_name":"Resch, Nicolas"},{"full_name":"Yuan, Chen","last_name":"Yuan","first_name":"Chen"},{"full_name":"Zhang, Yihan","orcid":"0000-0002-6465-6258","last_name":"Zhang","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"}],"language":[{"iso":"eng"}],"department":[{"_id":"MaMo"}],"date_created":"2024-07-28T22:01:10Z","page":"6211-6238","main_file_link":[{"url":"https://arxiv.org/abs/2210.07754","open_access":"1"}],"month":"09","issue":"9","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"year":"2024","publication_status":"published","acknowledgement":"Part of this work was done while Nicolas Resch was affiliated with the Centrum Wiskunde & Informatica and supported in part by ERC H2020 grant No.74079 (ALGSTRONGCRYPTO). Chen Yuan is supported in part by the National Key Research and Development Projects under Grant 2022YFA1004900 and Grant 2021YFE0109900, the National Natural Science Foundation of China under Grant 12101403 and Grant 12031011.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","status":"public","publisher":"IEEE","external_id":{"arxiv":["2210.07754"],"isi":["001299623600019"]},"isi":1,"citation":{"mla":"Resch, Nicolas, et al. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 9, IEEE, 2024, pp. 6211–38, doi:<a href=\"https://doi.org/10.1109/TIT.2024.3430842\">10.1109/TIT.2024.3430842</a>.","short":"N. Resch, C. Yuan, Y. Zhang, IEEE Transactions on Information Theory 70 (2024) 6211–6238.","chicago":"Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/TIT.2024.3430842\">https://doi.org/10.1109/TIT.2024.3430842</a>.","ieee":"N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery,” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 9. IEEE, pp. 6211–6238, 2024.","ista":"Resch N, Yuan C, Zhang Y. 2024. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. IEEE Transactions on Information Theory. 70(9), 6211–6238.","ama":"Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. <i>IEEE Transactions on Information Theory</i>. 2024;70(9):6211-6238. doi:<a href=\"https://doi.org/10.1109/TIT.2024.3430842\">10.1109/TIT.2024.3430842</a>","apa":"Resch, N., Yuan, C., &#38; Zhang, Y. (2024). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2024.3430842\">https://doi.org/10.1109/TIT.2024.3430842</a>"},"related_material":{"record":[{"id":"14083","status":"public","relation":"earlier_version"}]},"_id":"17330","oa_version":"Preprint","title":"Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery","OA_place":"repository"},{"oa":1,"date_updated":"2025-09-08T08:33:53Z","volume":92,"doi":"10.1002/prot.26732","article_processing_charge":"No","date_published":"2024-12-01T00:00:00Z","publication":"Proteins: Structure, Function and Bioinformatics","intvolume":"        92","scopus_import":"1","type":"journal_article","OA_type":"green","article_type":"original","abstract":[{"text":"Amyloidosis are a group of diseases in which soluble proteins aggregate and deposit in fibrillar conformation extracellularly in tissues. The effectiveness of therapeutic strategies depends on the specific protein involved, being crucial to accurately determine its nature. Moreover, following the diagnosis, the search for the mutation within relatives allows the clinical advice. Here we report the precise diagnosis and explored the possible reasons of the structural pathogenicity for a renal amyloidosis related to a fibrinogen Aα-chain variant. Whole-exome sequencing and GATK calling pipeline were leveraged to characterize the protein variant present in a patient with kidney failure. Bioinformatics strategies were applied to suggest potential explanations of the variants aggregation. Our pipeline allowed the identification of a single-point variant of fibrinogen Aα-chain, which opened the possibility of curative transplantation. In silico structural analysis suggested that the pathogenicity of the variant may be attributed to a heightened susceptibility to yield a peptide prone to deposit as an oligomer with a β-sheet structure. Exploiting the comprehensive coverage of whole-genome sequencing, we managed to fill a vacant stage in the diagnosis of hereditary amyloidosis and to stimulate the advancement in biomedicine.","lang":"eng"}],"quality_controlled":"1","publication_identifier":{"issn":["0887-3585"],"eissn":["1097-0134"]},"year":"2024","page":"1366-1374","author":[{"first_name":"Elizabeth R","full_name":"Cattaneo, Elizabeth R","last_name":"Cattaneo"},{"last_name":"Gisonno","full_name":"Gisonno, Romina A","id":"a9e08d76-6a98-11ec-8f7b-c777fe5ca519","first_name":"Romina A"},{"last_name":"Abba","full_name":"Abba, Martín C","first_name":"Martín C"},{"last_name":"Santana","full_name":"Santana, Marianela","first_name":"Marianela"},{"first_name":"Silvana A","last_name":"Rosú","full_name":"Rosú, Silvana A"},{"first_name":"Elsa","last_name":"Nucifora","full_name":"Nucifora, Elsa"},{"full_name":"Aguirre, María A","last_name":"Aguirre","first_name":"María A"},{"last_name":"Giordani","full_name":"Giordani, María C","first_name":"María C"},{"first_name":"M. Alejandra","full_name":"Tricerri, M. Alejandra","last_name":"Tricerri"},{"last_name":"Ramella","full_name":"Ramella, Nahuel A","first_name":"Nahuel A"}],"department":[{"_id":"GaNo"}],"language":[{"iso":"eng"}],"date_created":"2024-07-28T22:01:10Z","issue":"12","main_file_link":[{"url":"https://doi.org/10.22541/au.171804763.37967262/v1","open_access":"1"}],"month":"12","publisher":"Wiley","status":"public","isi":1,"external_id":{"pmid":["39031927"],"isi":["001272128100001"]},"publication_status":"published","acknowledgement":"The authors acknowledge Rosana del Cid for her help with English corrections, Mario Ramos for the figure editions, and Gabriela Finarelli for technical assistance. S.A. Rosú, N.A. Ramella, and M.A. Tricerri acknowledge support from Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET) (Grant PIP 11220200102381), Agencia Nacional de Promoción Científica y Tecnológica (PICT 2019-03592), Universidad Nacional de La Plata (UNLP) (Grants M234 and PPID M014), and Fundación Florencio Fiorini. The authors warmly thank M.P. for her willingness to conduct these studies.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","OA_place":"repository","title":"Hereditary amyloidosis: Insights into a fibrinogen A variant protein","pmid":1,"citation":{"ama":"Cattaneo ER, Gisonno RA, Abba MC, et al. Hereditary amyloidosis: Insights into a fibrinogen A variant protein. <i>Proteins: Structure, Function and Bioinformatics</i>. 2024;92(12):1366-1374. doi:<a href=\"https://doi.org/10.1002/prot.26732\">10.1002/prot.26732</a>","apa":"Cattaneo, E. R., Gisonno, R. A., Abba, M. C., Santana, M., Rosú, S. A., Nucifora, E., … Ramella, N. A. (2024). Hereditary amyloidosis: Insights into a fibrinogen A variant protein. <i>Proteins: Structure, Function and Bioinformatics</i>. Wiley. <a href=\"https://doi.org/10.1002/prot.26732\">https://doi.org/10.1002/prot.26732</a>","short":"E.R. Cattaneo, R.A. Gisonno, M.C. Abba, M. Santana, S.A. Rosú, E. Nucifora, M.A. Aguirre, M.C. Giordani, M.A. Tricerri, N.A. Ramella, Proteins: Structure, Function and Bioinformatics 92 (2024) 1366–1374.","mla":"Cattaneo, Elizabeth R., et al. “Hereditary Amyloidosis: Insights into a Fibrinogen A Variant Protein.” <i>Proteins: Structure, Function and Bioinformatics</i>, vol. 92, no. 12, Wiley, 2024, pp. 1366–74, doi:<a href=\"https://doi.org/10.1002/prot.26732\">10.1002/prot.26732</a>.","ista":"Cattaneo ER, Gisonno RA, Abba MC, Santana M, Rosú SA, Nucifora E, Aguirre MA, Giordani MC, Tricerri MA, Ramella NA. 2024. Hereditary amyloidosis: Insights into a fibrinogen A variant protein. Proteins: Structure, Function and Bioinformatics. 92(12), 1366–1374.","chicago":"Cattaneo, Elizabeth R, Romina A Gisonno, Martín C Abba, Marianela Santana, Silvana A Rosú, Elsa Nucifora, María A Aguirre, María C Giordani, M. Alejandra Tricerri, and Nahuel A Ramella. “Hereditary Amyloidosis: Insights into a Fibrinogen A Variant Protein.” <i>Proteins: Structure, Function and Bioinformatics</i>. Wiley, 2024. <a href=\"https://doi.org/10.1002/prot.26732\">https://doi.org/10.1002/prot.26732</a>.","ieee":"E. R. Cattaneo <i>et al.</i>, “Hereditary amyloidosis: Insights into a fibrinogen A variant protein,” <i>Proteins: Structure, Function and Bioinformatics</i>, vol. 92, no. 12. Wiley, pp. 1366–1374, 2024."},"_id":"17331","oa_version":"Preprint"},{"conference":{"end_date":"2024-05-31","name":"IPDPS: International Parallel and Distributed Processing Symposium","start_date":"2024-05-27","location":"San Francisco, CA, United States"},"abstract":[{"text":"Tree data structures, such as red-black trees, quad trees, treaps, or tries, are fundamental tools in computer science. A classical problem in concurrency is to obtain expressive, efficient, and scalable versions of practical tree data structures. We are interested in concurrent trees supporting range queries, i.e., queries that involve multiple consecutive data items. Existing implementations with this capability can list keys in a specific range, but do not support aggregate range queries: for instance, if we want to calculate the number of keys in a range, the only choice is to retrieve a whole list and return its size. This is suboptimal: in the sequential setting, one can augment a balanced search tree with counters and, consequently, perform these aggregate requests in logarithmic rather than linear time.In this paper, we propose a generic approach to implement a broad class of range queries on concurrent trees in a way that is wait-free, asymptotically efficient, and practically scalable. The key idea is a new mechanism for maintaining metadata concurrently at tree nodes, which can be seen as a wait-free variant of hand-over-hand locking (which we call hand-over-hand helping). We did a preliminary implementation of the wait-free binary search tree and preliminary experiments have indicated the soundness of our approach.","lang":"eng"}],"quality_controlled":"1","publication":"2024 IEEE International Parallel and Distributed Processing Symposium","corr_author":"1","arxiv":1,"type":"conference","scopus_import":"1","article_processing_charge":"No","date_published":"2024-07-08T00:00:00Z","oa":1,"date_updated":"2025-09-08T08:29:45Z","doi":"10.1109/IPDPS57955.2024.00023","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.05293"}],"month":"07","page":"169-179","author":[{"full_name":"Kokorin, Ilya","last_name":"Kokorin","first_name":"Ilya"},{"last_name":"Yudov","full_name":"Yudov, Victor","first_name":"Victor"},{"first_name":"Vitaly","full_name":"Aksenov, Vitaly","last_name":"Aksenov"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"date_created":"2024-07-28T22:01:11Z","department":[{"_id":"DaAl"}],"year":"2024","publication_identifier":{"isbn":["9798350337662"],"eissn":["1530-2075"]},"acknowledgement":"We thank Trevor Brown and Yuanhao Wei for the discussion and anonymous reviewers for helping us to improve the paper. Also, we thank JetBrains and Huawei for their support.","day":"08","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","isi":1,"external_id":{"isi":["001270389600078"],"arxiv":["2310.05293"]},"publisher":"IEEE","status":"public","oa_version":"Preprint","_id":"17332","citation":{"short":"I. Kokorin, V. Yudov, V. Aksenov, D.-A. Alistarh, in:, 2024 IEEE International Parallel and Distributed Processing Symposium, IEEE, 2024, pp. 169–179.","mla":"Kokorin, Ilya, et al. “Wait-Free Trees with Asymptotically-Efficient Range Queries.” <i>2024 IEEE International Parallel and Distributed Processing Symposium</i>, IEEE, 2024, pp. 169–79, doi:<a href=\"https://doi.org/10.1109/IPDPS57955.2024.00023\">10.1109/IPDPS57955.2024.00023</a>.","ista":"Kokorin I, Yudov V, Aksenov V, Alistarh D-A. 2024. Wait-free trees with asymptotically-efficient range queries. 2024 IEEE International Parallel and Distributed Processing Symposium. IPDPS: International Parallel and Distributed Processing Symposium, 169–179.","chicago":"Kokorin, Ilya, Victor Yudov, Vitaly Aksenov, and Dan-Adrian Alistarh. “Wait-Free Trees with Asymptotically-Efficient Range Queries.” In <i>2024 IEEE International Parallel and Distributed Processing Symposium</i>, 169–79. IEEE, 2024. <a href=\"https://doi.org/10.1109/IPDPS57955.2024.00023\">https://doi.org/10.1109/IPDPS57955.2024.00023</a>.","ieee":"I. Kokorin, V. Yudov, V. Aksenov, and D.-A. Alistarh, “Wait-free trees with asymptotically-efficient range queries,” in <i>2024 IEEE International Parallel and Distributed Processing Symposium</i>, San Francisco, CA, United States, 2024, pp. 169–179.","ama":"Kokorin I, Yudov V, Aksenov V, Alistarh D-A. Wait-free trees with asymptotically-efficient range queries. In: <i>2024 IEEE International Parallel and Distributed Processing Symposium</i>. IEEE; 2024:169-179. doi:<a href=\"https://doi.org/10.1109/IPDPS57955.2024.00023\">10.1109/IPDPS57955.2024.00023</a>","apa":"Kokorin, I., Yudov, V., Aksenov, V., &#38; Alistarh, D.-A. (2024). Wait-free trees with asymptotically-efficient range queries. In <i>2024 IEEE International Parallel and Distributed Processing Symposium</i> (pp. 169–179). San Francisco, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/IPDPS57955.2024.00023\">https://doi.org/10.1109/IPDPS57955.2024.00023</a>"},"title":"Wait-free trees with asymptotically-efficient range queries"},{"publication_status":"published","day":"26","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Springer Nature","status":"public","isi":1,"external_id":{"isi":["001278986700012"]},"citation":{"short":"S. Mondal, S.A. Freunberger, Nature Catalysis 7 (2024) 759–760.","mla":"Mondal, Soumyadip, and Stefan Alexander Freunberger. “Catalysing Rate and Capacity.” <i>Nature Catalysis</i>, vol. 7, no. 7, Springer Nature, 2024, pp. 759–60, doi:<a href=\"https://doi.org/10.1038/s41929-024-01184-7\">10.1038/s41929-024-01184-7</a>.","ieee":"S. Mondal and S. A. Freunberger, “Catalysing rate and capacity,” <i>Nature Catalysis</i>, vol. 7, no. 7. Springer Nature, pp. 759–760, 2024.","ista":"Mondal S, Freunberger SA. 2024. Catalysing rate and capacity. Nature Catalysis. 7(7), 759–760.","chicago":"Mondal, Soumyadip, and Stefan Alexander Freunberger. “Catalysing Rate and Capacity.” <i>Nature Catalysis</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41929-024-01184-7\">https://doi.org/10.1038/s41929-024-01184-7</a>.","ama":"Mondal S, Freunberger SA. Catalysing rate and capacity. <i>Nature Catalysis</i>. 2024;7(7):759-760. doi:<a href=\"https://doi.org/10.1038/s41929-024-01184-7\">10.1038/s41929-024-01184-7</a>","apa":"Mondal, S., &#38; Freunberger, S. A. (2024). Catalysing rate and capacity. <i>Nature Catalysis</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41929-024-01184-7\">https://doi.org/10.1038/s41929-024-01184-7</a>"},"oa_version":"None","_id":"17333","title":"Catalysing rate and capacity","corr_author":"1","intvolume":"         7","publication":"Nature Catalysis","type":"journal_article","scopus_import":"1","article_type":"letter_note","quality_controlled":"1","abstract":[{"lang":"eng","text":"Aqueous zinc-ion batteries are attractive due to their low cost, environmental friendliness, and exceptional performance, but the latter remains poorly understood. Now, a fast catalytic step involved in oxygen redox catalysis is shown to contribute to capacity at a high rate."}],"date_updated":"2025-09-08T08:30:59Z","volume":7,"doi":"10.1038/s41929-024-01184-7","date_published":"2024-07-26T00:00:00Z","article_processing_charge":"No","page":"759-760","department":[{"_id":"StFr"}],"language":[{"iso":"eng"}],"date_created":"2024-07-29T07:05:33Z","author":[{"first_name":"Soumyadip","id":"d25d21ef-dc8d-11ea-abe3-ec4576307f48","full_name":"Mondal, Soumyadip","last_name":"Mondal"},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"}],"issue":"7","month":"07","publication_identifier":{"issn":["2520-1158"]},"year":"2024"},{"author":[{"last_name":"Pedrotti","full_name":"Pedrotti, Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","first_name":"Francesco"}],"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"date_created":"2024-07-29T09:14:14Z","language":[{"iso":"eng"}],"page":"183","file":[{"date_created":"2024-08-02T09:23:26Z","creator":"fpedrott","checksum":"11650bab714ef85ad43a287060850523","file_size":2941599,"success":1,"content_type":"application/pdf","access_level":"open_access","file_id":"17366","date_updated":"2024-08-02T09:23:26Z","relation":"main_file","file_name":"thesis_final.pdf"},{"date_created":"2024-08-02T09:27:15Z","checksum":"c30ba5611941226cf1bfc867c25b1e80","creator":"fpedrott","file_size":6293375,"content_type":"application/x-zip-compressed","file_id":"17367","access_level":"closed","date_updated":"2024-08-02T09:27:15Z","file_name":"thesis_final_source.zip","relation":"source_file"}],"month":"07","supervisor":[{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan"}],"alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"year":"2024","type":"dissertation","ddc":["500","510","515","519"],"corr_author":"1","abstract":[{"lang":"eng","text":"This thesis deals with the study of stochastic processes and their ergodicity properties. The\r\nvariety of problems encountered calls for a set of different approaches, ranging from classical to\r\nmodern ones: a special place is held by probabilistic methods based on couplings, by functional\r\ninequalities, and by the theory of gradient flows in the space of measures.\r\n\r\nThe material is organized as follows. Chapter 1 contains the introduction to this thesis, starting\r\nwith a general presentation of some of the relevant topics. Section 1.1 is dedicated to the\r\ntheory of gradient flows in metric spaces, and introduces the first contribution of this thesis\r\n[DSMP24], which is presented in detail in Chapter 2. Section 1.2 moves to the topic of\r\ncurvature of Markov chains, concluding with a brief description of our second contribution\r\n[Ped23], which is included in Chapter 3. Section 1.3 discusses applications of stochastic\r\nprocesses to the theory of sampling, in particular the recent framework of score-based diffusion\r\nmodels, and our contribution [PMM24], which is contained in Chapter 4. Section 1.4 discusses\r\nsome related problems, concerning the regularization properties of the heat flow. It serves\r\nas a motivation for the work [BP24], which we report in Chapter 5. Finally, Section 1.5\r\ndiscusses the last contribution of this thesis, which can be found in Chapter 6. It deals with\r\nthe convergence to equilibrium of a particular stochastic model from quantitative genetics:\r\nthis is established via some functional inequalities, which we prove with probabilistic arguments\r\nbased on couplings.\r\n"}],"ec_funded":1,"doi":"10.15479/at:ista:17336","oa":1,"date_updated":"2026-04-07T13:00:03Z","article_processing_charge":"No","date_published":"2024-07-31T00:00:00Z","citation":{"ama":"Pedrotti F. Functional inequalities and convergence of stochastic processes. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17336\">10.15479/at:ista:17336</a>","apa":"Pedrotti, F. (2024). <i>Functional inequalities and convergence of stochastic processes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17336\">https://doi.org/10.15479/at:ista:17336</a>","mla":"Pedrotti, Francesco. <i>Functional Inequalities and Convergence of Stochastic Processes</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17336\">10.15479/at:ista:17336</a>.","short":"F. Pedrotti, Functional Inequalities and Convergence of Stochastic Processes, Institute of Science and Technology Austria, 2024.","chicago":"Pedrotti, Francesco. “Functional Inequalities and Convergence of Stochastic Processes.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17336\">https://doi.org/10.15479/at:ista:17336</a>.","ieee":"F. Pedrotti, “Functional inequalities and convergence of stochastic processes,” Institute of Science and Technology Austria, 2024.","ista":"Pedrotti F. 2024. Functional inequalities and convergence of stochastic processes. Institute of Science and Technology Austria."},"related_material":{"record":[{"id":"17351","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"17353","status":"public"},{"relation":"part_of_dissertation","id":"17350","status":"public"},{"status":"public","id":"17352","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"17143"}]},"project":[{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"oa_version":"Published Version","_id":"17336","title":"Functional inequalities and convergence of stochastic processes","file_date_updated":"2024-08-02T09:27:15Z","OA_place":"publisher","degree_awarded":"PhD","publication_status":"published","day":"31","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"}},{"type":"research_data","ddc":["576"],"abstract":[{"text":"This file contains the Mathematica notebook associated with the paper Effect of assortative mating and sexual selection on polygenic barriers to gene flow. It contains the numerical approximations, analyses, and simulations used in the study. ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","status":"public","doi":"10.15479/AT:ISTA:17344","oa":1,"publisher":"Institute of Science and Technology Austria","date_updated":"2025-01-14T13:02:59Z","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"date_published":"2024-07-01T00:00:00Z","citation":{"apa":"Surendranadh, P., &#38; Sachdeva, H. (2024). Mathematica notebook for “Effect of assortative mating and sexual selection on polygenic barriers to gene flow.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:17344\">https://doi.org/10.15479/AT:ISTA:17344</a>","ama":"Surendranadh P, Sachdeva H. Mathematica notebook for “Effect of assortative mating and sexual selection on polygenic barriers to gene flow.” 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17344\">10.15479/AT:ISTA:17344</a>","ista":"Surendranadh P, Sachdeva H. 2024. Mathematica notebook for ‘Effect of assortative mating and sexual selection on polygenic barriers to gene flow’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:17344\">10.15479/AT:ISTA:17344</a>.","ieee":"P. Surendranadh and H. Sachdeva, “Mathematica notebook for ‘Effect of assortative mating and sexual selection on polygenic barriers to gene flow.’” Institute of Science and Technology Austria, 2024.","chicago":"Surendranadh, Parvathy, and Himani Sachdeva. “Mathematica Notebook for ‘Effect of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene Flow.’” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:17344\">https://doi.org/10.15479/AT:ISTA:17344</a>.","short":"P. Surendranadh, H. Sachdeva, (2024).","mla":"Surendranadh, Parvathy, and Himani Sachdeva. <i>Mathematica Notebook for “Effect of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene Flow.”</i> Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17344\">10.15479/AT:ISTA:17344</a>."},"author":[{"first_name":"Parvathy","id":"455235B8-F248-11E8-B48F-1D18A9856A87","full_name":"Surendranadh, Parvathy","orcid":"0000-0001-6395-386X","last_name":"Surendranadh"},{"first_name":"Himani","last_name":"Sachdeva","full_name":"Sachdeva, Himani"}],"date_created":"2024-07-29T14:01:43Z","department":[{"_id":"GradSch"},{"_id":"NiBa"}],"file":[{"relation":"main_file","file_name":"Submission.nb","date_updated":"2024-07-29T13:51:11Z","access_level":"open_access","file_id":"17345","content_type":"application/octet-stream","file_size":726132,"success":1,"creator":"psurendr","checksum":"75bdbc7ad7cc6afe4459bc4a8824a302","date_created":"2024-07-29T13:51:11Z"}],"month":"07","oa_version":"Published Version","_id":"17344","title":"Mathematica notebook for 'Effect of assortative mating and sexual selection on polygenic barriers to gene flow'","file_date_updated":"2024-07-29T13:51:11Z","acknowledged_ssus":[{"_id":"ScienComp"}],"year":"2024"},{"citation":{"apa":"Pedrotti, F., Maas, J., &#38; Mondelli, M. (n.d.). Improved convergence of score-based diffusion models via prediction-correction. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2305.14164\">https://doi.org/10.48550/arXiv.2305.14164</a>","ama":"Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2305.14164\">10.48550/arXiv.2305.14164</a>","ieee":"F. Pedrotti, J. Maas, and M. Mondelli, “Improved convergence of score-based diffusion models via prediction-correction,” <i>arXiv</i>. .","chicago":"Pedrotti, Francesco, Jan Maas, and Marco Mondelli. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2305.14164\">https://doi.org/10.48550/arXiv.2305.14164</a>.","ista":"Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2305.14164\">10.48550/arXiv.2305.14164</a>.","mla":"Pedrotti, Francesco, et al. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2305.14164\">10.48550/arXiv.2305.14164</a>.","short":"F. Pedrotti, J. Maas, M. Mondelli, ArXiv (n.d.)."},"author":[{"full_name":"Pedrotti, Francesco","last_name":"Pedrotti","first_name":"Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c"},{"full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"}],"language":[{"iso":"eng"}],"date_created":"2024-07-31T07:56:40Z","related_material":{"record":[{"relation":"later_version","id":"18897","status":"public"},{"relation":"dissertation_contains","status":"public","id":"17336"}]},"department":[{"_id":"JaMa"},{"_id":"MaMo"}],"_id":"17350","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2305.14164"}],"project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"month":"06","OA_place":"repository","title":"Improved convergence of score-based diffusion models via prediction-correction","year":"2024","publication":"arXiv","publication_status":"draft","corr_author":"1","arxiv":1,"type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"06","abstract":[{"lang":"eng","text":"Score-based generative models (SGMs) are powerful tools to sample from\r\ncomplex data distributions. Their underlying idea is to (i) run a forward\r\nprocess for time $T_1$ by adding noise to the data, (ii) estimate its score\r\nfunction, and (iii) use such estimate to run a reverse process. As the reverse\r\nprocess is initialized with the stationary distribution of the forward one, the\r\nexisting analysis paradigm requires $T_1\\to\\infty$. This is however\r\nproblematic: from a theoretical viewpoint, for a given precision of the score\r\napproximation, the convergence guarantee fails as $T_1$ diverges; from a\r\npractical viewpoint, a large $T_1$ increases computational costs and leads to\r\nerror propagation. This paper addresses the issue by considering a version of\r\nthe popular predictor-corrector scheme: after running the forward process, we\r\nfirst estimate the final distribution via an inexact Langevin dynamics and then\r\nrevert the process. Our key technical contribution is to provide convergence\r\nguarantees which require to run the forward process only for a fixed finite\r\ntime $T_1$. Our bounds exhibit a mild logarithmic dependence on the input\r\ndimension and the subgaussian norm of the target distribution, have minimal\r\nassumptions on the data, and require only to control the $L^2$ loss on the\r\nscore approximation, which is the quantity minimized in practice."}],"oa":1,"date_updated":"2026-04-07T13:00:02Z","status":"public","doi":"10.48550/arXiv.2305.14164","article_processing_charge":"No","date_published":"2024-06-06T00:00:00Z","external_id":{"arxiv":["2305.14164"]}},{"year":"2024","OA_place":"repository","title":"L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher's infinitesimal model","_id":"17352","oa_version":"Preprint","month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.04151"}],"project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"grant_number":"26293","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","name":"The impact of deleterious mutations on small populations"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","id":"20050","status":"public"},{"id":"17336","status":"public","relation":"dissertation_contains"}]},"department":[{"_id":"JaMa"}],"date_created":"2024-07-31T08:07:40Z","citation":{"chicago":"Khudiakova, Kseniia, Jan Maas, and Francesco Pedrotti. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2402.04151\">https://doi.org/10.48550/arXiv.2402.04151</a>.","ieee":"K. Khudiakova, J. Maas, and F. Pedrotti, “L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model,” <i>arXiv</i>. .","ista":"Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. arXiv, 2402.04151.","mla":"Khudiakova, Kseniia, et al. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>ArXiv</i>, 2402.04151, doi:<a href=\"https://doi.org/10.48550/arXiv.2402.04151\">10.48550/arXiv.2402.04151</a>.","short":"K. Khudiakova, J. Maas, F. Pedrotti, ArXiv (n.d.).","apa":"Khudiakova, K., Maas, J., &#38; Pedrotti, F. (n.d.). L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2402.04151\">https://doi.org/10.48550/arXiv.2402.04151</a>","ama":"Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2402.04151\">10.48550/arXiv.2402.04151</a>"},"author":[{"id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","first_name":"Kseniia","orcid":"0000-0002-6246-1465","last_name":"Khudiakova","full_name":"Khudiakova, Kseniia"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-0845-1338","last_name":"Maas","full_name":"Maas, Jan"},{"first_name":"Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","full_name":"Pedrotti, Francesco","last_name":"Pedrotti"}],"date_published":"2024-02-07T00:00:00Z","article_processing_charge":"No","external_id":{"arxiv":["2402.04151"]},"date_updated":"2026-04-07T13:00:02Z","oa":1,"article_number":"2402.04151","doi":"10.48550/arXiv.2402.04151","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"07","abstract":[{"lang":"eng","text":"We prove upper bounds on the $L^\\infty$-Wasserstein distance from optimal\r\ntransport between strongly log-concave probability densities and log-Lipschitz\r\nperturbations. In the simplest setting, such a bound amounts to a\r\ntransport-information inequality involving the $L^\\infty$-Wasserstein metric\r\nand the relative $L^\\infty$-Fisher information. We show that this inequality\r\ncan be sharpened significantly in situations where the involved densities are\r\nanisotropic. Our proof is based on probabilistic techniques using Langevin\r\ndynamics. As an application of these results, we obtain sharp exponential rates\r\nof convergence in Fisher's infinitesimal model from quantitative genetics,\r\ngeneralising recent results by Calvez, Poyato, and Santambrogio in dimension 1\r\nto arbitrary dimensions."}],"corr_author":"1","publication":"arXiv","publication_status":"draft","arxiv":1,"type":"preprint"},{"abstract":[{"text":"In this paper we derive estimates for the Hessian of the logarithm\r\n(log-Hessian) for solutions to the heat equation. For initial data in the form\r\nof log-Lipschitz perturbation of strongly log-concave measures, the log-Hessian\r\nadmits an explicit, uniform (in space) lower bound. This yields a new estimate\r\nfor the Lipschitz constant of a transport map pushing forward the standard\r\nGaussian to a measure in this class. Further connections are discussed with\r\nscore-based diffusion models and improved Gaussian logarithmic Sobolev\r\ninequalities. Finally, we show that assuming only fast decay of the tails of\r\nthe initial datum does not suffice to guarantee uniform log-Hessian upper\r\nbounds.","lang":"eng"}],"day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","arxiv":1,"publication_status":"draft","publication":"arXiv","corr_author":"1","external_id":{"arxiv":["2404.15205"]},"article_processing_charge":"No","date_published":"2024-05-08T00:00:00Z","status":"public","doi":"10.48550/arXiv.2404.15205","oa":1,"article_number":"2404.15205","date_updated":"2026-04-07T13:00:02Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2404.15205","open_access":"1"}],"month":"05","oa_version":"Preprint","_id":"17353","author":[{"full_name":"Brigati, Giovanni","last_name":"Brigati","first_name":"Giovanni","id":"63ff57e8-1fbb-11ee-88f2-f558ffc59cf1"},{"last_name":"Pedrotti","full_name":"Pedrotti, Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","first_name":"Francesco"}],"citation":{"ama":"Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2404.15205\">10.48550/arXiv.2404.15205</a>","apa":"Brigati, G., &#38; Pedrotti, F. (n.d.). Heat flow, log-concavity, and Lipschitz transport maps. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2404.15205\">https://doi.org/10.48550/arXiv.2404.15205</a>","short":"G. Brigati, F. Pedrotti, ArXiv (n.d.).","mla":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>ArXiv</i>, 2404.15205, doi:<a href=\"https://doi.org/10.48550/arXiv.2404.15205\">10.48550/arXiv.2404.15205</a>.","ieee":"G. Brigati and F. Pedrotti, “Heat flow, log-concavity, and Lipschitz transport maps,” <i>arXiv</i>. .","ista":"Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. arXiv, 2404.15205.","chicago":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2404.15205\">https://doi.org/10.48550/arXiv.2404.15205</a>."},"department":[{"_id":"JaMa"}],"date_created":"2024-07-31T08:17:14Z","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"20591"},{"relation":"dissertation_contains","status":"public","id":"17336"}]},"year":"2024","title":"Heat flow, log-concavity, and Lipschitz transport maps","OA_place":"repository"},{"_id":"17361","oa_version":"Preprint","project":[{"grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2407.19908"}],"keyword":["space of space curves","symplectic stuctures"],"month":"07","citation":{"ieee":"M. Bauer, S. Ishida, and P. W. Michor, “Symplectic structures on the space of space curves,” <i>arXiv</i>. .","chicago":"Bauer, Martin, Sadashige Ishida, and Peter W. Michor. “Symplectic Structures on the Space of Space Curves.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">https://doi.org/10.48550/arXiv.2407.19908</a>.","ista":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>.","mla":"Bauer, Martin, et al. “Symplectic Structures on the Space of Space Curves.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>.","short":"M. Bauer, S. Ishida, P.W. Michor, ArXiv (n.d.).","apa":"Bauer, M., Ishida, S., &#38; Michor, P. W. (n.d.). Symplectic structures on the space of space curves. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">https://doi.org/10.48550/arXiv.2407.19908</a>","ama":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>"},"author":[{"first_name":"Martin","last_name":"Bauer","full_name":"Bauer, Martin"},{"first_name":"Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige","orcid":"0000-0002-3121-3100","last_name":"Ishida"},{"first_name":"Peter W.","full_name":"Michor, Peter W.","last_name":"Michor"}],"language":[{"iso":"eng"}],"date_created":"2024-08-01T06:34:08Z","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20551"},{"relation":"later_version","id":"21743","status":"public"}]},"year":"2024","OA_place":"repository","title":"Symplectic structures on the space of space curves","acknowledgement":"The authors are grateful to Boris Khesin for valuable comments on the MW symplectic structure and S. Ishida thanks Albert Chern for insightful discussions on space curves and Chris Wojtan for his continuous support. M. Bauer was partially supported by NSF grant DMS-1953244 and by the Binational Science Foundation (BSF). S. Ishida was partially supported by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council. Some figures were generated by the software Houdini and its education license was provided by SideFX.","day":"29","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"lang":"eng","text":"We present symplectic structures on the shape space of unparameterized space curves that generalize the classical Marsden-Weinstein structure. Our method integrates the Liouville 1-form of the Marsden-Weinstein structure with Riemannian structures that have been introduced in mathematical shape analysis. We also derive Hamiltonian vector fields for several classical Hamiltonian functions with respect to these new symplectic structures."}],"publication_status":"draft","publication":"arXiv","arxiv":1,"type":"preprint","article_processing_charge":"No","date_published":"2024-07-29T00:00:00Z","external_id":{"arxiv":["2407.19908"]},"oa":1,"date_updated":"2026-04-28T09:59:01Z","doi":"10.48550/arXiv.2407.19908","status":"public"},{"file_date_updated":"2024-08-05T23:28:52Z","title":"Data for: \"Single-nucleus atlas of the Artemia female reproductive system suggests germline repression of the Z chromosome\"","year":"2024","acknowledged_ssus":[{"_id":"ScienComp"}],"file":[{"content_type":"text/plain","file_size":2465,"success":1,"checksum":"26b5d41b3103f4284dd97d56e370a5b6","creator":"melkrewi","date_created":"2024-08-05T22:24:18Z","file_name":"README.txt","relation":"main_file","date_updated":"2024-08-05T22:24:18Z","file_id":"17394","access_level":"open_access"},{"file_name":"Data_artemia_single_nucleus_atlas.zip","relation":"main_file","file_id":"17395","access_level":"open_access","date_updated":"2024-08-05T23:28:52Z","content_type":"application/x-zip-compressed","file_size":2526735400,"success":1,"date_created":"2024-08-05T23:28:52Z","checksum":"95adab5e36148015da313505e3910707","creator":"melkrewi"}],"author":[{"orcid":"0000-0002-5328-7231","last_name":"Elkrewi","full_name":"Elkrewi, Marwan N","id":"0B46FACA-A8E1-11E9-9BD3-79D1E5697425","first_name":"Marwan N"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz"}],"citation":{"short":"M.N. Elkrewi, B. Vicoso, (2024).","mla":"Elkrewi, Marwan N., and Beatriz Vicoso. <i>Data for: “Single-Nucleus Atlas of the Artemia Female Reproductive System Suggests Germline Repression of the Z Chromosome.”</i> Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17362\">10.15479/AT:ISTA:17362</a>.","ieee":"M. N. Elkrewi and B. Vicoso, “Data for: ‘Single-nucleus atlas of the Artemia female reproductive system suggests germline repression of the Z chromosome.’” Institute of Science and Technology Austria, 2024.","ista":"Elkrewi MN, Vicoso B. 2024. Data for: ‘Single-nucleus atlas of the Artemia female reproductive system suggests germline repression of the Z chromosome’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:17362\">10.15479/AT:ISTA:17362</a>.","chicago":"Elkrewi, Marwan N, and Beatriz Vicoso. “Data for: ‘Single-Nucleus Atlas of the Artemia Female Reproductive System Suggests Germline Repression of the Z Chromosome.’” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:17362\">https://doi.org/10.15479/AT:ISTA:17362</a>.","ama":"Elkrewi MN, Vicoso B. Data for: “Single-nucleus atlas of the Artemia female reproductive system suggests germline repression of the Z chromosome.” 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17362\">10.15479/AT:ISTA:17362</a>","apa":"Elkrewi, M. N., &#38; Vicoso, B. (2024). Data for: “Single-nucleus atlas of the Artemia female reproductive system suggests germline repression of the Z chromosome.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:17362\">https://doi.org/10.15479/AT:ISTA:17362</a>"},"date_created":"2024-08-02T07:27:45Z","department":[{"_id":"GradSch"},{"_id":"BeVi"}],"related_material":{"record":[{"relation":"used_in_publication","id":"17890","status":"public"}]},"_id":"17362","oa_version":"Published Version","project":[{"name":"The highjacking of meiosis for asexual reproduction","_id":"34ae1506-11ca-11ed-8bc3-c14f4c474396","grant_number":"F8810"}],"month":"08","publisher":"Institute of Science and Technology Austria","oa":1,"date_updated":"2026-04-16T12:20:41Z","doi":"10.15479/AT:ISTA:17362","has_accepted_license":"1","status":"public","article_processing_charge":"No","date_published":"2024-08-05T00:00:00Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"ddc":["576"],"corr_author":"1","type":"research_data","day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"This is the supplementary data for the paper titled \"Single-nucleus atlas of the Artemia female reproductive system suggests germline repression of the Z chromosome\", where we described the generation and analysis of single-nucleus expression and chromatin-accessibility data from the female reproductive system of Artemia franciscana. We compared our dataset to the published Drosophila single-nucleus data (over 400 million years of divergence) and highlighted the extreme conservation of several of the molecular pathways of oogenesis and meiosis. We found evidence of global transcriptional quiescence and chromatin condensation in late germ cells, highlighting the conserved role of this repressive stage in arthropod oogenesis. Additionally, we explored the expression patterns of the ZW sex chromosomes during oogenesis. Our data shows that the Z-chromosome is consistently downregulated in germline cells. While this is partly driven by a lack of dosage compensation in the germline, a subset of cells show stronger repression of the Z chromosome."}]},{"day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"The first author’s research was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme grant 948819. . The second author’s research was supported by the VICI subsidy VI.C.212.027 of the Netherlands Organisation for Scientific Research (NWO).","publication_status":"published","isi":1,"external_id":{"isi":["001315424500021"],"arxiv":["2301.06897"]},"publisher":"Society for Industrial and Applied Mathematics","status":"public","oa_version":"Preprint","_id":"17372","project":[{"grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","name":"Bridging Scales in Random Materials"}],"citation":{"mla":"Agresti, Antonio, and Mark Veraar. “Reaction-Diffusion Equations with Transport Noise and Critical Superlinear Diffusion: Global Well-Posedness of Weakly Dissipative Systems.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 56, no. 4, Society for Industrial and Applied Mathematics, 2024, pp. 4870–927, doi:<a href=\"https://doi.org/10.1137/23M1562482\">10.1137/23M1562482</a>.","short":"A. Agresti, M. Veraar, SIAM Journal on Mathematical Analysis 56 (2024) 4870–4927.","chicago":"Agresti, Antonio, and Mark Veraar. “Reaction-Diffusion Equations with Transport Noise and Critical Superlinear Diffusion: Global Well-Posedness of Weakly Dissipative Systems.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2024. <a href=\"https://doi.org/10.1137/23M1562482\">https://doi.org/10.1137/23M1562482</a>.","ieee":"A. Agresti and M. Veraar, “Reaction-diffusion equations with transport noise and critical superlinear diffusion: Global well-posedness of weakly dissipative systems,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 56, no. 4. Society for Industrial and Applied Mathematics, pp. 4870–4927, 2024.","ista":"Agresti A, Veraar M. 2024. Reaction-diffusion equations with transport noise and critical superlinear diffusion: Global well-posedness of weakly dissipative systems. SIAM Journal on Mathematical Analysis. 56(4), 4870–4927.","ama":"Agresti A, Veraar M. Reaction-diffusion equations with transport noise and critical superlinear diffusion: Global well-posedness of weakly dissipative systems. <i>SIAM Journal on Mathematical Analysis</i>. 2024;56(4):4870-4927. doi:<a href=\"https://doi.org/10.1137/23M1562482\">10.1137/23M1562482</a>","apa":"Agresti, A., &#38; Veraar, M. (2024). Reaction-diffusion equations with transport noise and critical superlinear diffusion: Global well-posedness of weakly dissipative systems. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/23M1562482\">https://doi.org/10.1137/23M1562482</a>"},"title":"Reaction-diffusion equations with transport noise and critical superlinear diffusion: Global well-posedness of weakly dissipative systems","article_type":"original","quality_controlled":"1","ec_funded":1,"abstract":[{"lang":"eng","text":"In this paper, we investigate the global well-posedness of reaction-diffusion systems with transport noise on the  d-dimensional torus. We show new global well-posedness results for a large class of scalar equations (e.g. the Allen-Cahn equation), and dissipative systems (e.g. equations in coagulation dynamics). Moreover, we prove global well-posedness for two weakly dissipative systems: Lotka-Volterra equations for  d∈{1,2,3,4}  and the Brusselator for  d∈{1,2,3}. Many of the results are also new without transport noise. The proofs are based on maximal regularity techniques, positivity results, and sharp blow-up criteria developed in our recent works, combined with energy estimates based on Itô's formula and stochastic Gronwall inequalities. Key novelties include the introduction of new  Lζ -coercivity/dissipativity conditions and the development of an  Lp(Lq) -framework for systems of reaction-diffusion equations, which are needed when treating dimensions  d∈{2,3}  in the case of cubic or higher order nonlinearities."}],"corr_author":"1","intvolume":"        56","publication":"SIAM Journal on Mathematical Analysis","type":"journal_article","arxiv":1,"scopus_import":"1","date_published":"2024-08-01T00:00:00Z","article_processing_charge":"No","date_updated":"2025-09-08T08:46:57Z","oa":1,"volume":56,"doi":"10.1137/23M1562482","issue":"4","month":"08","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.06897","open_access":"1"}],"page":"4870-4927","language":[{"iso":"eng"}],"department":[{"_id":"JuFi"}],"date_created":"2024-08-04T22:01:21Z","author":[{"full_name":"Agresti, Antonio","orcid":"0000-0002-9573-2962","last_name":"Agresti","first_name":"Antonio","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72"},{"first_name":"Mark","full_name":"Veraar, Mark","last_name":"Veraar"}],"year":"2024","publication_identifier":{"issn":["0036-1410"],"eissn":["1095-7154"]}},{"date_updated":"2025-09-08T08:47:42Z","oa":1,"doi":"10.1063/5.0215151","volume":136,"date_published":"2024-07-28T00:00:00Z","article_processing_charge":"No","intvolume":"       136","corr_author":"1","publication":"Journal of Applied Physics","ddc":["530"],"scopus_import":"1","type":"journal_article","article_type":"original","quality_controlled":"1","abstract":[{"lang":"eng","text":"Scanning Kelvin probe microscopy (SKPM) is a powerful technique for investigating the electrostatic properties of material surfaces, enabling the imaging of variations in work function, topology, surface charge density, or combinations thereof. Regardless of the underlying signal source, SKPM results in a voltage image, which is spatially distorted due to the finite size of the probe, long-range electrostatic interactions, mechanical and electrical noise, and the finite response time of the electronics. In order to recover the underlying signal, it is necessary to deconvolve the measurement with an appropriate point spread function (PSF) that accounts the aforementioned distortions, but determining this PSF is difficult. Here, we describe how such PSFs can be determined experimentally and show how they can be used to recover the underlying information of interest. We first consider the physical principles that enable SKPM and discuss how these affect the system PSF. We then show how one can experimentally measure PSFs by looking at well-defined features, and that these compare well to simulated PSFs, provided scans are performed extremely slowly and carefully. Next, we work at realistic scan speeds and show that the idealized PSFs fail to capture temporal distortions in the scan direction. While simulating PSFs for these situations would be quite challenging, we show that measuring PSFs with similar scan conditions works well. Our approach clarifies the basic principles and inherent challenges to SKPM measurements and gives practical methods to improve results."}],"ec_funded":1,"publication_identifier":{"eissn":["1089-7550"],"issn":["0021-8979"]},"year":"2024","file":[{"content_type":"application/pdf","file_size":2537502,"success":1,"checksum":"6141d05cd68d540a7446dce9490975db","creator":"dernst","date_created":"2024-08-05T08:19:58Z","file_name":"2024_JourApplPhysics_Lenton.pdf","relation":"main_file","date_updated":"2024-08-05T08:19:58Z","file_id":"17386","access_level":"open_access"}],"date_created":"2024-08-04T22:01:21Z","language":[{"iso":"eng"}],"department":[{"_id":"ScWa"},{"_id":"NanoFab"}],"author":[{"id":"a550210f-223c-11ec-8182-e2d45e817efb","first_name":"Isaac C","last_name":"Lenton","orcid":"0000-0002-5010-6984","full_name":"Lenton, Isaac C"},{"orcid":"0000-0003-0463-5794","last_name":"Pertl","full_name":"Pertl, Felix","id":"6313aec0-15b2-11ec-abd3-ed67d16139af","first_name":"Felix"},{"first_name":"Lubuna B","id":"3CD37A82-F248-11E8-B48F-1D18A9856A87","full_name":"Shafeek, Lubuna B","orcid":"0000-0001-7180-6050","last_name":"Shafeek"},{"orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"}],"issue":"4","month":"07","publisher":"AIP Publishing","article_number":"045305","status":"public","has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"isi":1,"external_id":{"isi":["001281681100003"]},"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"28","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 949120). This research was supported by the Scientific Service Units of the Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility, and Lab Support Facility. The authors wish to thank Dmytro Rak and Juan Carlos Sobarzo for letting us use their equipment. The authors wish to thank the contributions of the whole Waitukaitis Group for useful discussions and feedback.","file_date_updated":"2024-08-05T08:19:58Z","title":"Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"LifeSc"},{"_id":"ScienComp"}],"citation":{"apa":"Lenton, I. C., Pertl, F., Shafeek, L. B., &#38; Waitukaitis, S. R. (2024). Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging. <i>Journal of Applied Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0215151\">https://doi.org/10.1063/5.0215151</a>","ama":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging. <i>Journal of Applied Physics</i>. 2024;136(4). doi:<a href=\"https://doi.org/10.1063/5.0215151\">10.1063/5.0215151</a>","chicago":"Lenton, Isaac C, Felix Pertl, Lubuna B Shafeek, and Scott R Waitukaitis. “Beyond the Blur: Using Experimentally Determined Point Spread Functions to Improve Scanning Kelvin Probe Imaging.” <i>Journal of Applied Physics</i>. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0215151\">https://doi.org/10.1063/5.0215151</a>.","ieee":"I. C. Lenton, F. Pertl, L. B. Shafeek, and S. R. Waitukaitis, “Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging,” <i>Journal of Applied Physics</i>, vol. 136, no. 4. AIP Publishing, 2024.","ista":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. 2024. Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging. Journal of Applied Physics. 136(4), 045305.","short":"I.C. Lenton, F. Pertl, L.B. Shafeek, S.R. Waitukaitis, Journal of Applied Physics 136 (2024).","mla":"Lenton, Isaac C., et al. “Beyond the Blur: Using Experimentally Determined Point Spread Functions to Improve Scanning Kelvin Probe Imaging.” <i>Journal of Applied Physics</i>, vol. 136, no. 4, 045305, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0215151\">10.1063/5.0215151</a>."},"_id":"17373","oa_version":"Published Version","project":[{"grant_number":"949120","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics"}]},{"author":[{"first_name":"Pramod","last_name":"Rao","full_name":"Rao, Pramod"},{"full_name":"Fox, Gereon","last_name":"Fox","first_name":"Gereon"},{"first_name":"Abhimitra","last_name":"Meka","full_name":"Meka, Abhimitra"},{"first_name":"B. R.","last_name":"Mallikarjun","full_name":"Mallikarjun, B. R."},{"first_name":"Fangneng","full_name":"Zhan, Fangneng","last_name":"Zhan"},{"first_name":"Tim","last_name":"Weyrich","full_name":"Weyrich, Tim"},{"full_name":"Bickel, Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hanspeter","last_name":"Pfister","full_name":"Pfister, Hanspeter"},{"full_name":"Matusik, Wojciech","last_name":"Matusik","first_name":"Wojciech"},{"first_name":"Mohamed","full_name":"Elgharib, Mohamed","last_name":"Elgharib"},{"last_name":"Theobalt","full_name":"Theobalt, Christian","first_name":"Christian"}],"date_created":"2024-08-04T22:01:21Z","department":[{"_id":"BeBi"}],"language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_name":"2024_SIGGRAPH_Rao.pdf","date_updated":"2024-08-05T08:25:18Z","access_level":"open_access","file_id":"17387","file_size":59683257,"success":1,"content_type":"application/pdf","creator":"dernst","checksum":"4650f6d1419e675929133e46a91ca177","date_created":"2024-08-05T08:25:18Z"}],"month":"07","publication_identifier":{"isbn":["9798400705250"]},"year":"2024","type":"conference","arxiv":1,"scopus_import":"1","ddc":["000"],"publication":"Proceedings - SIGGRAPH 2024 Conference Papers","abstract":[{"text":"Achieving photorealistic 3D view synthesis and relighting of human portraits is pivotal for advancing AR/VR applications. Existing methodologies in portrait relighting demonstrate substantial limitations in terms of generalization and 3D consistency, coupled with inaccuracies in physically realistic lighting and identity preservation. Furthermore, personalization from a single view is difficult to achieve and often requires multiview images during the testing phase or involves slow optimization processes. This paper introduces Lite2Relight , a novel technique that can predict 3D consistent head poses of portraits while performing physically plausible light editing at interactive speed. Our method uniquely extends the generative capabilities and efficient volumetric representation of EG3D, leveraging a lightstage dataset to implicitly disentangle face reflectance and perform relighting under target HDRI environment maps. By utilizing a pre-trained geometry-aware encoder and a feature alignment module, we map input images into a relightable 3D space, enhancing them with a strong face geometry and reflectance prior. Through extensive quantitative and qualitative evaluations, we show that our method outperforms the state-of-the-art methods in terms of efficacy, photorealism, and practical application. This includes producing 3D-consistent results of the full head, including hair, eyes, and expressions. Lite2Relight paves the way for large-scale adoption of photorealistic portrait editing in various domains, offering a robust, interactive solution to a previously constrained problem.","lang":"eng"}],"quality_controlled":"1","conference":{"name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","end_date":"2024-08-01","location":"Denver, CO, United States","start_date":"2024-07-27"},"doi":"10.1145/3641519.3657470","oa":1,"date_updated":"2025-09-08T08:48:22Z","article_processing_charge":"Yes (in subscription journal)","date_published":"2024-07-13T00:00:00Z","citation":{"ista":"Rao P, Fox G, Meka A, Mallikarjun BR, Zhan F, Weyrich T, Bickel B, Pfister H, Matusik W, Elgharib M, Theobalt C. 2024. Lite2Relight: 3D-aware single image portrait relighting. Proceedings - SIGGRAPH 2024 Conference Papers. SIGGRAPH: Computer Graphics and Interactive Techniques Conference, 41.","chicago":"Rao, Pramod, Gereon Fox, Abhimitra Meka, B. R. Mallikarjun, Fangneng Zhan, Tim Weyrich, Bernd Bickel, et al. “Lite2Relight: 3D-Aware Single Image Portrait Relighting.” In <i>Proceedings - SIGGRAPH 2024 Conference Papers</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3641519.3657470\">https://doi.org/10.1145/3641519.3657470</a>.","ieee":"P. Rao <i>et al.</i>, “Lite2Relight: 3D-aware single image portrait relighting,” in <i>Proceedings - SIGGRAPH 2024 Conference Papers</i>, Denver, CO, United States, 2024.","short":"P. Rao, G. Fox, A. Meka, B.R. Mallikarjun, F. Zhan, T. Weyrich, B. Bickel, H. Pfister, W. Matusik, M. Elgharib, C. Theobalt, in:, Proceedings - SIGGRAPH 2024 Conference Papers, Association for Computing Machinery, 2024.","mla":"Rao, Pramod, et al. “Lite2Relight: 3D-Aware Single Image Portrait Relighting.” <i>Proceedings - SIGGRAPH 2024 Conference Papers</i>, 41, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3641519.3657470\">10.1145/3641519.3657470</a>.","apa":"Rao, P., Fox, G., Meka, A., Mallikarjun, B. R., Zhan, F., Weyrich, T., … Theobalt, C. (2024). Lite2Relight: 3D-aware single image portrait relighting. In <i>Proceedings - SIGGRAPH 2024 Conference Papers</i>. Denver, CO, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3641519.3657470\">https://doi.org/10.1145/3641519.3657470</a>","ama":"Rao P, Fox G, Meka A, et al. Lite2Relight: 3D-aware single image portrait relighting. In: <i>Proceedings - SIGGRAPH 2024 Conference Papers</i>. Association for Computing Machinery; 2024. doi:<a href=\"https://doi.org/10.1145/3641519.3657470\">10.1145/3641519.3657470</a>"},"oa_version":"Published Version","_id":"17374","title":"Lite2Relight: 3D-aware single image portrait relighting","file_date_updated":"2024-08-05T08:25:18Z","publication_status":"published","acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784). We extend our gratitude to Shrisha Bharadwaj for providing feedback and constant support.","day":"13","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","has_accepted_license":"1","article_number":"41","publisher":"Association for Computing Machinery","external_id":{"isi":["001282218200076"],"arxiv":["2407.10487"]},"isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"}},{"date_published":"2024-06-01T00:00:00Z","article_processing_charge":"No","volume":65,"doi":"10.1063/5.0209705","date_updated":"2025-09-08T08:44:57Z","oa":1,"quality_controlled":"1","ec_funded":1,"abstract":[{"text":"We consider the spectral radius of a large random matrix X with independent, identically distributed entries. We show that its typical size is given by a precise three-term asymptotics with an optimal error term beyond the radius of the celebrated circular law. The coefficients in this asymptotics are universal but they differ from a similar asymptotics recently proved for the rightmost eigenvalue of X in Cipolloni et al., Ann. Probab. 51(6), 2192–2242 (2023). To access the more complicated spectral radius, we need to establish a new decorrelation mechanism for the low-lying singular values of X − z for different complex shift parameters z using the Dyson Brownian Motion.","lang":"eng"}],"article_type":"original","scopus_import":"1","arxiv":1,"type":"journal_article","corr_author":"1","intvolume":"        65","publication":"Journal of Mathematical Physics","year":"2024","publication_identifier":{"issn":["0022-2488"]},"month":"06","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2210.15643","open_access":"1"}],"issue":"6","language":[{"iso":"eng"}],"date_created":"2024-08-04T22:01:22Z","department":[{"_id":"LaEr"}],"author":[{"orcid":"0000-0002-4901-7992","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László"},{"last_name":"Xu","orcid":"0000-0003-1559-1205","full_name":"Xu, Yuanyuan","id":"7902bdb1-a2a4-11eb-a164-c9216f71aea3","first_name":"Yuanyuan"}],"external_id":{"arxiv":["2210.15643"],"isi":["001252240700002"]},"isi":1,"status":"public","article_number":"063302","publisher":"AIP Publishing","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"L.E. and Y.X. were supported by the ERC Advanced Grant “RMTBeyond” Grant No. 101020331.","publication_status":"published","title":"Precise asymptotics for the spectral radius of a large random matrix","project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020"}],"_id":"17375","oa_version":"Preprint","citation":{"apa":"Cipolloni, G., Erdös, L., &#38; Xu, Y. (2024). Precise asymptotics for the spectral radius of a large random matrix. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0209705\">https://doi.org/10.1063/5.0209705</a>","ama":"Cipolloni G, Erdös L, Xu Y. Precise asymptotics for the spectral radius of a large random matrix. <i>Journal of Mathematical Physics</i>. 2024;65(6). doi:<a href=\"https://doi.org/10.1063/5.0209705\">10.1063/5.0209705</a>","chicago":"Cipolloni, Giorgio, László Erdös, and Yuanyuan Xu. “Precise Asymptotics for the Spectral Radius of a Large Random Matrix.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0209705\">https://doi.org/10.1063/5.0209705</a>.","ieee":"G. Cipolloni, L. Erdös, and Y. Xu, “Precise asymptotics for the spectral radius of a large random matrix,” <i>Journal of Mathematical Physics</i>, vol. 65, no. 6. AIP Publishing, 2024.","ista":"Cipolloni G, Erdös L, Xu Y. 2024. Precise asymptotics for the spectral radius of a large random matrix. Journal of Mathematical Physics. 65(6), 063302.","short":"G. Cipolloni, L. Erdös, Y. Xu, Journal of Mathematical Physics 65 (2024).","mla":"Cipolloni, Giorgio, et al. “Precise Asymptotics for the Spectral Radius of a Large Random Matrix.” <i>Journal of Mathematical Physics</i>, vol. 65, no. 6, 063302, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0209705\">10.1063/5.0209705</a>."}},{"publication_identifier":{"eissn":["1469-2120"],"issn":["0024-6093"]},"year":"2024","author":[{"first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567"},{"first_name":"Yuval","last_name":"Wigderson","full_name":"Wigderson, Yuval"}],"department":[{"_id":"MaKw"}],"language":[{"iso":"eng"}],"date_created":"2024-08-04T22:01:22Z","page":"3196-3208","file":[{"creator":"dernst","checksum":"7117f9819eaeb45eef1b0a226f9c2709","date_created":"2025-01-09T13:36:53Z","content_type":"application/pdf","success":1,"file_size":175966,"date_updated":"2025-01-09T13:36:53Z","access_level":"open_access","file_id":"18814","relation":"main_file","file_name":"2024_BulletinLondonMathSoc_Kwan.pdf"}],"month":"10","issue":"10","doi":"10.1112/blms.13127","volume":56,"oa":1,"date_updated":"2025-09-08T08:45:39Z","article_processing_charge":"Yes (via OA deal)","date_published":"2024-10-01T00:00:00Z","arxiv":1,"scopus_import":"1","OA_type":"hybrid","type":"journal_article","publication":"Bulletin of the London Mathematical Society","ddc":["510"],"intvolume":"        56","abstract":[{"text":"The inertia bound and ratio bound (also known as the Cvetković bound and Hoffman bound) are two fundamental inequalities in spectral graph theory, giving upper bounds on the independence number α(G) of a graph G in terms of spectral information about a weighted adjacency matrix of G. For both inequalities, given a graph G, one needs to make a judicious choice of weighted adjacency matrix to obtain as strong a bound as possible.\r\nWhile there is a well-established theory surrounding the ratio bound, the inertia bound is much more mysterious, and its limits are rather unclear. In fact, only recently did Sinkovic find the first example of a graph for which the inertia bound is not tight (for any weighted adjacency matrix), answering a longstanding question of Godsil. We show that the inertia bound can be extremely far from tight, and in fact can significantly underperform the ratio bound: for example, one of our results is that for infinitely many n, there is an n-vertex graph for which even the unweighted ratio bound can prove α(G)≤4n3/4, but the inertia bound is always at least n/4. In particular, these results address questions of Rooney, Sinkovic, and Wocjan--Elphick--Abiad.","lang":"eng"}],"quality_controlled":"1","article_type":"original","title":"The inertia bound is far from tight","file_date_updated":"2025-01-09T13:36:53Z","OA_place":"publisher","citation":{"ama":"Kwan MA, Wigderson Y. The inertia bound is far from tight. <i>Bulletin of the London Mathematical Society</i>. 2024;56(10):3196-3208. doi:<a href=\"https://doi.org/10.1112/blms.13127\">10.1112/blms.13127</a>","apa":"Kwan, M. A., &#38; Wigderson, Y. (2024). The inertia bound is far from tight. <i>Bulletin of the London Mathematical Society</i>. London Mathematical Society. <a href=\"https://doi.org/10.1112/blms.13127\">https://doi.org/10.1112/blms.13127</a>","short":"M.A. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024) 3196–3208.","mla":"Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.” <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 10, London Mathematical Society, 2024, pp. 3196–208, doi:<a href=\"https://doi.org/10.1112/blms.13127\">10.1112/blms.13127</a>.","ista":"Kwan MA, Wigderson Y. 2024. The inertia bound is far from tight. Bulletin of the London Mathematical Society. 56(10), 3196–3208.","chicago":"Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.” <i>Bulletin of the London Mathematical Society</i>. London Mathematical Society, 2024. <a href=\"https://doi.org/10.1112/blms.13127\">https://doi.org/10.1112/blms.13127</a>.","ieee":"M. A. Kwan and Y. Wigderson, “The inertia bound is far from tight,” <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 10. London Mathematical Society, pp. 3196–3208, 2024."},"project":[{"name":"Randomness and structure in combinatorics","grant_number":"101076777","_id":"bd95085b-d553-11ed-ba76-e55d3349be45"}],"oa_version":"Published Version","_id":"17376","status":"public","has_accepted_license":"1","publisher":"London Mathematical Society","external_id":{"isi":["001279563300001"],"arxiv":["2312.04925"]},"isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_status":"published","acknowledgement":"The authors are grateful to Noga Alon, Anurag Bishnoi, Clive Elphick, and Ferdinand Ihringer for helpful comments and interesting discussions on earlier drafts of this paper. Matthew Kwan is supported by ERC Starting Grant “RANDSTRUCT” No. 101076777. Yuval Wigderson is supported by Dr. Max Rössler, the Walter Haefner Foundation, and the ETH Zürich Foundation.\r\nOpen access funding provided by Eidgenossische Technische Hochschule Zurich.","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"project":[{"name":"Peptide receptors for auxin canalization in Arabidopsis","grant_number":"I06123","_id":"bd76d395-d553-11ed-ba76-f678c14f9033"}],"_id":"17377","oa_version":"Submitted Version","citation":{"ista":"Wójcikowska B, Friml J, Mazur E. 2024. BiAux, a newly discovered compound triggering auxin signaling. Trends in Plant Science. 29(12), 1279–1281.","ieee":"B. Wójcikowska, J. Friml, and E. Mazur, “BiAux, a newly discovered compound triggering auxin signaling,” <i>Trends in Plant Science</i>, vol. 29, no. 12. Elsevier, pp. 1279–1281, 2024.","chicago":"Wójcikowska, Barbara, Jiří Friml, and Ewa Mazur. “BiAux, a Newly Discovered Compound Triggering Auxin Signaling.” <i>Trends in Plant Science</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.tplants.2024.07.008\">https://doi.org/10.1016/j.tplants.2024.07.008</a>.","mla":"Wójcikowska, Barbara, et al. “BiAux, a Newly Discovered Compound Triggering Auxin Signaling.” <i>Trends in Plant Science</i>, vol. 29, no. 12, Elsevier, 2024, pp. 1279–81, doi:<a href=\"https://doi.org/10.1016/j.tplants.2024.07.008\">10.1016/j.tplants.2024.07.008</a>.","short":"B. Wójcikowska, J. Friml, E. Mazur, Trends in Plant Science 29 (2024) 1279–1281.","apa":"Wójcikowska, B., Friml, J., &#38; Mazur, E. (2024). BiAux, a newly discovered compound triggering auxin signaling. <i>Trends in Plant Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tplants.2024.07.008\">https://doi.org/10.1016/j.tplants.2024.07.008</a>","ama":"Wójcikowska B, Friml J, Mazur E. BiAux, a newly discovered compound triggering auxin signaling. <i>Trends in Plant Science</i>. 2024;29(12):1279-1281. doi:<a href=\"https://doi.org/10.1016/j.tplants.2024.07.008\">10.1016/j.tplants.2024.07.008</a>"},"pmid":1,"title":"BiAux, a newly discovered compound triggering auxin signaling","OA_place":"repository","file_date_updated":"2025-11-24T15:12:50Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by funding from the National Science Centre, Poland, under the OPUS call in the Weave program and the Austrian Science Fund, Austria project (FWF)/OPUS – Peptide receptor complexes for auxin canalization and regeneration in Arabidopsis (grant \r\n2021/43/I/NZ1/01835) to E.M., and grant I 6123-B to J.F.","publication_status":"published","external_id":{"isi":["001375335200001"],"pmid":["39079770"]},"isi":1,"has_accepted_license":"1","status":"public","publisher":"Elsevier","month":"12","issue":"12","language":[{"iso":"eng"}],"date_created":"2024-08-04T22:01:22Z","department":[{"_id":"JiFr"}],"author":[{"full_name":"Wójcikowska, Barbara","last_name":"Wójcikowska","first_name":"Barbara"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"first_name":"Ewa","full_name":"Mazur, Ewa","last_name":"Mazur"}],"file":[{"date_updated":"2025-11-24T15:12:50Z","file_id":"20691","access_level":"open_access","file_name":"2024_TrendsPlantScience_Wojcikowska_submittedversion.pdf","relation":"main_file","checksum":"89a83fe25b9ec1aad8e22d134a342c09","creator":"dernst","date_created":"2025-11-24T15:12:50Z","file_size":277636,"content_type":"application/pdf","success":1}],"page":"1279-1281","year":"2024","publication_identifier":{"issn":["1360-1385"]},"quality_controlled":"1","abstract":[{"text":"Lateral root (LR) formation, that is vital for plant development, is one of many auxin-modulated processes, but the underlying regulatory mechanism is not yet fully known. Recently, \r\nGonzález-García et al. discovered the BiAux compound and showed that it is involved in LR development via regulating specific auxin coreceptors.","lang":"eng"}],"article_type":"original","OA_type":"green","scopus_import":"1","type":"journal_article","corr_author":"1","intvolume":"        29","ddc":["580"],"publication":"Trends in Plant Science","date_published":"2024-12-01T00:00:00Z","article_processing_charge":"No","doi":"10.1016/j.tplants.2024.07.008","volume":29,"date_updated":"2025-11-24T15:13:16Z","oa":1},{"file_date_updated":"2024-08-05T08:52:14Z","title":"Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning","acknowledged_ssus":[{"_id":"NanoFab"}],"pmid":1,"citation":{"ama":"Severin B, Lennon DT, Camenzind LC, et al. Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. <i>Scientific Reports</i>. 2024;14. doi:<a href=\"https://doi.org/10.1038/s41598-024-67787-z\">10.1038/s41598-024-67787-z</a>","apa":"Severin, B., Lennon, D. T., Camenzind, L. C., Vigneau, F., Fedele, F., Jirovec, D., … Ares, N. (2024). Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-024-67787-z\">https://doi.org/10.1038/s41598-024-67787-z</a>","short":"B. Severin, D.T. Lennon, L.C. Camenzind, F. Vigneau, F. Fedele, D. Jirovec, A. Ballabio, D. Chrastina, G. Isella, M. de Kruijf, M.J. Carballido, S. Svab, A.V. Kuhlmann, S. Geyer, F.N.M. Froning, H. Moon, M.A. Osborne, D. Sejdinovic, G. Katsaros, D.M. Zumbühl, G.A.D. Briggs, N. Ares, Scientific Reports 14 (2024).","mla":"Severin, B., et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum Devices Using Machine Learning.” <i>Scientific Reports</i>, vol. 14, 17281, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s41598-024-67787-z\">10.1038/s41598-024-67787-z</a>.","ista":"Severin B, Lennon DT, Camenzind LC, Vigneau F, Fedele F, Jirovec D, Ballabio A, Chrastina D, Isella G, de Kruijf M, Carballido MJ, Svab S, Kuhlmann AV, Geyer S, Froning FNM, Moon H, Osborne MA, Sejdinovic D, Katsaros G, Zumbühl DM, Briggs GAD, Ares N. 2024. Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. Scientific Reports. 14, 17281.","chicago":"Severin, B., D. T. Lennon, L. C. Camenzind, F. Vigneau, F. Fedele, Daniel Jirovec, A. Ballabio, et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum Devices Using Machine Learning.” <i>Scientific Reports</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41598-024-67787-z\">https://doi.org/10.1038/s41598-024-67787-z</a>.","ieee":"B. Severin <i>et al.</i>, “Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning,” <i>Scientific Reports</i>, vol. 14. Springer Nature, 2024."},"related_material":{"record":[{"status":"public","id":"10066","relation":"earlier_version"}]},"_id":"17389","oa_version":"Published Version","project":[{"name":"High impedance circuit quantum electrodynamics with hole spins","grant_number":"I05060","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1"},{"name":"Hole spin orbit qubits in Ge quantum wells","grant_number":"P30207","_id":"2641CE5E-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publisher":"Springer Nature","article_number":"17281","status":"public","has_accepted_license":"1","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2107.12975"],"pmid":["39068242"],"isi":["001281273100062"]},"publication_status":"published","acknowledgement":"We acknowledge Ang Li, Erik P. A. M. Bakkers (University of Eindhoven) for the fabrication of the Ge/Si nanowire. This work was supported by the Royal Society, the EPSRC National Quantum Technology Hub in Networked Quantum Information Technology (EP/M013243/1), Quantum Technology Capital (EP/N014995/1), EPSRC Platform Grant (EP/R029229/1), the European Research Council (Grant agreement 948932), the Swiss Nanoscience Institute, the NCCR SPIN, the EU H2020 European Microkelvin Platform EMP grant No. 824109, the Scientific Service Units of IST Austria through resources provided by the nanofabrication facility, the FWF-I 05060 and the FWF-P 30207 project.","day":"27","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["2045-2322"]},"year":"2024","file":[{"content_type":"application/pdf","success":1,"file_size":2255741,"creator":"dernst","checksum":"0b34b89e5f4f3f7b32ffadf104394594","date_created":"2024-08-05T08:52:14Z","relation":"main_file","file_name":"2024_ScientificReports_Severin.pdf","date_updated":"2024-08-05T08:52:14Z","access_level":"open_access","file_id":"17390"}],"author":[{"last_name":"Severin","full_name":"Severin, B.","first_name":"B."},{"first_name":"D. T.","last_name":"Lennon","full_name":"Lennon, D. T."},{"full_name":"Camenzind, L. C.","last_name":"Camenzind","first_name":"L. C."},{"last_name":"Vigneau","full_name":"Vigneau, F.","first_name":"F."},{"first_name":"F.","last_name":"Fedele","full_name":"Fedele, F."},{"id":"4C473F58-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","orcid":"0000-0002-7197-4801","last_name":"Jirovec","full_name":"Jirovec, Daniel"},{"first_name":"A.","full_name":"Ballabio, A.","last_name":"Ballabio"},{"first_name":"D.","last_name":"Chrastina","full_name":"Chrastina, D."},{"first_name":"G.","last_name":"Isella","full_name":"Isella, G."},{"first_name":"M.","last_name":"de Kruijf","full_name":"de Kruijf, M."},{"first_name":"M. J.","full_name":"Carballido, M. J.","last_name":"Carballido"},{"full_name":"Svab, S.","last_name":"Svab","first_name":"S."},{"first_name":"A. V.","full_name":"Kuhlmann, A. V.","last_name":"Kuhlmann"},{"full_name":"Geyer, S.","last_name":"Geyer","first_name":"S."},{"first_name":"F. N. M.","full_name":"Froning, F. N. M.","last_name":"Froning"},{"last_name":"Moon","full_name":"Moon, H.","first_name":"H."},{"first_name":"M. A.","last_name":"Osborne","full_name":"Osborne, M. A."},{"full_name":"Sejdinovic, D.","last_name":"Sejdinovic","first_name":"D."},{"full_name":"Katsaros, Georgios","last_name":"Katsaros","orcid":"0000-0001-8342-202X","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zumbühl","full_name":"Zumbühl, D. M.","first_name":"D. M."},{"full_name":"Briggs, G. A. D.","last_name":"Briggs","first_name":"G. A. D."},{"full_name":"Ares, N.","last_name":"Ares","first_name":"N."}],"language":[{"iso":"eng"}],"date_created":"2024-08-05T08:50:51Z","department":[{"_id":"GeKa"}],"month":"07","oa":1,"date_updated":"2025-09-08T08:49:16Z","volume":14,"doi":"10.1038/s41598-024-67787-z","article_processing_charge":"Yes","date_published":"2024-07-27T00:00:00Z","publication":"Scientific Reports","ddc":["530"],"intvolume":"        14","type":"journal_article","scopus_import":"1","arxiv":1,"article_type":"original","abstract":[{"text":"The potential of Si and SiGe-based devices for the scaling of quantum circuits is tainted by device variability. Each device needs to be tuned to operation conditions and each device realisation requires a different tuning protocol. We demonstrate that it is possible to automate the tuning of a 4-gate Si FinFET, a 5-gate GeSi nanowire and a 7-gate Ge/SiGe heterostructure double quantum dot device from scratch with the same algorithm. We achieve tuning times of 30, 10, and 92 min, respectively. The algorithm also provides insight into the parameter space landscape for each of these devices, allowing for the characterization of the regions where double quantum dot regimes are found. These results show that overarching solutions for the tuning of quantum devices are enabled by machine learning.","lang":"eng"}],"quality_controlled":"1"},{"month":"09","author":[{"last_name":"Quishpe-Vásquez","full_name":"Quishpe-Vásquez, César","first_name":"César"},{"last_name":"Oliva","full_name":"Oliva, Patricia","first_name":"Patricia"},{"full_name":"López-Barrera, Ellie Anne","last_name":"López-Barrera","first_name":"Ellie Anne"},{"first_name":"Alejandro","id":"92081129-2d75-11ef-a48d-b04dd7a2385a","full_name":"Casallas Garcia, Alejandro","last_name":"Casallas Garcia","orcid":"0000-0002-1988-5035"}],"department":[{"_id":"CaMu"}],"date_created":"2024-08-06T05:54:52Z","language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_name":"Fires_Galicia_SM.pdf","date_updated":"2024-08-09T13:37:23Z","access_level":"open_access","file_id":"17405","file_size":1595118,"success":1,"content_type":"application/pdf","creator":"acasalla","checksum":"6fa476a4c08aded413844d92336b0e52","date_created":"2024-08-09T13:37:23Z"},{"relation":"main_file","file_name":"Fires_Galicia.pdf","access_level":"open_access","file_id":"17406","date_updated":"2024-08-09T13:37:24Z","file_size":13662676,"success":1,"content_type":"application/pdf","date_created":"2024-08-09T13:37:24Z","creator":"acasalla","checksum":"859dcdef9555c383b702cf8cc7da66f2"}],"year":"2024","publication_identifier":{"issn":["0301-4797"]},"ec_funded":1,"abstract":[{"text":"Wildfire intensity and severity have been increasing in the Iberian Peninsula in recent years, particularly in the Galicia region, due to rising temperatures and accumulating drier combustible vegetation in unmanaged lands. This leads to substantial emissions of air pollutants, notably fine particles (PM2.5), posing a risk to public health. This study aims to assess the impact of local and regional wildfires on PM2.5 levels in Galicia's main cities and their implications for air quality and public health. Over a decade (2013–2022), PM2.5 data during wildfire seasons were analyzed using statistical methods and Lagrangian tracking to monitor smoke plume evolution. The results reveal a notable increase in PM2.5 concentration during the wildfire season (June–November) in Galicia, surpassing health guidelines during extreme events and posing a significant health risk to the population. Regional wildfire analyses indicate that smoke plumes from Northern Portugal contribute to pollution in Galician cities, influencing the seasonality of heightened PM2.5 levels. During extensive wildfires, elevated PM2.5 concentration values persisted for several days, potentially exacerbating health concerns in Galicia. These findings underscore the urgency of implementing air pollution prevention and management measures in the region, including developing effective alerts for large-scale events and improved wildfire management strategies to mitigate their impact on air quality in Galician cities.","lang":"eng"}],"quality_controlled":"1","article_type":"original","scopus_import":"1","type":"journal_article","publication":"Journal of Environmental Management","ddc":["550"],"intvolume":"       367","article_processing_charge":"Yes (in subscription journal)","date_published":"2024-09-01T00:00:00Z","volume":367,"doi":"10.1016/j.jenvman.2024.122093","oa":1,"date_updated":"2025-09-08T08:53:10Z","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"oa_version":"Published Version","_id":"17396","citation":{"mla":"Quishpe-Vásquez, César, et al. “Wildfires Impact on PM2.5 Concentration in Galicia Spain.” <i>Journal of Environmental Management</i>, vol. 367, 122093, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.jenvman.2024.122093\">10.1016/j.jenvman.2024.122093</a>.","short":"C. Quishpe-Vásquez, P. Oliva, E.A. López-Barrera, A. Casallas Garcia, Journal of Environmental Management 367 (2024).","ista":"Quishpe-Vásquez C, Oliva P, López-Barrera EA, Casallas Garcia A. 2024. Wildfires impact on PM2.5 concentration in galicia Spain. Journal of Environmental Management. 367, 122093.","chicago":"Quishpe-Vásquez, César, Patricia Oliva, Ellie Anne López-Barrera, and Alejandro Casallas Garcia. “Wildfires Impact on PM2.5 Concentration in Galicia Spain.” <i>Journal of Environmental Management</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jenvman.2024.122093\">https://doi.org/10.1016/j.jenvman.2024.122093</a>.","ieee":"C. Quishpe-Vásquez, P. Oliva, E. A. López-Barrera, and A. Casallas Garcia, “Wildfires impact on PM2.5 concentration in galicia Spain,” <i>Journal of Environmental Management</i>, vol. 367. Elsevier, 2024.","ama":"Quishpe-Vásquez C, Oliva P, López-Barrera EA, Casallas Garcia A. Wildfires impact on PM2.5 concentration in galicia Spain. <i>Journal of Environmental Management</i>. 2024;367. doi:<a href=\"https://doi.org/10.1016/j.jenvman.2024.122093\">10.1016/j.jenvman.2024.122093</a>","apa":"Quishpe-Vásquez, C., Oliva, P., López-Barrera, E. A., &#38; Casallas Garcia, A. (2024). Wildfires impact on PM2.5 concentration in galicia Spain. <i>Journal of Environmental Management</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jenvman.2024.122093\">https://doi.org/10.1016/j.jenvman.2024.122093</a>"},"pmid":1,"title":"Wildfires impact on PM2.5 concentration in galicia Spain","file_date_updated":"2024-08-09T13:37:24Z","acknowledgement":"Alejandro Casallas was partially funded by a fellowship from the Abdus Salam International Centre for Theoretical Physics – ICTP. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413 awarded to Alejandro Casallas. ","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","license":"https://creativecommons.org/licenses/by-nc/4.0/","external_id":{"isi":["001289532100001"],"pmid":["39106804"]},"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"isi":1,"status":"public","has_accepted_license":"1","publisher":"Elsevier","article_number":"122093"},{"citation":{"ama":"Meggendorfer T, Weininger M. Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In: <i>36th International Conference on Computer Aided Verification</i>. Vol 14683. Springer Nature; 2024:359-372. doi:<a href=\"https://doi.org/10.1007/978-3-031-65633-0_16\">10.1007/978-3-031-65633-0_16</a>","apa":"Meggendorfer, T., &#38; Weininger, M. (2024). Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In <i>36th International Conference on Computer Aided Verification</i> (Vol. 14683, pp. 359–372). Montreal, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-65633-0_16\">https://doi.org/10.1007/978-3-031-65633-0_16</a>","short":"T. Meggendorfer, M. Weininger, in:, 36th International Conference on Computer Aided Verification, Springer Nature, 2024, pp. 359–372.","mla":"Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games.” <i>36th International Conference on Computer Aided Verification</i>, vol. 14683, Springer Nature, 2024, pp. 359–72, doi:<a href=\"https://doi.org/10.1007/978-3-031-65633-0_16\">10.1007/978-3-031-65633-0_16</a>.","ista":"Meggendorfer T, Weininger M. 2024. Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. 36th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 14683, 359–372.","ieee":"T. Meggendorfer and M. Weininger, “Playing games with your PET: Extending the Partial Exploration Tool to stochastic games,” in <i>36th International Conference on Computer Aided Verification</i>, Montreal, Canada, 2024, vol. 14683, pp. 359–372.","chicago":"Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games.” In <i>36th International Conference on Computer Aided Verification</i>, 14683:359–72. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-65633-0_16\">https://doi.org/10.1007/978-3-031-65633-0_16</a>."},"project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"_id":"17402","oa_version":"Published Version","title":"Playing games with your PET: Extending the Partial Exploration Tool to stochastic games","file_date_updated":"2024-08-12T08:39:12Z","publication_status":"published","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"M. Weininger has received funding from the EU’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413.","has_accepted_license":"1","status":"public","publisher":"Springer Nature","external_id":{"arxiv":["2405.03885"],"isi":["001307897000016"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"isi":1,"department":[{"_id":"KrCh"}],"date_created":"2024-08-09T11:24:54Z","language":[{"iso":"eng"}],"author":[{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"}],"file":[{"relation":"main_file","file_name":"2024_CAV_Meggendorfer.pdf","access_level":"open_access","file_id":"17419","date_updated":"2024-08-12T08:39:12Z","file_size":368487,"content_type":"application/pdf","success":1,"date_created":"2024-08-12T08:39:12Z","creator":"dernst","checksum":"c888231d0a47b55786b7b4c0f02216bb"}],"page":"359-372","month":"07","publication_identifier":{"isbn":["9783031656323"],"eisbn":["9783031656330"],"issn":["0302-9743"],"eissn":["1611-3349"]},"alternative_title":["LNCS"],"year":"2024","arxiv":1,"type":"conference","scopus_import":"1","corr_author":"1","intvolume":"     14683","publication":"36th International Conference on Computer Aided Verification","ddc":["000"],"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present version 2.0 of the Partial Exploration Tool (PET), a tool for verification of probabilistic systems. We extend the previous version by adding support for stochastic games, based on a recent unified framework for sound value iteration algorithms. Thereby, PET2 is the first tool implementing a sound and efficient approach for solving stochastic games with objectives of the type reachability/safety and mean payoff. We complement this approach by developing and implementing a partial-exploration based variant for all three objectives. Our experimental evaluation shows that PET2 offers the most efficient partial-exploration based algorithm and is the most viable tool on SGs, even outperforming unsound tools."}],"ec_funded":1,"conference":{"start_date":"2024-07-24","location":"Montreal, Canada","end_date":"2024-07-27","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-031-65633-0_16","volume":14683,"date_updated":"2025-09-08T08:53:55Z","oa":1,"date_published":"2024-07-01T00:00:00Z","article_processing_charge":"Yes (in subscription journal)"}]