[{"month":"07","date_updated":"2025-04-14T07:49:12Z","publication":"Proceedings of the 40th International Conference on Machine Learning","publication_identifier":{"eissn":["2640-3498"]},"day":"30","department":[{"_id":"DaAl"}],"_id":"14460","publication_status":"published","language":[{"iso":"eng"}],"conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23"},"title":"SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge","citation":{"short":"M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 26215–26227.","chicago":"Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” In <i>Proceedings of the 40th International Conference on Machine Learning</i>, 202:26215–27. ML Research Press, 2023.","ama":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In: <i>Proceedings of the 40th International Conference on Machine Learning</i>. Vol 202. ML Research Press; 2023:26215-26227.","apa":"Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., &#38; Alistarh, D.-A. (2023). SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United States: ML Research Press.","ieee":"M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge,” in <i>Proceedings of the 40th International Conference on Machine Learning</i>, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.","mla":"Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” <i>Proceedings of the 40th International Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 26215–27.","ista":"Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 26215–26227."},"volume":202,"type":"conference","oa_version":"Preprint","alternative_title":["PMLR"],"acknowledgement":"We would like to thank Elias Frantar for his valuable assistance and support at the outset of this project, and the anonymous ICML and SNN reviewers for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant 805223 ScaleML. ","author":[{"last_name":"Nikdan","first_name":"Mahdi","full_name":"Nikdan, Mahdi","id":"66374281-f394-11eb-9cf6-869147deecc0"},{"full_name":"Pegolotti, Tommaso","first_name":"Tommaso","last_name":"Pegolotti"},{"orcid":"0000-0002-7778-3221","last_name":"Iofinova","full_name":"Iofinova, Eugenia B","first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117"},{"last_name":"Kurtic","full_name":"Kurtic, Eldar","first_name":"Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"year":"2023","abstract":[{"text":"We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.04852","open_access":"1"}],"status":"public","project":[{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020"}],"intvolume":"       202","page":"26215-26227","corr_author":"1","scopus_import":"1","date_published":"2023-07-30T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"article_processing_charge":"No","date_created":"2023-10-29T23:01:17Z","oa":1,"quality_controlled":"1","external_id":{"arxiv":["2302.04852"]},"publisher":"ML Research Press","arxiv":1},{"date_updated":"2026-04-07T13:00:54Z","acknowledged_ssus":[{"_id":"ScienComp"}],"publication":"Proceedings of the 40th International Conference on Machine Learning","month":"07","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23"},"related_material":{"record":[{"id":"17490","status":"public","relation":"dissertation_contains"}]},"day":"30","department":[{"_id":"DaAl"}],"publication_identifier":{"eissn":["2640-3498"]},"language":[{"iso":"eng"}],"publication_status":"published","_id":"14461","type":"conference","oa_version":"Preprint","title":"Quantized distributed training of large models with convergence guarantees","volume":202,"citation":{"mla":"Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence Guarantees.” <i>Proceedings of the 40th International Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 24020–44.","ieee":"I. Markov, A. Vladu, Q. Guo, and D.-A. Alistarh, “Quantized distributed training of large models with convergence guarantees,” in <i>Proceedings of the 40th International Conference on Machine Learning</i>, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 24020–24044.","ista":"Markov I, Vladu A, Guo Q, Alistarh D-A. 2023. Quantized distributed training of large models with convergence guarantees. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 24020–24044.","ama":"Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of large models with convergence guarantees. In: <i>Proceedings of the 40th International Conference on Machine Learning</i>. Vol 202. ML Research Press; 2023:24020-24044.","chicago":"Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In <i>Proceedings of the 40th International Conference on Machine Learning</i>, 202:24020–44. ML Research Press, 2023.","apa":"Markov, I., Vladu, A., Guo, Q., &#38; Alistarh, D.-A. (2023). Quantized distributed training of large models with convergence guarantees. In <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol. 202, pp. 24020–24044). Honolulu, Hawaii, HI, United States: ML Research Press.","short":"I. Markov, A. Vladu, Q. Guo, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 24020–24044."},"author":[{"full_name":"Markov, Ilia","first_name":"Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"last_name":"Vladu","full_name":"Vladu, Adrian","first_name":"Adrian"},{"last_name":"Guo","first_name":"Qi","full_name":"Guo, Qi"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), as well as experimental support from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl. AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT), the support of Fondation Hadamard with a PRMO grant, and the support of CNRS with a CoopIntEER IEA grant (project ALFRED).","alternative_title":["PMLR"],"abstract":[{"text":"Communication-reduction techniques are a popular way to improve scalability in data-parallel training of deep neural networks (DNNs). The recent emergence of large language models such as GPT has created the need for new approaches to exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training is highly popular, yet it still encounters scalability bottlenecks. One reason is that applying compression techniques to FSDP is challenging: as the vast majority of the communication involves the model’s weights, direct compression alters convergence and leads to accuracy loss. We present QSDP, a variant of FSDP which supports both gradient and weight quantization with theoretical guarantees, is simple to implement and has essentially no overheads. To derive QSDP we prove that a natural modification of SGD achieves convergence even when we only maintain quantized weights, and thus the domain over which we train consists of quantized points and is, therefore, highly non-convex. We validate this approach by training GPT-family models with up to 1.3 billion parameters on a multi-node cluster. Experiments show that QSDP preserves model accuracy, while completely removing the communication bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2302.02390"}],"year":"2023","intvolume":"       202","corr_author":"1","page":"24020-24044","status":"public","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020"}],"date_created":"2023-10-29T23:01:17Z","article_processing_charge":"No","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-07-30T00:00:00Z","scopus_import":"1","external_id":{"arxiv":["2302.02390"]},"quality_controlled":"1","oa":1,"arxiv":1,"publisher":"ML Research Press"},{"main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf"}],"abstract":[{"lang":"eng","text":"We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error."}],"year":"2023","page":"10072-10092","corr_author":"1","intvolume":"       202","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"status":"public","date_created":"2023-10-29T23:01:17Z","article_processing_charge":"No","ddc":["000"],"date_published":"2023-07-30T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"scopus_import":"1","publisher":"ML Research Press","arxiv":1,"external_id":{"arxiv":["2202.11205"]},"quality_controlled":"1","oa":1,"publication":"Proceedings of the 40th International Conference on Machine Learning","date_updated":"2026-06-18T17:35:42Z","month":"07","conference":{"name":"ICML: International Conference on Machine Learning","location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29","start_date":"2023-07-23"},"language":[{"iso":"eng"}],"_id":"14462","publication_status":"published","department":[{"_id":"MoHe"}],"day":"30","publication_identifier":{"eissn":["2640-3498"]},"oa_version":"Published Version","type":"conference","volume":202,"citation":{"short":"H. Fichtenberger, M. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.","chicago":"Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In <i>Proceedings of the 40th International Conference on Machine Learning</i>, 202:10072–92. ML Research Press, 2023.","ama":"Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: <i>Proceedings of the 40th International Conference on Machine Learning</i>. Vol 202. ML Research Press; 2023:10072-10092.","apa":"Fichtenberger, H., Henzinger, M., &#38; Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.","mla":"Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” <i>Proceedings of the 40th International Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 10072–92.","ieee":"H. Fichtenberger, M. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in <i>Proceedings of the 40th International Conference on Machine Learning</i>, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.","ista":"Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained error bound on differentially private continual observation. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10072–10092."},"title":"Constant matters: Fine-grained error bound on differentially private continual observation","author":[{"first_name":"Hendrik","full_name":"Fichtenberger, Hendrik","last_name":"Fichtenberger"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Upadhyay","full_name":"Upadhyay, Jalaj","first_name":"Jalaj"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was funded by Decanal Research Grant. A part of this work was done when JU was visiting Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia, Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta, and Sarvagya Upadhyay for useful discussions.","alternative_title":["PMLR"]},{"intvolume":"        34","page":"737-760","status":"public","abstract":[{"lang":"eng","text":"Given a triangle Δ, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of Δ with respect to area and perimeter. This problem was initially posed by Nandakumar [17, 22] and was first studied by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present paper, we prove that for any triangle Δ, every maximum area isosceles triangle embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter enclosing triangles is different: there are infinite families of triangles Δ whose minimum perimeter isosceles containers do not share a side and an angle with Δ."}],"issue":"7","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2205.11637","open_access":"1"}],"year":"2023","external_id":{"arxiv":["2205.11637"],"isi":["001080874400001"]},"oa":1,"quality_controlled":"1","arxiv":1,"publisher":"World Scientific Publishing","date_created":"2023-10-29T23:01:18Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-10-05T00:00:00Z","scopus_import":"1","department":[{"_id":"HeEd"}],"day":"05","publication_identifier":{"eissn":["1793-6373"],"issn":["0129-0541"]},"language":[{"iso":"eng"}],"_id":"14464","publication_status":"published","date_updated":"2023-12-13T13:04:55Z","publication":"International Journal of Foundations of Computer Science","article_type":"original","month":"10","author":[{"full_name":"Ambrus, Áron","first_name":"Áron","last_name":"Ambrus"},{"full_name":"Csikós, Mónika","first_name":"Mónika","last_name":"Csikós"},{"first_name":"Gergely","full_name":"Kiss, Gergely","last_name":"Kiss"},{"last_name":"Pach","first_name":"János","full_name":"Pach, János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4"},{"last_name":"Somlai","first_name":"Gábor","full_name":"Somlai, Gábor"}],"doi":"10.1142/S012905412342008X","oa_version":"Preprint","type":"journal_article","isi":1,"title":"Optimal embedded and enclosing isosceles triangles","citation":{"apa":"Ambrus, Á., Csikós, M., Kiss, G., Pach, J., &#38; Somlai, G. (2023). Optimal embedded and enclosing isosceles triangles. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S012905412342008X\">https://doi.org/10.1142/S012905412342008X</a>","chicago":"Ambrus, Áron, Mónika Csikós, Gergely Kiss, János Pach, and Gábor Somlai. “Optimal Embedded and Enclosing Isosceles Triangles.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2023. <a href=\"https://doi.org/10.1142/S012905412342008X\">https://doi.org/10.1142/S012905412342008X</a>.","ama":"Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. Optimal embedded and enclosing isosceles triangles. <i>International Journal of Foundations of Computer Science</i>. 2023;34(7):737-760. doi:<a href=\"https://doi.org/10.1142/S012905412342008X\">10.1142/S012905412342008X</a>","short":"Á. Ambrus, M. Csikós, G. Kiss, J. Pach, G. Somlai, International Journal of Foundations of Computer Science 34 (2023) 737–760.","ista":"Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. 2023. Optimal embedded and enclosing isosceles triangles. International Journal of Foundations of Computer Science. 34(7), 737–760.","ieee":"Á. Ambrus, M. Csikós, G. Kiss, J. Pach, and G. Somlai, “Optimal embedded and enclosing isosceles triangles,” <i>International Journal of Foundations of Computer Science</i>, vol. 34, no. 7. World Scientific Publishing, pp. 737–760, 2023.","mla":"Ambrus, Áron, et al. “Optimal Embedded and Enclosing Isosceles Triangles.” <i>International Journal of Foundations of Computer Science</i>, vol. 34, no. 7, World Scientific Publishing, 2023, pp. 737–60, doi:<a href=\"https://doi.org/10.1142/S012905412342008X\">10.1142/S012905412342008X</a>."},"volume":34},{"author":[{"orcid":"0000-0001-7173-4923","last_name":"Marensi","full_name":"Marensi, Elena","first_name":"Elena","id":"0BE7553A-1004-11EA-B805-18983DDC885E"},{"orcid":"0000-0002-8490-9312","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","last_name":"Yalniz","full_name":"Yalniz, Gökhan","first_name":"Gökhan"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754"}],"acknowledgement":"E.M. acknowledges funding from the ISTplus fellowship programme. G.Y. and B.H. acknowledge a grant from the Simons Foundation (662960, BH).","doi":"10.1017/jfm.2023.780","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"oa_version":"Published Version","type":"journal_article","title":"Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows","citation":{"mla":"Marensi, Elena, et al. “Dynamics and Proliferation of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” <i>Journal of Fluid Mechanics</i>, vol. 974, A21, Cambridge University Press, 2023, doi:<a href=\"https://doi.org/10.1017/jfm.2023.780\">10.1017/jfm.2023.780</a>.","ieee":"E. Marensi, G. Yalniz, and B. Hof, “Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows,” <i>Journal of Fluid Mechanics</i>, vol. 974. Cambridge University Press, 2023.","ista":"Marensi E, Yalniz G, Hof B. 2023. Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics. 974, A21.","ama":"Marensi E, Yalniz G, Hof B. Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid Mechanics</i>. 2023;974. doi:<a href=\"https://doi.org/10.1017/jfm.2023.780\">10.1017/jfm.2023.780</a>","chicago":"Marensi, Elena, Gökhan Yalniz, and Björn Hof. “Dynamics and Proliferation of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/jfm.2023.780\">https://doi.org/10.1017/jfm.2023.780</a>.","apa":"Marensi, E., Yalniz, G., &#38; Hof, B. (2023). Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2023.780\">https://doi.org/10.1017/jfm.2023.780</a>","short":"E. Marensi, G. Yalniz, B. Hof, Journal of Fluid Mechanics 974 (2023)."},"volume":974,"related_material":{"record":[{"status":"public","id":"19684","relation":"dissertation_contains"}]},"article_number":"A21","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"day":"10","publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"language":[{"iso":"eng"}],"publication_status":"published","_id":"14466","date_updated":"2026-04-07T11:47:05Z","publication":"Journal of Fluid Mechanics","article_type":"original","month":"11","external_id":{"isi":["001088363700001"],"arxiv":["2212.12406"]},"keyword":["turbulence","transition to turbulence","patterns"],"quality_controlled":"1","oa":1,"file":[{"checksum":"17c64c1fb0d5f73252364bf98b0b9e1a","file_id":"14996","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_name":"2023_JourFluidMechanics_Marensi.pdf","creator":"dernst","file_size":2804641,"date_created":"2024-02-15T09:05:21Z","date_updated":"2024-02-15T09:05:21Z"}],"publisher":"Cambridge University Press","arxiv":1,"date_created":"2023-10-30T09:32:28Z","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2024-02-15T09:05:21Z","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_published":"2023-11-10T00:00:00Z","intvolume":"       974","corr_author":"1","status":"public","project":[{"name":"Revisiting the Turbulence Problem Using Statistical Mechanics","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","grant_number":"662960"}],"abstract":[{"lang":"eng","text":"The first long-lived turbulent structures observable in planar shear flows take the form of localized stripes, inclined with respect to the mean flow direction. The dynamics of these stripes is central to transition, and recent studies proposed an analogy to directed percolation where the stripes’ proliferation is ultimately responsible for the turbulence becoming sustained. In the present study we focus on the internal stripe dynamics as well as on the eventual stripe expansion, and we compare the underlying mechanisms in pressure- and shear-driven planar flows, respectively, plane-Poiseuille and plane-Couette flow. Despite the similarities of the overall laminar–turbulence patterns, the stripe proliferation processes in the two cases are fundamentally different. Starting from the growth and sustenance of individual stripes, we find that in plane-Couette flow new streaks are created stochastically throughout the stripe whereas in plane-Poiseuille flow streak creation is deterministic and occurs locally at the downstream tip. Because of the up/downstream symmetry, Couette stripes, in contrast to Poiseuille stripes, have two weak and two strong laminar turbulent interfaces. These differences in symmetry as well as in internal growth give rise to two fundamentally different stripe splitting mechanisms. In plane-Poiseuille flow splitting is connected to the elongational growth of the original stripe, and it results from a break-off/shedding of the stripe's tail. In plane-Couette flow splitting follows from a broadening of the original stripe and a division along the stripe into two slimmer stripes."}],"year":"2023"},{"related_material":{"record":[{"status":"public","id":"14610","relation":"used_in_publication"}]},"has_accepted_license":"1","corr_author":"1","day":"31","status":"public","department":[{"_id":"AnSa"}],"_id":"14472","abstract":[{"text":"Data related to the following paper:\r\n\"Stress granules plug and stabilize damaged endolysosomal membranes\" (https://doi.org/10.1038/s41586-023-06726-w)\r\n\r\nAbstract: \r\nEndomembrane damage represents a form of stress that is detrimental for eukaryotic cells. To cope with this threat, cells possess mechanisms that repair the damage and restore cellular homeostasis. Endomembrane damage also results in organelle instability and the mechanisms by which cells stabilize damaged endomembranes to enable membrane repair remains unknown. In this work we use a minimal coarse-grained molecular dynamics system to explore how lipid vesicles undergoing poration in a protein-rich medium can be plugged and stabilised by condensate formation. The solution of proteins in and out of the vesicle is described by beads dispersed in implicit solvent. The membrane is described as a one-bead-thick fluid elastic layer of mechanical properties that mimic biological membranes. We tune the interactions between solution beads in the different compartments to capture the differences between the cytoplasmic and endosomal protein solutions and explore how the system responds to different degrees of membrane poration. We find that, in the right interaction regime, condensates form rapidly at the damage site upon solution mixing and act as a plug that prevents futher mixing and destabilisation of the vesicle. Further, when the condensate can interact with the membrane (wetting interactions) we find that it mediates pore sealing and membrane repair. This research is part of the work published in \"Stress granules plug and stabilize damaged endolysosomal membranes\", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w.","lang":"eng"}],"date_updated":"2025-09-09T13:30:33Z","year":"2023","month":"10","author":[{"last_name":"Vanhille-Campos","full_name":"Vanhille-Campos, Christian Eduardo","first_name":"Christian Eduardo","id":"3adeca52-9313-11ed-b1ac-c170b2505714"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","full_name":"Šarić, Anđela","last_name":"Šarić","orcid":"0000-0002-7854-2139"}],"oa":1,"publisher":"Institute of Science and Technology Austria","file":[{"file_size":62821432,"date_created":"2023-10-30T16:31:08Z","date_updated":"2023-10-30T16:31:08Z","file_name":"SGporecondensation-main.zip","creator":"ipalaia","relation":"main_file","access_level":"open_access","success":1,"checksum":"a18706e952e8660c51ede52a167270b7","file_id":"14473","content_type":"application/zip"},{"success":1,"relation":"main_file","access_level":"open_access","content_type":"text/plain","file_id":"14474","checksum":"389eab31c6509dbc05795017fb618758","date_updated":"2023-10-31T08:57:50Z","date_created":"2023-10-31T08:57:50Z","file_size":1697,"file_name":"README.txt","creator":"dernst"}],"doi":"10.15479/AT:ISTA:14472","article_processing_charge":"No","file_date_updated":"2023-10-31T08:57:50Z","date_created":"2023-10-30T16:38:32Z","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"oa_version":"Published Version","type":"research_data","title":"Stress granules plug and stabilize damaged endolysosomal membranes","date_published":"2023-10-31T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Vanhille-Campos CE, Šarić A. 2023. Stress granules plug and stabilize damaged endolysosomal membranes, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14472\">10.15479/AT:ISTA:14472</a>.","mla":"Vanhille-Campos, Christian Eduardo, and Anđela Šarić. <i>Stress Granules Plug and Stabilize Damaged Endolysosomal Membranes</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14472\">10.15479/AT:ISTA:14472</a>.","ieee":"C. E. Vanhille-Campos and A. Šarić, “Stress granules plug and stabilize damaged endolysosomal membranes.” Institute of Science and Technology Austria, 2023.","short":"C.E. Vanhille-Campos, A. Šarić, (2023).","apa":"Vanhille-Campos, C. E., &#38; Šarić, A. (2023). Stress granules plug and stabilize damaged endolysosomal membranes. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14472\">https://doi.org/10.15479/AT:ISTA:14472</a>","ama":"Vanhille-Campos CE, Šarić A. Stress granules plug and stabilize damaged endolysosomal membranes. 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14472\">10.15479/AT:ISTA:14472</a>","chicago":"Vanhille-Campos, Christian Eduardo, and Anđela Šarić. “Stress Granules Plug and Stabilize Damaged Endolysosomal Membranes.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:14472\">https://doi.org/10.15479/AT:ISTA:14472</a>."},"ddc":["570"]},{"_id":"14484","publication_status":"published","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1530-8995"],"issn":["1081-0706"]},"day":"16","department":[{"_id":"AnKi"}],"has_accepted_license":"1","month":"10","article_type":"review","publication":"Annual Review of Cell and Developmental Biology","date_updated":"2025-12-30T10:57:08Z","doi":"10.1146/annurev-cellbio-020823-011522","acknowledgement":"We are grateful to Zena Hadjivasiliou for comments on this article. A.K. is supported by grants from the European Research Council under the European Union (EU) Horizon 2020 research and innovation program (680037) and Horizon Europe (101044579), and the Austrian Science Fund (F78) (Stem Cell Modulation). J.B. is supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (CC001051), the UK Medical Research Council (CC001051), and the Wellcome Trust (CC001051), and by a grant from the European Research Council under the EU Horizon 2020 research and innovation program (742138).","author":[{"last_name":"Kicheva","first_name":"Anna","full_name":"Kicheva, Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998"},{"last_name":"Briscoe","full_name":"Briscoe, James","first_name":"James"}],"volume":39,"citation":{"mla":"Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.” <i>Annual Review of Cell and Developmental Biology</i>, vol. 39, Annual Reviews, 2023, pp. 91–121, doi:<a href=\"https://doi.org/10.1146/annurev-cellbio-020823-011522\">10.1146/annurev-cellbio-020823-011522</a>.","ieee":"A. Kicheva and J. Briscoe, “Control of tissue development by morphogens,” <i>Annual Review of Cell and Developmental Biology</i>, vol. 39. Annual Reviews, pp. 91–121, 2023.","ista":"Kicheva A, Briscoe J. 2023. Control of tissue development by morphogens. Annual Review of Cell and Developmental Biology. 39, 91–121.","chicago":"Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.” <i>Annual Review of Cell and Developmental Biology</i>. Annual Reviews, 2023. <a href=\"https://doi.org/10.1146/annurev-cellbio-020823-011522\">https://doi.org/10.1146/annurev-cellbio-020823-011522</a>.","ama":"Kicheva A, Briscoe J. Control of tissue development by morphogens. <i>Annual Review of Cell and Developmental Biology</i>. 2023;39:91-121. doi:<a href=\"https://doi.org/10.1146/annurev-cellbio-020823-011522\">10.1146/annurev-cellbio-020823-011522</a>","apa":"Kicheva, A., &#38; Briscoe, J. (2023). Control of tissue development by morphogens. <i>Annual Review of Cell and Developmental Biology</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev-cellbio-020823-011522\">https://doi.org/10.1146/annurev-cellbio-020823-011522</a>","short":"A. Kicheva, J. Briscoe, Annual Review of Cell and Developmental Biology 39 (2023) 91–121."},"title":"Control of tissue development by morphogens","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"oa_version":"Published Version","type":"journal_article","project":[{"call_identifier":"H2020","grant_number":"680037","_id":"B6FC0238-B512-11E9-945C-1524E6697425","name":"Coordination of Patterning And Growth In the Spinal Cord"},{"grant_number":"101044579","_id":"bd7e737f-d553-11ed-ba76-d69ffb5ee3aa","name":"Mechanisms of tissue size regulation in spinal cord development"},{"name":"Stem Cell Modulation in Neural Development and Regeneration/ P02-Morphogen control of growth and pattern in the spinal cord","_id":"059DF620-7A3F-11EA-A408-12923DDC885E","grant_number":"F7802"}],"status":"public","page":"91-121","corr_author":"1","intvolume":"        39","year":"2023","abstract":[{"text":"Intercellular signaling molecules, known as morphogens, act at a long range in developing tissues to provide spatial information and control properties such as cell fate and tissue growth. The production, transport, and removal of morphogens shape their concentration profiles in time and space. Downstream signaling cascades and gene regulatory networks within cells then convert the spatiotemporal morphogen profiles into distinct cellular responses. Current challenges are to understand the diverse molecular and cellular mechanisms underlying morphogen gradient formation, as well as the logic of downstream regulatory circuits involved in morphogen interpretation. This knowledge, combining experimental and theoretical results, is essential to understand emerging properties of morphogen-controlled systems, such as robustness and scaling.","lang":"eng"}],"publisher":"Annual Reviews","file":[{"creator":"dernst","file_name":"2023_AnnualReviews_Kicheva.pdf","file_size":434819,"date_updated":"2023-11-06T09:47:50Z","date_created":"2023-11-06T09:47:50Z","checksum":"461726014cf5907010afbd418d3c13ec","content_type":"application/pdf","file_id":"14491","access_level":"open_access","relation":"main_file","success":1}],"oa":1,"quality_controlled":"1","external_id":{"isi":["001082823000006"],"pmid":["37418774"]},"date_published":"2023-10-16T00:00:00Z","ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","ddc":["570"],"pmid":1,"article_processing_charge":"Yes (in subscription journal)","file_date_updated":"2023-11-06T09:47:50Z","date_created":"2023-11-05T23:00:53Z"},{"author":[{"first_name":"Vitaly","full_name":"Aksenov, Vitaly","last_name":"Aksenov"},{"last_name":"Anoprenko","full_name":"Anoprenko, Michael","first_name":"Michael"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","last_name":"Fedorov","full_name":"Fedorov, Alexander","first_name":"Alexander"},{"first_name":"Michael","full_name":"Spear, Michael","last_name":"Spear"}],"doi":"10.4230/LIPIcs.DISC.2023.35","alternative_title":["LIPIcs"],"type":"conference","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","citation":{"ieee":"V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement: BatchBoost: Universal batching for concurrent data structures,” in <i>37th International Symposium on Distributed Computing</i>, L’Aquila, Italy, 2023, vol. 281.","mla":"Aksenov, Vitaly, et al. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” <i>37th International Symposium on Distributed Computing</i>, vol. 281, 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2023.35\">10.4230/LIPIcs.DISC.2023.35</a>.","ista":"Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost: Universal batching for concurrent data structures. 37th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 281, 35.","chicago":"Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” In <i>37th International Symposium on Distributed Computing</i>, Vol. 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2023.35\">https://doi.org/10.4230/LIPIcs.DISC.2023.35</a>.","ama":"Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost: Universal batching for concurrent data structures. In: <i>37th International Symposium on Distributed Computing</i>. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2023.35\">10.4230/LIPIcs.DISC.2023.35</a>","apa":"Aksenov, V., Anoprenko, M., Fedorov, A., &#38; Spear, M. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In <i>37th International Symposium on Distributed Computing</i> (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2023.35\">https://doi.org/10.4230/LIPIcs.DISC.2023.35</a>","short":"V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"volume":281,"title":"Brief announcement: BatchBoost: Universal batching for concurrent data structures","has_accepted_license":"1","article_number":"35","conference":{"end_date":"2023-10-13","start_date":"2023-10-09","location":"L'Aquila, Italy","name":"DISC: Symposium on Distributed Computing"},"publication_status":"published","_id":"14485","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773010"]},"department":[{"_id":"GradSch"}],"day":"01","publication":"37th International Symposium on Distributed Computing","date_updated":"2024-10-09T21:07:14Z","month":"10","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"access_level":"open_access","relation":"main_file","success":1,"checksum":"d9f8d2915cccdf2df5905b7cd1b4a560","content_type":"application/pdf","file_id":"14492","file_size":646665,"date_updated":"2023-11-06T11:45:21Z","date_created":"2023-11-06T11:45:21Z","creator":"dernst","file_name":"2023_LIPIcs_Aksenov.pdf"}],"oa":1,"quality_controlled":"1","file_date_updated":"2023-11-06T11:45:21Z","article_processing_charge":"Yes","date_created":"2023-11-05T23:00:53Z","date_published":"2023-10-01T00:00:00Z","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"corr_author":"1","intvolume":"       281","status":"public","abstract":[{"lang":"eng","text":"Batching is a technique that stores multiple keys/values in each node of a data structure. In sequential search data structures, batching reduces latency by reducing the number of cache misses and shortening the chain of pointers to dereference. Applying batching to concurrent data structures is challenging, because it is difficult to maintain the search property and keep contention low in the presence of batching.\r\nIn this paper, we present a general methodology for leveraging batching in concurrent search data structures, called BatchBoost. BatchBoost builds a search data structure from distinct \"data\" and \"index\" layers. The data layer’s purpose is to store a batch of key/value pairs in each of its nodes. The index layer uses an unmodified concurrent search data structure to route operations to a position in the data layer that is \"close\" to where the corresponding key should exist. The requirements on the index and data layers are low: with minimal effort, we were able to compose three highly scalable concurrent search data structures based on three original data structures as the index layers with a batched version of the Lazy List as the data layer. The resulting BatchBoost data structures provide significant performance improvements over their original counterparts."}],"year":"2023"},{"title":"Rotor lattice model of ferroelectric large polarons","volume":5,"citation":{"short":"G. Koutentakis, A. Ghazaryan, M. Lemeshko, Physical Review Research 5 (2023).","apa":"Koutentakis, G., Ghazaryan, A., &#38; Lemeshko, M. (2023). Rotor lattice model of ferroelectric large polarons. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevResearch.5.043016\">https://doi.org/10.1103/PhysRevResearch.5.043016</a>","ama":"Koutentakis G, Ghazaryan A, Lemeshko M. Rotor lattice model of ferroelectric large polarons. <i>Physical Review Research</i>. 2023;5(4). doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.5.043016\">10.1103/PhysRevResearch.5.043016</a>","chicago":"Koutentakis, Georgios, Areg Ghazaryan, and Mikhail Lemeshko. “Rotor Lattice Model of Ferroelectric Large Polarons.” <i>Physical Review Research</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevResearch.5.043016\">https://doi.org/10.1103/PhysRevResearch.5.043016</a>.","ista":"Koutentakis G, Ghazaryan A, Lemeshko M. 2023. Rotor lattice model of ferroelectric large polarons. Physical Review Research. 5(4), 043016.","mla":"Koutentakis, Georgios, et al. “Rotor Lattice Model of Ferroelectric Large Polarons.” <i>Physical Review Research</i>, vol. 5, no. 4, 043016, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.5.043016\">10.1103/PhysRevResearch.5.043016</a>.","ieee":"G. Koutentakis, A. Ghazaryan, and M. Lemeshko, “Rotor lattice model of ferroelectric large polarons,” <i>Physical Review Research</i>, vol. 5, no. 4. American Physical Society, 2023."},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"journal_article","oa_version":"Published Version","acknowledgement":"We thank Zh. Alpichshev, A. Volosniev, and A. V. Zampetaki for fruitful discussions and comments. This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","doi":"10.1103/PhysRevResearch.5.043016","author":[{"id":"d7b23d3a-9e21-11ec-b482-f76739596b95","last_name":"Koutentakis","first_name":"Georgios","full_name":"Koutentakis, Georgios"},{"orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","first_name":"Areg","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","orcid":"0000-0002-6990-7802"}],"article_type":"original","month":"10","date_updated":"2025-04-14T07:48:54Z","publication":"Physical Review Research","publication_identifier":{"issn":["2643-1564"]},"day":"05","department":[{"_id":"MiLe"}],"publication_status":"published","_id":"14486","language":[{"iso":"eng"}],"article_number":"043016","has_accepted_license":"1","date_published":"2023-10-05T00:00:00Z","scopus_import":"1","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"article_processing_charge":"Yes","file_date_updated":"2023-11-07T07:52:46Z","date_created":"2023-11-05T23:00:53Z","oa":1,"quality_controlled":"1","external_id":{"arxiv":["2301.09875"]},"arxiv":1,"publisher":"American Physical Society","file":[{"date_updated":"2023-11-07T07:52:46Z","date_created":"2023-11-07T07:52:46Z","file_size":1127522,"creator":"dernst","file_name":"2023_PhysReviewResearch_Koutentakis.pdf","success":1,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"14493","checksum":"cb8de8fed6e09df1a18bd5a5aec5c55c"}],"year":"2023","issue":"4","abstract":[{"lang":"eng","text":"We present a minimal model of ferroelectric large polarons, which are suggested as one of the mechanisms responsible for the unique charge transport properties of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions lead to long-range ferroelectric ordering of rotors, which strongly affects the carrier mobility. In the nonperturbative regime, where our theory cannot be reduced to any of the earlier models, we reveal that the polaron is characterized by large coherence length and a roughly tenfold increase of the effective mass as compared to the bare mass. These results are in good agreement with other theoretical predictions for ferroelectric polarons. Our model establishes a general phenomenological framework for ferroelectric polarons providing the starting point for future studies of their role in the transport properties of hybrid organic-inorganic perovskites."}],"status":"public","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"},{"grant_number":"801770","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle"}],"intvolume":"         5","corr_author":"1"},{"quality_controlled":"1","oa":1,"external_id":{"isi":["001091989600005"]},"publisher":"Wiley","file":[{"success":1,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"14495","checksum":"7ba9c87228dc09029b16bc800a0ef1a1","date_created":"2023-11-07T08:10:44Z","date_updated":"2023-11-07T08:10:44Z","file_size":5554901,"file_name":"2023_WaterResourcesResearch_Buri.pdf","creator":"dernst"}],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2023-10-25T00:00:00Z","ddc":["550"],"article_processing_charge":"Yes (via OA deal)","file_date_updated":"2023-11-07T08:10:44Z","date_created":"2023-11-05T23:00:53Z","status":"public","intvolume":"        59","year":"2023","issue":"10","abstract":[{"text":"High Mountain Asia (HMA) is among the most vulnerable water towers globally and yet future projections of water availability in and from its high-mountain catchments remain uncertain, as their hydrologic response to ongoing environmental changes is complex. Mechanistic modeling approaches incorporating cryospheric, hydrological, and vegetation processes in high spatial, temporal, and physical detail have never been applied for high-elevation catchments of HMA. We use a land surface model at high spatial and temporal resolution (100 m and hourly) to simulate the coupled dynamics of energy, water, and vegetation for the 350 km2 Langtang catchment (Nepal). We compare our model outputs for one hydrological year against a large set of observations to gain insight into the partitioning of the water balance at the subseasonal scale and across elevation bands. During the simulated hydrological year, we find that evapotranspiration is a key component of the total water balance, as it causes about the equivalent of 20% of all the available precipitation or 154% of the water production from glacier melt in the basin to return directly to the atmosphere. The depletion of the cryospheric water budget is dominated by snow melt, but at high elevations is primarily dictated by snow and ice sublimation. Snow sublimation is the dominant vapor flux (49%) at the catchment scale, accounting for the equivalent of 11% of snowfall, 17% of snowmelt, and 75% of ice melt, respectively. We conclude that simulations should consider sublimation and other evaporative fluxes explicitly, as otherwise water balance estimates can be ill-quantified.","lang":"eng"}],"acknowledgement":"This project has received funding from the JSPS-SNSF (Japan Society for the Promotion of Science and Swiss National Science Foundation) Bilateral Programmes project (HOPE, High-ele-vation precipitation in High Mountain Asia; Grant 183633), and the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers in High Mountain Asia; Grant 772751). We want to thank in particular T. Gurung, S. Joshi, J. Shea, W. Immerzeel, and others involved, as well as ICIMOD, for their efforts over the past years in observing the meteorology of the Langtang catchment, collecting and organizing the data and making them publicly available. We also thank the National Geographic Society (Grant NGS-61784R-19) and the Mount Everest Foundation (reference 19-24) for providing fieldwork funding for C. L. Fyffe. We thank T. Kramer for help with the WSL Hyperion cluster. We are grate-ful for comments by three anonymous reviewers and the Associate Editor, who greatly helped to improve the manuscript further. Open access funding provided by ETH-Bereich Forschungsanstalten.","doi":"10.1029/2022WR033841","author":[{"last_name":"Buri","first_name":"Pascal","full_name":"Buri, Pascal"},{"first_name":"Simone","full_name":"Fatichi, Simone","last_name":"Fatichi"},{"id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","full_name":"Shaw, Thomas","first_name":"Thomas","last_name":"Shaw","orcid":"0000-0001-7640-6152"},{"full_name":"Miles, Evan S.","first_name":"Evan S.","last_name":"Miles"},{"full_name":"Mccarthy, Michael","first_name":"Michael","last_name":"Mccarthy","id":"22a2674a-61ce-11ee-94b5-d18813baf16f"},{"id":"001b0422-8d15-11ed-bc51-cab6c037a228","full_name":"Fyffe, Catriona Louise","first_name":"Catriona Louise","last_name":"Fyffe"},{"last_name":"Fugger","full_name":"Fugger, Stefan","first_name":"Stefan"},{"full_name":"Ren, Shaoting","first_name":"Shaoting","last_name":"Ren"},{"first_name":"Marin","full_name":"Kneib, Marin","last_name":"Kneib"},{"last_name":"Jouberton","full_name":"Jouberton, Achille","first_name":"Achille"},{"last_name":"Steiner","first_name":"Jakob","full_name":"Steiner, Jakob"},{"last_name":"Fujita","first_name":"Koji","full_name":"Fujita, Koji"},{"orcid":"0000-0002-5554-8087","full_name":"Pellicciotti, Francesca","first_name":"Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"title":"Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment","volume":59,"citation":{"ieee":"P. Buri <i>et al.</i>, “Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment,” <i>Water Resources Research</i>, vol. 59, no. 10. Wiley, 2023.","mla":"Buri, Pascal, et al. “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” <i>Water Resources Research</i>, vol. 59, no. 10, e2022WR033841, Wiley, 2023, doi:<a href=\"https://doi.org/10.1029/2022WR033841\">10.1029/2022WR033841</a>.","ista":"Buri P, Fatichi S, Shaw T, Miles ES, McCarthy M, Fyffe CL, Fugger S, Ren S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. Water Resources Research. 59(10), e2022WR033841.","chicago":"Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan S. Miles, Michael McCarthy, Catriona Louise Fyffe, Stefan Fugger, et al. “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” <i>Water Resources Research</i>. Wiley, 2023. <a href=\"https://doi.org/10.1029/2022WR033841\">https://doi.org/10.1029/2022WR033841</a>.","ama":"Buri P, Fatichi S, Shaw T, et al. Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. <i>Water Resources Research</i>. 2023;59(10). doi:<a href=\"https://doi.org/10.1029/2022WR033841\">10.1029/2022WR033841</a>","apa":"Buri, P., Fatichi, S., Shaw, T., Miles, E. S., McCarthy, M., Fyffe, C. L., … Pellicciotti, F. (2023). Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment. <i>Water Resources Research</i>. Wiley. <a href=\"https://doi.org/10.1029/2022WR033841\">https://doi.org/10.1029/2022WR033841</a>","short":"P. Buri, S. Fatichi, T. Shaw, E.S. Miles, M. McCarthy, C.L. Fyffe, S. Fugger, S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, Water Resources Research 59 (2023)."},"oa_version":"Published Version","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"isi":1,"type":"journal_article","publication_identifier":{"eissn":["1944-7973"],"issn":["0043-1397"]},"department":[{"_id":"FrPe"}],"day":"25","_id":"14487","publication_status":"published","language":[{"iso":"eng"}],"article_number":"e2022WR033841","related_material":{"record":[{"status":"public","id":"14494","relation":"research_data"}]},"has_accepted_license":"1","article_type":"original","month":"10","date_updated":"2025-09-09T13:15:40Z","publication":"Water Resources Research"},{"_id":"14489","publication_status":"published","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1863-8899"],"issn":["1863-8880"]},"department":[{"_id":"JoFi"}],"day":"01","article_number":"2200866","month":"12","article_type":"original","publication":"Laser and Photonics Reviews","date_updated":"2025-09-09T13:13:18Z","doi":"10.1002/lpor.202200866","acknowledgement":"This work was supported by the National Key Research and Development Program of China (Grant no. 2022YFA1405200), the National Natural Science Foundation of China (Nos. 92265202), and the European Research Council (ERC CoG Q-ECHOS, 101001005).","author":[{"last_name":"Fan","full_name":"Fan, Zhi Yuan","first_name":"Zhi Yuan"},{"full_name":"Qiu, Liu","first_name":"Liu","last_name":"Qiu","id":"45e99c0d-1eb1-11eb-9b96-ed8ab2983cac","orcid":"0000-0003-4345-4267"},{"last_name":"Gröblacher","first_name":"Simon","full_name":"Gröblacher, Simon"},{"last_name":"Li","first_name":"Jie","full_name":"Li, Jie"}],"citation":{"ista":"Fan ZY, Qiu L, Gröblacher S, Li J. 2023. Microwave-optics entanglement via cavity optomagnomechanics. Laser and Photonics Reviews. 17(12), 2200866.","mla":"Fan, Zhi Yuan, et al. “Microwave-Optics Entanglement via Cavity Optomagnomechanics.” <i>Laser and Photonics Reviews</i>, vol. 17, no. 12, 2200866, Wiley, 2023, doi:<a href=\"https://doi.org/10.1002/lpor.202200866\">10.1002/lpor.202200866</a>.","ieee":"Z. Y. Fan, L. Qiu, S. Gröblacher, and J. Li, “Microwave-optics entanglement via cavity optomagnomechanics,” <i>Laser and Photonics Reviews</i>, vol. 17, no. 12. Wiley, 2023.","apa":"Fan, Z. Y., Qiu, L., Gröblacher, S., &#38; Li, J. (2023). Microwave-optics entanglement via cavity optomagnomechanics. <i>Laser and Photonics Reviews</i>. Wiley. <a href=\"https://doi.org/10.1002/lpor.202200866\">https://doi.org/10.1002/lpor.202200866</a>","chicago":"Fan, Zhi Yuan, Liu Qiu, Simon Gröblacher, and Jie Li. “Microwave-Optics Entanglement via Cavity Optomagnomechanics.” <i>Laser and Photonics Reviews</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/lpor.202200866\">https://doi.org/10.1002/lpor.202200866</a>.","ama":"Fan ZY, Qiu L, Gröblacher S, Li J. Microwave-optics entanglement via cavity optomagnomechanics. <i>Laser and Photonics Reviews</i>. 2023;17(12). doi:<a href=\"https://doi.org/10.1002/lpor.202200866\">10.1002/lpor.202200866</a>","short":"Z.Y. Fan, L. Qiu, S. Gröblacher, J. Li, Laser and Photonics Reviews 17 (2023)."},"volume":17,"title":"Microwave-optics entanglement via cavity optomagnomechanics","isi":1,"oa_version":"Preprint","type":"journal_article","status":"public","intvolume":"        17","year":"2023","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2208.10703"}],"issue":"12","abstract":[{"text":"Microwave-optics entanglement is a vital component for building hybrid quantum networks. Here, a new mechanism for preparing stationary entanglement between microwave and optical cavity fields in a cavity optomagnomechanical system is proposed. It consists of a magnon mode in a ferrimagnetic crystal that couples directly to a microwave cavity mode via the magnetic dipole interaction and indirectly to an optical cavity through the deformation displacement of the crystal. The mechanical displacement is induced by the magnetostrictive force and coupled to the optical cavity via radiation pressure. Both the opto- and magnomechanical couplings are dispersive. Magnon–phonon entanglement is created via magnomechanical parametric down-conversion, which is further distributed to optical and microwave photons via simultaneous optomechanical beamsplitter interaction and electromagnonic state-swap interaction, yielding stationary microwave-optics entanglement. The microwave-optics entanglement is robust against thermal noise, which will find broad potential applications in quantum networks and quantum information processing with hybrid quantum systems.","lang":"eng"}],"publisher":"Wiley","arxiv":1,"oa":1,"quality_controlled":"1","external_id":{"arxiv":["2208.10703"],"isi":["001088860000001"]},"date_published":"2023-12-01T00:00:00Z","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","date_created":"2023-11-05T23:00:54Z"},{"status":"public","intvolume":"      2023","page":"603-613","year":"2023","abstract":[{"text":"Payment channel networks (PCNs) are a promising solution to the scalability problem of cryptocurrencies. Any two users connected by a payment channel in the network can theoretically send an unbounded number of instant, costless transactions between them. Users who are not directly connected can also transact with each other in a multi-hop fashion. In this work, we study the incentive structure behind the creation of payment channel networks, particularly from the point of view of a single user that wants to join the network. We define a utility function for a new user in terms of expected revenue, expected fees, and the cost of creating channels, and then provide constant factor approximation algorithms that optimise the utility function given a certain budget. Additionally, we take a step back from a single user to the whole network and examine the parameter spaces under which simple graph topologies form a Nash equilibrium.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2306.16006"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["2306.16006"],"isi":["001081242600053"]},"publisher":"IEEE","arxiv":1,"scopus_import":"1","date_published":"2023-10-11T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","date_created":"2023-11-05T23:00:54Z","publication_identifier":{"isbn":["9798350339864"],"eissn":["2575-8411"]},"department":[{"_id":"KrPi"}],"day":"11","_id":"14490","publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14506"}]},"conference":{"start_date":"2023-07-18","location":"Hong Kong, China","end_date":"2023-07-21","name":"ICDCS: International Conference on Distributed Computing Systems"},"month":"10","date_updated":"2026-04-07T13:29:44Z","publication":"43rd International Conference on Distributed Computing Systems","acknowledgement":"The work was partially supported by the Austrian Science Fund (FWF) through the project CoRaF (grant 2020388). It was also partially supported by NCN Grant 2019/35/B/ST6/04138 and ERC Grant 885666.","doi":"10.1109/ICDCS57875.2023.00037","author":[{"full_name":"Avarikioti, Zeta","first_name":"Zeta","last_name":"Avarikioti"},{"last_name":"Lizurej","full_name":"Lizurej, Tomasz","first_name":"Tomasz"},{"last_name":"Michalak","first_name":"Tomasz","full_name":"Michalak, Tomasz"},{"first_name":"Michelle X","full_name":"Yeo, Michelle X","last_name":"Yeo","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809"}],"title":"Lightning creation games","volume":2023,"citation":{"apa":"Avarikioti, Z., Lizurej, T., Michalak, T., &#38; Yeo, M. X. (2023). Lightning creation games. In <i>43rd International Conference on Distributed Computing Systems</i> (Vol. 2023, pp. 603–613). Hong Kong, China: IEEE. <a href=\"https://doi.org/10.1109/ICDCS57875.2023.00037\">https://doi.org/10.1109/ICDCS57875.2023.00037</a>","ama":"Avarikioti Z, Lizurej T, Michalak T, Yeo MX. Lightning creation games. In: <i>43rd International Conference on Distributed Computing Systems</i>. Vol 2023. IEEE; 2023:603-613. doi:<a href=\"https://doi.org/10.1109/ICDCS57875.2023.00037\">10.1109/ICDCS57875.2023.00037</a>","chicago":"Avarikioti, Zeta, Tomasz Lizurej, Tomasz Michalak, and Michelle X Yeo. “Lightning Creation Games.” In <i>43rd International Conference on Distributed Computing Systems</i>, 2023:603–13. IEEE, 2023. <a href=\"https://doi.org/10.1109/ICDCS57875.2023.00037\">https://doi.org/10.1109/ICDCS57875.2023.00037</a>.","short":"Z. Avarikioti, T. Lizurej, T. Michalak, M.X. Yeo, in:, 43rd International Conference on Distributed Computing Systems, IEEE, 2023, pp. 603–613.","ista":"Avarikioti Z, Lizurej T, Michalak T, Yeo MX. 2023. Lightning creation games. 43rd International Conference on Distributed Computing Systems. ICDCS: International Conference on Distributed Computing Systems vol. 2023, 603–613.","mla":"Avarikioti, Zeta, et al. “Lightning Creation Games.” <i>43rd International Conference on Distributed Computing Systems</i>, vol. 2023, IEEE, 2023, pp. 603–13, doi:<a href=\"https://doi.org/10.1109/ICDCS57875.2023.00037\">10.1109/ICDCS57875.2023.00037</a>.","ieee":"Z. Avarikioti, T. Lizurej, T. Michalak, and M. X. Yeo, “Lightning creation games,” in <i>43rd International Conference on Distributed Computing Systems</i>, Hong Kong, China, 2023, vol. 2023, pp. 603–613."},"oa_version":"Preprint","isi":1,"type":"conference"},{"has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"14487","relation":"used_in_publication"}]},"_id":"14494","day":"03","department":[{"_id":"FrPe"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://10.5281/ZENODO.8402426"}],"abstract":[{"text":"We provide i) gridded initial conditions (.tif), ii) modeled gridded monthly outputs (.tif), and iii) modeled hourly outputs at the station locations (.txt) for the hydrological year 2019. Information about the variables and units can be found in the figures (.png) associated to each dataset. Details about the datasets can be found in the original publication by Buri and others (2023).\r\n\r\nBuri, P., Fatichi, S., Shaw, T. E., Miles, E. S., McCarthy, M. J., Fyffe, C. L., ... & Pellicciotti, F. (2023). Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High‐Elevation Catchment. Water Resources Research, 59(10), e2022WR033841. DOI: 10.1029/2022WR033841","lang":"eng"}],"date_updated":"2025-09-09T13:15:39Z","month":"10","year":"2023","author":[{"last_name":"Buri","full_name":"Buri, Pascal","first_name":"Pascal"},{"first_name":"Simone","full_name":"Fatichi, Simone","last_name":"Fatichi"},{"orcid":"0000-0001-7640-6152","last_name":"Shaw","full_name":"Shaw, Thomas","first_name":"Thomas","id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e"},{"full_name":"Miles, Evan ","first_name":"Evan ","last_name":"Miles"},{"id":"22a2674a-61ce-11ee-94b5-d18813baf16f","first_name":"Michael","full_name":"McCarthy, Michael","last_name":"McCarthy"},{"first_name":"Catriona Louise","full_name":"Fyffe, Catriona Louise","last_name":"Fyffe","id":"001b0422-8d15-11ed-bc51-cab6c037a228"},{"full_name":"Fugger, Stefan","first_name":"Stefan","last_name":"Fugger"},{"first_name":"Shaoting","full_name":"Ren, Shaoting","last_name":"Ren"},{"full_name":"Kneib, Marin","first_name":"Marin","last_name":"Kneib"},{"full_name":"Jouberton, Achille","first_name":"Achille","last_name":"Jouberton"},{"first_name":"Jakob","full_name":"Steiner, Jakob","last_name":"Steiner"},{"last_name":"Fujita","first_name":"Koji","full_name":"Fujita, Koji"},{"last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","orcid":"0000-0002-5554-8087"}],"publisher":"Zenodo","doi":"10.5281/ZENODO.8402426","oa":1,"type":"research_data_reference","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"oa_version":"Published Version","article_processing_charge":"No","date_created":"2023-11-07T08:01:39Z","date_published":"2023-10-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Buri P, Fatichi S, Shaw T, et al. Model output data to “Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.” 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8402426\">10.5281/ZENODO.8402426</a>","chicago":"Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan  Miles, Michael McCarthy, Catriona Louise Fyffe, Stefan Fugger, et al. “Model Output Data to ‘Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High Elevation Catchment.’” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8402426\">https://doi.org/10.5281/ZENODO.8402426</a>.","apa":"Buri, P., Fatichi, S., Shaw, T., Miles, E., McCarthy, M., Fyffe, C. L., … Pellicciotti, F. (2023). Model output data to “Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.” Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8402426\">https://doi.org/10.5281/ZENODO.8402426</a>","short":"P. Buri, S. Fatichi, T. Shaw, E. Miles, M. McCarthy, C.L. Fyffe, S. Fugger, S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, (2023).","ieee":"P. Buri <i>et al.</i>, “Model output data to ‘Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment.’” Zenodo, 2023.","mla":"Buri, Pascal, et al. <i>Model Output Data to “Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High Elevation Catchment.”</i> Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8402426\">10.5281/ZENODO.8402426</a>.","ista":"Buri P, Fatichi S, Shaw T, Miles E, McCarthy M, Fyffe CL, Fugger S, Ren S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Model output data to ‘Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment’, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8402426\">10.5281/ZENODO.8402426</a>."},"ddc":["550"],"title":"Model output data to \"Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment\""},{"status":"public","project":[{"name":"Randomness and structure in combinatorics","_id":"bd95085b-d553-11ed-ba76-e55d3349be45","grant_number":"101076777"}],"intvolume":"        11","corr_author":"1","year":"2023","abstract":[{"text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.\r\n\r\nThe proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes.","lang":"eng"}],"external_id":{"arxiv":["2208.02874"],"isi":["001123866200001"]},"keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Analysis"],"oa":1,"quality_controlled":"1","file":[{"access_level":"open_access","relation":"main_file","success":1,"checksum":"54b824098d59073cc87a308d458b0a3e","file_id":"14500","content_type":"application/pdf","file_size":1218719,"date_updated":"2023-11-07T09:16:23Z","date_created":"2023-11-07T09:16:23Z","file_name":"2023_ForumMathematics_Kwan.pdf","creator":"dernst"}],"arxiv":1,"publisher":"Cambridge University Press","ddc":["510"],"scopus_import":"1","date_published":"2023-08-24T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2023-11-07T09:02:48Z","article_processing_charge":"Yes","file_date_updated":"2023-11-07T09:16:23Z","department":[{"_id":"MaKw"}],"day":"24","publication_identifier":{"issn":["2050-5086"]},"language":[{"iso":"eng"}],"_id":"14499","publication_status":"published","article_number":"e21","has_accepted_license":"1","article_type":"original","month":"08","date_updated":"2025-09-09T13:16:15Z","publication":"Forum of Mathematics, Pi","acknowledgement":"Kwan was supported for part of this work by ERC Starting Grant ‘RANDSTRUCT’ No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-2141064. Sah was supported by the PD Soros Fellowship. Sauermann was supported by NSF Award DMS-2100157, and for part of this work by a Sloan Research Fellowship.","doi":"10.1017/fmp.2023.17","author":[{"full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567"},{"first_name":"Ashwin","full_name":"Sah, Ashwin","last_name":"Sah"},{"last_name":"Sauermann","first_name":"Lisa","full_name":"Sauermann, Lisa"},{"last_name":"Sawhney","first_name":"Mehtaab","full_name":"Sawhney, Mehtaab"}],"title":"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture","citation":{"ista":"Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11, e21.","mla":"Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” <i>Forum of Mathematics, Pi</i>, vol. 11, e21, Cambridge University Press, 2023, doi:<a href=\"https://doi.org/10.1017/fmp.2023.17\">10.1017/fmp.2023.17</a>.","ieee":"M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” <i>Forum of Mathematics, Pi</i>, vol. 11. Cambridge University Press, 2023.","apa":"Kwan, M. A., Sah, A., Sauermann, L., &#38; Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics, Pi</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fmp.2023.17\">https://doi.org/10.1017/fmp.2023.17</a>","chicago":"Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” <i>Forum of Mathematics, Pi</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/fmp.2023.17\">https://doi.org/10.1017/fmp.2023.17</a>.","ama":"Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics, Pi</i>. 2023;11. doi:<a href=\"https://doi.org/10.1017/fmp.2023.17\">10.1017/fmp.2023.17</a>","short":"M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (2023)."},"volume":11,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","type":"journal_article","isi":1},{"ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2023-11-10T00:00:00Z","ddc":["000"],"file_date_updated":"2023-11-23T10:30:08Z","article_processing_charge":"No","date_created":"2023-11-10T08:10:43Z","publisher":"Institute of Science and Technology Austria","file":[{"content_type":"application/x-zip-compressed","file_id":"14598","checksum":"521c72818d720a52b377207b2ee87b6a","access_level":"closed","relation":"source_file","file_name":"thesis_yeo.zip","creator":"cchlebak","date_updated":"2023-11-23T10:29:55Z","date_created":"2023-11-23T10:29:55Z","file_size":3037720},{"file_name":"thesis_yeo.pdf","creator":"cchlebak","file_size":2717256,"date_updated":"2023-11-23T10:30:08Z","date_created":"2023-11-23T10:30:08Z","checksum":"0ed5d16899687aecf13d843c9878c9f2","content_type":"application/pdf","file_id":"14599","access_level":"open_access","relation":"main_file","success":1}],"oa":1,"year":"2023","degree_awarded":"PhD","abstract":[{"text":"Payment channel networks are a promising approach to improve the scalability bottleneck\r\nof cryptocurrencies. Two design principles behind payment channel networks are\r\nefficiency and privacy. Payment channel networks improve efficiency by allowing users\r\nto transact in a peer-to-peer fashion along multi-hop routes in the network, avoiding\r\nthe lengthy process of consensus on the blockchain. Transacting over payment channel\r\nnetworks also improves privacy as these transactions are not broadcast to the blockchain.\r\nDespite the influx of recent protocols built on top of payment channel networks and\r\ntheir analysis, a common shortcoming of many of these protocols is that they typically\r\nfocus only on either improving efficiency or privacy, but not both. Another limitation\r\non the efficiency front is that the models used to model actions, costs and utilities of\r\nusers are limited or come with unrealistic assumptions.\r\nThis thesis aims to address some of the shortcomings of recent protocols and algorithms\r\non payment channel networks, particularly in their privacy and efficiency aspects. We\r\nfirst present a payment route discovery protocol based on hub labelling and private\r\ninformation retrieval that hides the route query and is also efficient. We then present\r\na rebalancing protocol that formulates the rebalancing problem as a linear program\r\nand solves the linear program using multiparty computation so as to hide the channel\r\nbalances. The rebalancing solution as output by our protocol is also globally optimal.\r\nWe go on to develop more realistic models of the action space, costs, and utilities of\r\nboth existing and new users that want to join the network. In each of these settings,\r\nwe also develop algorithms to optimise the utility of these users with good guarantees\r\non the approximation and competitive ratios.","lang":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"supervisor":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"status":"public","corr_author":"1","page":"162","citation":{"ieee":"M. X. Yeo, “Advances in efficiency and privacy in payment channel network analysis,” Institute of Science and Technology Austria, 2023.","mla":"Yeo, Michelle X. <i>Advances in Efficiency and Privacy in Payment Channel Network Analysis</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/14506\">10.15479/14506</a>.","ista":"Yeo MX. 2023. Advances in efficiency and privacy in payment channel network analysis. Institute of Science and Technology Austria.","ama":"Yeo MX. Advances in efficiency and privacy in payment channel network analysis. 2023. doi:<a href=\"https://doi.org/10.15479/14506\">10.15479/14506</a>","chicago":"Yeo, Michelle X. “Advances in Efficiency and Privacy in Payment Channel Network Analysis.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/14506\">https://doi.org/10.15479/14506</a>.","apa":"Yeo, M. X. (2023). <i>Advances in efficiency and privacy in payment channel network analysis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/14506\">https://doi.org/10.15479/14506</a>","short":"M.X. Yeo, Advances in Efficiency and Privacy in Payment Channel Network Analysis, Institute of Science and Technology Austria, 2023."},"title":"Advances in efficiency and privacy in payment channel network analysis","oa_version":"Published Version","type":"dissertation","doi":"10.15479/14506","alternative_title":["ISTA Thesis"],"OA_place":"publisher","author":[{"id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","first_name":"Michelle X","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809"}],"month":"11","date_updated":"2026-04-07T13:29:45Z","_id":"14506","publication_status":"published","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"day":"10","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"has_accepted_license":"1","related_material":{"record":[{"status":"deleted","id":"13238","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9969"},{"id":"14490","status":"public","relation":"part_of_dissertation"}]}},{"type":"journal_article","isi":1,"oa_version":"Preprint","volume":1042,"citation":{"ista":"Mistakidis SI, Volosniev A, Barfknecht RE, Fogarty T, Busch T, Foerster A, Schmelcher P, Zinner NT. 2023. Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. Physics Reports. 1042, 1–108.","ieee":"S. I. Mistakidis <i>et al.</i>, “Few-body Bose gases in low dimensions - A laboratory for quantum dynamics,” <i>Physics Reports</i>, vol. 1042. Elsevier, pp. 1–108, 2023.","mla":"Mistakidis, S. I., et al. “Few-Body Bose Gases in Low Dimensions - A Laboratory for Quantum Dynamics.” <i>Physics Reports</i>, vol. 1042, Elsevier, 2023, pp. 1–108, doi:<a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">10.1016/j.physrep.2023.10.004</a>.","apa":"Mistakidis, S. I., Volosniev, A., Barfknecht, R. E., Fogarty, T., Busch, T., Foerster, A., … Zinner, N. T. (2023). Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. <i>Physics Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">https://doi.org/10.1016/j.physrep.2023.10.004</a>","ama":"Mistakidis SI, Volosniev A, Barfknecht RE, et al. Few-body Bose gases in low dimensions - A laboratory for quantum dynamics. <i>Physics Reports</i>. 2023;1042:1-108. doi:<a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">10.1016/j.physrep.2023.10.004</a>","chicago":"Mistakidis, S. I., Artem Volosniev, R. E. Barfknecht, T. Fogarty, Th Busch, A. Foerster, P. Schmelcher, and N. T. Zinner. “Few-Body Bose Gases in Low Dimensions - A Laboratory for Quantum Dynamics.” <i>Physics Reports</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.physrep.2023.10.004\">https://doi.org/10.1016/j.physrep.2023.10.004</a>.","short":"S.I. Mistakidis, A. Volosniev, R.E. Barfknecht, T. Fogarty, T. Busch, A. Foerster, P. Schmelcher, N.T. Zinner, Physics Reports 1042 (2023) 1–108."},"title":"Few-body Bose gases in low dimensions - A laboratory for quantum dynamics","author":[{"first_name":"S. I.","full_name":"Mistakidis, S. I.","last_name":"Mistakidis"},{"last_name":"Volosniev","first_name":"Artem","full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525"},{"last_name":"Barfknecht","full_name":"Barfknecht, R. E.","first_name":"R. E."},{"last_name":"Fogarty","first_name":"T.","full_name":"Fogarty, T."},{"last_name":"Busch","full_name":"Busch, Th","first_name":"Th"},{"full_name":"Foerster, A.","first_name":"A.","last_name":"Foerster"},{"last_name":"Schmelcher","full_name":"Schmelcher, P.","first_name":"P."},{"last_name":"Zinner","first_name":"N. T.","full_name":"Zinner, N. T."}],"doi":"10.1016/j.physrep.2023.10.004","acknowledgement":"This review could not have been written without the many fruitful discussions and great collaborations with colleagues throughout the years, there are too many to mention. Here we acknowledge conversations regarding the context of the review with Joachim Brand, Fabian Brauneis, Adolfo del Campo, Alberto Cappellaro, Panagiotis Giannakeas, Tommaso Macrí, Oleksandr Marchukov, Lukas Rammelmüller and Manuel Valiente. S. I. M. acknowledges support from the NSF through a grant for ITAMP at Harvard University. T.F. acknowledges support from JSPS KAKENHI Grant Number JP23K03290 and T.F. and Th.B. acknowledge support from the Okinawa Institute for Science and Technology Graduate University, and JST Grant Number JPMJPF2221. A.F. and R. E. B. acknowledge support from CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico) - Edital Universal 406563/2021-7. A. G. V. acknowledges support by European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. P. S. is supported by the Cluster of Excellence ‘Advanced Imaging of Matter’ of the Deutsche Forschungsgemeinschaft (DFG) - EXC2056 - project ID 390715994. N. T. Z. is partially supported by the Independent Research Fund Denmark .","publication":"Physics Reports","date_updated":"2025-09-09T13:16:58Z","month":"11","article_type":"original","language":[{"iso":"eng"}],"_id":"14513","publication_status":"published","department":[{"_id":"MiLe"}],"day":"29","publication_identifier":{"issn":["0370-1573"]},"date_created":"2023-11-12T23:00:54Z","article_processing_charge":"No","date_published":"2023-11-29T00:00:00Z","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"arxiv":1,"publisher":"Elsevier","external_id":{"arxiv":["2202.11071"],"isi":["001109871200001"]},"oa":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2202.11071"}],"abstract":[{"text":"Cold atomic gases have become a paradigmatic system for exploring fundamental physics, which at the same time allows for applications in quantum technologies. The accelerating developments in the field have led to a highly advanced set of engineering techniques that, for example, can tune interactions, shape the external geometry, select among a large set of atomic species with different properties, or control the number of atoms. In particular, it is possible to operate in lower dimensions and drive atomic systems into the strongly correlated regime. In this review, we discuss recent advances in few-body cold atom systems confined in low dimensions from a theoretical viewpoint. We mainly focus on bosonic systems in one dimension and provide an introduction to the static properties before we review the state-of-the-art research into quantum dynamical processes stimulated by the presence of correlations. Besides discussing the fundamental physical phenomena arising in these systems, we also provide an overview of the calculational and numerical tools and methods that are commonly used, thus delivering a balanced and comprehensive overview of the field. We conclude by giving an outlook on possible future directions that are interesting to explore in these correlated systems.","lang":"eng"}],"year":"2023","page":"1-108","intvolume":"      1042","project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"status":"public"},{"article_number":"168201","related_material":{"record":[{"id":"14523","status":"public","relation":"research_data"}]},"has_accepted_license":"1","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"department":[{"_id":"ScWa"}],"day":"20","_id":"14514","publication_status":"published","language":[{"iso":"eng"}],"date_updated":"2025-09-09T13:19:07Z","publication":"Physical Review Letters","article_type":"original","month":"10","author":[{"last_name":"Binysh","first_name":"Jack","full_name":"Binysh, Jack"},{"full_name":"Chakraborty, Indrajit","first_name":"Indrajit","last_name":"Chakraborty"},{"full_name":"Chubynsky, Mykyta V.","first_name":"Mykyta V.","last_name":"Chubynsky"},{"id":"b6798902-eea0-11ea-9cbc-a8e14286c631","first_name":"Vicente L","full_name":"Diaz Melian, Vicente L","last_name":"Diaz Melian"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","first_name":"Scott R","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176"},{"last_name":"Sprittles","full_name":"Sprittles, James E.","first_name":"James E."},{"full_name":"Souslov, Anton","first_name":"Anton","last_name":"Souslov"}],"acknowledgement":"We are grateful to Dominic Vella, Jens Eggers, John Kolinski, Joshua Dijksman, and Daniel Bonn for insightful discussions. J. B. and A. S. acknowledge the support of the Engineering and Physical Sciences Research Council (EPSRC) through New Investigator Award No. EP/\r\nT000961/1. A. S. acknowledges the support of Royal Society under Grant No. RGS/R2/202135. J. E. S. acknowledges EPSRC Grants No. EP/N016602/1, EP/S022848/1, EP/S029966/1, and EP/P031684/1.","doi":"10.1103/PhysRevLett.131.168201","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","type":"journal_article","isi":1,"title":"Modeling Leidenfrost levitation of soft elastic solids","volume":131,"citation":{"mla":"Binysh, Jack, et al. “Modeling Leidenfrost Levitation of Soft Elastic Solids.” <i>Physical Review Letters</i>, vol. 131, no. 16, 168201, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.131.168201\">10.1103/PhysRevLett.131.168201</a>.","ieee":"J. Binysh <i>et al.</i>, “Modeling Leidenfrost levitation of soft elastic solids,” <i>Physical Review Letters</i>, vol. 131, no. 16. American Physical Society, 2023.","ista":"Binysh J, Chakraborty I, Chubynsky MV, Diaz Melian VL, Waitukaitis SR, Sprittles JE, Souslov A. 2023. Modeling Leidenfrost levitation of soft elastic solids. Physical Review Letters. 131(16), 168201.","short":"J. Binysh, I. Chakraborty, M.V. Chubynsky, V.L. Diaz Melian, S.R. Waitukaitis, J.E. Sprittles, A. Souslov, Physical Review Letters 131 (2023).","ama":"Binysh J, Chakraborty I, Chubynsky MV, et al. Modeling Leidenfrost levitation of soft elastic solids. <i>Physical Review Letters</i>. 2023;131(16). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.131.168201\">10.1103/PhysRevLett.131.168201</a>","chicago":"Binysh, Jack, Indrajit Chakraborty, Mykyta V. Chubynsky, Vicente L Diaz Melian, Scott R Waitukaitis, James E. Sprittles, and Anton Souslov. “Modeling Leidenfrost Levitation of Soft Elastic Solids.” <i>Physical Review Letters</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevLett.131.168201\">https://doi.org/10.1103/PhysRevLett.131.168201</a>.","apa":"Binysh, J., Chakraborty, I., Chubynsky, M. V., Diaz Melian, V. L., Waitukaitis, S. R., Sprittles, J. E., &#38; Souslov, A. (2023). Modeling Leidenfrost levitation of soft elastic solids. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.131.168201\">https://doi.org/10.1103/PhysRevLett.131.168201</a>"},"intvolume":"       131","status":"public","issue":"16","abstract":[{"lang":"eng","text":"The elastic Leidenfrost effect occurs when a vaporizable soft solid is lowered onto a hot surface. Evaporative flow couples to elastic deformation, giving spontaneous bouncing or steady-state floating. The effect embodies an unexplored interplay between thermodynamics, elasticity, and lubrication: despite being observed, its basic theoretical description remains a challenge. Here, we provide a theory of elastic Leidenfrost floating. As weight increases, a rigid solid sits closer to the hot surface. By contrast, we discover an elasticity-dominated regime where the heavier the solid, the higher it floats. This geometry-governed behavior is reminiscent of the dynamics of large liquid Leidenfrost drops. We show that this elastic regime is characterized by Hertzian behavior of the solid’s underbelly and derive how the float height scales with materials parameters. Introducing a dimensionless elastic Leidenfrost number, we capture the crossover between rigid and Hertzian behavior. Our results provide theoretical underpinning for recent experiments, and point to the design of novel soft machines."}],"year":"2023","oa":1,"quality_controlled":"1","external_id":{"isi":["001164388300007"],"pmid":["37925690"]},"publisher":"American Physical Society","file":[{"access_level":"open_access","relation":"main_file","success":1,"checksum":"1a419e25b762aadffbcc8eb2e609bd97","file_id":"14524","content_type":"application/pdf","file_size":724098,"date_updated":"2023-11-13T09:12:58Z","date_created":"2023-11-13T09:12:58Z","creator":"dernst","file_name":"2023_PhysRevLetters_Binysh.pdf"}],"article_processing_charge":"Yes (in subscription journal)","file_date_updated":"2023-11-13T09:12:58Z","date_created":"2023-11-12T23:00:55Z","date_published":"2023-10-20T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","ddc":["530"],"pmid":1},{"author":[{"last_name":"Reinhardt","full_name":"Reinhardt, Manuel","first_name":"Manuel"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","full_name":"Tkačik, Gašper","first_name":"Gašper"},{"full_name":"Ten Wolde, Pieter Rein","first_name":"Pieter Rein","last_name":"Ten Wolde"}],"doi":"10.1103/PhysRevX.13.041017","acknowledgement":"We thank Bela Mulder, Tom Shimizu, Fotios Avgidis, Peter Bolhuis, and Daan Frenkel for useful discussions and a careful reading of the manuscript, and we thank Age Tjalma for support with obtaining the Gaussian approximation of the chemotaxis system. This work is part of the Dutch Research Council (NWO) and was performed at the research institute AMOLF. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 885065) and was\r\nfinancially supported by NWO through the “Building a Synthetic Cell (BaSyC)” Gravitation Grant (024.003.019).","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"oa_version":"Published Version","type":"journal_article","volume":13,"citation":{"short":"M. Reinhardt, G. Tkačik, P.R. Ten Wolde, Physical Review X 13 (2023).","ama":"Reinhardt M, Tkačik G, Ten Wolde PR. Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. <i>Physical Review X</i>. 2023;13(4). doi:<a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">10.1103/PhysRevX.13.041017</a>","chicago":"Reinhardt, Manuel, Gašper Tkačik, and Pieter Rein Ten Wolde. “Path Weight Sampling: Exact Monte Carlo Computation of the Mutual Information between Stochastic Trajectories.” <i>Physical Review X</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">https://doi.org/10.1103/PhysRevX.13.041017</a>.","apa":"Reinhardt, M., Tkačik, G., &#38; Ten Wolde, P. R. (2023). Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">https://doi.org/10.1103/PhysRevX.13.041017</a>","mla":"Reinhardt, Manuel, et al. “Path Weight Sampling: Exact Monte Carlo Computation of the Mutual Information between Stochastic Trajectories.” <i>Physical Review X</i>, vol. 13, no. 4, 041017, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevX.13.041017\">10.1103/PhysRevX.13.041017</a>.","ieee":"M. Reinhardt, G. Tkačik, and P. R. Ten Wolde, “Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories,” <i>Physical Review X</i>, vol. 13, no. 4. American Physical Society, 2023.","ista":"Reinhardt M, Tkačik G, Ten Wolde PR. 2023. Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories. Physical Review X. 13(4), 041017."},"title":"Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories","has_accepted_license":"1","article_number":"041017","language":[{"iso":"eng"}],"publication_status":"published","_id":"14515","department":[{"_id":"GaTk"}],"day":"26","publication_identifier":{"eissn":["2160-3308"]},"publication":"Physical Review X","date_updated":"2025-09-09T13:18:24Z","month":"10","article_type":"original","file":[{"access_level":"open_access","relation":"main_file","success":1,"checksum":"32574aeebcca7347a4152c611b66b3d5","content_type":"application/pdf","file_id":"14522","file_size":1595223,"date_updated":"2023-11-13T09:00:19Z","date_created":"2023-11-13T09:00:19Z","creator":"dernst","file_name":"2023_PhysReviewX_Reinhardt.pdf"}],"publisher":"American Physical Society","arxiv":1,"external_id":{"arxiv":["2203.03461"],"isi":["001122894200001"]},"oa":1,"quality_controlled":"1","date_created":"2023-11-12T23:00:55Z","file_date_updated":"2023-11-13T09:00:19Z","article_processing_charge":"Yes","ddc":["530"],"date_published":"2023-10-26T00:00:00Z","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        13","status":"public","abstract":[{"text":"Most natural and engineered information-processing systems transmit information via signals that vary in time. Computing the information transmission rate or the information encoded in the temporal characteristics of these signals requires the mutual information between the input and output signals as a function of time, i.e., between the input and output trajectories. Yet, this is notoriously difficult because of the high-dimensional nature of the trajectory space, and all existing techniques require approximations. We present an exact Monte Carlo technique called path weight sampling (PWS) that, for the first time, makes it possible to compute the mutual information between input and output trajectories for any stochastic system that is described by a master equation. The principal idea is to use the master equation to evaluate the exact conditional probability of an individual output trajectory for a given input trajectory and average this via Monte Carlo sampling in trajectory space to obtain the mutual information. We present three variants of PWS, which all generate the trajectories using the standard stochastic simulation algorithm. While direct PWS is a brute-force method, Rosenbluth-Rosenbluth PWS exploits the analogy between signal trajectory sampling and polymer sampling, and thermodynamic integration PWS is based on a reversible work calculation in trajectory space. PWS also makes it possible to compute the mutual information between input and output trajectories for systems with hidden internal states as well as systems with feedback from output to input. Applying PWS to the bacterial chemotaxis system, consisting of 182 coupled chemical reactions, demonstrates not only that the scheme is highly efficient but also that the number of receptor clusters is much smaller than hitherto believed, while their size is much larger.","lang":"eng"}],"issue":"4","year":"2023"},{"month":"10","date_updated":"2024-10-09T21:07:17Z","publication":"5th Conference on Advances in Financial Technologies","department":[{"_id":"ElKo"}],"day":"01","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773034"]},"language":[{"iso":"eng"}],"_id":"14516","publication_status":"published","conference":{"name":"AFT: Conference on Advances in Financial Technologies","start_date":"2023-10-23","location":"Princeton, NJ, United States","end_date":"2023-10-25"},"article_number":"7","has_accepted_license":"1","title":"STROBE: Streaming Threshold Random Beacons","volume":282,"citation":{"ista":"Beaver D, Kelkar M, Lewi K, Nikolaenko V, Sonnino A, Chalkias K, Kokoris Kogias E, Naurois LD, Roy A. 2023. STROBE: Streaming Threshold Random Beacons. 5th Conference on Advances in Financial Technologies. AFT: Conference on Advances in Financial Technologies, LIPIcs, vol. 282, 7.","ieee":"D. Beaver <i>et al.</i>, “STROBE: Streaming Threshold Random Beacons,” in <i>5th Conference on Advances in Financial Technologies</i>, Princeton, NJ, United States, 2023, vol. 282.","mla":"Beaver, Donald, et al. “STROBE: Streaming Threshold Random Beacons.” <i>5th Conference on Advances in Financial Technologies</i>, vol. 282, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">10.4230/LIPIcs.AFT.2023.7</a>.","apa":"Beaver, D., Kelkar, M., Lewi, K., Nikolaenko, V., Sonnino, A., Chalkias, K., … Roy, A. (2023). STROBE: Streaming Threshold Random Beacons. In <i>5th Conference on Advances in Financial Technologies</i> (Vol. 282). Princeton, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">https://doi.org/10.4230/LIPIcs.AFT.2023.7</a>","ama":"Beaver D, Kelkar M, Lewi K, et al. STROBE: Streaming Threshold Random Beacons. In: <i>5th Conference on Advances in Financial Technologies</i>. Vol 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">10.4230/LIPIcs.AFT.2023.7</a>","chicago":"Beaver, Donald, Mahimna Kelkar, Kevin Lewi, Valeria Nikolaenko, Alberto Sonnino, Konstantinos Chalkias, Eleftherios Kokoris Kogias, Ladi De Naurois, and Arnab Roy. “STROBE: Streaming Threshold Random Beacons.” In <i>5th Conference on Advances in Financial Technologies</i>, Vol. 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.AFT.2023.7\">https://doi.org/10.4230/LIPIcs.AFT.2023.7</a>.","short":"D. Beaver, M. Kelkar, K. Lewi, V. Nikolaenko, A. Sonnino, K. Chalkias, E. Kokoris Kogias, L.D. Naurois, A. Roy, in:, 5th Conference on Advances in Financial Technologies, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"type":"conference","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","acknowledgement":"Work done when all the authors were at Novi Research, Meta.","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.AFT.2023.7","author":[{"full_name":"Beaver, Donald","first_name":"Donald","last_name":"Beaver"},{"last_name":"Kelkar","first_name":"Mahimna","full_name":"Kelkar, Mahimna"},{"last_name":"Lewi","first_name":"Kevin","full_name":"Lewi, Kevin"},{"last_name":"Nikolaenko","first_name":"Valeria","full_name":"Nikolaenko, Valeria"},{"first_name":"Alberto","full_name":"Sonnino, Alberto","last_name":"Sonnino"},{"full_name":"Chalkias, Konstantinos","first_name":"Konstantinos","last_name":"Chalkias"},{"first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Naurois","first_name":"Ladi De","full_name":"Naurois, Ladi De"},{"full_name":"Roy, Arnab","first_name":"Arnab","last_name":"Roy"}],"year":"2023","abstract":[{"text":"We revisit decentralized random beacons with a focus on practical distributed applications. Decentralized random beacons (Beaver and So, Eurocrypt'93) provide the functionality for n parties to generate an unpredictable sequence of bits in a way that cannot be biased, which is useful for any decentralized protocol requiring trusted randomness. Existing beacon constructions are highly inefficient in practical settings where protocol parties need to rejoin after crashes or disconnections, and more significantly where smart contracts may rely on arbitrary index points in high-volume streams. For this, we introduce a new notion of history-generating decentralized random beacons (HGDRBs). Roughly, the history-generation property of HGDRBs allows for previous beacon outputs to be efficiently generated knowing only the current value and the public key. At application layers, history-generation supports registering a sparser set of on-chain values if desired, so that apps like lotteries can utilize on-chain values without incurring high-frequency costs, enjoying all the benefits of DRBs implemented off-chain or with decoupled, special-purpose chains. Unlike rollups, HG is tailored specifically to recovering and verifying pseudorandom bit sequences and thus enjoys unique optimizations investigated in this work. We introduce STROBE: an efficient HGDRB construction which generalizes the original squaring-based RSA approach of Beaver and So. STROBE enjoys several useful properties that make it suited for practical applications that use beacons: 1) history-generating: it can regenerate and verify high-throughput beacon streams, supporting sparse (thus cost-effective) ledger entries; 2) concisely self-verifying: NIZK-free, with state and validation employing a single ring element; 3) eco-friendly: stake-based rather than work based; 4) unbounded: refresh-free, addressing limitations of Beaver and So; 5) delay-free: results are immediately available. 6) storage-efficient: the last beacon suffices to derive all past outputs, thus O(1) storage requirements for nodes serving the whole history.","lang":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2021/1643","open_access":"1"}],"status":"public","intvolume":"       282","corr_author":"1","ddc":["000"],"date_published":"2023-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_created":"2023-11-12T23:00:55Z","article_processing_charge":"Yes","file_date_updated":"2023-11-13T08:44:34Z","oa":1,"quality_controlled":"1","file":[{"file_size":793495,"date_created":"2023-11-13T08:44:34Z","date_updated":"2023-11-13T08:44:34Z","creator":"dernst","file_name":"2023_LIPIcs_Beaver.pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"c1f98831cb5149d6c030c41999e6e960","content_type":"application/pdf","file_id":"14521"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"publisher":"American Physical Society","arxiv":1,"external_id":{"arxiv":["2206.14104"],"isi":["001095315600001"]},"oa":1,"quality_controlled":"1","date_created":"2023-11-12T23:00:55Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"scopus_import":"1","date_published":"2023-10-20T00:00:00Z","corr_author":"1","intvolume":"        20","project":[{"_id":"26336814-B435-11E9-9278-68D0E5697425","name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","grant_number":"758053"},{"_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2","name":"Protected states of quantum matter"},{"grant_number":"707438","call_identifier":"H2020","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics","_id":"258047B6-B435-11E9-9278-68D0E5697425"},{"name":"Open Superconducting Quantum Computers (OpenSuperQPlus)","_id":"bdb7cfc1-d553-11ed-ba76-d2eaab167738","grant_number":"101080139"},{"grant_number":"F07105","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2206.14104"}],"abstract":[{"lang":"eng","text":"State-of-the-art transmon qubits rely on large capacitors, which systematically improve their coherence due to reduced surface-loss participation. However, this approach increases both the footprint and the parasitic cross-coupling and is ultimately limited by radiation losses—a potential roadblock for scaling up quantum processors to millions of qubits. In this work we present transmon qubits with sizes as low as 36 × 39 µm2 with  100-nm-wide vacuum-gap capacitors that are micromachined from commercial silicon-on-insulator wafers and shadow evaporated with aluminum. We achieve a vacuum participation ratio up to 99.6% in an in-plane design that is compatible with standard coplanar circuits. Qubit relaxationtime measurements for small gaps with high zero-point electric field variance of up to 22 V/m reveal a double exponential decay indicating comparably strong qubit interaction with long-lived two-level systems. The exceptionally high selectivity of up to 20 dB to the superconductor-vacuum interface allows us to precisely back out the sub-single-photon dielectric loss tangent of aluminum oxide previously exposed to ambient conditions. In terms of future scaling potential, we achieve a ratio of qubit quality factor to a footprint area equal to 20 µm−2, which is comparable with the highest T1 devices relying on larger geometries, a value that could improve substantially for lower surface-loss superconductors. "}],"issue":"4","year":"2023","author":[{"orcid":"0009-0005-0878-3032","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Zemlicka, Martin","last_name":"Zemlicka"},{"id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","full_name":"Redchenko, Elena","last_name":"Redchenko"},{"orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo","first_name":"Matilda","full_name":"Peruzzo, Matilda"},{"orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","full_name":"Hassani, Farid","first_name":"Farid","last_name":"Hassani"},{"id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","first_name":"Andrea","last_name":"Trioni"},{"orcid":"0000-0003-0415-1423","last_name":"Barzanjeh","first_name":"Shabir","full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","full_name":"Fink, Johannes M","first_name":"Johannes M","orcid":"0000-0001-8112-028X"}],"doi":"10.1103/PhysRevApplied.20.044054","acknowledgement":"This work was supported by the Austrian Science Fund (FWF) through BeyondC (F7105), the European Research Council under Grant Agreement No. 758053 (ERC StG QUNNECT) and a NOMIS foundation research grant. M.Z. was the recipient of a SAIA scholarship, E.R. of\r\na DOC fellowship of the Austrian Academy of Sciences, and M.P. of a Pöttinger scholarship at IST Austria. S.B. acknowledges support from Marie Skłodowska Curie Program No. 707438 (MSC-IF SUPEREOM). J.M.F. acknowledges support from the Horizon Europe Program HORIZON-CL4-2022-QUANTUM-01-SGA via Project No. 101113946 OpenSuperQPlus100 and the ISTA Nanofabrication Facility.","oa_version":"Preprint","type":"journal_article","isi":1,"citation":{"ista":"Zemlicka M, Redchenko E, Peruzzo M, Hassani F, Trioni A, Barzanjeh S, Fink JM. 2023. Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. Physical Review Applied. 20(4), 044054.","ieee":"M. Zemlicka <i>et al.</i>, “Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses,” <i>Physical Review Applied</i>, vol. 20, no. 4. American Physical Society, 2023.","mla":"Zemlicka, Martin, et al. “Compact Vacuum-Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” <i>Physical Review Applied</i>, vol. 20, no. 4, 044054, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">10.1103/PhysRevApplied.20.044054</a>.","short":"M. Zemlicka, E. Redchenko, M. Peruzzo, F. Hassani, A. Trioni, S. Barzanjeh, J.M. Fink, Physical Review Applied 20 (2023).","apa":"Zemlicka, M., Redchenko, E., Peruzzo, M., Hassani, F., Trioni, A., Barzanjeh, S., &#38; Fink, J. M. (2023). Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">https://doi.org/10.1103/PhysRevApplied.20.044054</a>","chicago":"Zemlicka, Martin, Elena Redchenko, Matilda Peruzzo, Farid Hassani, Andrea Trioni, Shabir Barzanjeh, and Johannes M Fink. “Compact Vacuum-Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” <i>Physical Review Applied</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">https://doi.org/10.1103/PhysRevApplied.20.044054</a>.","ama":"Zemlicka M, Redchenko E, Peruzzo M, et al. Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses. <i>Physical Review Applied</i>. 2023;20(4). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.20.044054\">10.1103/PhysRevApplied.20.044054</a>"},"volume":20,"title":"Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses","related_material":{"record":[{"relation":"research_data","id":"14520","status":"public"}]},"article_number":"044054","language":[{"iso":"eng"}],"_id":"14517","publication_status":"published","day":"20","department":[{"_id":"JoFi"}],"publication_identifier":{"eissn":["2331-7019"]},"publication":"Physical Review Applied","date_updated":"2026-06-03T07:16:02Z","acknowledged_ssus":[{"_id":"NanoFab"}],"month":"10","article_type":"original"}]