[{"date_published":"2021-11-10T00:00:00Z","type":"conference","arxiv":1,"ec_funded":1,"isi":1,"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Kafshdar Goharshadi, Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","first_name":"Ehsan","last_name":"Kafshdar Goharshadi","orcid":"0000-0002-8595-0587"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr"},{"full_name":"Zárevúcky, Jiří","last_name":"Zárevúcky","first_name":"Jiří"},{"last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699"}],"title":"On lexicographic proof rules for probabilistic termination","alternative_title":["LNCS"],"article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"isbn":["9-783-0309-0869-0"],"issn":["0302-9743"],"eisbn":["978-3-030-90870-6"],"eissn":["1611-3349"]},"publication":"24th International Symposium on Formal Methods","year":"2021","conference":{"name":"FM: Formal Methods","end_date":"2021-11-26","location":"Virtual","start_date":"2021-11-20"},"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","language":[{"iso":"eng"}],"publisher":"Springer Nature","_id":"10414","citation":{"ieee":"K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in <i>24th International Symposium on Formal Methods</i>, Virtual, 2021, vol. 13047, pp. 619–639.","mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” <i>24th International Symposium on Formal Methods</i>, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>.","ama":"Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: <i>24th International Symposium on Formal Methods</i>. Vol 13047. Springer Nature; 2021:619-639. doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>","ista":"Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.","apa":"Chatterjee, K., Goharshady, E., Novotný, P., Zárevúcky, J., &#38; Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In <i>24th International Symposium on Formal Methods</i> (Vol. 13047, pp. 619–639). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>","short":"K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In <i>24th International Symposium on Formal Methods</i>, 13047:619–39. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>."},"date_updated":"2026-04-07T13:27:55Z","page":"619-639","month":"11","date_created":"2021-12-05T23:01:45Z","volume":13047,"abstract":[{"lang":"eng","text":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs."}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"14778"},{"status":"public","relation":"dissertation_contains","id":"14539"}]},"oa_version":"Preprint","intvolume":"     13047","scopus_import":"1","external_id":{"isi":["000758218600033"],"arxiv":["2108.02188"]},"main_file_link":[{"url":"https://arxiv.org/abs/2108.02188","open_access":"1"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"doi":"10.1007/978-3-030-90870-6_33","day":"10","project":[{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"publication_status":"published","status":"public"},{"publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","article_processing_charge":"No","publication_identifier":{"isbn":["9781450383912"]},"quality_controlled":"1","isi":1,"ec_funded":1,"arxiv":1,"title":"Proving non-termination by program reversal","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","first_name":"Ehsan Kafshdar","full_name":"Goharshady, Ehsan Kafshdar"},{"full_name":"Novotný, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"date_published":"2021-06-01T00:00:00Z","type":"conference","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"month":"06","page":"1033-1048","_id":"9644","citation":{"short":"K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048.","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., &#38; Zikelic, D. (2021). Proving non-termination by program reversal. In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i> (pp. 1033–1048). Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453483.3454093\">https://doi.org/10.1145/3453483.3454093</a>","ista":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048.","mla":"Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2021, pp. 1033–48, doi:<a href=\"https://doi.org/10.1145/3453483.3454093\">10.1145/3453483.3454093</a>.","ama":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination by program reversal. In: <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2021:1033-1048. doi:<a href=\"https://doi.org/10.1145/3453483.3454093\">10.1145/3453483.3454093</a>","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Online, 2021, pp. 1033–1048.","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, 1033–48. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453483.3454093\">https://doi.org/10.1145/3453483.3454093</a>."},"date_updated":"2026-04-07T13:27:55Z","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was partially supported by the ERCCoG 863818 (ForM-SMArt) and the Czech Science Foundation grant No. GJ19-15134Y.","conference":{"name":"PLDI: Programming Language Design and Implementation","start_date":"2021-06-20","location":"Online","end_date":"2021-06-26"},"year":"2021","scopus_import":"1","external_id":{"isi":["000723661700067"],"arxiv":["2104.01189"]},"oa_version":"Preprint","date_created":"2021-07-11T22:01:17Z","related_material":{"record":[{"status":"public","id":"15284","relation":"research_data"},{"status":"public","relation":"dissertation_contains","id":"14539"}]},"abstract":[{"lang":"eng","text":"We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it handles programs with non-determinism, provides relative completeness guarantees and supports programs with polynomial arithmetic. The experiments performed with our prototype tool RevTerm show that our approach, despite its simplicity and stronger theoretical guarantees, is at least on par with the state-of-the-art tools, often achieving a non-trivial improvement under a proper configuration of its parameters."}],"publication_status":"published","status":"public","doi":"10.1145/3453483.3454093","department":[{"_id":"KrCh"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"day":"01","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.01189"}]},{"type":"conference","date_published":"2021-06-21T00:00:00Z","author":[{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"first_name":"Iosif","last_name":"Salem","full_name":"Salem, Iosif"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Yeo, Michelle X","last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809"}],"title":"LightPIR: Privacy-preserving route discovery for payment channel networks","arxiv":1,"ec_funded":1,"isi":1,"quality_controlled":"1","publication_identifier":{"isbn":["978-1-6654-4501-6"],"eisbn":["978-3-9031-7639-3"],"eissn":["1861-2288"]},"article_processing_charge":"No","year":"2021","conference":{"end_date":"2021-06-24","location":"Espoo and Helsinki, Finland","start_date":"2021-06-21","name":"2021 IFIP Networking Conference (IFIP Networking)"},"citation":{"chicago":"Pietrzak, Krzysztof Z, Iosif Salem, Stefan Schmid, and Michelle X Yeo. “LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks.” IEEE, 2021. <a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">https://doi.org/10.23919/IFIPNetworking52078.2021.9472205</a>.","ista":"Pietrzak KZ, Salem I, Schmid S, Yeo MX. 2021. LightPIR: Privacy-preserving route discovery for payment channel networks. 2021 IFIP Networking Conference (IFIP Networking).","short":"K.Z. Pietrzak, I. Salem, S. Schmid, M.X. Yeo, in:, IEEE, 2021.","apa":"Pietrzak, K. Z., Salem, I., Schmid, S., &#38; Yeo, M. X. (2021). LightPIR: Privacy-preserving route discovery for payment channel networks. Presented at the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland: IEEE. <a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">https://doi.org/10.23919/IFIPNetworking52078.2021.9472205</a>","ieee":"K. Z. Pietrzak, I. Salem, S. Schmid, and M. X. Yeo, “LightPIR: Privacy-preserving route discovery for payment channel networks,” presented at the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland, 2021.","ama":"Pietrzak KZ, Salem I, Schmid S, Yeo MX. LightPIR: Privacy-preserving route discovery for payment channel networks. In: IEEE; 2021. doi:<a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">10.23919/IFIPNetworking52078.2021.9472205</a>","mla":"Pietrzak, Krzysztof Z., et al. <i>LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks</i>. IEEE, 2021, doi:<a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">10.23919/IFIPNetworking52078.2021.9472205</a>."},"_id":"9969","date_updated":"2026-04-07T13:29:44Z","month":"06","language":[{"iso":"eng"}],"publisher":"IEEE","abstract":[{"text":"Payment channel networks are a promising approach to improve the scalability of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion, along multihop routes in the network, without requiring consensus on the blockchain. However, during the discovery of cost-efficient routes for the transaction, critical information may be revealed about the transacting entities. This paper initiates the study of privacy-preserving route discovery mechanisms for payment channel networks. In particular, we present LightPIR, an approach which allows a client to learn the shortest (or cheapest in terms of fees) path between two nodes without revealing any information about the endpoints of the transaction to the servers. The two main observations which allow for an efficient solution in LightPIR are that: (1) surprisingly, hub labelling algorithms – which were developed to preprocess “street network like” graphs so one can later efficiently compute shortest paths – also perform well for the graphs underlying payment channel networks, and that (2) hub labelling algorithms can be conveniently combined with private information retrieval. LightPIR relies on a simple hub labeling heuristic on top of existing hub labeling algorithms which leverages the specific topological features of cryptocurrency networks to further minimize storage and bandwidth overheads. In a case study considering the Lightning network, we show that our approach is an order of magnitude more efficient compared to a privacy-preserving baseline based on using private information retrieval on a database that stores all pairs shortest paths.","lang":"eng"}],"related_material":{"record":[{"id":"14506","relation":"dissertation_contains","status":"public"}]},"date_created":"2021-08-29T22:01:16Z","oa_version":"Submitted Version","external_id":{"isi":["000853016800008"],"arxiv":["2104.04293"]},"scopus_import":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.04293"}],"project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"day":"21","department":[{"_id":"KrPi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.23919/IFIPNetworking52078.2021.9472205","status":"public","publication_status":"published"},{"page":"196-213","_id":"9394","citation":{"chicago":"Koch, Eva L., Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria, Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin. “Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis.” <i>Evolution Letters</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/evl3.227\">https://doi.org/10.1002/evl3.227</a>.","ista":"Koch EL, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM, Johannesson K, Butlin RK. 2021. Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. Evolution Letters. 5(3), 196–213.","short":"E.L. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon, E.M. Lemmon, K. Johannesson, R.K. Butlin, Evolution Letters 5 (2021) 196–213.","apa":"Koch, E. L., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon, A. R., … Butlin, R. K. (2021). Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. <i>Evolution Letters</i>. Wiley. <a href=\"https://doi.org/10.1002/evl3.227\">https://doi.org/10.1002/evl3.227</a>","ieee":"E. L. Koch <i>et al.</i>, “Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis,” <i>Evolution Letters</i>, vol. 5, no. 3. Wiley, pp. 196–213, 2021.","ama":"Koch EL, Morales HE, Larsson J, et al. Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. <i>Evolution Letters</i>. 2021;5(3):196-213. doi:<a href=\"https://doi.org/10.1002/evl3.227\">10.1002/evl3.227</a>","mla":"Koch, Eva L., et al. “Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis.” <i>Evolution Letters</i>, vol. 5, no. 3, Wiley, 2021, pp. 196–213, doi:<a href=\"https://doi.org/10.1002/evl3.227\">10.1002/evl3.227</a>."},"date_updated":"2026-04-07T14:01:29Z","month":"05","language":[{"iso":"eng"}],"publisher":"Wiley","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-10-15T08:26:02Z","access_level":"open_access","success":1,"file_name":"2021_EvolutionLetters_Koch.pdf","checksum":"023b1608e311f0fda30593ba3d0a4e0b","file_size":3021108,"date_created":"2021-10-15T08:26:02Z","file_id":"10142","creator":"cchlebak"}],"acknowledgement":"We are very grateful to Irena Senčić for technical assistance and to Michelle Kortyna and Sean Holland at the Center for Anchored Phylogenomics for assistance with data collection. RKB was funded by the Natural Environment Research Council and by the European Research Council. KJ was funded by the Swedish Research Councils VR and Formas (Linnaeus Grant: 217‐2008‐1719). JL was funded by a studentship from the Leverhulme Centre for Advanced Biological Modelling. AMW was funded by the European Union's Horizon 2020 research and innovation program under Marie Skłodowska‐Curie Grant agreement no. 797747. RF was funded by the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska‐Curie Grant agreement No. 706376 and by FEDER Funds through the Operational Competitiveness Factors Program—COMPETE and by National Funds through FCT—Foundation for Science and Technology within the scope of the project “Hybrabbid” (PTDC/BIA‐EVL/30628/2017‐ POCI‐01‐0145‐FEDER‐030628). We are grateful to other members of the Littorina research group for helpful discussions. We thank Claire Mérot and an anonymous referee for insightful comments on an earlier version. ","year":"2021","ddc":["570"],"publication":"Evolution Letters","quality_controlled":"1","publication_identifier":{"eissn":["2056-3744"]},"article_processing_charge":"No","author":[{"full_name":"Koch, Eva L.","first_name":"Eva L.","last_name":"Koch"},{"full_name":"Morales, Hernán E.","last_name":"Morales","first_name":"Hernán E."},{"last_name":"Larsson","first_name":"Jenny","full_name":"Larsson, Jenny"},{"orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","last_name":"Westram"},{"last_name":"Faria","first_name":"Rui","full_name":"Faria, Rui"},{"first_name":"Alan R.","last_name":"Lemmon","full_name":"Lemmon, Alan R."},{"full_name":"Lemmon, E. Moriarty","last_name":"Lemmon","first_name":"E. Moriarty"},{"full_name":"Johannesson, Kerstin","first_name":"Kerstin","last_name":"Johannesson"},{"last_name":"Butlin","first_name":"Roger K.","full_name":"Butlin, Roger K."}],"title":"Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis","ec_funded":1,"isi":1,"type":"journal_article","has_accepted_license":"1","date_published":"2021-05-07T00:00:00Z","status":"public","publication_status":"published","day":"07","project":[{"grant_number":"797747","_id":"265B41B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Theoretical and empirical approaches to understanding Parallel Adaptation"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"NiBa"}],"doi":"10.1002/evl3.227","issue":"3","file_date_updated":"2021-10-15T08:26:02Z","oa":1,"external_id":{"isi":["000647846200001"]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","intvolume":"         5","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Chromosomal inversions have long been recognized for their role in local adaptation. By suppressing recombination in heterozygous individuals, they can maintain coadapted gene complexes and protect them from homogenizing effects of gene flow. However, to fully understand their importance for local adaptation we need to know their influence on phenotypes under divergent selection. For this, the marine snail Littorina saxatilis provides an ideal study system. Divergent ecotypes adapted to wave action and crab predation occur in close proximity on intertidal shores with gene flow between them. Here, we used F2 individuals obtained from crosses between the ecotypes to test for associations between genomic regions and traits distinguishing the Crab‐/Wave‐adapted ecotypes including size, shape, shell thickness, and behavior. We show that most of these traits are influenced by two previously detected inversion regions that are divergent between ecotypes. We thus gain a better understanding of one important underlying mechanism responsible for the rapid and repeated formation of ecotypes: divergent selection acting on inversions. We also found that some inversions contributed to more than one trait suggesting that they may contain several loci involved in adaptation, consistent with the hypothesis that suppression of recombination within inversions facilitates differentiation in the presence of gene flow."}],"related_material":{"record":[{"status":"public","id":"12987","relation":"research_data"}]},"article_type":"original","volume":5,"date_created":"2021-05-16T22:01:47Z"},{"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"ddc":["570"],"article_processing_charge":"No","license":"https://creativecommons.org/publicdomain/zero/1.0/","oa_version":"Published Version","author":[{"last_name":"Koch","first_name":"Eva","full_name":"Koch, Eva"},{"full_name":"Morales, Hernán E.","first_name":"Hernán E.","last_name":"Morales"},{"full_name":"Larsson, Jenny","first_name":"Jenny","last_name":"Larsson"},{"orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","full_name":"Westram, Anja M"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"},{"first_name":"Alan R.","last_name":"Lemmon","full_name":"Lemmon, Alan R."},{"full_name":"Lemmon, E. Moriarty","first_name":"E. Moriarty","last_name":"Lemmon"},{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"},{"last_name":"Butlin","first_name":"Roger K.","full_name":"Butlin, Roger K."}],"title":"Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis","abstract":[{"text":"Chromosomal inversion polymorphisms, segments of chromosomes that are flipped in orientation and occur in reversed order in some individuals, have long been recognized to play an important role in local adaptation. They can reduce recombination in heterozygous individuals and thus help to maintain sets of locally adapted alleles. In a wide range of organisms, populations adapted to different habitats differ in frequency of inversion arrangements. However, getting a full understanding of the importance of inversions for adaptation requires confirmation of their influence on traits under divergent selection. Here, we studied a marine snail, Littorina saxatilis, that has evolved ecotypes adapted to wave exposure or crab predation. These two types occur in close proximity on different parts of the shore. Gene flow between them exists in contact zones. However, they exhibit strong phenotypic divergence in several traits under habitat-specific selection, including size, shape and behaviour. We used crosses between these ecotypes to identify genomic regions that explain variation in these traits by using QTL analysis and variance partitioning across linkage groups. We could show that previously detected inversion regions contribute to adaptive divergence. Some inversions influenced multiple traits suggesting that they contain sets of locally adaptive alleles. Our study also identified regions without known inversions that are important for phenotypic divergence. Thus, we provide a more complete overview of the importance of inversions in relation to the remaining genome.","lang":"eng"}],"related_material":{"record":[{"relation":"used_in_publication","id":"9394","status":"public"}]},"type":"research_data_reference","has_accepted_license":"1","date_created":"2023-05-16T12:34:09Z","date_published":"2021-04-10T00:00:00Z","_id":"12987","date_updated":"2026-04-07T14:01:30Z","status":"public","citation":{"chicago":"Koch, Eva, Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria, Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin. “Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis.” Dryad, 2021. <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">https://doi.org/10.5061/DRYAD.ZGMSBCCB4</a>.","ama":"Koch E, Morales HE, Larsson J, et al. Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. 2021. doi:<a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>","mla":"Koch, Eva, et al. <i>Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis</i>. Dryad, 2021, doi:<a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>.","ieee":"E. Koch <i>et al.</i>, “Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis.” Dryad, 2021.","apa":"Koch, E., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon, A. R., … Butlin, R. K. (2021). Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">https://doi.org/10.5061/DRYAD.ZGMSBCCB4</a>","short":"E. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon, E.M. Lemmon, K. Johannesson, R.K. Butlin, (2021).","ista":"Koch E, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM, Johannesson K, Butlin RK. 2021. Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>."},"month":"04","publisher":"Dryad","day":"10","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"NiBa"}],"doi":"10.5061/DRYAD.ZGMSBCCB4","OA_place":"publisher","main_file_link":[{"url":"https://doi.org/10.5061/dryad.zgmsbccb4","open_access":"1"}],"oa":1,"year":"2021"},{"language":[{"iso":"eng"}],"publication_status":"draft","corr_author":"1","_id":"12077","status":"public","citation":{"chicago":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>.","ista":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv, 2104.14946.","short":"A.L. Shute, ArXiv (n.d.).","apa":"Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>","ieee":"A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana points,” <i>arXiv</i>. .","mla":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, 2104.14946, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>.","ama":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>"},"date_updated":"2026-04-07T14:13:35Z","month":"04","department":[{"_id":"TiBr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.48550/arXiv.2104.14946","day":"30","acknowledgement":"The author would like to thank Damaris Schindler and Florian Wilsch for their helpful comments on the heights and Tamagawa measures used in Section 3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable feedback on an earlier version of this paper, and Tim Browning for many useful comments and discussions during the development of this work. The author is also grateful to the anonymous referee for providing many valuable comments and suggestions that improved the quality of the paper.","year":"2021","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.14946"}],"oa":1,"publication":"arXiv","external_id":{"arxiv":["2104.14946"]},"article_processing_charge":"No","arxiv":1,"author":[{"orcid":"0000-0002-1812-2810","full_name":"Shute, Alec L","id":"440EB050-F248-11E8-B48F-1D18A9856A87","first_name":"Alec L","last_name":"Shute"}],"oa_version":"Preprint","title":"On the leading constant in the Manin-type conjecture for Campana points","date_created":"2022-09-09T10:43:17Z","date_published":"2021-04-30T00:00:00Z","abstract":[{"lang":"eng","text":"We compare the Manin-type conjecture for Campana points recently formulated\r\nby Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$, where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that the two predicted leading constants do not agree, and we discuss whether thin sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding to squareful values of binary quadratic forms."}],"type":"preprint","related_material":{"record":[{"status":"public","id":"17058","relation":"later_version"},{"status":"public","id":"12072","relation":"dissertation_contains"}]},"article_number":"2104.14946"},{"title":"Sums of four squareful numbers","oa_version":"Preprint","author":[{"orcid":"0000-0002-1812-2810","id":"440EB050-F248-11E8-B48F-1D18A9856A87","first_name":"Alec L","last_name":"Shute","full_name":"Shute, Alec L"}],"arxiv":1,"type":"preprint","article_number":"2104.06966","related_material":{"record":[{"relation":"dissertation_contains","id":"12072","status":"public"}]},"abstract":[{"text":"We find an asymptotic formula for the number of primitive vectors $(z_1,\\ldots,z_4)\\in (\\mathbb{Z}_{\\neq 0})^4$ such that $z_1,\\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado.","lang":"eng"}],"date_created":"2022-09-09T10:42:51Z","date_published":"2021-04-15T00:00:00Z","external_id":{"arxiv":["2104.06966"]},"publication":"arXiv","article_processing_charge":"No","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2104.06966","open_access":"1"}],"year":"2021","month":"04","_id":"12076","citation":{"mla":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, 2104.06966, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>.","ama":"Shute AL. Sums of four squareful numbers. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>","ieee":"A. L. Shute, “Sums of four squareful numbers,” <i>arXiv</i>. .","apa":"Shute, A. L. (n.d.). Sums of four squareful numbers. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>","short":"A.L. Shute, ArXiv (n.d.).","ista":"Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.","chicago":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>."},"status":"public","date_updated":"2026-04-07T14:13:35Z","corr_author":"1","publication_status":"draft","language":[{"iso":"eng"}],"day":"15","doi":"10.48550/arXiv.2104.06966","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"TiBr"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"oa":1,"year":"2021","day":"07","doi":"10.48550/arXiv.2102.05996","department":[{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","date_updated":"2026-04-07T14:19:48Z","_id":"10803","citation":{"ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. .","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, 2102.05996, doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>.","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>","chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>."},"status":"public","corr_author":"1","publication_status":"draft","language":[{"iso":"eng"}],"article_number":"2102.05996","related_material":{"record":[{"relation":"dissertation_contains","id":"10799","status":"public"}]},"type":"preprint","abstract":[{"text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.","lang":"eng"}],"date_published":"2021-06-07T00:00:00Z","date_created":"2022-02-28T14:13:59Z","title":"Fairness through regularization for learning to rank","author":[{"full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","last_name":"Konstantinov","orcid":"0009-0009-5204-7621"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0002-4561-241X"}],"oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","external_id":{"arxiv":["2102.05996"]},"publication":"arXiv"},{"year":"2021","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","month":"05","citation":{"chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>.","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","apa":"Rzadkowski, W., Lemeshko, M., &#38; Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>"},"_id":"10762","page":"2105.15193","date_updated":"2026-04-07T14:20:12Z","corr_author":"1","language":[{"iso":"eng"}],"type":"preprint","date_published":"2021-05-31T00:00:00Z","title":"Artificial neural network states for non-additive systems","author":[{"orcid":"0000-0002-1106-4419","last_name":"Rzadkowski","id":"48C55298-F248-11E8-B48F-1D18A9856A87","first_name":"Wojciech","full_name":"Rzadkowski, Wojciech"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"},{"full_name":"Mentink, Johan H.","first_name":"Johan H.","last_name":"Mentink"}],"arxiv":1,"ec_funded":1,"article_processing_charge":"No","publication":"arXiv","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2105.15193","open_access":"1"}],"day":"31","project":[{"name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"doi":"10.48550/arXiv.2105.15193","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"status":"public","publication_status":"draft","related_material":{"record":[{"id":"10759","relation":"dissertation_contains","status":"public"}]},"abstract":[{"lang":"eng","text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications."}],"date_created":"2022-02-17T11:18:57Z","oa_version":"Preprint","external_id":{"arxiv":["2105.15193"]}},{"scopus_import":"1","external_id":{"arxiv":["2012.08185"]},"intvolume":"        35","oa_version":"Published Version","date_created":"2022-01-25T15:15:02Z","volume":35,"abstract":[{"text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"publication_status":"published","status":"public","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"day":"28","issue":"5A","file_date_updated":"2022-01-26T07:41:16Z","oa":1,"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","ddc":["000"],"article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"isbn":["978-1-57735-866-4"],"issn":["2159-5399"],"eissn":["2374-3468"]},"ec_funded":1,"arxiv":1,"author":[{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"}],"alternative_title":["Technical Tracks"],"title":"Scalable verification of quantized neural networks","date_published":"2021-05-28T00:00:00Z","has_accepted_license":"1","type":"conference","language":[{"iso":"eng"}],"corr_author":"1","publisher":"AAAI Press","_id":"10665","citation":{"ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021."},"page":"3787-3795","date_updated":"2026-04-07T14:21:58Z","month":"05","file":[{"success":1,"access_level":"open_access","date_updated":"2022-01-26T07:41:16Z","relation":"main_file","content_type":"application/pdf","creator":"mlechner","file_id":"10684","date_created":"2022-01-26T07:41:16Z","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","file_size":137235,"file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","year":"2021","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02","location":"Virtual"}},{"file":[{"relation":"main_file","content_type":"application/pdf","success":1,"access_level":"open_access","date_updated":"2022-01-26T07:39:59Z","file_size":452492,"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","date_created":"2022-01-26T07:39:59Z","file_name":"infinite_time_horizon_safety_o.pdf","creator":"mlechner","file_id":"10682"}],"month":"12","_id":"10667","date_updated":"2026-04-07T14:21:58Z","citation":{"chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, ."},"corr_author":"1","language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-10"},"year":"2021","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","quality_controlled":"1","article_processing_charge":"No","ddc":["000"],"publication":"35th Conference on Neural Information Processing Systems","has_accepted_license":"1","type":"conference","date_published":"2021-12-01T00:00:00Z","alternative_title":[" Advances in Neural Information Processing Systems"],"title":"Infinite time horizon safety of Bayesian neural networks","author":[{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"last_name":"Žikelić","first_name":"Ðorđe","full_name":"Žikelić, Ðorđe"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"ec_funded":1,"arxiv":1,"day":"01","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"doi":"10.48550/arXiv.2111.03165","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"status":"public","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"oa":1,"file_date_updated":"2022-01-26T07:39:59Z","external_id":{"arxiv":["2111.03165"]},"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"abstract":[{"text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.","lang":"eng"}],"date_created":"2022-01-25T15:45:58Z","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/"},{"date_created":"2022-01-25T15:44:54Z","abstract":[{"lang":"eng","text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning."}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"OA_type":"green","oa_version":"Preprint","scopus_import":"1","external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2103.08187","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"doi":"10.1109/ICRA48506.2021.9561036","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"day":"01","publication_status":"published","status":"public","date_published":"2021-06-01T00:00:00Z","has_accepted_license":"1","type":"conference","arxiv":1,"isi":1,"series_title":"ICRA","author":[{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"title":"Adversarial training is not ready for robot learning","article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"issn":["1050-4729"],"eisbn":["978-1-7281-9077-8"],"isbn":["978-1-7281-9078-5"],"eissn":["2577-087X"]},"publication":"2021 IEEE International Conference on Robotics and Automation","ddc":["000"],"year":"2021","conference":{"end_date":"2021-06-05","location":"Xi'an, China","start_date":"2021-05-30","name":"ICRA: International Conference on Robotics and Automation"},"acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","OA_place":"repository","language":[{"iso":"eng"}],"page":"4140-4147","_id":"10666","date_updated":"2026-04-07T14:21:58Z","citation":{"mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. ICRA, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>."},"month":"06"},{"degree_awarded":"PhD","abstract":[{"lang":"eng","text":"In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime.\r\nIn the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time\r\n(up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result\r\nimproves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices."}],"date_created":"2021-01-21T18:16:54Z","supervisor":[{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös"}],"oa_version":"Published Version","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7"}],"day":"25","doi":"10.15479/AT:ISTA:9022","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"status":"public","publication_status":"published","oa":1,"file_date_updated":"2021-01-25T14:19:10Z","publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","ddc":["510"],"has_accepted_license":"1","type":"dissertation","date_published":"2021-01-25T00:00:00Z","title":"Fluctuations in the spectrum of random matrices","alternative_title":["ISTA Thesis"],"author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992"}],"ec_funded":1,"file":[{"file_name":"thesis.pdf","file_size":4127796,"checksum":"5a93658a5f19478372523ee232887e2b","date_created":"2021-01-25T14:19:03Z","file_id":"9043","creator":"gcipollo","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2021-01-25T14:19:03Z","success":1},{"file_id":"9044","creator":"gcipollo","file_name":"Thesis_files.zip","file_size":12775206,"checksum":"e8270eddfe6a988e92a53c88d1d19b8c","date_created":"2021-01-25T14:19:10Z","date_updated":"2021-01-25T14:19:10Z","access_level":"closed","content_type":"application/zip","relation":"source_file"}],"month":"01","page":"380","_id":"9022","date_updated":"2026-04-08T06:59:33Z","citation":{"chicago":"Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9022\">https://doi.org/10.15479/AT:ISTA:9022</a>.","mla":"Cipolloni, Giorgio. <i>Fluctuations in the Spectrum of Random Matrices</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9022\">10.15479/AT:ISTA:9022</a>.","ama":"Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9022\">10.15479/AT:ISTA:9022</a>","ieee":"G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021.","short":"G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021.","apa":"Cipolloni, G. (2021). <i>Fluctuations in the spectrum of random matrices</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9022\">https://doi.org/10.15479/AT:ISTA:9022</a>","ista":"Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria."},"corr_author":"1","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"year":"2021","acknowledgement":"I gratefully acknowledge the financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804.","OA_place":"publisher"},{"publication_identifier":{"issn":["2791-4585"]},"article_processing_charge":"No","ddc":["530"],"type":"dissertation","has_accepted_license":"1","date_published":"2021-12-07T00:00:00Z","author":[{"full_name":"Piankov, Anton","last_name":"Piankov","first_name":"Anton","id":"865E3C26-AA8C-11E9-A409-C4C4E5697425"}],"alternative_title":["ISTA Master's Thesis"],"title":"Towards designer materials using customizable particle shape","file":[{"checksum":"114e8f4b2c002c6c352416c12de2c695","file_size":394018,"date_created":"2021-12-07T11:13:52Z","file_name":"Thesis.zip","creator":"cchlebak","file_id":"10424","relation":"source_file","content_type":"application/x-zip-compressed","access_level":"closed","date_updated":"2022-03-10T12:10:25Z"},{"creator":"cchlebak","file_id":"10425","file_size":47638,"checksum":"cd15ae991ced352a9959815f794e657c","date_created":"2021-12-07T11:14:01Z","file_name":"Preliminary_pages_Piankov.docx","date_updated":"2022-03-10T12:10:25Z","access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"},{"success":1,"date_updated":"2021-12-07T11:20:35Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","creator":"cchlebak","file_id":"10426","checksum":"e6899c798b75ba42fab9822bce309050","file_size":484965,"date_created":"2021-12-07T11:20:35Z","file_name":"2021_Piankov_combined.pdf"}],"_id":"10422","citation":{"chicago":"Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>.","apa":"Piankov, A. (2021). <i>Towards designer materials using customizable particle shape</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>","short":"A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021.","ista":"Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria.","mla":"Piankov, Anton. <i>Towards Designer Materials Using Customizable Particle Shape</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>.","ama":"Piankov A. Towards designer materials using customizable particle shape. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>","ieee":"A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021."},"date_updated":"2026-04-08T06:58:55Z","month":"12","language":[{"iso":"eng"}],"corr_author":"1","publisher":"Institute of Science and Technology Austria","year":"2021","OA_place":"publisher","degree_awarded":"MS","abstract":[{"text":"Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems.","lang":"eng"}],"date_created":"2021-12-07T10:48:06Z","oa_version":"Published Version","supervisor":[{"orcid":"0000-0002-1307-5074","full_name":"Goodrich, Carl Peter","last_name":"Goodrich","first_name":"Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425"}],"day":"07","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"GradSch"},{"_id":"CaGo"}],"doi":"10.15479/at:ista:10422","status":"public","publication_status":"published","oa":1,"file_date_updated":"2022-03-10T12:10:25Z"},{"language":[{"iso":"eng"}],"corr_author":"1","publisher":"Institute of Science and Technology Austria","date_updated":"2026-04-08T07:00:04Z","_id":"10030","citation":{"chicago":"Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10030\">https://doi.org/10.15479/at:ista:10030</a>.","ieee":"L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021.","ama":"Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10030\">10.15479/at:ista:10030</a>","mla":"Portinale, Lorenzo. <i>Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10030\">10.15479/at:ista:10030</a>.","ista":"Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria.","short":"L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.","apa":"Portinale, L. (2021). <i>Discrete-to-continuum limits of transport problems and gradient flows in the space of measures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10030\">https://doi.org/10.15479/at:ista:10030</a>"},"month":"09","file":[{"date_created":"2021-09-21T09:17:34Z","file_size":3876668,"checksum":"8cd60dcb8762e8f21867e21e8001e183","file_name":"tex_and_pictures.zip","creator":"cchlebak","file_id":"10032","relation":"source_file","content_type":"application/x-zip-compressed","access_level":"closed","date_updated":"2022-03-10T12:14:42Z"},{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-09-27T11:14:31Z","file_size":2532673,"checksum":"9789e9d967c853c1503ec7f307170279","date_created":"2021-09-27T11:14:31Z","file_name":"thesis_portinale_Final (1).pdf","creator":"cchlebak","file_id":"10047"}],"acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","OA_place":"publisher","year":"2021","ddc":["515"],"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"author":[{"id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","first_name":"Lorenzo","last_name":"Portinale","full_name":"Portinale, Lorenzo"}],"alternative_title":["ISTA Thesis"],"title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","date_published":"2021-09-22T00:00:00Z","type":"dissertation","has_accepted_license":"1","publication_status":"published","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"doi":"10.15479/at:ista:10030","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"day":"22","project":[{"_id":"260788DE-B435-11E9-9278-68D0E5697425","grant_number":"W1245","call_identifier":"FWF","name":"Dissipation and dispersion in nonlinear partial differential equations"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"oa":1,"file_date_updated":"2022-03-10T12:14:42Z","degree_awarded":"PhD","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","supervisor":[{"full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-0845-1338"}],"date_created":"2021-09-21T09:14:15Z","abstract":[{"lang":"eng","text":"This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces."}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"9792","status":"public"},{"status":"public","id":"10022","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7573","status":"public"}]}},{"OA_place":"publisher","year":"2021","month":"08","citation":{"ista":"Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria.","apa":"Feliciangeli, D. (2021). <i>The polaron at strong coupling</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>","short":"D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.","ieee":"D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021.","ama":"Feliciangeli D. The polaron at strong coupling. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>","mla":"Feliciangeli, Dario. <i>The Polaron at Strong Coupling</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>.","chicago":"Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>."},"_id":"9733","page":"180","date_updated":"2026-04-08T06:59:50Z","publisher":"Institute of Science and Technology Austria","corr_author":"1","language":[{"iso":"eng"}],"file":[{"file_name":"Thesis_FeliciangeliA.pdf","checksum":"e88bb8ca43948abe060eb2d2fa719881","file_size":1958710,"date_created":"2021-08-19T14:03:48Z","file_id":"9944","creator":"dfelicia","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2021-09-06T09:28:56Z"},{"file_name":"thesis.7z","date_created":"2021-08-19T14:06:35Z","file_size":3771669,"checksum":"72810843abee83705853505b3f8348aa","file_id":"9945","creator":"dfelicia","content_type":"application/octet-stream","relation":"source_file","access_level":"closed","date_updated":"2022-03-10T12:13:57Z"}],"alternative_title":["ISTA Thesis"],"title":"The polaron at strong coupling","author":[{"orcid":"0000-0003-0754-8530","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario","last_name":"Feliciangeli","full_name":"Feliciangeli, Dario"}],"ec_funded":1,"has_accepted_license":"1","type":"dissertation","date_published":"2021-08-20T00:00:00Z","ddc":["515","519","539"],"publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","oa":1,"file_date_updated":"2022-03-10T12:13:57Z","status":"public","publication_status":"published","day":"20","project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"doi":"10.15479/at:ista:9733","department":[{"_id":"GradSch"},{"_id":"RoSe"},{"_id":"JaMa"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","supervisor":[{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Maas","orcid":"0000-0002-0845-1338"}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nd/4.0/","related_material":{"record":[{"status":"public","id":"9787","relation":"part_of_dissertation"},{"status":"public","id":"9792","relation":"part_of_dissertation"},{"id":"9791","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"9781","relation":"part_of_dissertation"},{"status":"public","id":"9225","relation":"part_of_dissertation"}]},"abstract":[{"lang":"eng","text":"This thesis is the result of the research carried out by the author during his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich polaron model, specifically to its regime of strong coupling. This model, which is rigorously introduced and discussed in the introduction, has been of great interest in condensed matter physics and field theory for more than eighty years. It is used to describe an electron interacting with the atoms of a solid material (the strength of this interaction is modeled by the presence of a coupling constant α in the Hamiltonian of the system). The particular regime examined here, which is mathematically described by considering the limit α →∞, displays many interesting features related to the emergence of classical behavior, which allows for a simplified effective description of the system under analysis. The properties, the range of validity and a quantitative analysis of the precision of such classical approximations are the main object of the present work. We specify our investigation to the study of the ground state energy of the system, its dynamics and its effective mass. For each of these problems, we provide in the introduction an overview of the previously known results and a detailed account of the original contributions by the author."}],"date_created":"2021-07-27T15:48:30Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"degree_awarded":"PhD"},{"month":"02","_id":"9225","date_updated":"2026-04-08T06:59:49Z","citation":{"chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” <i>Letters in Mathematical Physics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11005-020-01350-5\">https://doi.org/10.1007/s11005-020-01350-5</a>.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the spectral gap for the Landau–Pekar equations,” <i>Letters in Mathematical Physics</i>, vol. 111. Springer Nature, 2021.","ama":"Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap for the Landau–Pekar equations. <i>Letters in Mathematical Physics</i>. 2021;111. doi:<a href=\"https://doi.org/10.1007/s11005-020-01350-5\">10.1007/s11005-020-01350-5</a>","mla":"Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” <i>Letters in Mathematical Physics</i>, vol. 111, 19, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s11005-020-01350-5\">10.1007/s11005-020-01350-5</a>.","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19.","apa":"Feliciangeli, D., Rademacher, S. A. E., &#38; Seiringer, R. (2021). Persistence of the spectral gap for the Landau–Pekar equations. <i>Letters in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11005-020-01350-5\">https://doi.org/10.1007/s11005-020-01350-5</a>","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical Physics 111 (2021)."},"publisher":"Springer Nature","language":[{"iso":"eng"}],"file":[{"file_name":"2021_LettersMathPhysics_Feliciangeli.pdf","checksum":"ffbfe1aad623bce7ff529c207e343b53","file_size":391205,"date_created":"2021-03-09T11:44:34Z","file_id":"9232","creator":"dernst","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2021-03-09T11:44:34Z","success":1}],"acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged. Open Access funding provided by Institute of Science and Technology (IST Austria)","year":"2021","ddc":["510"],"publication":"Letters in Mathematical Physics","publication_identifier":{"eissn":["1573-0530"],"issn":["0377-9017"]},"quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","title":"Persistence of the spectral gap for the Landau–Pekar equations","author":[{"orcid":"0000-0003-0754-8530","full_name":"Feliciangeli, Dario","last_name":"Feliciangeli","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rademacher","id":"856966FE-A408-11E9-977E-802DE6697425","first_name":"Simone Anna Elvira","full_name":"Rademacher, Simone Anna Elvira","orcid":"0000-0001-5059-4466"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"isi":1,"ec_funded":1,"type":"journal_article","has_accepted_license":"1","date_published":"2021-02-11T00:00:00Z","status":"public","publication_status":"published","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"day":"11","doi":"10.1007/s11005-020-01350-5","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"RoSe"}],"file_date_updated":"2021-03-09T11:44:34Z","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["000617195700001"]},"scopus_import":"1","intvolume":"       111","oa_version":"Published Version","article_number":"19","related_material":{"record":[{"id":"9733","relation":"dissertation_contains","status":"public"}]},"abstract":[{"lang":"eng","text":"The Landau–Pekar equations describe the dynamics of a strongly coupled polaron.\r\nHere, we provide a class of initial data for which the associated effective Hamiltonian\r\nhas a uniform spectral gap for all times. For such initial data, this allows us to extend the\r\nresults on the adiabatic theorem for the Landau–Pekar equations and their derivation\r\nfrom the Fröhlich model obtained in previous works to larger times."}],"volume":111,"date_created":"2021-03-07T23:01:25Z","article_type":"original"},{"oa_version":"Preprint","abstract":[{"lang":"eng","text":"This paper establishes new connections between many-body quantum systems, One-body Reduced Density Matrices Functional Theory (1RDMFT) and Optimal Transport (OT), by interpreting the problem of computing the ground-state energy of a finite dimensional composite quantum system at positive temperature as a non-commutative entropy regularized Optimal Transport problem. We develop a new approach to fully characterize the dual-primal solutions in such non-commutative setting. The mathematical formalism is particularly relevant in quantum chemistry: numerical realizations of the many-electron ground state energy can be computed via a non-commutative version of Sinkhorn algorithm. Our approach allows to prove convergence and robustness of this algorithm, which, to our best knowledge, were unknown even in the two marginal case. Our methods are based on careful a priori estimates in the dual problem, which we believe to be of independent interest. Finally, the above results are extended in 1RDMFT setting, where bosonic or fermionic symmetry conditions are enforced on the problem."}],"article_number":"2106.11217","related_material":{"record":[{"id":"12911","relation":"later_version","status":"public"},{"id":"9733","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"10030"}]},"date_created":"2021-08-06T09:07:12Z","external_id":{"arxiv":["2106.11217"]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2106.11217"}],"status":"public","publication_status":"draft","day":"21","project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"},{"_id":"JaMa"}],"doi":"10.48550/arXiv.2106.11217","author":[{"full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario","last_name":"Feliciangeli","orcid":"0000-0003-0754-8530"},{"full_name":"Gerolin, Augusto","first_name":"Augusto","last_name":"Gerolin"},{"last_name":"Portinale","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo"}],"title":"A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature","ec_funded":1,"arxiv":1,"has_accepted_license":"1","type":"preprint","date_published":"2021-07-21T00:00:00Z","ddc":["510"],"publication":"arXiv","article_processing_charge":"No","acknowledgement":"This work started when A.G. was visiting the Erwin Schrödinger Institute and then continued when D.F. and L.P visited the Theoretical Chemistry Department of the Vrije Universiteit Amsterdam. The authors thanks the hospitality of both places and, especially, P. Gori-Giorgi and K. Giesbertz for fruitful discussions and literature suggestions in the early state of the project. Finally, the authors also thanks J. Maas and R. Seiringer for their feedback and useful comments to a first draft of the article.  L.P. acknowledges support by the Austrian Science Fund (FWF), grants No W1245 and NoF65. D.F acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 716117 and No 694227). A.G. acknowledges funding by the European Research Council under H2020/MSCA-IF “OTmeetsDFT” [grant ID: 795942].","year":"2021","citation":{"chicago":"Feliciangeli, Dario, Augusto Gerolin, and Lorenzo Portinale. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2106.11217\">https://doi.org/10.48550/arXiv.2106.11217</a>.","apa":"Feliciangeli, D., Gerolin, A., &#38; Portinale, L. (n.d.). A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2106.11217\">https://doi.org/10.48550/arXiv.2106.11217</a>","short":"D. Feliciangeli, A. Gerolin, L. Portinale, ArXiv (n.d.).","ista":"Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. arXiv, 2106.11217.","ama":"Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2106.11217\">10.48550/arXiv.2106.11217</a>","mla":"Feliciangeli, Dario, et al. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” <i>ArXiv</i>, 2106.11217, doi:<a href=\"https://doi.org/10.48550/arXiv.2106.11217\">10.48550/arXiv.2106.11217</a>.","ieee":"D. Feliciangeli, A. Gerolin, and L. Portinale, “A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature,” <i>arXiv</i>. ."},"_id":"9792","date_updated":"2026-04-08T07:00:03Z","month":"07","language":[{"iso":"eng"}]},{"ec_funded":1,"arxiv":1,"author":[{"orcid":"0000-0003-0754-8530","full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario","last_name":"Feliciangeli"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","date_published":"2021-02-01T00:00:00Z","has_accepted_license":"1","type":"preprint","publication":"arXiv","ddc":["510"],"article_processing_charge":"No","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.1.\r\n","year":"2021","language":[{"iso":"eng"}],"corr_author":"1","_id":"9787","date_updated":"2026-04-08T06:59:49Z","citation":{"ieee":"D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” <i>arXiv</i>. .","mla":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, 2101.12566, doi:<a href=\"https://doi.org/10.48550/arXiv.2101.12566\">10.48550/arXiv.2101.12566</a>.","ama":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2101.12566\">10.48550/arXiv.2101.12566</a>","ista":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566.","apa":"Feliciangeli, D., &#38; Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2101.12566\">https://doi.org/10.48550/arXiv.2101.12566</a>","short":"D. Feliciangeli, R. Seiringer, ArXiv (n.d.).","chicago":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2101.12566\">https://doi.org/10.48550/arXiv.2101.12566</a>."},"month":"02","oa_version":"Preprint","date_created":"2021-08-06T08:25:57Z","abstract":[{"lang":"eng","text":"We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging."}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"10224"},{"id":"9733","relation":"dissertation_contains","status":"public"}]},"article_number":"2101.12566","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"arxiv":["2101.12566"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.12566"}],"publication_status":"draft","status":"public","department":[{"_id":"RoSe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.48550/arXiv.2101.12566","project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"day":"01"},{"publication_status":"draft","status":"public","doi":"10.48550/arXiv.2107.03720","department":[{"_id":"RoSe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2107.03720","open_access":"1"}],"external_id":{"arxiv":["2107.03720"]},"oa_version":"Preprint","date_created":"2021-08-06T08:49:45Z","related_material":{"record":[{"status":"public","id":"10755","relation":"later_version"},{"status":"public","relation":"dissertation_contains","id":"9733"}]},"article_number":"2107.03720 ","abstract":[{"text":"We provide a definition of the effective mass for the classical polaron described by the Landau-Pekar equations. It is based on a novel variational principle, minimizing the energy functional over states with given (initial) velocity. The resulting formula for the polaron's effective mass agrees with the prediction by Landau and Pekar.","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"month":"07","citation":{"ista":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv, 2107.03720.","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.).","apa":"Feliciangeli, D., Rademacher, S. A. E., &#38; Seiringer, R. (n.d.). The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2107.03720\">https://doi.org/10.48550/arXiv.2107.03720</a>","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass problem for the Landau-Pekar equations,” <i>arXiv</i>. .","ama":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03720\">10.48550/arXiv.2107.03720</a>","mla":"Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, 2107.03720, doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03720\">10.48550/arXiv.2107.03720</a>.","chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2107.03720\">https://doi.org/10.48550/arXiv.2107.03720</a>."},"_id":"9791","date_updated":"2026-04-08T06:59:49Z","acknowledgement":"We thank Herbert Spohn for helpful comments. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged..","OA_place":"repository","year":"2021","publication":"arXiv","ddc":["510"],"article_processing_charge":"No","ec_funded":1,"arxiv":1,"title":"The effective mass problem for the Landau-Pekar equations","author":[{"full_name":"Feliciangeli, Dario","last_name":"Feliciangeli","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530"},{"first_name":"Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher","full_name":"Rademacher, Simone Anna Elvira","orcid":"0000-0001-5059-4466"},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"date_published":"2021-07-08T00:00:00Z","type":"preprint"}]