[{"publisher":"Association for Computing Machinery","abstract":[{"text":"Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate.","lang":"eng"}],"oa":1,"date_updated":"2022-03-18T08:45:46Z","main_file_link":[{"url":"https://arxiv.org/abs/2105.08098","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"title":"A scalable concurrent algorithm for dynamic connectivity","publication":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","date_created":"2022-03-18T08:21:47Z","citation":{"apa":"Fedorov, A., Koval, N., &#38; Alistarh, D.-A. (2021). A scalable concurrent algorithm for dynamic connectivity. In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 208–220). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>","ieee":"A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Virtual, Online, 2021, pp. 208–220.","ama":"Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic connectivity. In: <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:208-220. doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>","ista":"Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 208–220.","mla":"Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 208–20, doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>.","short":"A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220.","chicago":"Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 208–20. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>."},"year":"2021","date_published":"2021-07-01T00:00:00Z","status":"public","publication_status":"published","language":[{"iso":"eng"}],"external_id":{"arxiv":["2105.08098"]},"quality_controlled":"1","author":[{"last_name":"Fedorov","first_name":"Alexander","full_name":"Fedorov, Alexander"},{"full_name":"Koval, Nikita","first_name":"Nikita","last_name":"Koval"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"}],"article_processing_charge":"No","department":[{"_id":"DaAl"}],"page":"208-220","scopus_import":"1","type":"conference","month":"07","oa_version":"Preprint","conference":{"end_date":"2021-07-08","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","location":"Virtual, Online","start_date":"2021-07-06"},"_id":"10853","doi":"10.1145/3409964.3461810","day":"01","publication_identifier":{"isbn":["9781450380706"]}},{"citation":{"short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, 71–72. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i> (pp. 71–72). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>. Association for Computing Machinery; 2021:71-72. doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Virtual, Online, 2021, pp. 71–72.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Association for Computing Machinery, 2021, pp. 71–72, doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>."},"status":"public","publication_status":"published","date_published":"2021-05-01T00:00:00Z","year":"2021","external_id":{"arxiv":["2005.07637"]},"language":[{"iso":"eng"}],"quality_controlled":"1","author":[{"first_name":"Klaus-Tycho","full_name":"Foerster, Klaus-Tycho","last_name":"Foerster"},{"last_name":"Korhonen","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne"},{"last_name":"Paz","first_name":"Ami","full_name":"Paz, Ami"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","first_name":"Joel","last_name":"Rybicki"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"publisher":"Association for Computing Machinery","ec_funded":1,"abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?\r\nTo address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.\r\nOur work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task."}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07637"}],"date_updated":"2025-04-14T13:52:09Z","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"extended_version","id":"10855","status":"public"}]},"publication":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","title":"Input-dynamic distributed algorithms for communication networks","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to improve the paper. 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 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","date_created":"2022-03-18T08:48:41Z","conference":{"start_date":"2021-06-14","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems","end_date":"2021-06-18","location":"Virtual, Online"},"project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"},{"name":"Coordination in constrained and natural distributed systems","grant_number":"840605","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"_id":"10854","day":"01","doi":"10.1145/3410220.3453923","publication_identifier":{"isbn":["9781450380720"]},"article_processing_charge":"No","page":"71-72","department":[{"_id":"DaAl"}],"scopus_import":"1","month":"05","type":"conference","oa_version":"Preprint"},{"_id":"10855","project":[{"call_identifier":"H2020","grant_number":"840605","name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425"},{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"volume":5,"doi":"10.1145/3447384","day":"01","publication_identifier":{"issn":["2476-1249"]},"article_type":"original","article_processing_charge":"No","department":[{"_id":"DaAl"}],"page":"1-33","scopus_import":"1","type":"journal_article","month":"03","oa_version":"Preprint","citation":{"ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>."},"date_published":"2021-03-01T00:00:00Z","year":"2021","status":"public","publication_status":"published","external_id":{"arxiv":["2005.07637"]},"language":[{"iso":"eng"}],"quality_controlled":"1","author":[{"last_name":"Foerster","full_name":"Foerster, Klaus-Tycho","first_name":"Klaus-Tycho"},{"first_name":"Janne","full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"first_name":"Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","last_name":"Rybicki"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"intvolume":"         5","issue":"1","publisher":"Association for Computing Machinery","ec_funded":1,"abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques."}],"oa":1,"date_updated":"2025-04-14T13:52:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"title":"Input-dynamic distributed algorithms for communication networks","related_material":{"record":[{"id":"10854","relation":"shorter_version","status":"public"}]},"publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"date_created":"2022-03-18T09:10:27Z","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N."},{"has_accepted_license":"1","issue":"1","intvolume":"         9","author":[{"last_name":"Ivanov","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","full_name":"Ivanov, Grigory"},{"last_name":"Tsiutsiurupa","first_name":"Igor","full_name":"Tsiutsiurupa, Igor"}],"quality_controlled":"1","external_id":{"isi":["000734286800001"],"arxiv":["2004.02674"]},"language":[{"iso":"eng"}],"status":"public","publication_status":"published","date_published":"2021-01-29T00:00:00Z","year":"2021","file_date_updated":"2022-03-18T09:31:59Z","citation":{"apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021.","ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. 2021;9(1):1-18. doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>","ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>.","short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter, 2021. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>."},"acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","date_created":"2022-03-18T09:25:14Z","publication":"Analysis and Geometry in Metric Spaces","keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"title":"On the volume of sections of the cube","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","arxiv":1,"date_updated":"2023-08-17T07:07:58Z","oa":1,"file":[{"creator":"dernst","file_size":789801,"file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","content_type":"application/pdf","relation":"main_file","checksum":"7e615ac8489f5eae580b6517debfdc53","access_level":"open_access","date_updated":"2022-03-18T09:31:59Z","file_id":"10857","date_created":"2022-03-18T09:31:59Z","success":1}],"abstract":[{"text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2.","lang":"eng"}],"publisher":"De Gruyter","article_type":"original","publication_identifier":{"issn":["2299-3274"]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"29","doi":"10.1515/agms-2020-0103","volume":9,"_id":"10856","oa_version":"Published Version","month":"01","type":"journal_article","ddc":["510"],"isi":1,"scopus_import":"1","page":"1-18","department":[{"_id":"UlWa"}],"article_processing_charge":"No"},{"scopus_import":"1","isi":1,"ddc":["540"],"department":[{"_id":"MaIb"}],"article_processing_charge":"No","oa_version":"Published Version","type":"journal_article","month":"07","publication_identifier":{"issn":["2079-4991"]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"doi":"10.3390/nano11071827","day":"14","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"_id":"10858","volume":11,"article_type":"original","article_number":"1827","oa":1,"abstract":[{"text":"The cost-effective conversion of low-grade heat into electricity using thermoelectric devices requires developing alternative materials and material processing technologies able to reduce the currently high device manufacturing costs. In this direction, thermoelectric materials that do not rely on rare or toxic elements such as tellurium or lead need to be produced using high-throughput technologies not involving high temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative to Bi2Te3 for ambient temperature thermoelectric applications, but its performance is still low for practical applications, and additional efforts toward finding proper dopants are required. Here, we report a scalable method to produce Bi2Se3 nanosheets at low synthesis temperatures. We studied the influence of different dopants on the thermoelectric properties of this material. Among the elements tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a reduction in the thermal conductivity in the direction of the hot-press axis, resulting in an overall 60% improvement in the thermoelectric figure of merit of Bi2Se3.","lang":"eng"}],"file":[{"date_updated":"2022-03-18T09:53:15Z","access_level":"open_access","file_id":"10859","date_created":"2022-03-18T09:53:15Z","success":1,"creator":"dernst","file_size":4867547,"file_name":"2021_Nanomaterials_Li.pdf","relation":"main_file","content_type":"application/pdf","checksum":"f28a8b5cf80f5605828359bb398463b0"}],"ec_funded":1,"publisher":"MDPI","date_created":"2022-03-18T09:45:02Z","acknowledgement":"M.L., Y.Z., T.Z. and K.X. thank the China Scholarship Council for their scholarship\r\nsupport. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and\r\ninnovation program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. thanks the ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and G.C. 2017 SGR 128. ICN2 acknowledges funding from the Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3.","title":"Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping","keyword":["General Materials Science","General Chemical Engineering"],"publication":"Nanomaterials","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"date_updated":"2025-06-12T06:42:18Z","quality_controlled":"1","external_id":{"pmid":["34361214"],"isi":["000676570000001"]},"language":[{"iso":"eng"}],"year":"2021","date_published":"2021-07-14T00:00:00Z","publication_status":"published","status":"public","citation":{"short":"M. Li, Y. Zhang, T. Zhang, Y. Zuo, K. Xiao, J. Arbiol, J. Llorca, Y. Liu, A. Cabot, Nanomaterials 11 (2021).","chicago":"Li, Mengyao, Yu Zhang, Ting Zhang, Yong Zuo, Ke Xiao, Jordi Arbiol, Jordi Llorca, Yu Liu, and Andreu Cabot. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>.","ama":"Li M, Zhang Y, Zhang T, et al. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. 2021;11(7). doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>","ieee":"M. Li <i>et al.</i>, “Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping,” <i>Nanomaterials</i>, vol. 11, no. 7. MDPI, 2021.","apa":"Li, M., Zhang, Y., Zhang, T., Zuo, Y., Xiao, K., Arbiol, J., … Cabot, A. (2021). Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. MDPI. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>","ista":"Li M, Zhang Y, Zhang T, Zuo Y, Xiao K, Arbiol J, Llorca J, Liu Y, Cabot A. 2021. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. Nanomaterials. 11(7), 1827.","mla":"Li, Mengyao, et al. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>, vol. 11, no. 7, 1827, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>."},"corr_author":"1","file_date_updated":"2022-03-18T09:53:15Z","has_accepted_license":"1","intvolume":"        11","issue":"7","author":[{"last_name":"Li","first_name":"Mengyao","full_name":"Li, Mengyao"},{"last_name":"Zhang","full_name":"Zhang, Yu","first_name":"Yu"},{"full_name":"Zhang, Ting","first_name":"Ting","last_name":"Zhang"},{"full_name":"Zuo, Yong","first_name":"Yong","last_name":"Zuo"},{"full_name":"Xiao, Ke","first_name":"Ke","last_name":"Xiao"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"last_name":"Llorca","full_name":"Llorca, Jordi","first_name":"Jordi"},{"full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","first_name":"Yu","last_name":"Liu"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}]},{"oa_version":"Preprint","type":"journal_article","month":"12","scopus_import":"1","isi":1,"department":[{"_id":"UlWa"}],"page":"942-963","article_processing_charge":"No","article_type":"original","publication_identifier":{"eissn":["1496-4287"],"issn":["0008-4395"]},"doi":"10.4153/s000843952000096x","day":"18","_id":"10860","volume":64,"date_created":"2022-03-18T09:55:59Z","acknowledgement":"The author was supported by the Swiss National Science Foundation grant 200021_179133. The author acknowledges the financial support from the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no. 075-15-2019-1926.","title":"Tight frames and related geometric problems","keyword":["General Mathematics","Tight frame","Grassmannian","zonotope"],"publication":"Canadian Mathematical Bulletin","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10055"}],"arxiv":1,"date_updated":"2024-10-09T21:01:50Z","oa":1,"abstract":[{"lang":"eng","text":"A tight frame is the orthogonal projection of some orthonormal basis of Rn onto Rk. We show that a set of vectors is a tight frame if and only if the set of all cross products of these vectors is a tight frame. We reformulate a range of problems on the volume of projections (or sections) of regular polytopes in terms of tight frames and write a first-order necessary condition for local extrema of these problems. As applications, we prove new results for the problem of maximization of the volume of zonotopes."}],"publisher":"Canadian Mathematical Society","intvolume":"        64","issue":"4","author":[{"first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","full_name":"Ivanov, Grigory","last_name":"Ivanov"}],"quality_controlled":"1","external_id":{"isi":["000730165300021"],"arxiv":["1804.10055"]},"language":[{"iso":"eng"}],"date_published":"2021-12-18T00:00:00Z","year":"2021","publication_status":"published","status":"public","citation":{"ista":"Ivanov G. 2021. Tight frames and related geometric problems. Canadian Mathematical Bulletin. 64(4), 942–963.","ieee":"G. Ivanov, “Tight frames and related geometric problems,” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4. Canadian Mathematical Society, pp. 942–963, 2021.","ama":"Ivanov G. Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. 2021;64(4):942-963. doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>","apa":"Ivanov, G. (2021). Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>","mla":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4, Canadian Mathematical Society, 2021, pp. 942–63, doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>.","short":"G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.","chicago":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society, 2021. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>."},"corr_author":"1"},{"ddc":["570"],"oa":1,"page":"37","abstract":[{"text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"department":[{"_id":"GaTk"}],"article_processing_charge":"No","ec_funded":1,"publisher":"arXiv","acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","date_created":"2022-03-21T11:41:28Z","oa_version":"Preprint","month":"08","title":"Quantifying the coexistence of neuronal oscillations and avalanches","type":"preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.06686"}],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-22T11:24:26Z","external_id":{"arxiv":["2108.06686"]},"language":[{"iso":"eng"}],"day":"17","doi":"10.48550/ARXIV.2108.06686","publication_status":"submitted","status":"public","year":"2021","_id":"10912","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"grant_number":"P34015","name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"date_published":"2021-08-17T00:00:00Z","citation":{"chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).","mla":"Lombardi, Fabrizio, et al. <i>Quantifying the Coexistence of Neuronal Oscillations and Avalanches</i>. arXiv, doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>.","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv.","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>."},"author":[{"orcid":"0000-0003-2623-5249","id":"A057D288-3E88-11E9-986D-0CF4E5697425","full_name":"Lombardi, Fabrizio","first_name":"Fabrizio","last_name":"Lombardi"},{"first_name":"Selver","full_name":"Pepic, Selver","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","last_name":"Pepic"},{"full_name":"Shriki, Oren","first_name":"Oren","last_name":"Shriki"},{"first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","last_name":"Tkačik"},{"last_name":"De Martino","full_name":"De Martino, Daniele","first_name":"Daniele"}]},{"author":[{"full_name":"Krishna, Shefali","first_name":"Shefali","last_name":"Krishna"},{"full_name":"Arrojo e Drigo, Rafael","first_name":"Rafael","last_name":"Arrojo e Drigo"},{"last_name":"Capitanio","full_name":"Capitanio, Juliana S.","first_name":"Juliana S."},{"last_name":"Ramachandra","first_name":"Ranjan","full_name":"Ramachandra, Ranjan"},{"last_name":"Ellisman","first_name":"Mark","full_name":"Ellisman, Mark"},{"last_name":"HETZER","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","first_name":"Martin W"}],"issue":"21","intvolume":"        56","language":[{"iso":"eng"}],"external_id":{"pmid":["34715012"]},"quality_controlled":"1","citation":{"short":"S. Krishna, R. Arrojo e Drigo, J.S. Capitanio, R. Ramachandra, M. Ellisman, M. Hetzer, Developmental Cell 56 (2021) P2952–2965.e9.","chicago":"Krishna, Shefali, Rafael Arrojo e Drigo, Juliana S. Capitanio, Ranjan Ramachandra, Mark Ellisman, and Martin Hetzer. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” <i>Developmental Cell</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">https://doi.org/10.1016/j.devcel.2021.10.008</a>.","ista":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. 2021. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. Developmental Cell. 56(21), P2952–2965.e9.","ieee":"S. Krishna, R. Arrojo e Drigo, J. S. Capitanio, R. Ramachandra, M. Ellisman, and M. Hetzer, “Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain,” <i>Developmental Cell</i>, vol. 56, no. 21. Elsevier, p. P2952–2965.e9, 2021.","ama":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. <i>Developmental Cell</i>. 2021;56(21):P2952-2965.e9. doi:<a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">10.1016/j.devcel.2021.10.008</a>","apa":"Krishna, S., Arrojo e Drigo, R., Capitanio, J. S., Ramachandra, R., Ellisman, M., &#38; Hetzer, M. (2021). Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">https://doi.org/10.1016/j.devcel.2021.10.008</a>","mla":"Krishna, Shefali, et al. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” <i>Developmental Cell</i>, vol. 56, no. 21, Elsevier, 2021, p. P2952–2965.e9, doi:<a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">10.1016/j.devcel.2021.10.008</a>."},"publication_status":"published","status":"public","extern":"1","date_published":"2021-11-08T00:00:00Z","year":"2021","keyword":["Developmental Biology","Cell Biology","General Biochemistry","Genetics and Molecular Biology","Molecular Biology"],"publication":"Developmental Cell","title":"Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain","date_created":"2022-04-07T07:43:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"date_updated":"2025-12-15T10:01:56Z","abstract":[{"lang":"eng","text":"In order to combat molecular damage, most cellular proteins undergo rapid turnover. We have previously identified large nuclear protein assemblies that can persist for years in post-mitotic tissues and are subject to age-related decline. Here, we report that mitochondria can be long lived in the mouse brain and reveal that specific mitochondrial proteins have half-lives longer than the average proteome. These mitochondrial long-lived proteins (mitoLLPs) are core components of the electron transport chain (ETC) and display increased longevity in respiratory supercomplexes. We find that COX7C, a mitoLLP that forms a stable contact site between complexes I and IV, is required for complex IV and supercomplex assembly. Remarkably, even upon depletion of COX7C transcripts, ETC function is maintained for days, effectively uncoupling mitochondrial function from ongoing transcription of its mitoLLPs. Our results suggest that modulating protein longevity within the ETC is critical for mitochondrial proteome maintenance and the robustness of mitochondrial function."}],"publisher":"Elsevier","article_type":"original","doi":"10.1016/j.devcel.2021.10.008","day":"08","publication_identifier":{"issn":["1534-5807"]},"volume":56,"_id":"11052","month":"11","type":"journal_article","oa_version":"None","page":"P2952-2965.e9","department":[{"_id":"MaHe"}],"scopus_import":"1","article_processing_charge":"No"},{"publication_identifier":{"issn":["2509-2715","2509-2723"]},"doi":"10.1007/s11357-021-00426-x","day":"01","volume":43,"_id":"11053","article_type":"original","scopus_import":"1","page":"2139-2148","article_processing_charge":"No","oa_version":"Published Version","month":"10","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"pmid":["34370163"]},"publication_status":"published","status":"public","extern":"1","date_published":"2021-10-01T00:00:00Z","year":"2021","citation":{"short":"G.S. Shadel, P.D. Adams, W.T. Berggren, J.K. Diedrich, K.E. Diffenderfer, F.H. Gage, N. Hah, M. Hansen, M. Hetzer, A.J.A. Molina, U. Manor, K. Marek, D.D. O’Keefe, A.F.M. Pinto, A. Sacco, T.O. Sharpee, M.N. Shokriev, S. Zambetti, GeroScience 43 (2021) 2139–2148.","chicago":"Shadel, Gerald S., Peter D. Adams, W. Travis Berggren, Jolene K. Diedrich, Kenneth E. Diffenderfer, Fred H. Gage, Nasun Hah, et al. “The San Diego Nathan Shock Center: Tackling the Heterogeneity of Aging.” <i>GeroScience</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11357-021-00426-x\">https://doi.org/10.1007/s11357-021-00426-x</a>.","apa":"Shadel, G. S., Adams, P. D., Berggren, W. T., Diedrich, J. K., Diffenderfer, K. E., Gage, F. H., … Zambetti, S. (2021). The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. <i>GeroScience</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11357-021-00426-x\">https://doi.org/10.1007/s11357-021-00426-x</a>","ieee":"G. S. Shadel <i>et al.</i>, “The San Diego Nathan Shock Center: Tackling the heterogeneity of aging,” <i>GeroScience</i>, vol. 43, no. 5. Springer Nature, pp. 2139–2148, 2021.","ama":"Shadel GS, Adams PD, Berggren WT, et al. The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. <i>GeroScience</i>. 2021;43(5):2139-2148. doi:<a href=\"https://doi.org/10.1007/s11357-021-00426-x\">10.1007/s11357-021-00426-x</a>","ista":"Shadel GS, Adams PD, Berggren WT, Diedrich JK, Diffenderfer KE, Gage FH, Hah N, Hansen M, Hetzer M, Molina AJA, Manor U, Marek K, O’Keefe DD, Pinto AFM, Sacco A, Sharpee TO, Shokriev MN, Zambetti S. 2021. The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. GeroScience. 43(5), 2139–2148.","mla":"Shadel, Gerald S., et al. “The San Diego Nathan Shock Center: Tackling the Heterogeneity of Aging.” <i>GeroScience</i>, vol. 43, no. 5, Springer Nature, 2021, pp. 2139–48, doi:<a href=\"https://doi.org/10.1007/s11357-021-00426-x\">10.1007/s11357-021-00426-x</a>."},"issue":"5","intvolume":"        43","author":[{"first_name":"Gerald S.","full_name":"Shadel, Gerald S.","last_name":"Shadel"},{"first_name":"Peter D.","full_name":"Adams, Peter D.","last_name":"Adams"},{"last_name":"Berggren","first_name":"W. Travis","full_name":"Berggren, W. Travis"},{"full_name":"Diedrich, Jolene K.","first_name":"Jolene K.","last_name":"Diedrich"},{"last_name":"Diffenderfer","first_name":"Kenneth E.","full_name":"Diffenderfer, Kenneth E."},{"last_name":"Gage","first_name":"Fred H.","full_name":"Gage, Fred H."},{"last_name":"Hah","full_name":"Hah, Nasun","first_name":"Nasun"},{"last_name":"Hansen","full_name":"Hansen, Malene","first_name":"Malene"},{"last_name":"HETZER","first_name":"Martin W","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X"},{"last_name":"Molina","first_name":"Anthony J. A.","full_name":"Molina, Anthony J. A."},{"last_name":"Manor","first_name":"Uri","full_name":"Manor, Uri"},{"full_name":"Marek, Kurt","first_name":"Kurt","last_name":"Marek"},{"last_name":"O’Keefe","full_name":"O’Keefe, David D.","first_name":"David D."},{"first_name":"Antonio F. M.","full_name":"Pinto, Antonio F. M.","last_name":"Pinto"},{"last_name":"Sacco","first_name":"Alessandra","full_name":"Sacco, Alessandra"},{"last_name":"Sharpee","first_name":"Tatyana O.","full_name":"Sharpee, Tatyana O."},{"last_name":"Shokriev","first_name":"Maxim N.","full_name":"Shokriev, Maxim N."},{"last_name":"Zambetti","first_name":"Stefania","full_name":"Zambetti, Stefania"}],"oa":1,"abstract":[{"lang":"eng","text":"Understanding basic mechanisms of aging holds great promise for developing interventions that prevent or delay many age-related declines and diseases simultaneously to increase human healthspan. However, a major confounding factor in aging research is the heterogeneity of the aging process itself. At the organismal level, it is clear that chronological age does not always predict biological age or susceptibility to frailty or pathology. While genetics and environment are major factors driving variable rates of aging, additional complexity arises because different organs, tissues, and cell types are intrinsically heterogeneous and exhibit different aging trajectories normally or in response to the stresses of the aging process (e.g., damage accumulation). Tackling the heterogeneity of aging requires new and specialized tools (e.g., single-cell analyses, mass spectrometry-based approaches, and advanced imaging) to identify novel signatures of aging across scales. Cutting-edge computational approaches are then needed to integrate these disparate datasets and elucidate network interactions between known aging hallmarks. There is also a need for improved, human cell-based models of aging to ensure that basic research findings are relevant to human aging and healthspan interventions. The San Diego Nathan Shock Center (SD-NSC) provides access to cutting-edge scientific resources to facilitate the study of the heterogeneity of aging in general and to promote the use of novel human cell models of aging. The center also has a robust Research Development Core that funds pilot projects on the heterogeneity of aging and organizes innovative training activities, including workshops and a personalized mentoring program, to help investigators new to the aging field succeed. Finally, the SD-NSC participates in outreach activities to educate the general community about the importance of aging research and promote the need for basic biology of aging research in particular."}],"publisher":"Springer Nature","date_created":"2022-04-07T07:43:25Z","keyword":["Geriatrics and Gerontology","Aging"],"publication":"GeroScience","title":"The San Diego Nathan Shock Center: Tackling the heterogeneity of aging","pmid":1,"date_updated":"2022-07-18T08:27:24Z","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8599742/"}],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd"},{"arxiv":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1905.11845"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-14T07:43:57Z","publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","date_created":"2022-06-05T22:01:52Z","publisher":"AAAI Press","ec_funded":1,"abstract":[{"text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy.","lang":"eng"}],"oa":1,"author":[{"first_name":"Vyacheslav","full_name":"Kungurtsev, Vyacheslav","last_name":"Kungurtsev"},{"first_name":"Malcolm","full_name":"Egan, Malcolm","last_name":"Egan"},{"first_name":"Bapi","orcid":"0000-0002-2742-4028","full_name":"Chatterjee, Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"}],"issue":"9B","intvolume":"        35","citation":{"mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16.","ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>. Vol 35. AAAI Press; 2021:8209-8216.","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., &#38; Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i> (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press.","ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.","chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, 35:8209–16. AAAI Press, 2021.","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216."},"publication_status":"published","status":"public","year":"2021","date_published":"2021-05-18T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["1905.11845"]},"quality_controlled":"1","month":"05","type":"conference","oa_version":"Preprint","article_processing_charge":"No","page":"8209-8216","department":[{"_id":"DaAl"}],"scopus_import":"1","conference":{"end_date":"2021-02-09","name":"AAAI: Conference on Artificial Intelligence","location":"Virtual, Online","start_date":"2021-02-02"},"volume":35,"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"_id":"11436","day":"18","publication_identifier":{"issn":["2159-5399"],"isbn":["9781713835974"],"eissn":["2374-3468"]}},{"article_number":"14","article_type":"original","_id":"10000","volume":62,"publication_identifier":{"eissn":["1552-5783"],"issn":["0146-0404"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"day":"16","doi":"10.1167/IOVS.62.10.14","oa_version":"Published Version","type":"journal_article","month":"08","article_processing_charge":"Yes","scopus_import":"1","ddc":["570"],"isi":1,"department":[{"_id":"SaSi"}],"intvolume":"        62","issue":"10","author":[{"last_name":"Schmitt","full_name":"Schmitt, Heather M.","first_name":"Heather M."},{"last_name":"Fehrman","full_name":"Fehrman, Rachel L.","first_name":"Rachel L."},{"last_name":"Maes","first_name":"Margaret E","orcid":"0000-0001-9642-1085","full_name":"Maes, Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yang, Huan","first_name":"Huan","last_name":"Yang"},{"first_name":"Lian Wang","full_name":"Guo, Lian Wang","last_name":"Guo"},{"last_name":"Schlamp","first_name":"Cassandra L.","full_name":"Schlamp, Cassandra L."},{"first_name":"Heather R.","full_name":"Pelzel, Heather R.","last_name":"Pelzel"},{"first_name":"Robert W.","full_name":"Nickells, Robert W.","last_name":"Nickells"}],"has_accepted_license":"1","date_published":"2021-08-16T00:00:00Z","year":"2021","status":"public","publication_status":"published","citation":{"chicago":"Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision and Ophthalmology, 2021. <a href=\"https://doi.org/10.1167/IOVS.62.10.14\">https://doi.org/10.1167/IOVS.62.10.14</a>.","short":"H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R. Pelzel, R.W. Nickells, Investigative Ophthalmology and Visual Science 62 (2021).","mla":"Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology and Visual Science</i>, vol. 62, no. 10, 14, Association for Research in Vision and Ophthalmology, 2021, doi:<a href=\"https://doi.org/10.1167/IOVS.62.10.14\">10.1167/IOVS.62.10.14</a>.","ista":"Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 62(10), 14.","ieee":"H. M. Schmitt <i>et al.</i>, “Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression,” <i>Investigative Ophthalmology and Visual Science</i>, vol. 62, no. 10. Association for Research in Vision and Ophthalmology, 2021.","ama":"Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology and Visual Science</i>. 2021;62(10). doi:<a href=\"https://doi.org/10.1167/IOVS.62.10.14\">10.1167/IOVS.62.10.14</a>","apa":"Schmitt, H. M., Fehrman, R. L., Maes, M. E., Yang, H., Guo, L. W., Schlamp, C. L., … Nickells, R. W. (2021). Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision and Ophthalmology. <a href=\"https://doi.org/10.1167/IOVS.62.10.14\">https://doi.org/10.1167/IOVS.62.10.14</a>"},"file_date_updated":"2022-05-13T07:40:15Z","quality_controlled":"1","external_id":{"isi":["000695230000014"],"pmid":["34398198"]},"language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","pmid":1,"date_updated":"2023-08-14T06:35:17Z","date_created":"2021-09-12T22:01:23Z","acknowledgement":"The authors thank Joel Dietz for maintaining the mice used in this study, Satoshi Kinoshita and the Translational Research Initiative in Pathology Laboratory at the University of Wisconsin-Madison for cutting retinal sections analyzed in this study, and Mark Banghart for statistical review of the data analysis. Supported by National Eye Institute Grants R01 EY012223 (RWN), R01 EY030123 (RWN), R01 EY029809 (LWG), R01 EY029809 (LWG) and a Vision Research CORE grant P30 EY016665, NRSA grant T32 GM081061, by an unrestricted research grant from Research to Prevent Blindness, Inc., and by a University of Wisconsin-Madison Vilas Life Cycle award and the Frederick A. Davis Research Chair (RWN). ","title":"Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression","publication":"Investigative Ophthalmology and Visual Science","publisher":"Association for Research in Vision and Ophthalmology","oa":1,"abstract":[{"lang":"eng","text":"Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs) after acute optic nerve damage. Consistent with this, induced HDAC3 expression in cultured cells shows selective toxicity to neurons. Despite an established role for HDAC3 in neuronal pathology, little is known regarding the mechanism of this pathology."}],"file":[{"access_level":"open_access","date_updated":"2022-05-13T07:40:15Z","success":1,"date_created":"2022-05-13T07:40:15Z","file_id":"11369","file_name":"2021_IOVS_Schmitt.pdf","file_size":19707796,"creator":"dernst","checksum":"c430967746f653aa1ae84ee617f62b73","relation":"main_file","content_type":"application/pdf"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/2104.07466","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"date_updated":"2025-07-10T11:15:45Z","date_created":"2021-09-12T22:01:24Z","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506.","title":"Symbolic time and space tradeoffs for probabilistic verification","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"ec_funded":1,"publisher":"Institute of Electrical and Electronics Engineers","oa":1,"abstract":[{"text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with  n  vertices and  m  edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires  O(n2)  symbolic operations and  O(1)  symbolic space. The only other symbolic algorithm for the MEC decomposition requires  O(nm−−√)  symbolic operations and  O(m−−√)  symbolic space. A main open question is whether the worst-case  O(n2)  bound for symbolic operations can be beaten. We present a symbolic algorithm that requires  O˜(n1.5)  symbolic operations and  O˜(n−−√)  symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all  0<ϵ≤1/2  the symbolic algorithm requires  O˜(n2−ϵ)  symbolic operations and  O˜(nϵ)  symbolic space ( O˜  hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of  ω -regular objectives for MDPs. We consider the canonical parity objectives for  ω -regular objectives, and for parity objectives with  d -priorities we present an algorithm that computes the almost-sure winning region with  O˜(n2−ϵ)  symbolic operations and  O˜(nϵ)  symbolic space, for all  0<ϵ≤1/2 .","lang":"eng"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Wolfgang","full_name":"Dvorak, Wolfgang","last_name":"Dvorak"},{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Alexander","full_name":"Svozil, Alexander","last_name":"Svozil"}],"year":"2021","date_published":"2021-07-07T00:00:00Z","publication_status":"published","status":"public","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 1–13. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">https://doi.org/10.1109/LICS52264.2021.9470739</a>.","short":"K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">10.1109/LICS52264.2021.9470739</a>.","ista":"Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.","ama":"Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">10.1109/LICS52264.2021.9470739</a>","apa":"Chatterjee, K., Dvorak, W., Henzinger, M., &#38; Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">https://doi.org/10.1109/LICS52264.2021.9470739</a>","ieee":"K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021, pp. 1–13."},"quality_controlled":"1","external_id":{"arxiv":["2104.07466"],"isi":["000947350400089"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","type":"conference","month":"07","article_processing_charge":"No","scopus_import":"1","isi":1,"department":[{"_id":"KrCh"}],"page":"1-13","_id":"10002","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"conference":{"start_date":"2021-06-29","location":"Rome, Italy","name":"LICS: Logic in Computer Science","end_date":"2021-07-02"},"publication_identifier":{"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"],"isbn":["978-1-6654-4896-3"]},"day":"07","doi":"10.1109/LICS52264.2021.9470739"},{"oa":1,"abstract":[{"lang":"eng","text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs."}],"ec_funded":1,"publisher":"Institute of Electrical and Electronics Engineers","acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","date_created":"2021-09-12T22:01:25Z","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","related_material":{"record":[{"status":"public","id":"18630","relation":"later_version"}]},"title":"Stochastic processes with expected stopping time","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07278"}],"arxiv":1,"date_updated":"2025-09-08T14:54:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"language":[{"iso":"eng"}],"status":"public","publication_status":"published","year":"2021","date_published":"2021-07-07T00:00:00Z","citation":{"ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.","apa":"Chatterjee, K., &#38; Doyen, L. (2021). Stochastic processes with expected stopping time. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">https://doi.org/10.1109/LICS52264.2021.9470595</a>","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021, pp. 1–13.","ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">10.1109/LICS52264.2021.9470595</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">10.1109/LICS52264.2021.9470595</a>.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 1–13. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">https://doi.org/10.1109/LICS52264.2021.9470595</a>."},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"isi":1,"scopus_import":"1","page":"1-13","department":[{"_id":"KrCh"}],"article_processing_charge":"No","oa_version":"Preprint","month":"07","type":"conference","publication_identifier":{"isbn":["978-1-6654-4896-3"],"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"]},"doi":"10.1109/LICS52264.2021.9470595","day":"07","_id":"10004","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"conference":{"start_date":"2021-06-29","location":"Rome, Italy","end_date":"2021-07-02","name":"LICS: Logic in Computer Science"}},{"oa_version":"Preprint","type":"journal_article","month":"08","scopus_import":"1","isi":1,"department":[{"_id":"JuFi"}],"article_processing_charge":"No","article_type":"original","publication_identifier":{"eissn":["1793-6314"],"issn":["0218-2025"]},"day":"25","doi":"10.1142/S0218202521500457","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"_id":"10005","volume":31,"date_created":"2021-09-12T22:01:25Z","acknowledgement":"M. Bulíček and J. Málek acknowledge the support of the project No. 18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583 by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers of the Nečas Center for Mathematical Modelling.\r\n","title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","publication":"Mathematical Models and Methods in Applied Sciences","keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"date_updated":"2025-05-14T10:50:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2009.06917","open_access":"1"}],"oa":1,"abstract":[{"lang":"eng","text":"We study systems of nonlinear partial differential equations of parabolic type, in which the elliptic operator is replaced by the first-order divergence operator acting on a flux function, which is related to the spatial gradient of the unknown through an additional implicit equation. This setting, broad enough in terms of applications, significantly expands the paradigm of nonlinear parabolic problems. Formulating four conditions concerning the form of the implicit equation, we first show that these conditions describe a maximal monotone p-coercive graph. We then establish the global-in-time and large-data existence of a (weak) solution and its uniqueness. To this end, we adopt and significantly generalize Minty’s method of monotone mappings. A unified theory, containing several novel tools, is developed in a way to be tractable from the point of view of numerical approximations."}],"publisher":"World Scientific Publishing","intvolume":"        31","issue":"09","author":[{"first_name":"Miroslav","full_name":"Bulíček, Miroslav","last_name":"Bulíček"},{"last_name":"Maringová","full_name":"Maringová, Erika","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4","first_name":"Erika"},{"last_name":"Málek","full_name":"Málek, Josef","first_name":"Josef"}],"quality_controlled":"1","external_id":{"arxiv":["2009.06917"],"isi":["000722222900004"]},"language":[{"iso":"eng"}],"year":"2021","date_published":"2021-08-25T00:00:00Z","publication_status":"published","status":"public","citation":{"mla":"Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 09, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/S0218202521500457\">10.1142/S0218202521500457</a>.","ista":"Bulíček M, Maringová E, Málek J. 2021. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. Mathematical Models and Methods in Applied Sciences. 31(09).","ieee":"M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic type with implicit constitutive equations involving flux,” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 09. World Scientific Publishing, 2021.","apa":"Bulíček, M., Maringová, E., &#38; Málek, J. (2021). On nonlinear problems of parabolic type with implicit constitutive equations involving flux. <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218202521500457\">https://doi.org/10.1142/S0218202521500457</a>","ama":"Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. <i>Mathematical Models and Methods in Applied Sciences</i>. 2021;31(09). doi:<a href=\"https://doi.org/10.1142/S0218202521500457\">10.1142/S0218202521500457</a>","chicago":"Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/S0218202521500457\">https://doi.org/10.1142/S0218202521500457</a>.","short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021)."}},{"quality_controlled":"1","external_id":{"arxiv":["2005.14177"]},"language":[{"iso":"eng"}],"publication_status":"published","status":"public","year":"2021","date_published":"2021-06-04T00:00:00Z","citation":{"short":"I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and Systems 21 (2021) 481–536.","chicago":"Karatzas, Ioannis, Jan Maas, and Walter Schachermayer. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” <i>Communications in Information and Systems</i>. International Press, 2021. <a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">https://doi.org/10.4310/CIS.2021.v21.n4.a1</a>.","ista":"Karatzas I, Maas J, Schachermayer W. 2021. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. 21(4), 481–536.","ieee":"I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and gradient flow for the relative entropy in Markov chains,” <i>Communications in Information and Systems</i>, vol. 21, no. 4. International Press, pp. 481–536, 2021.","ama":"Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. <i>Communications in Information and Systems</i>. 2021;21(4):481-536. doi:<a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">10.4310/CIS.2021.v21.n4.a1</a>","apa":"Karatzas, I., Maas, J., &#38; Schachermayer, W. (2021). Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. <i>Communications in Information and Systems</i>. International Press. <a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">https://doi.org/10.4310/CIS.2021.v21.n4.a1</a>","mla":"Karatzas, Ioannis, et al. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” <i>Communications in Information and Systems</i>, vol. 21, no. 4, International Press, 2021, pp. 481–536, doi:<a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">10.4310/CIS.2021.v21.n4.a1</a>."},"issue":"4","intvolume":"        21","author":[{"full_name":"Karatzas, Ioannis","first_name":"Ioannis","last_name":"Karatzas"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","last_name":"Maas"},{"last_name":"Schachermayer","first_name":"Walter","full_name":"Schachermayer, Walter"}],"oa":1,"abstract":[{"text":"We study the temporal dissipation of variance and relative entropy for ergodic Markov Chains in continuous time, and compute explicitly the corresponding dissipation rates. These are identified, as is well known, in the case of the variance in terms of an appropriate Hilbertian norm; and in the case of the relative entropy, in terms of a Dirichlet form which morphs into a version of the familiar Fisher information under conditions of detailed balance. Here we obtain trajectorial versions of these results, valid along almost every path of the random motion and most transparent in the backwards direction of time. Martingale arguments and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer and Tschiderer for conservative diffusions. Extensions are developed to general “convex divergences” and to countable state-spaces. The steepest descent and gradient flow properties for the variance, the relative entropy, and appropriate generalizations, are studied along with their respective geometries under conditions of detailed balance, leading to a very direct proof for the HWI inequality of Otto and Villani in the present context.","lang":"eng"}],"ec_funded":1,"publisher":"International Press","acknowledgement":"I.K. acknowledges support from the U.S. National Science Foundation under Grant NSF-DMS-20-04997. J.M. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and from the Austrian Science Fund (FWF) through project F65. W.S. acknowledges support from the Austrian Science Fund (FWF) under grant P28861 and by the Vienna Science and Technology Fund (WWTF) through projects MA14-008 and MA16-021.","date_created":"2021-09-19T08:53:19Z","keyword":["Markov Chain","relative entropy","time reversal","steepest descent","gradient flow"],"publication":"Communications in Information and Systems","title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","date_updated":"2025-04-14T07:27:45Z","arxiv":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","main_file_link":[{"url":"https://arxiv.org/abs/2005.14177","open_access":"1"}],"publication_identifier":{"issn":["1526-7555"]},"day":"04","doi":"10.4310/CIS.2021.v21.n4.a1","volume":21,"_id":"10023","project":[{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"article_type":"original","page":"481-536","department":[{"_id":"JaMa"}],"article_processing_charge":"No","oa_version":"Preprint","month":"06","type":"journal_article"},{"oa_version":"Published Version","type":"journal_article","month":"08","article_processing_charge":"Yes","scopus_import":"1","ddc":["519"],"isi":1,"department":[{"_id":"JaMa"}],"page":"124-158","article_type":"original","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"_id":"10024","volume":142,"publication_identifier":{"issn":["0304-4149"]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"doi":"10.1016/j.spa.2021.08.006","day":"27","date_updated":"2025-04-14T07:43:46Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","arxiv":1,"date_created":"2021-09-19T22:01:25Z","acknowledgement":"The authors would like to thank Marek Biskup and Alberto Chiarini for useful suggestions and  Cristian  Giardina,  Frank  den  Hollander  and  Shubhamoy  Nandan  for  inspiring  discussions.  S.F.  acknowledges  Simona  Villa  for  her  help  in  creating  the  picture.  Furthermore, the  authors  thank  two  anonymous  referees  for  the  careful  reading  of  the  manuscript.  S.F. acknowledges  financial  support  from  NWO,  The  Netherlands  via  the  grant  TOP1.17.019. F.S.  acknowledges  financial  support  from  NWO  via  the  TOP1  grant  613.001.552  as  well  as funding from the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.","title":"Hydrodynamics for the partial exclusion process in random environment","keyword":["hydrodynamic limit","random environment","random conductance model","arbitrary starting point quenched invariance principle","duality","mild solution"],"publication":"Stochastic Processes and their Applications","ec_funded":1,"publisher":"Elsevier","oa":1,"abstract":[{"lang":"eng","text":"In this paper, we introduce a random environment for the exclusion process in  obtained by assigning a maximal occupancy to each site. This maximal occupancy is allowed to randomly vary among sites, and partial exclusion occurs. Under the assumption of ergodicity under translation and uniform ellipticity of the environment, we derive a quenched hydrodynamic limit in path space by strengthening the mild solution approach initiated in Nagy (2002) and Faggionato (2007). To this purpose, we prove, employing the technology developed for the random conductance model, a homogenization result in the form of an arbitrary starting point quenched invariance principle for a single particle in the same environment, which is a result of independent interest. The self-duality property of the partial exclusion process allows us to transfer this homogenization result to the particle system and, then, apply the tightness criterion in Redig et al. (2020)."}],"file":[{"file_name":"2021_StochasticProcessesAppl_Floreani.pdf","file_size":2115791,"creator":"dernst","checksum":"56768c553d7218ee5714902ffec90ec4","relation":"main_file","content_type":"application/pdf","date_updated":"2022-05-13T07:55:50Z","access_level":"open_access","success":1,"date_created":"2022-05-13T07:55:50Z","file_id":"11370"}],"intvolume":"       142","author":[{"full_name":"Floreani, Simone","first_name":"Simone","last_name":"Floreani"},{"last_name":"Redig","first_name":"Frank","full_name":"Redig, Frank"},{"full_name":"Sau, Federico","id":"E1836206-9F16-11E9-8814-AEFDE5697425","first_name":"Federico","last_name":"Sau"}],"has_accepted_license":"1","date_published":"2021-08-27T00:00:00Z","year":"2021","status":"public","publication_status":"published","file_date_updated":"2022-05-13T07:55:50Z","citation":{"ista":"Floreani S, Redig F, Sau F. 2021. Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and their Applications. 142, 124–158.","ama":"Floreani S, Redig F, Sau F. Hydrodynamics for the partial exclusion process in random environment. <i>Stochastic Processes and their Applications</i>. 2021;142:124-158. doi:<a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">10.1016/j.spa.2021.08.006</a>","ieee":"S. Floreani, F. Redig, and F. Sau, “Hydrodynamics for the partial exclusion process in random environment,” <i>Stochastic Processes and their Applications</i>, vol. 142. Elsevier, pp. 124–158, 2021.","apa":"Floreani, S., Redig, F., &#38; Sau, F. (2021). Hydrodynamics for the partial exclusion process in random environment. <i>Stochastic Processes and Their Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">https://doi.org/10.1016/j.spa.2021.08.006</a>","mla":"Floreani, Simone, et al. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” <i>Stochastic Processes and Their Applications</i>, vol. 142, Elsevier, 2021, pp. 124–58, doi:<a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">10.1016/j.spa.2021.08.006</a>.","short":"S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications 142 (2021) 124–158.","chicago":"Floreani, Simone, Frank Redig, and Federico Sau. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” <i>Stochastic Processes and Their Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">https://doi.org/10.1016/j.spa.2021.08.006</a>."},"quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000697748500005"],"arxiv":["1911.12564"]}},{"date_updated":"2025-04-14T07:43:46Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":"https://arxiv.org/abs/2104.00653","open_access":"1"}],"arxiv":1,"title":"Half and quarter metals in rhombohedral trilayer graphene","related_material":{"link":[{"url":"https://doi.org/10.1038/s41586-021-04181-z","relation":"erratum"}]},"publication":"Nature","keyword":["condensed matter - mesoscale and nanoscale physics","condensed matter - strongly correlated electrons","multidisciplinary"],"date_created":"2021-09-19T22:01:25Z","acknowledgement":"The authors acknowledge discussions with A. Macdonald, L. Fu, F. Wang and M. Zaletel. AFY acknowledges support of the National Science Foundation under DMR1654186, and the Gordon and Betty Moore Foundation under award GBMF9471. The authors acknowledge the use of the research facilities within the California NanoSystems Institute, supported by the University of California, Santa Barbara and the University of California, Office of the President.\r\nK.W. and T.T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, Grant Number JPMXP0112101001 and JSPS KAKENHI, Grant Number JP20H00354. EB and TH were supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement No. 817799). A.G. acknowledges support by the European Unions Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement\r\nNo. 754411.\r\n","publisher":"Springer Nature","ec_funded":1,"abstract":[{"lang":"eng","text":"Ferromagnetism is most common in transition metal compounds but may also arise in low-density two-dimensional electron systems, with signatures observed in silicon, III-V semiconductor systems, and graphene moiré heterostructures. Here we show that gate-tuned van Hove singularities in rhombohedral trilayer graphene drive the spontaneous ferromagnetic polarization of the electron system into one or more spin- and valley flavors. Using capacitance measurements on graphite-gated van der Waals heterostructures, we find a cascade of density- and electronic displacement field tuned phase transitions marked by negative electronic compressibility. The transitions define the boundaries between phases where quantum oscillations have either four-fold, two-fold, or one-fold degeneracy, associated with a spin and valley degenerate normal metal, spin-polarized `half-metal', and spin and valley polarized `quarter metal', respectively. For electron doping, the salient features are well captured by a phenomenological Stoner model with a valley-anisotropic Hund's coupling, likely arising from interactions at the lattice scale. For hole filling, we observe a richer phase diagram featuring a delicate interplay of broken symmetries and transitions in the Fermi surface topology. Finally, by rotational alignment of a hexagonal boron nitride substrate to induce a moiré superlattice, we find that the superlattice perturbs the preexisting isospin order only weakly, leaving the basic phase diagram intact while catalyzing the formation of topologically nontrivial gapped states whenever itinerant half- or quarter metal states occur at half- or quarter superlattice band filling. Our results show that rhombohedral trilayer graphene is an ideal platform for well-controlled tests of many-body theory and reveal magnetism in moiré materials to be fundamentally itinerant in nature."}],"oa":1,"author":[{"first_name":"Haoxin","full_name":"Zhou, Haoxin","last_name":"Zhou"},{"last_name":"Xie","first_name":"Tian","full_name":"Xie, Tian"},{"id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543","first_name":"Areg","last_name":"Ghazaryan"},{"full_name":"Holder, Tobias","first_name":"Tobias","last_name":"Holder"},{"first_name":"James R.","full_name":"Ehrets, James R.","last_name":"Ehrets"},{"first_name":"Eric M.","full_name":"Spanton, Eric M.","last_name":"Spanton"},{"last_name":"Taniguchi","full_name":"Taniguchi, Takashi","first_name":"Takashi"},{"last_name":"Watanabe","full_name":"Watanabe, Kenji","first_name":"Kenji"},{"full_name":"Berg, Erez","first_name":"Erez","last_name":"Berg"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","last_name":"Serbyn"},{"first_name":"Andrea F.","full_name":"Young, Andrea F.","last_name":"Young"}],"citation":{"ieee":"H. Zhou <i>et al.</i>, “Half and quarter metals in rhombohedral trilayer graphene,” <i>Nature</i>. Springer Nature, 2021.","ama":"Zhou H, Xie T, Ghazaryan A, et al. Half and quarter metals in rhombohedral trilayer graphene. <i>Nature</i>. 2021. doi:<a href=\"https://doi.org/10.1038/s41586-021-03938-w\">10.1038/s41586-021-03938-w</a>","apa":"Zhou, H., Xie, T., Ghazaryan, A., Holder, T., Ehrets, J. R., Spanton, E. M., … Young, A. F. (2021). Half and quarter metals in rhombohedral trilayer graphene. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-021-03938-w\">https://doi.org/10.1038/s41586-021-03938-w</a>","ista":"Zhou H, Xie T, Ghazaryan A, Holder T, Ehrets JR, Spanton EM, Taniguchi T, Watanabe K, Berg E, Serbyn M, Young AF. 2021. Half and quarter metals in rhombohedral trilayer graphene. Nature.","mla":"Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” <i>Nature</i>, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41586-021-03938-w\">10.1038/s41586-021-03938-w</a>.","short":"H. Zhou, T. Xie, A. Ghazaryan, T. Holder, J.R. Ehrets, E.M. Spanton, T. Taniguchi, K. Watanabe, E. Berg, M. Serbyn, A.F. Young, Nature (2021).","chicago":"Zhou, Haoxin, Tian Xie, Areg Ghazaryan, Tobias Holder, James R. Ehrets, Eric M. Spanton, Takashi Taniguchi, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” <i>Nature</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41586-021-03938-w\">https://doi.org/10.1038/s41586-021-03938-w</a>."},"date_published":"2021-09-01T00:00:00Z","year":"2021","publication_status":"published","status":"public","external_id":{"arxiv":["2104.00653"],"isi":["000706977400002"]},"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","month":"09","oa_version":"Preprint","article_processing_charge":"No","department":[{"_id":"MaSe"},{"_id":"MiLe"}],"scopus_import":"1","isi":1,"article_type":"original","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"_id":"10025","day":"01","doi":"10.1038/s41586-021-03938-w","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]}},{"article_number":"2107.03695","_id":"10029","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"day":"08","doi":"10.48550/arXiv.2107.03695","month":"07","type":"preprint","oa_version":"Preprint","article_processing_charge":"No","department":[{"_id":"MaSe"},{"_id":"AnHi"},{"_id":"MiLe"}],"author":[{"last_name":"Phan","first_name":"Duc T","full_name":"Phan, Duc T","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Senior","orcid":"0000-0002-0672-9295","id":"5479D234-2D30-11EA-89CC-40953DDC885E","full_name":"Senior, Jorden L","first_name":"Jorden L"},{"last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Areg"},{"last_name":"Hatefipour","first_name":"M.","full_name":"Hatefipour, M."},{"last_name":"Strickland","full_name":"Strickland, W. M.","first_name":"W. M."},{"full_name":"Shabani, J.","first_name":"J.","last_name":"Shabani"},{"first_name":"Maksym","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","last_name":"Serbyn"},{"first_name":"Andrew P","orcid":"0000-0003-2607-2363","full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","last_name":"Higginbotham"}],"citation":{"mla":"Phan, Duc T., et al. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” <i>ArXiv</i>, 2107.03695, doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03695\">10.48550/arXiv.2107.03695</a>.","ama":"Phan DT, Senior JL, Ghazaryan A, et al. Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03695\">10.48550/arXiv.2107.03695</a>","ieee":"D. T. Phan <i>et al.</i>, “Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid,” <i>arXiv</i>. .","apa":"Phan, D. T., Senior, J. L., Ghazaryan, A., Hatefipour, M., Strickland, W. M., Shabani, J., … Higginbotham, A. P. (n.d.). Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2107.03695\">https://doi.org/10.48550/arXiv.2107.03695</a>","ista":"Phan DT, Senior JL, Ghazaryan A, Hatefipour M, Strickland WM, Shabani J, Serbyn M, Higginbotham AP. Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. arXiv, 2107.03695.","chicago":"Phan, Duc T, Jorden L Senior, Areg Ghazaryan, M. Hatefipour, W. M. Strickland, J. Shabani, Maksym Serbyn, and Andrew P Higginbotham. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2107.03695\">https://doi.org/10.48550/arXiv.2107.03695</a>.","short":"D.T. Phan, J.L. Senior, A. Ghazaryan, M. Hatefipour, W.M. Strickland, J. Shabani, M. Serbyn, A.P. Higginbotham, ArXiv (n.d.)."},"status":"public","publication_status":"draft","date_published":"2021-07-08T00:00:00Z","year":"2021","language":[{"iso":"eng"}],"external_id":{"arxiv":["2107.03695"]},"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"main_file_link":[{"url":"https://arxiv.org/abs/2107.03695","open_access":"1"}],"date_updated":"2025-04-15T06:54:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"arXiv","related_material":{"record":[{"status":"public","relation":"research_data","id":"9636"},{"status":"public","relation":"later_version","id":"10851"}]},"title":"Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid","acknowledgement":"This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility. JS and AG were supported by funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No.754411.","date_created":"2021-09-21T08:41:02Z","ec_funded":1,"abstract":[{"text":"Superconductor-semiconductor hybrids are platforms for realizing effective p-wave superconductivity. Spin-orbit coupling, combined with the proximity effect, causes the two-dimensional semiconductor to inherit p±ip intraband pairing, and application of magnetic field can then result in transitions to the normal state, partial Bogoliubov Fermi surfaces, or topological phases with Majorana modes. Experimentally probing the hybrid superconductor-semiconductor interface is challenging due to the shunting effect of the conventional superconductor. Consequently, the nature of induced pairing remains an open question. Here, we use the circuit quantum electrodynamics architecture to probe induced superconductivity in a two dimensional Al-InAs hybrid system. We observe a strong suppression of superfluid density and enhanced dissipation driven by magnetic field, which cannot be accounted for by the depairing theory of an s-wave superconductor. These observations are explained by a picture of independent intraband p±ip superconductors giving way to partial Bogoliubov Fermi surfaces, and allow for the first characterization of key properties of the hybrid superconducting system.","lang":"eng"}],"oa":1},{"has_accepted_license":"1","author":[{"first_name":"Quoc P","id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Ho, Quoc P","orcid":"0000-0001-6889-1418","last_name":"Ho"}],"intvolume":"       392","external_id":{"arxiv":["1610.00212"],"isi":["000707040300031"]},"language":[{"iso":"eng"}],"quality_controlled":"1","corr_author":"1","citation":{"ama":"Ho QP. The Atiyah-Bott formula and connectivity in chiral Koszul duality. <i>Advances in Mathematics</i>. 2021;392. doi:<a href=\"https://doi.org/10.1016/j.aim.2021.107992\">10.1016/j.aim.2021.107992</a>","ieee":"Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,” <i>Advances in Mathematics</i>, vol. 392. Elsevier, 2021.","apa":"Ho, Q. P. (2021). The Atiyah-Bott formula and connectivity in chiral Koszul duality. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2021.107992\">https://doi.org/10.1016/j.aim.2021.107992</a>","ista":"Ho QP. 2021. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. 392, 107992.","mla":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” <i>Advances in Mathematics</i>, vol. 392, 107992, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.aim.2021.107992\">10.1016/j.aim.2021.107992</a>.","short":"Q.P. Ho, Advances in Mathematics 392 (2021).","chicago":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” <i>Advances in Mathematics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.aim.2021.107992\">https://doi.org/10.1016/j.aim.2021.107992</a>."},"file_date_updated":"2021-09-21T15:58:52Z","publication_status":"published","status":"public","date_published":"2021-09-21T00:00:00Z","year":"2021","keyword":["Chiral algebras","Chiral homology","Factorization algebras","Koszul duality","Ran space"],"publication":"Advances in Mathematics","title":"The Atiyah-Bott formula and connectivity in chiral Koszul duality","acknowledgement":"The author would like to express his gratitude to D. Gaitsgory, without whose tireless guidance and encouragement in pursuing this problem, this work would not have been possible. The author is grateful to his advisor B.C. Ngô for many years of patient guidance and support. This paper is revised while the author is a postdoc in Hausel group at IST Austria. We thank him and the group for providing a wonderful research environment. The author also gratefully acknowledges the support of the Lise Meitner fellowship “Algebro-Geometric Applications of Factorization Homology,” Austrian Science Fund (FWF): M 2751.","date_created":"2021-09-21T15:58:59Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","arxiv":1,"date_updated":"2025-04-14T09:09:35Z","file":[{"date_created":"2021-09-21T15:58:52Z","file_id":"10034","access_level":"open_access","date_updated":"2021-09-21T15:58:52Z","checksum":"f3c0086d41af11db31c00014efb38072","content_type":"application/pdf","relation":"main_file","file_name":"1-s2.0-S000187082100431X-main.pdf","file_size":840635,"creator":"qho"}],"abstract":[{"lang":"eng","text":"The ⊗*-monoidal structure on the category of sheaves on the Ran space is not pro-nilpotent in the sense of [3]. However, under some connectivity assumptions, we prove that Koszul duality induces an equivalence of categories and that this equivalence behaves nicely with respect to Verdier duality on the Ran space and integrating along the Ran space, i.e. taking factorization homology. Based on ideas sketched in [4], we show that these results also offer a simpler alternative to one of the two main steps in the proof of the Atiyah-Bott formula given in [7] and [5]."}],"oa":1,"publisher":"Elsevier","article_type":"original","article_number":"107992","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"21","doi":"10.1016/j.aim.2021.107992","publication_identifier":{"eissn":["1090-2082"],"issn":["0001-8708"]},"volume":392,"_id":"10033","project":[{"name":"Algebro-Geometric Applications of Factorization Homology","grant_number":"M02751","_id":"26B96266-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"09","type":"journal_article","oa_version":"Published Version","department":[{"_id":"TaHa"}],"ddc":["514"],"isi":1,"scopus_import":"1","article_processing_charge":"Yes (via OA deal)"},{"file":[{"creator":"dernst","file_size":11571961,"file_name":"2021_JourNeuroscience_Butola.pdf","relation":"main_file","content_type":"application/pdf","checksum":"769ab627c7355a50ccfd445e43a5f351","date_updated":"2022-05-31T09:10:15Z","access_level":"open_access","date_created":"2022-05-31T09:10:15Z","success":1,"file_id":"11423"}],"abstract":[{"text":"Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated Ca2+ channels (CaV), it is considered to be a central organizer of the topography of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2 knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs) with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway with high release probability. Disruption of RIM-BP2 lowered release probability altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics during high-frequency train stimulation indicated a reduction of SVs with high release probability but an overall normal size of the readily releasable SV pool (RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion was slowed. Ultrastructural analysis by superresolution light and electron microscopy revealed an impaired topography of presynaptic CaV and a reduction of docked and membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for establishing a high initial release probability as required to reliably signal sound onset information that we found to be degraded in BCs of RIM-BP2-deficient mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins (BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach to the calyceal endbulb of Held synapse that transmits auditory information at rates of up to hundreds of Hertz with submillisecond precision we demonstrate a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+ influx and abundance of the key priming protein Munc13-1, a reduced rate of SV replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+ channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This hampers transmission of sound onset information likely affecting downstream neural computations such as of sound localization.","lang":"eng"}],"oa":1,"publisher":"Society for Neuroscience","title":"RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse","publication":"Journal of Neuroscience","date_created":"2021-09-27T14:33:13Z","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Collaborative Sensory Research Center 1286 [to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940. We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance; G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke for technical support and discussion regarding in vivo experiments. We also thank Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody, and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang and J. Neef for constant support and scientific discussion.","date_updated":"2023-08-14T06:56:30Z","pmid":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"external_id":{"pmid":["34353898"],"isi":["000752287700005"]},"quality_controlled":"1","citation":{"ieee":"T. Butola <i>et al.</i>, “RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse,” <i>Journal of Neuroscience</i>, vol. 41, no. 37. Society for Neuroscience, pp. 7742–7767, 2021.","apa":"Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto, R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>","ama":"Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. 2021;41(37):7742-7767. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>","ista":"Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R, Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 41(37), 7742–7767.","mla":"Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>, vol. 41, no. 37, Society for Neuroscience, 2021, pp. 7742–67, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>.","short":"T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto, C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767.","chicago":"Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2021. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>."},"file_date_updated":"2022-05-31T09:10:15Z","date_published":"2021-09-15T00:00:00Z","year":"2021","status":"public","publication_status":"published","has_accepted_license":"1","author":[{"full_name":"Butola, Tanvi","first_name":"Tanvi","last_name":"Butola"},{"full_name":"Alvanos, Theocharis","first_name":"Theocharis","last_name":"Alvanos"},{"first_name":"Anika","full_name":"Hintze, Anika","last_name":"Hintze"},{"first_name":"Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3509-1948","full_name":"Koppensteiner, Peter","last_name":"Koppensteiner"},{"last_name":"Kleindienst","full_name":"Kleindienst, David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","first_name":"David"},{"first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto"},{"last_name":"Wichmann","first_name":"Carolin","full_name":"Wichmann, Carolin"},{"last_name":"Moser","first_name":"Tobias","full_name":"Moser, Tobias"}],"intvolume":"        41","issue":"37","department":[{"_id":"RySh"}],"page":"7742-7767","scopus_import":"1","isi":1,"ddc":["570"],"article_processing_charge":"No","type":"journal_article","month":"09","oa_version":"Published Version","doi":"10.1523/JNEUROSCI.0586-21.2021","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"15","publication_identifier":{"eissn":["1529-2401"],"issn":["0270-6474"]},"_id":"10051","volume":41,"article_type":"original"}]