[{"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"call_identifier":"FWF","name":"Taming Complexity in Partial Differential Systems","_id":"260482E2-B435-11E9-9278-68D0E5697425","grant_number":"F06504"}],"citation":{"ista":"Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378.","ama":"Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. <i>Journal of Statistical Physics</i>. 2020;178(2):319-378. doi:<a href=\"https://doi.org/10.1007/s10955-019-02434-w\">10.1007/s10955-019-02434-w</a>","ieee":"E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems,” <i>Journal of Statistical Physics</i>, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.","short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.","mla":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical Physics</i>, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:<a href=\"https://doi.org/10.1007/s10955-019-02434-w\">10.1007/s10955-019-02434-w</a>.","apa":"Carlen, E. A., &#38; Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-019-02434-w\">https://doi.org/10.1007/s10955-019-02434-w</a>","chicago":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical Physics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10955-019-02434-w\">https://doi.org/10.1007/s10955-019-02434-w</a>."},"day":"01","status":"public","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"Springer Nature","arxiv":1,"department":[{"_id":"JaMa"}],"date_updated":"2025-06-12T07:27:20Z","month":"01","language":[{"iso":"eng"}],"date_published":"2020-01-01T00:00:00Z","oa":1,"file_date_updated":"2020-07-14T12:47:28Z","isi":1,"_id":"6358","scopus_import":"1","type":"journal_article","article_type":"original","oa_version":"Published Version","intvolume":"       178","ddc":["500"],"has_accepted_license":"1","quality_controlled":"1","file":[{"file_id":"7209","checksum":"7b04befbdc0d4982c0ee945d25d19872","relation":"main_file","access_level":"open_access","file_size":905538,"date_updated":"2020-07-14T12:47:28Z","date_created":"2019-12-23T12:03:09Z","content_type":"application/pdf","file_name":"2019_JourStatistPhysics_Carlen.pdf","creator":"dernst"}],"corr_author":"1","publication":"Journal of Statistical Physics","issue":"2","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"doi":"10.1007/s10955-019-02434-w","year":"2020","date_created":"2019-04-30T07:34:18Z","title":"Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems","abstract":[{"text":"We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras.  Our settingcovers  arbitrary  skew-derivations  and  it  provides  a  unified  framework  that  simultaneously  generalizes  recently  constructed  transport  metrics  for  Markov  chains,  Lindblad  equations,  and  the  Fermi  Ornstein–Uhlenbeck  semigroup.   We  develop  a  non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature  bounds,  logarithmic  Sobolev  inequalities,  transport-entropy  inequalities,  andspectral gap estimates.","lang":"eng"}],"external_id":{"isi":["000498933300001"],"pmid":["33223567"],"arxiv":["1811.04572"]},"publication_status":"published","page":"319-378","article_processing_charge":"Yes (via OA deal)","related_material":{"link":[{"url":"https://doi.org/10.1007/s10955-020-02671-4","relation":"erratum"}]},"pmid":1,"volume":178,"author":[{"full_name":"Carlen, Eric A.","last_name":"Carlen","first_name":"Eric A."},{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","file":[{"file_id":"8549","file_size":273042,"date_updated":"2020-09-21T13:15:02Z","checksum":"8e7c42e72596f6889d786e8e8b89994f","relation":"main_file","access_level":"open_access","file_name":"2020_EJournProbab_Dareiotis.pdf","content_type":"application/pdf","date_created":"2020-09-21T13:15:02Z","creator":"dernst","success":1}],"ddc":["510"],"has_accepted_license":"1","article_number":"82","year":"2020","date_created":"2019-04-30T07:40:17Z","publication":"Electronic Journal of Probability","publication_identifier":{"eissn":["1083-6489"]},"doi":"10.1214/20-EJP479","abstract":[{"lang":"eng","text":"The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients."}],"publication_status":"published","external_id":{"isi":["000550150700001"],"arxiv":["1812.04583"]},"article_processing_charge":"No","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","volume":25,"author":[{"last_name":"Dareiotis","first_name":"Konstantinos","full_name":"Dareiotis, Konstantinos"},{"full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. <i>Electronic Journal of Probability</i>. 2020;25. doi:<a href=\"https://doi.org/10.1214/20-EJP479\">10.1214/20-EJP479</a>","ista":"Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 25, 82.","ieee":"K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift,” <i>Electronic Journal of Probability</i>, vol. 25. Institute of Mathematical Statistics, 2020.","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020).","mla":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal of Probability</i>, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:<a href=\"https://doi.org/10.1214/20-EJP479\">10.1214/20-EJP479</a>.","chicago":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2020. <a href=\"https://doi.org/10.1214/20-EJP479\">https://doi.org/10.1214/20-EJP479</a>.","apa":"Dareiotis, K., &#38; Gerencser, M. (2020). On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/20-EJP479\">https://doi.org/10.1214/20-EJP479</a>"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"16","status":"public","oa":1,"file_date_updated":"2020-09-21T13:15:02Z","isi":1,"department":[{"_id":"JaMa"}],"arxiv":1,"publisher":"Institute of Mathematical Statistics","date_updated":"2023-10-16T09:22:50Z","month":"07","language":[{"iso":"eng"}],"date_published":"2020-07-16T00:00:00Z","type":"journal_article","article_type":"original","oa_version":"Published Version","intvolume":"        25","_id":"6359","scopus_import":"1"},{"project":[{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"citation":{"apa":"Chatterjee, K., Fu, H., &#38; Novotný, P. (2020). Termination Analysis of Probabilistic Programs with Martingales. In <i>Foundations of Probabilistic Programming</i> (pp. 221–258). Cambridge University Press. <a href=\"https://doi.org/10.1017/9781108770750.008\">https://doi.org/10.1017/9781108770750.008</a>","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Petr Novotný. “Termination Analysis of Probabilistic Programs with Martingales.” In <i>Foundations of Probabilistic Programming</i>, 221–58. Cambridge University Press, 2020. <a href=\"https://doi.org/10.1017/9781108770750.008\">https://doi.org/10.1017/9781108770750.008</a>.","mla":"Chatterjee, Krishnendu, et al. “Termination Analysis of Probabilistic Programs with Martingales.” <i>Foundations of Probabilistic Programming</i>, Cambridge University Press, 2020, pp. 221–58, doi:<a href=\"https://doi.org/10.1017/9781108770750.008\">10.1017/9781108770750.008</a>.","short":"K. Chatterjee, H. Fu, P. Novotný, in:, Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–258.","ieee":"K. Chatterjee, H. Fu, and P. Novotný, “Termination Analysis of Probabilistic Programs with Martingales,” in <i>Foundations of Probabilistic Programming</i>, Cambridge University Press, 2020, pp. 221–258.","ama":"Chatterjee K, Fu H, Novotný P. Termination Analysis of Probabilistic Programs with Martingales. In: <i>Foundations of Probabilistic Programming</i>. Cambridge University Press; 2020:221-258. doi:<a href=\"https://doi.org/10.1017/9781108770750.008\">10.1017/9781108770750.008</a>","ista":"Chatterjee K, Fu H, Novotný P. 2020.Termination Analysis of Probabilistic Programs with Martingales. In: Foundations of Probabilistic Programming. , 221–258."},"day":"18","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_updated":"2025-09-23T12:10:25Z","publisher":"Cambridge University Press","department":[{"_id":"KrCh"}],"date_published":"2020-11-18T00:00:00Z","language":[{"iso":"eng"}],"month":"11","file_date_updated":"2025-09-23T12:03:09Z","oa":1,"_id":"19986","type":"book_chapter","acknowledgement":"Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN\r\nGrant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Hongfei Fu\r\nis supported by the National Natural Science Foundation of China (NSFC) Grant\r\nNo. 61802254. Petr Novotný is supported by the Czech Science Foundation grant\r\nNo. GJ19-15134Y.","oa_version":"Published Version","ddc":["000"],"has_accepted_license":"1","quality_controlled":"1","file":[{"success":1,"creator":"dernst","content_type":"application/pdf","file_name":"2020_ProbProgramming_Chatterjee.pdf","date_created":"2025-09-23T12:03:09Z","file_size":316681,"date_updated":"2025-09-23T12:03:09Z","access_level":"open_access","relation":"main_file","checksum":"28ece115e8d2d9263e253a598e7caef2","file_id":"20380"}],"corr_author":"1","publication":"Foundations of Probabilistic Programming","doi":"10.1017/9781108770750.008","publication_identifier":{"isbn":["9781108488518"],"eisbn":["9781108770750"]},"date_created":"2025-07-10T13:28:51Z","year":"2020","title":"Termination Analysis of Probabilistic Programs with Martingales","publication_status":"published","abstract":[{"text":"For non-probabilistic programs, a key question in static analysis is termination, which asks whether a given program terminates under a given initial condition. In the presence of probabilistic behaviour, there are two fundamental extensions of the termination question: (a) the almost-sure termination question, which asks whether the termination probability is 1; and (b) the bounded-time termination question, which asks whether the expected termination time is bounded. There are many active research directions to address these two questions; one important such direction is the use of martingale theory for termination analysis. In this chapter, we survey the main techniques of the martingale-based approach to the termination analysis of probabilistic programs.","lang":"eng"}],"article_processing_charge":"No","page":"221-258","OA_place":"publisher","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr","last_name":"Novotný","first_name":"Petr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"draft","external_id":{"arxiv":["2003.05478"]},"abstract":[{"text":"We prove that in the absence of topological changes, the notion of BV solutions to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical) non-uniqueness. Our approach is based on the local structure of the energy landscape near a classical evolution by mean curvature. Mean curvature flow being the gradient flow of the surface energy functional, we develop a gradient-flow analogue of the notion of calibrations. Just like the existence of a calibration guarantees that one has reached a global minimum in the energy landscape, the existence of a \"gradient flow calibration\" ensures that the route of steepest descent in the energy landscape is unique and stable.","lang":"eng"}],"oa":1,"article_processing_charge":"No","date_updated":"2026-04-08T07:01:01Z","department":[{"_id":"JuFi"}],"arxiv":1,"date_published":"2020-03-11T00:00:00Z","language":[{"iso":"eng"}],"title":"The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions","month":"03","type":"preprint","acknowledgement":"Parts of the paper were written during the visit of the authors to the Hausdorff Research Institute for Mathematics (HIM), University of Bonn, in the framework of the trimester program “Evolution of Interfaces”. The support and the hospitality of HIM are gratefully acknowledged. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385.","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Fischer, Julian L","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","last_name":"Fischer"},{"first_name":"Sebastian","last_name":"Hensel","full_name":"Hensel, Sebastian","orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Laux, Tim","first_name":"Tim","last_name":"Laux"},{"first_name":"Thilo","last_name":"Simon","full_name":"Simon, Thilo"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10007"}]},"_id":"10012","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Fischer, Julian L., et al. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” <i>ArXiv</i>, 2003.05478, doi:<a href=\"https://doi.org/10.48550/arXiv.2003.05478\">10.48550/arXiv.2003.05478</a>.","chicago":"Fischer, Julian L, Sebastian Hensel, Tim Laux, and Thilo Simon. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2003.05478\">https://doi.org/10.48550/arXiv.2003.05478</a>.","apa":"Fischer, J. L., Hensel, S., Laux, T., &#38; Simon, T. (n.d.). The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2003.05478\">https://doi.org/10.48550/arXiv.2003.05478</a>","ista":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv, 2003.05478.","ama":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2003.05478\">10.48550/arXiv.2003.05478</a>","short":"J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).","ieee":"J. L. Fischer, S. Hensel, T. Laux, and T. Simon, “The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions,” <i>arXiv</i>. ."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2003.05478"}],"article_number":"2003.05478","ec_funded":1,"date_created":"2021-09-13T12:17:11Z","year":"2020","publication":"arXiv","day":"11","status":"public","doi":"10.48550/arXiv.2003.05478"},{"corr_author":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.10962"}],"date_created":"2021-09-17T10:57:27Z","year":"2020","article_number":"2008.10962","doi":"10.48550/arXiv.2008.10962","publication":"arXiv","article_processing_charge":"No","publication_status":"draft","external_id":{"arxiv":["2008.10962"]},"abstract":[{"text":"We consider finite-volume approximations of Fokker-Planck equations on bounded convex domains in R^d and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker-Planck equation via the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalising the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.","lang":"eng"}],"title":"Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","author":[{"first_name":"Dominik L","last_name":"Forkert","full_name":"Forkert, Dominik L","id":"35C79D68-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maas","first_name":"Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan"},{"id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo","first_name":"Lorenzo","last_name":"Portinale"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"11739"},{"relation":"dissertation_contains","id":"10030","status":"public"}]},"citation":{"ista":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962.","ama":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2008.10962\">10.48550/arXiv.2008.10962</a>","ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” <i>arXiv</i>. .","short":"D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).","mla":"Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>ArXiv</i>, 2008.10962, doi:<a href=\"https://doi.org/10.48550/arXiv.2008.10962\">10.48550/arXiv.2008.10962</a>.","apa":"Forkert, D. L., Maas, J., &#38; Portinale, L. (n.d.). Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2008.10962\">https://doi.org/10.48550/arXiv.2008.10962</a>","chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2008.10962\">https://doi.org/10.48550/arXiv.2008.10962</a>."},"project":[{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"ec_funded":1,"day":"25","status":"public","oa":1,"date_published":"2020-08-25T00:00:00Z","language":[{"iso":"eng"}],"month":"08","date_updated":"2026-04-08T07:00:03Z","department":[{"_id":"JaMa"}],"arxiv":1,"oa_version":"Preprint","acknowledgement":"This work is supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and by the Austrian Science Fund (FWF), grants No F65 and W1245.","type":"preprint","_id":"10022"},{"_id":"10328","scopus_import":"1","oa_version":"None","author":[{"last_name":"Lambert","first_name":"Nicholas J.","full_name":"Lambert, Nicholas J."},{"full_name":"Mobassem, Sonia","last_name":"Mobassem","first_name":"Sonia"},{"id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R","first_name":"Alfredo R","last_name":"Rueda Sanchez"},{"first_name":"Harald G.L.","last_name":"Schwefel","full_name":"Schwefel, Harald G.L."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","month":"01","title":"New designs and noise channels in electro-optic microwave to optical up-conversion","language":[{"iso":"eng"}],"date_published":"2020-01-01T00:00:00Z","publisher":"Optica Publishing Group","department":[{"_id":"JoFi"}],"date_updated":"2023-10-18T08:32:34Z","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We discus noise channels in coherent electro-optic up-conversion between microwave and optical fields, in particular due to optical heating. We also report on a novel configuration, which promises to be flexible and highly efficient."}],"publication_status":"published","alternative_title":["OSA Technical Digest"],"doi":"10.1364/QUANTUM.2020.QTu8A.1","publication_identifier":{"isbn":["9-781-5575-2820-9"]},"publication":"OSA Quantum 2.0 Conference","day":"01","status":"public","year":"2020","date_created":"2021-11-21T23:01:31Z","article_number":"QTu8A.1","conference":{"start_date":"2020-09-14","name":"OSA: Optical Society of America","location":"Washington, DC, United States","end_date":"2020-09-17"},"citation":{"mla":"Lambert, Nicholas J., et al. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” <i>OSA Quantum 2.0 Conference</i>, QTu8A.1, Optica Publishing Group, 2020, doi:<a href=\"https://doi.org/10.1364/QUANTUM.2020.QTu8A.1\">10.1364/QUANTUM.2020.QTu8A.1</a>.","chicago":"Lambert, Nicholas J., Sonia Mobassem, Alfredo R Rueda Sanchez, and Harald G.L. Schwefel. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” In <i>OSA Quantum 2.0 Conference</i>. Optica Publishing Group, 2020. <a href=\"https://doi.org/10.1364/QUANTUM.2020.QTu8A.1\">https://doi.org/10.1364/QUANTUM.2020.QTu8A.1</a>.","apa":"Lambert, N. J., Mobassem, S., Rueda Sanchez, A. R., &#38; Schwefel, H. G. L. (2020). New designs and noise channels in electro-optic microwave to optical up-conversion. In <i>OSA Quantum 2.0 Conference</i>. Washington, DC, United States: Optica Publishing Group. <a href=\"https://doi.org/10.1364/QUANTUM.2020.QTu8A.1\">https://doi.org/10.1364/QUANTUM.2020.QTu8A.1</a>","ama":"Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. New designs and noise channels in electro-optic microwave to optical up-conversion. In: <i>OSA Quantum 2.0 Conference</i>. Optica Publishing Group; 2020. doi:<a href=\"https://doi.org/10.1364/QUANTUM.2020.QTu8A.1\">10.1364/QUANTUM.2020.QTu8A.1</a>","ista":"Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. 2020. New designs and noise channels in electro-optic microwave to optical up-conversion. OSA Quantum 2.0 Conference. OSA: Optical Society of America, OSA Technical Digest, , QTu8A.1.","ieee":"N. J. Lambert, S. Mobassem, A. R. Rueda Sanchez, and H. G. L. Schwefel, “New designs and noise channels in electro-optic microwave to optical up-conversion,” in <i>OSA Quantum 2.0 Conference</i>, Washington, DC, United States, 2020.","short":"N.J. Lambert, S. Mobassem, A.R. Rueda Sanchez, H.G.L. Schwefel, in:, OSA Quantum 2.0 Conference, Optica Publishing Group, 2020."},"quality_controlled":"1"},{"quality_controlled":"1","conference":{"location":"Virtual, United States","end_date":"2020-11-13","name":"CCS: Conference on Computer and Communications Security","start_date":"2020-11-09"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1015"}],"date_created":"2021-12-16T13:23:27Z","year":"2020","publication":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","doi":"10.1145/3372297.3423364","publication_identifier":{"isbn":["978-1-4503-7089-9"]},"external_id":{"isi":["000768470400104"]},"publication_status":"published","abstract":[{"lang":"eng","text":"In this paper, we present the first Asynchronous Distributed Key Generation (ADKG) algorithm which is also the first distributed key generation algorithm that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number of faulty parties). As a result, using our ADKG we remove the trusted setup assumption that the most scalable consensus algorithms make. In order to create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative the open question posed by Cachin et al. [7] on how to create an Asynchronous Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1<k łe 2f+1, which is of independent interest. Our High-threshold-AVSS (HAVSS) uses an asymmetric bivariate polynomial to encode the secret. This enables the reconstruction of the secret only if a set of k nodes contribute while allowing an honest node that did not participate in the sharing phase to recover his share with the help of f+1 honest parties. Once we have HAVSS we can use it to bootstrap scalable partially synchronous consensus protocols, but the question on how to get a DKG in asynchrony remains as we need a way to produce common randomness. The solution comes from a novel Eventually Perfect Common Coin (EPCC) abstraction that enables the generation of a common coin from n concurrent HAVSS invocations. EPCC's key property is that it is eventually reliable, as it might fail to agree at most f times (even if invoked a polynomial number of times). Using EPCC we implement an Eventually Efficient Asynchronous Binary Agreement (EEABA) which is optimal when the EPCC agrees and protects safety when EPCC fails. Finally, using EEABA we construct the first ADKG which has the same overhead and expected runtime as the best partially-synchronous DKG (O(n4) words, O(f) rounds). As a corollary of our ADKG, we can also create the first Validated Asynchronous Byzantine Agreement (VABA) that does not need a trusted dealer to setup threshold signatures of degree n-f. Our VABA has an overhead of expected O(n2) words and O(1) time per instance, after an initial O(n4) words and O(f) time bootstrap via ADKG."}],"article_processing_charge":"No","page":"1751–1767","title":"Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kokoris Kogias","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios"},{"first_name":"Dahlia","last_name":"Malkhi","full_name":"Malkhi, Dahlia"},{"full_name":"Spiegelman, Alexander","last_name":"Spiegelman","first_name":"Alexander"}],"citation":{"ama":"Kokoris Kogias E, Malkhi D, Spiegelman A. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>. Association for Computing Machinery; 2020:1751–1767. doi:<a href=\"https://doi.org/10.1145/3372297.3423364\">10.1145/3372297.3423364</a>","ista":"Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1751–1767.","ieee":"E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures,” in <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, Virtual, United States, 2020, pp. 1751–1767.","short":"E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767.","mla":"Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, Association for Computing Machinery, 2020, pp. 1751–1767, doi:<a href=\"https://doi.org/10.1145/3372297.3423364\">10.1145/3372297.3423364</a>.","chicago":"Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” In <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, 1751–1767. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3372297.3423364\">https://doi.org/10.1145/3372297.3423364</a>.","apa":"Kokoris Kogias, E., Malkhi, D., &#38; Spiegelman, A. (2020). Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i> (pp. 1751–1767). Virtual, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3372297.3423364\">https://doi.org/10.1145/3372297.3423364</a>"},"day":"30","status":"public","oa":1,"isi":1,"date_updated":"2025-07-10T11:49:52Z","publisher":"Association for Computing Machinery","department":[{"_id":"ElKo"}],"date_published":"2020-10-30T00:00:00Z","language":[{"iso":"eng"}],"month":"10","acknowledgement":"We would like to thank Ittai Abraham for the discussions and guidance during the initial conception of the project, especially for HAVSS. Furthermore, we would like to thank the anonymous reviewers for pointing out the relevance of this work to MPC protocols.","type":"conference","oa_version":"Preprint","scopus_import":"1","_id":"10556"},{"main_file_link":[{"url":"https://patents.google.com/patent/US10581613B2/en","open_access":"1"}],"citation":{"mla":"Ford, Bryan, et al. <i>Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards Links and Associated Systems and Methods</i>. 2020.","chicago":"Ford, Bryan, Linus Gasse, Eleftherios Kokoris Kogias, and Philipp Jovanovic. “Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards Links and Associated Systems and Methods,” 2020.","apa":"Ford, B., Gasse, L., Kokoris Kogias, E., &#38; Jovanovic, P. (2020). Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.","ista":"Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. 2020. Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.","ama":"Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods. 2020.","short":"B. Ford, L. Gasse, E. Kokoris Kogias, P. Jovanovic, (2020).","ieee":"B. Ford, L. Gasse, E. Kokoris Kogias, and P. Jovanovic, “Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.” 2020."},"ipn":"10581613","status":"public","day":"03","application_date":"2017-06-09","date_created":"2021-12-16T13:28:59Z","year":"2020","date_updated":"2021-12-21T10:04:50Z","department":[{"_id":"ElKo"}],"date_published":"2020-03-03T00:00:00Z","month":"03","title":"Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods","abstract":[{"lang":"eng","text":"Data storage and retrieval systems, methods, and computer-readable media utilize a cryptographically verifiable data structure that facilitates verification of a transaction in a decentralized peer-to-peer environment using multi-hop backwards and forwards links. Backward links are cryptographic hashes of past records. Forward links are cryptographic signatures of future records that are added retroactively to records once the target block has been appended to the data structure."}],"oa":1,"article_processing_charge":"No","ipc":" H04L9/3247 ; G06Q20/29 ; G06Q20/382 ; H04L9/3236","publication_date":"2020-03-03","related_material":{"link":[{"url":"https://patents.google.com/patent/US20180359096A1/en","relation":"earlier_version"}]},"_id":"10557","applicant":["Ecole Polytechnique Federale de Lausanne"],"type":"patent","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Bryan","last_name":"Ford","full_name":"Ford, Bryan"},{"first_name":"Linus","last_name":"Gasse","full_name":"Gasse, Linus"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Jovanovic, Philipp","last_name":"Jovanovic","first_name":"Philipp"}],"oa_version":"Published Version","extern":"1"},{"author":[{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Learning representations for binary-classification without backpropagation","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","article_processing_charge":"No","publication_status":"published","abstract":[{"text":"The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity.","lang":"eng"}],"publication":"8th International Conference on Learning Representations","date_created":"2022-01-25T15:50:00Z","year":"2020","has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Bke61krFvS"}],"ddc":["000"],"conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2020-04-26","location":"Virtual ; Addis Ababa, Ethiopia","end_date":"2020-05-01"},"corr_author":"1","file":[{"date_created":"2022-01-26T07:35:17Z","file_name":"iclr_2020.pdf","content_type":"application/pdf","success":1,"creator":"mlechner","file_id":"10677","access_level":"open_access","relation":"main_file","checksum":"ea13d42dd4541ddb239b6a75821fd6c9","date_updated":"2022-01-26T07:35:17Z","file_size":249431}],"quality_controlled":"1","scopus_import":"1","_id":"10672","oa_version":"Published Version","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","type":"conference","date_published":"2020-03-11T00:00:00Z","language":[{"iso":"eng"}],"month":"03","date_updated":"2025-04-15T06:25:56Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"ICLR","file_date_updated":"2022-01-26T07:35:17Z","oa":1,"day":"11","status":"public","tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"citation":{"mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” <i>8th International Conference on Learning Representations</i>, ICLR, 2020.","apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In <i>8th International Conference on Learning Representations</i>. Virtual ; Addis Ababa, Ethiopia: ICLR.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In <i>8th International Conference on Learning Representations</i>. ICLR, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: <i>8th International Conference on Learning Representations</i>. ICLR; 2020.","short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in <i>8th International Conference on Learning Representations</i>, Virtual ; Addis Ababa, Ethiopia, 2020."},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}]},{"acknowledgement":"RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n","type":"conference","oa_version":"Published Version","scopus_import":"1","_id":"10673","file_date_updated":"2022-01-26T11:08:51Z","oa":1,"date_updated":"2025-04-15T06:25:56Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_published":"2020-01-01T00:00:00Z","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"series_title":"PMLR","status":"public","alternative_title":["PMLR"],"project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"citation":{"apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (pp. 4082–4093). Virtual.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 4082–93. PMLR, 2020.","mla":"Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, 2020, pp. 4082–93.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Virtual, 2020, pp. 4082–4093.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. PMLR. ; 2020:4082-4093."},"author":[{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"published","abstract":[{"text":"We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level.","lang":"eng"}],"article_processing_charge":"No","page":"4082-4093","title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","date_created":"2022-01-25T15:50:34Z","year":"2020","publication":"Proceedings of the 37th International Conference on Machine Learning","publication_identifier":{"issn":["2640-3498"]},"file":[{"success":1,"creator":"cchlebak","content_type":"application/pdf","file_name":"2020_PMLR_Hasani.pdf","date_created":"2022-01-26T11:08:51Z","date_updated":"2022-01-26T11:08:51Z","file_size":2329798,"access_level":"open_access","relation":"main_file","checksum":"c9a4a29161777fc1a89ef451c040e3b1","file_id":"10691"}],"quality_controlled":"1","conference":{"start_date":"2020-07-12","name":"ML: Machine Learning","end_date":"2020-07-18","location":"Virtual"},"ddc":["000"],"has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}]},{"publisher":"Springer Nature","department":[{"_id":"HeEd"}],"date_updated":"2025-04-14T07:44:03Z","language":[{"iso":"eng"}],"month":"03","date_published":"2020-03-01T00:00:00Z","oa":1,"file_date_updated":"2020-11-20T10:18:02Z","_id":"7567","scopus_import":"1","type":"journal_article","article_type":"original","intvolume":"        14","oa_version":"Published Version","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"citation":{"ieee":"A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” <i>Mathematics in Computer Science</i>, vol. 14. Springer Nature, pp. 141–176, 2020.","short":"A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176.","ama":"Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. <i>Mathematics in Computer Science</i>. 2020;14:141-176. doi:<a href=\"https://doi.org/10.1007/s11786-020-00461-5\">10.1007/s11786-020-00461-5</a>","ista":"Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176.","chicago":"Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” <i>Mathematics in Computer Science</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11786-020-00461-5\">https://doi.org/10.1007/s11786-020-00461-5</a>.","apa":"Choudhary, A., Kachanovich, S., &#38; Wintraecken, M. (2020). Coxeter triangulations have good quality. <i>Mathematics in Computer Science</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11786-020-00461-5\">https://doi.org/10.1007/s11786-020-00461-5</a>","mla":"Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” <i>Mathematics in Computer Science</i>, vol. 14, Springer Nature, 2020, pp. 141–76, doi:<a href=\"https://doi.org/10.1007/s11786-020-00461-5\">10.1007/s11786-020-00461-5</a>."},"status":"public","day":"01","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"Coxeter triangulations have good quality","abstract":[{"lang":"eng","text":"Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space."}],"publication_status":"published","page":"141-176","article_processing_charge":"Yes (via OA deal)","volume":14,"author":[{"full_name":"Choudhary, Aruni","last_name":"Choudhary","first_name":"Aruni"},{"last_name":"Kachanovich","first_name":"Siargey","full_name":"Kachanovich, Siargey"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"has_accepted_license":"1","quality_controlled":"1","file":[{"date_created":"2020-11-20T10:18:02Z","file_name":"2020_MathCompScie_Choudhary.pdf","content_type":"application/pdf","success":1,"creator":"dernst","file_id":"8783","access_level":"open_access","checksum":"1d145f3ab50ccee735983cb89236e609","relation":"main_file","date_updated":"2020-11-20T10:18:02Z","file_size":872275}],"corr_author":"1","publication":"Mathematics in Computer Science","doi":"10.1007/s11786-020-00461-5","publication_identifier":{"issn":["1661-8270"],"eissn":["1661-8289"]},"year":"2020","date_created":"2020-03-05T13:30:18Z"},{"date_published":"2020-02-25T00:00:00Z","month":"02","language":[{"iso":"eng"}],"date_updated":"2026-04-08T07:25:08Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"publisher":"Public Library of Science","isi":1,"file_date_updated":"2020-07-14T12:48:00Z","oa":1,"scopus_import":"1","_id":"7569","oa_version":"Published Version","intvolume":"        16","article_type":"original","type":"journal_article","citation":{"mla":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” <i>PLOS Computational Biology</i>, vol. 16, no. 2, e1007642, Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">10.1371/journal.pcbi.1007642</a>.","apa":"Grah, R., &#38; Friedlander, T. (2020). The relation between crosstalk and gene regulation form revisited. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">https://doi.org/10.1371/journal.pcbi.1007642</a>","chicago":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” <i>PLOS Computational Biology</i>. Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">https://doi.org/10.1371/journal.pcbi.1007642</a>.","ista":"Grah R, Friedlander T. 2020. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 16(2), e1007642.","ama":"Grah R, Friedlander T. The relation between crosstalk and gene regulation form revisited. <i>PLOS Computational Biology</i>. 2020;16(2). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642\">10.1371/journal.pcbi.1007642</a>","short":"R. Grah, T. Friedlander, PLOS Computational Biology 16 (2020).","ieee":"R. Grah and T. Friedlander, “The relation between crosstalk and gene regulation form revisited,” <i>PLOS Computational Biology</i>, vol. 16, no. 2. Public Library of Science, 2020."},"day":"25","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"The relation between crosstalk and gene regulation form revisited","article_processing_charge":"No","publication_status":"published","external_id":{"pmid":["32097416"],"isi":["000526725200019"]},"abstract":[{"lang":"eng","text":"Genes differ in the frequency at which they are expressed and in the form of regulation used to control their activity. In particular, positive or negative regulation can lead to activation of a gene in response to an external signal. Previous works proposed that the form of regulation of a gene correlates with its frequency of usage: positive regulation when the gene is frequently expressed and negative regulation when infrequently expressed. Such network design means that, in the absence of their regulators, the genes are found in their least required activity state, hence regulatory intervention is often necessary. Due to the multitude of genes and regulators, spurious binding and unbinding events, called “crosstalk”, could occur. To determine how the form of regulation affects the global crosstalk in the network, we used a mathematical model that includes multiple regulators and multiple target genes. We found that crosstalk depends non-monotonically on the availability of regulators. Our analysis showed that excess use of regulation entailed by the formerly suggested network design caused high crosstalk levels in a large part of the parameter space. We therefore considered the opposite ‘idle’ design, where the default unregulated state of genes is their frequently required activity state. We found, that ‘idle’ design minimized the use of regulation and thus minimized crosstalk. In addition, we estimated global crosstalk of S. cerevisiae using transcription factors binding data. We demonstrated that even partial network data could suffice to estimate its global crosstalk, suggesting its applicability to additional organisms. We found that S. cerevisiae estimated crosstalk is lower than that of a random network, suggesting that natural selection reduces crosstalk. In summary, our study highlights a new type of protein production cost which is typically overlooked: that of regulatory interference caused by the presence of excess regulators in the cell. It demonstrates the importance of whole-network descriptions, which could show effects missed by single-gene models."}],"pmid":1,"related_material":{"record":[{"relation":"research_data","id":"9716","status":"deleted"},{"relation":"research_data","id":"9776","status":"public"},{"status":"public","id":"9779","relation":"research_data"},{"id":"9777","relation":"research_data","status":"public"},{"status":"public","relation":"dissertation_contains","id":"8155"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Grah, Rok","orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","last_name":"Grah","first_name":"Rok"},{"first_name":"Tamar","last_name":"Friedlander","full_name":"Friedlander, Tamar"}],"volume":16,"has_accepted_license":"1","ddc":["000","570"],"quality_controlled":"1","file":[{"file_id":"7579","access_level":"open_access","checksum":"5239dd134dc6e1c71fe7b3ce2953da37","relation":"main_file","file_size":2209325,"date_updated":"2020-07-14T12:48:00Z","date_created":"2020-03-09T15:12:21Z","content_type":"application/pdf","file_name":"2020_PlosCompBio_Grah.pdf","creator":"dernst"}],"publication_identifier":{"issn":["1553-7358"]},"doi":"10.1371/journal.pcbi.1007642","issue":"2","publication":"PLOS Computational Biology","date_created":"2020-03-06T07:39:38Z","year":"2020","article_number":"e1007642"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"04","status":"public","citation":{"mla":"Michailidis, Alexios, et al. “Slow Quantum Thermalization and Many-Body Revivals from Mixed Phase Space.” <i>Physical Review X</i>, vol. 10, no. 1, 011055, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/physrevx.10.011055\">10.1103/physrevx.10.011055</a>.","chicago":"Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Slow Quantum Thermalization and Many-Body Revivals from Mixed Phase Space.” <i>Physical Review X</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/physrevx.10.011055\">https://doi.org/10.1103/physrevx.10.011055</a>.","apa":"Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., &#38; Serbyn, M. (2020). Slow quantum thermalization and many-body revivals from mixed phase space. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevx.10.011055\">https://doi.org/10.1103/physrevx.10.011055</a>","ama":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Slow quantum thermalization and many-body revivals from mixed phase space. <i>Physical Review X</i>. 2020;10(1). doi:<a href=\"https://doi.org/10.1103/physrevx.10.011055\">10.1103/physrevx.10.011055</a>","ista":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Slow quantum thermalization and many-body revivals from mixed phase space. Physical Review X. 10(1), 011055.","short":"A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review X 10 (2020).","ieee":"A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Slow quantum thermalization and many-body revivals from mixed phase space,” <i>Physical Review X</i>, vol. 10, no. 1. American Physical Society, 2020."},"type":"journal_article","article_type":"original","intvolume":"        10","oa_version":"Published Version","_id":"7570","scopus_import":"1","oa":1,"file_date_updated":"2020-07-14T12:48:00Z","isi":1,"arxiv":1,"publisher":"American Physical Society","department":[{"_id":"MaSe"}],"date_updated":"2023-08-18T07:01:07Z","language":[{"iso":"eng"}],"month":"03","date_published":"2020-03-04T00:00:00Z","article_number":"011055","year":"2020","date_created":"2020-03-08T18:02:01Z","publication":"Physical Review X","issue":"1","doi":"10.1103/physrevx.10.011055","publication_identifier":{"issn":["2160-3308"]},"file":[{"creator":"dernst","date_created":"2020-03-12T12:13:07Z","file_name":"2020_PhysicalReviewX_Michailidis.pdf","content_type":"application/pdf","checksum":"4b3f2c13873d35230173c73d0e11c408","relation":"main_file","access_level":"open_access","file_size":17828638,"date_updated":"2020-07-14T12:48:00Z","file_id":"7581"}],"quality_controlled":"1","ddc":["530"],"has_accepted_license":"1","volume":10,"author":[{"last_name":"Michailidis","first_name":"Alexios","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8443-1064","full_name":"Michailidis, Alexios"},{"full_name":"Turner, C. J.","first_name":"C. J.","last_name":"Turner"},{"last_name":"Papić","first_name":"Z.","full_name":"Papić, Z."},{"full_name":"Abanin, D. A.","first_name":"D. A.","last_name":"Abanin"},{"full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","last_name":"Serbyn"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"link":[{"url":"https://ist.ac.at/en/news/classical-physics-helps-predict-fate-of-interacting-quantum-systems/","relation":"press_release","description":"News on IST Homepage"}]},"abstract":[{"text":"The relaxation of few-body quantum systems can strongly depend on the initial state when the system’s semiclassical phase space is mixed; i.e., regions of chaotic motion coexist with regular islands. In recent years, there has been much effort to understand the process of thermalization in strongly interacting quantum systems that often lack an obvious semiclassical limit. The time-dependent variational principle (TDVP) allows one to systematically derive an effective classical (nonlinear) dynamical system by projecting unitary many-body dynamics onto a manifold of weakly entangled variational states. We demonstrate that such dynamical systems generally possess mixed phase space. When TDVP errors are small, the mixed phase space leaves a footprint on the exact dynamics of the quantum model. For example, when the system is initialized in a state belonging to a stable periodic orbit or the surrounding regular region, it exhibits persistent many-body quantum revivals. As a proof of principle, we identify new types of “quantum many-body scars,” i.e., initial states that lead to long-time oscillations in a model of interacting Rydberg atoms in one and two dimensions. Intriguingly, the initial states that give rise to most robust revivals are typically entangled states. On the other hand, even when TDVP errors are large, as in the thermalizing tilted-field Ising model, initializing the system in a regular region of phase space leads to a surprising slowdown of thermalization. Our work establishes TDVP as a method for identifying interacting quantum systems with anomalous dynamics in arbitrary dimensions. Moreover, the mixed phase space classical variational equations allow one to find slowly thermalizing initial conditions in interacting models. Our results shed light on a link between classical and quantum chaos, pointing toward possible extensions of the classical Kolmogorov-Arnold-Moser theorem to quantum systems.","lang":"eng"}],"publication_status":"published","external_id":{"arxiv":["1905.08564"],"isi":["000517969300001"]},"article_processing_charge":"No","title":"Slow quantum thermalization and many-body revivals from mixed phase space"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/839571"}],"quality_controlled":"1","publication":"Methods in Cell Biology","publication_identifier":{"issn":["0091-679X"]},"doi":"10.1016/bs.mcb.2020.01.006","year":"2020","date_created":"2020-03-08T23:00:47Z","title":"Computational analysis of filament polymerization dynamics in cytoskeletal networks","abstract":[{"lang":"eng","text":"The polymerization–depolymerization dynamics of cytoskeletal proteins play essential roles in the self-organization of cytoskeletal structures, in eukaryotic as well as prokaryotic cells. While advances in fluorescence microscopy and in vitro reconstitution experiments have helped to study the dynamic properties of these complex systems, methods that allow to collect and analyze large quantitative datasets of the underlying polymer dynamics are still missing. Here, we present a novel image analysis workflow to study polymerization dynamics of active filaments in a nonbiased, highly automated manner. Using treadmilling filaments of the bacterial tubulin FtsZ as an example, we demonstrate that our method is able to specifically detect, track and analyze growth and shrinkage of polymers, even in dense networks of filaments. We believe that this automated method can facilitate the analysis of a large variety of dynamic cytoskeletal systems, using standard time-lapse movies obtained from experiments in vitro as well as in the living cell. Moreover, we provide scripts implementing this method as supplementary material."}],"publication_status":"published","external_id":{"isi":["000611826500008"]},"page":"145-161","article_processing_charge":"No","related_material":{"record":[{"relation":"part_of_dissertation","id":"8358","status":"public"}]},"volume":158,"editor":[{"full_name":"Tran, Phong ","last_name":"Tran","first_name":"Phong "}],"author":[{"full_name":"Dos Santos Caldas, Paulo R","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6730-4461","last_name":"Dos Santos Caldas","first_name":"Paulo R"},{"full_name":"Radler, Philipp","orcid":"0000-0001-9198-2182 ","id":"40136C2A-F248-11E8-B48F-1D18A9856A87","last_name":"Radler","first_name":"Philipp"},{"last_name":"Sommer","first_name":"Christoph M","orcid":"0000-0003-1216-9105","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","full_name":"Sommer, Christoph M"},{"orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","full_name":"Loose, Martin","last_name":"Loose","first_name":"Martin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","name":"Self-Organization of the Bacterial Cell","_id":"2595697A-B435-11E9-9278-68D0E5697425","grant_number":"679239"},{"name":"Reconstitution of Bacterial Cell Division Using Purified Components","_id":"260D98C8-B435-11E9-9278-68D0E5697425"}],"citation":{"apa":"Dos Santos Caldas, P. R., Radler, P., Sommer, C. M., &#38; Loose, M. (2020). Computational analysis of filament polymerization dynamics in cytoskeletal networks. In P. Tran (Ed.), <i>Methods in Cell Biology</i> (Vol. 158, pp. 145–161). Elsevier. <a href=\"https://doi.org/10.1016/bs.mcb.2020.01.006\">https://doi.org/10.1016/bs.mcb.2020.01.006</a>","chicago":"Dos Santos Caldas, Paulo R, Philipp Radler, Christoph M Sommer, and Martin Loose. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” In <i>Methods in Cell Biology</i>, edited by Phong  Tran, 158:145–61. Elsevier, 2020. <a href=\"https://doi.org/10.1016/bs.mcb.2020.01.006\">https://doi.org/10.1016/bs.mcb.2020.01.006</a>.","mla":"Dos Santos Caldas, Paulo R., et al. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” <i>Methods in Cell Biology</i>, edited by Phong  Tran, vol. 158, Elsevier, 2020, pp. 145–61, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.01.006\">10.1016/bs.mcb.2020.01.006</a>.","short":"P.R. Dos Santos Caldas, P. Radler, C.M. Sommer, M. Loose, in:, P. Tran (Ed.), Methods in Cell Biology, Elsevier, 2020, pp. 145–161.","ieee":"P. R. Dos Santos Caldas, P. Radler, C. M. Sommer, and M. Loose, “Computational analysis of filament polymerization dynamics in cytoskeletal networks,” in <i>Methods in Cell Biology</i>, vol. 158, P. Tran, Ed. Elsevier, 2020, pp. 145–161.","ista":"Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. 2020.Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Methods in Cell Biology. Methods in Cell Biology, vol. 158, 145–161.","ama":"Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Tran P, ed. <i>Methods in Cell Biology</i>. Vol 158. Elsevier; 2020:145-161. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.01.006\">10.1016/bs.mcb.2020.01.006</a>"},"day":"27","status":"public","alternative_title":["Methods in Cell Biology"],"ec_funded":1,"department":[{"_id":"MaLo"}],"publisher":"Elsevier","date_updated":"2026-04-08T07:26:30Z","language":[{"iso":"eng"}],"month":"02","date_published":"2020-02-27T00:00:00Z","oa":1,"isi":1,"_id":"7572","scopus_import":"1","type":"book_chapter","intvolume":"       158","oa_version":"Preprint"},{"ec_funded":1,"status":"public","day":"01","project":[{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"F06504","_id":"260482E2-B435-11E9-9278-68D0E5697425","name":"Taming Complexity in Partial Differential Systems","call_identifier":"FWF"},{"grant_number":"W1245","_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and dispersion in nonlinear partial differential equations","call_identifier":"FWF"}],"citation":{"mla":"Gladbach, Peter, et al. “Homogenisation of One-Dimensional Discrete Optimal Transport.” <i>Journal de Mathematiques Pures et Appliquees</i>, vol. 139, no. 7, Elsevier, 2020, pp. 204–34, doi:<a href=\"https://doi.org/10.1016/j.matpur.2020.02.008\">10.1016/j.matpur.2020.02.008</a>.","apa":"Gladbach, P., Kopfer, E., Maas, J., &#38; Portinale, L. (2020). Homogenisation of one-dimensional discrete optimal transport. <i>Journal de Mathematiques Pures et Appliquees</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.matpur.2020.02.008\">https://doi.org/10.1016/j.matpur.2020.02.008</a>","chicago":"Gladbach, Peter, Eva Kopfer, Jan Maas, and Lorenzo Portinale. “Homogenisation of One-Dimensional Discrete Optimal Transport.” <i>Journal de Mathematiques Pures et Appliquees</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.matpur.2020.02.008\">https://doi.org/10.1016/j.matpur.2020.02.008</a>.","ista":"Gladbach P, Kopfer E, Maas J, Portinale L. 2020. Homogenisation of one-dimensional discrete optimal transport. Journal de Mathematiques Pures et Appliquees. 139(7), 204–234.","ama":"Gladbach P, Kopfer E, Maas J, Portinale L. Homogenisation of one-dimensional discrete optimal transport. <i>Journal de Mathematiques Pures et Appliquees</i>. 2020;139(7):204-234. doi:<a href=\"https://doi.org/10.1016/j.matpur.2020.02.008\">10.1016/j.matpur.2020.02.008</a>","ieee":"P. Gladbach, E. Kopfer, J. Maas, and L. Portinale, “Homogenisation of one-dimensional discrete optimal transport,” <i>Journal de Mathematiques Pures et Appliquees</i>, vol. 139, no. 7. Elsevier, pp. 204–234, 2020.","short":"P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Journal de Mathematiques Pures et Appliquees 139 (2020) 204–234."},"type":"journal_article","acknowledgement":"J.M. gratefully acknowledges support by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 716117). J.M. and L.P. also acknowledge support from the Austrian Science Fund (FWF), grants No F65 and W1245. E.K. gratefully acknowledges support by the German Research Foundation through the Hausdorff Center for Mathematics and the Collaborative Research Center 1060. P.G. is partially funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 350398276.","article_type":"original","oa_version":"Preprint","intvolume":"       139","_id":"7573","scopus_import":"1","oa":1,"isi":1,"arxiv":1,"publisher":"Elsevier","department":[{"_id":"JaMa"}],"date_updated":"2026-04-08T07:00:03Z","month":"07","language":[{"iso":"eng"}],"date_published":"2020-07-01T00:00:00Z","year":"2020","date_created":"2020-03-08T23:00:47Z","publication":"Journal de Mathematiques Pures et Appliquees","issue":"7","publication_identifier":{"issn":["0021-7824"]},"doi":"10.1016/j.matpur.2020.02.008","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1905.05757","open_access":"1"}],"volume":139,"author":[{"last_name":"Gladbach","first_name":"Peter","full_name":"Gladbach, Peter"},{"last_name":"Kopfer","first_name":"Eva","full_name":"Kopfer, Eva"},{"full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","first_name":"Jan"},{"first_name":"Lorenzo","last_name":"Portinale","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10030"}]},"abstract":[{"text":"This paper deals with dynamical optimal transport metrics defined by spatial discretisation of the Benamou–Benamou formula for the Kantorovich metric . Such metrics appear naturally in discretisations of -gradient flow formulations for dissipative PDE. However, it has recently been shown that these metrics do not in general converge to , unless strong geometric constraints are imposed on the discrete mesh. In this paper we prove that, in a 1-dimensional periodic setting, discrete transport metrics converge to a limiting transport metric with a non-trivial effective mobility. This mobility depends sensitively on the geometry of the mesh and on the non-local mobility at the discrete level. Our result quantifies to what extent discrete transport can make use of microstructure in the mesh to reduce the cost of transport.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["000539439400008"],"arxiv":["1905.05757"]},"page":"204-234","article_processing_charge":"No","title":"Homogenisation of one-dimensional discrete optimal transport"},{"date_created":"2020-03-12T05:32:26Z","year":"2020","publication":"Proceedings of the National Academy of Sciences of the United States of America","doi":"10.1073/pnas.1921027117","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"issue":"12","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/776567"}],"volume":117,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-1365-5631","id":"2A58201A-F248-11E8-B48F-1D18A9856A87","full_name":"Bezeljak, Urban","last_name":"Bezeljak","first_name":"Urban"},{"full_name":"Loya, Hrushikesh","first_name":"Hrushikesh","last_name":"Loya"},{"id":"36FA4AFA-F248-11E8-B48F-1D18A9856A87","full_name":"Kaczmarek, Beata M","first_name":"Beata M","last_name":"Kaczmarek"},{"last_name":"Saunders","first_name":"Timothy E.","full_name":"Saunders, Timothy E."},{"first_name":"Martin","last_name":"Loose","orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","full_name":"Loose, Martin"}],"pmid":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"8341","status":"public"}],"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/proteins-as-molecular-switches/","description":"News on IST Homepage"}]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"external_id":{"pmid":["32161136"],"isi":["000521821800040"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The eukaryotic endomembrane system is controlled by small GTPases of the Rab family, which are activated at defined times and locations in a switch-like manner. While this switch is well understood for an individual protein, how regulatory networks produce intracellular activity patterns is currently not known. Here, we combine in vitro reconstitution experiments with computational modeling to study a minimal Rab5 activation network. We find that the molecular interactions in this system give rise to a positive feedback and bistable collective switching of Rab5. Furthermore, we find that switching near the critical point is intrinsically stochastic and provide evidence that controlling the inactive population of Rab5 on the membrane can shape the network response. Notably, we demonstrate that collective switching can spread on the membrane surface as a traveling wave of Rab5 activation. Together, our findings reveal how biochemical signaling networks control vesicle trafficking pathways and how their nonequilibrium properties define the spatiotemporal organization of the cell."}],"article_processing_charge":"No","page":"6504-6549","title":"Stochastic activation and bistability in a Rab GTPase regulatory network","status":"public","day":"24","project":[{"name":"Reconstitution of cell polarity and axis determination in a cell-free system","grant_number":"RGY0083/2016","_id":"2599F062-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"U. Bezeljak, H. Loya, B.M. Kaczmarek, T.E. Saunders, M. Loose, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 6504–6549.","ieee":"U. Bezeljak, H. Loya, B. M. Kaczmarek, T. E. Saunders, and M. Loose, “Stochastic activation and bistability in a Rab GTPase regulatory network,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 12. National Academy of Sciences, pp. 6504–6549, 2020.","ista":"Bezeljak U, Loya H, Kaczmarek BM, Saunders TE, Loose M. 2020. Stochastic activation and bistability in a Rab GTPase regulatory network. Proceedings of the National Academy of Sciences of the United States of America. 117(12), 6504–6549.","ama":"Bezeljak U, Loya H, Kaczmarek BM, Saunders TE, Loose M. Stochastic activation and bistability in a Rab GTPase regulatory network. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2020;117(12):6504-6549. doi:<a href=\"https://doi.org/10.1073/pnas.1921027117\">10.1073/pnas.1921027117</a>","chicago":"Bezeljak, Urban, Hrushikesh Loya, Beata M Kaczmarek, Timothy E. Saunders, and Martin Loose. “Stochastic Activation and Bistability in a Rab GTPase Regulatory Network.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.1921027117\">https://doi.org/10.1073/pnas.1921027117</a>.","apa":"Bezeljak, U., Loya, H., Kaczmarek, B. M., Saunders, T. E., &#38; Loose, M. (2020). Stochastic activation and bistability in a Rab GTPase regulatory network. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1921027117\">https://doi.org/10.1073/pnas.1921027117</a>","mla":"Bezeljak, Urban, et al. “Stochastic Activation and Bistability in a Rab GTPase Regulatory Network.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 12, National Academy of Sciences, 2020, pp. 6504–49, doi:<a href=\"https://doi.org/10.1073/pnas.1921027117\">10.1073/pnas.1921027117</a>."},"type":"journal_article","oa_version":"Preprint","intvolume":"       117","article_type":"original","scopus_import":"1","_id":"7580","oa":1,"isi":1,"date_updated":"2026-04-08T07:24:55Z","publisher":"National Academy of Sciences","department":[{"_id":"MaLo"},{"_id":"CaBe"}],"date_published":"2020-03-24T00:00:00Z","language":[{"iso":"eng"}],"month":"03"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Moturu, Taraka Ramji","first_name":"Taraka Ramji","last_name":"Moturu"},{"last_name":"Sinha","first_name":"Sansrity","full_name":"Sinha, Sansrity"},{"first_name":"Hymavathi","last_name":"Salava","full_name":"Salava, Hymavathi"},{"full_name":"Thula, Sravankumar","first_name":"Sravankumar","last_name":"Thula"},{"last_name":"Nodzyński","first_name":"Tomasz","full_name":"Nodzyński, Tomasz"},{"full_name":"Vařeková, Radka Svobodová","first_name":"Radka Svobodová","last_name":"Vařeková"},{"first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"},{"first_name":"Sibu","last_name":"Simon","full_name":"Simon, Sibu","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1998-6741"}],"volume":9,"pmid":1,"article_processing_charge":"No","abstract":[{"text":"Small RNAs (smRNA, 19–25 nucleotides long), which are transcribed by RNA polymerase II, regulate the expression of genes involved in a multitude of processes in eukaryotes. miRNA biogenesis and the proteins involved in the biogenesis pathway differ across plant and animal lineages. The major proteins constituting the biogenesis pathway, namely, the Dicers (DCL/DCR) and Argonautes (AGOs), have been extensively studied. However, the accessory proteins (DAWDLE (DDL), SERRATE (SE), and TOUGH (TGH)) of the pathway that differs across the two lineages remain largely uncharacterized. We present the first detailed report on the molecular evolution and divergence of these proteins across eukaryotes. Although DDL is present in eukaryotes and prokaryotes, SE and TGH appear to be specific to eukaryotes. The addition/deletion of specific domains and/or domain-specific sequence divergence in the three proteins points to the observed functional divergence of these proteins across the two lineages, which correlates with the differences in miRNA length across the two lineages. Our data enhance the current understanding of the structure–function relationship of these proteins and reveals previous unexplored crucial residues in the three proteins that can be used as a basis for further functional characterization. The data presented here on the number of miRNAs in crown eukaryotic lineages are consistent with the notion of the expansion of the number of miRNA-coding genes in animal and plant lineages correlating with organismal complexity. Whether this difference in functionally correlates with the diversification (or presence/absence) of the three proteins studied here or the miRNA signaling in the plant and animal lineages is unclear. Based on our results of the three proteins studied here and previously available data concerning the evolution of miRNA genes in the plant and animal lineages, we believe that miRNAs probably evolved once in the ancestor to crown eukaryotes and have diversified independently in the eukaryotes.","lang":"eng"}],"publication_status":"published","external_id":{"pmid":["32121542"],"isi":["000525315000035"]},"title":"Molecular evolution and diversification of proteins involved in miRNA maturation pathway","year":"2020","date_created":"2020-03-15T23:00:52Z","article_number":"299","issue":"3","doi":"10.3390/plants9030299","publication_identifier":{"eissn":["2223-7747"]},"publication":"Plants","corr_author":"1","file":[{"relation":"main_file","checksum":"6d5af3e17266a48996b4af4e67e88a85","access_level":"open_access","file_size":2373484,"date_updated":"2020-07-14T12:48:00Z","file_id":"7614","creator":"dernst","date_created":"2020-03-23T13:37:00Z","file_name":"2020_Plants_Moturu.pdf","content_type":"application/pdf"}],"quality_controlled":"1","has_accepted_license":"1","ddc":["580"],"article_type":"original","intvolume":"         9","oa_version":"Published Version","type":"journal_article","_id":"7582","scopus_import":"1","isi":1,"oa":1,"file_date_updated":"2020-07-14T12:48:00Z","month":"03","language":[{"iso":"eng"}],"date_published":"2020-03-01T00:00:00Z","department":[{"_id":"JiFr"}],"publisher":"MDPI","date_updated":"2026-04-02T14:35:47Z","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","day":"01","citation":{"ieee":"T. R. Moturu <i>et al.</i>, “Molecular evolution and diversification of proteins involved in miRNA maturation pathway,” <i>Plants</i>, vol. 9, no. 3. MDPI, 2020.","short":"T.R. Moturu, S. Sinha, H. Salava, S. Thula, T. Nodzyński, R.S. Vařeková, J. Friml, S. Simon, Plants 9 (2020).","ama":"Moturu TR, Sinha S, Salava H, et al. Molecular evolution and diversification of proteins involved in miRNA maturation pathway. <i>Plants</i>. 2020;9(3). doi:<a href=\"https://doi.org/10.3390/plants9030299\">10.3390/plants9030299</a>","ista":"Moturu TR, Sinha S, Salava H, Thula S, Nodzyński T, Vařeková RS, Friml J, Simon S. 2020. Molecular evolution and diversification of proteins involved in miRNA maturation pathway. Plants. 9(3), 299.","apa":"Moturu, T. R., Sinha, S., Salava, H., Thula, S., Nodzyński, T., Vařeková, R. S., … Simon, S. (2020). Molecular evolution and diversification of proteins involved in miRNA maturation pathway. <i>Plants</i>. MDPI. <a href=\"https://doi.org/10.3390/plants9030299\">https://doi.org/10.3390/plants9030299</a>","chicago":"Moturu, Taraka Ramji, Sansrity Sinha, Hymavathi Salava, Sravankumar Thula, Tomasz Nodzyński, Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and Diversification of Proteins Involved in MiRNA Maturation Pathway.” <i>Plants</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/plants9030299\">https://doi.org/10.3390/plants9030299</a>.","mla":"Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of Proteins Involved in MiRNA Maturation Pathway.” <i>Plants</i>, vol. 9, no. 3, 299, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/plants9030299\">10.3390/plants9030299</a>."},"project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7"}]},{"citation":{"short":"S. Weinert, N. Gimber, D. Deuschel, T. Stuhlmann, D. Puchkov, Z. Farsi, C.F. Ludwig, G. Novarino, K.I. López-Cayuqueo, R. Planells-Cases, T.J. Jentsch, EMBO Journal 39 (2020).","ieee":"S. Weinert <i>et al.</i>, “Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration,” <i>EMBO Journal</i>, vol. 39. EMBO Press, 2020.","ama":"Weinert S, Gimber N, Deuschel D, et al. Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration. <i>EMBO Journal</i>. 2020;39. doi:<a href=\"https://doi.org/10.15252/embj.2019103358\">10.15252/embj.2019103358</a>","ista":"Weinert S, Gimber N, Deuschel D, Stuhlmann T, Puchkov D, Farsi Z, Ludwig CF, Novarino G, López-Cayuqueo KI, Planells-Cases R, Jentsch TJ. 2020. Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration. EMBO Journal. 39, e103358.","apa":"Weinert, S., Gimber, N., Deuschel, D., Stuhlmann, T., Puchkov, D., Farsi, Z., … Jentsch, T. J. (2020). Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration. <i>EMBO Journal</i>. EMBO Press. <a href=\"https://doi.org/10.15252/embj.2019103358\">https://doi.org/10.15252/embj.2019103358</a>","chicago":"Weinert, Stefanie, Niclas Gimber, Dorothea Deuschel, Till Stuhlmann, Dmytro Puchkov, Zohreh Farsi, Carmen F. Ludwig, et al. “Uncoupling Endosomal CLC Chloride/Proton Exchange Causes Severe Neurodegeneration.” <i>EMBO Journal</i>. EMBO Press, 2020. <a href=\"https://doi.org/10.15252/embj.2019103358\">https://doi.org/10.15252/embj.2019103358</a>.","mla":"Weinert, Stefanie, et al. “Uncoupling Endosomal CLC Chloride/Proton Exchange Causes Severe Neurodegeneration.” <i>EMBO Journal</i>, vol. 39, e103358, EMBO Press, 2020, doi:<a href=\"https://doi.org/10.15252/embj.2019103358\">10.15252/embj.2019103358</a>."},"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","day":"02","isi":1,"file_date_updated":"2020-07-14T12:48:00Z","oa":1,"date_published":"2020-03-02T00:00:00Z","language":[{"iso":"eng"}],"month":"03","date_updated":"2026-04-16T09:35:48Z","publisher":"EMBO Press","department":[{"_id":"GaNo"}],"oa_version":"Published Version","intvolume":"        39","article_type":"original","type":"journal_article","acknowledgement":"We thank T. Stauber and T. Breiderhoff for cloning expression constructs; K. Räbel, S. Hohensee, and C. Backhaus for technical assistance; R. Jahn (MPIbpc, Göttingen) for providing the equipment required for SV purification; and A\r\nWoehler (MDC, Berlin) for assistance with SV imaging. Supported, in part, by grants from the Deutsche Forschungsgemeinschaft (JE164/9-2, SFB740 TP C5, FOR 2625 (JE164/14-1), NeuroCure Cluster of Excellence), the European Research Council Advanced Grant CYTOVOLION (ERC 294435) and the Prix Louis-Jeantet de Médecine to TJJ, and Peter and Traudl Engelhorn fellowship to ZF.","scopus_import":"1","_id":"7586","quality_controlled":"1","file":[{"creator":"dernst","file_name":"2020_EMBO_Weinert.pdf","content_type":"application/pdf","date_created":"2020-03-23T13:51:11Z","date_updated":"2020-07-14T12:48:00Z","file_size":12243278,"relation":"main_file","checksum":"82750a7a93e3740decbce8474004111a","access_level":"open_access","file_id":"7615"}],"has_accepted_license":"1","ddc":["570"],"date_created":"2020-03-15T23:00:55Z","year":"2020","article_number":"e103358","doi":"10.15252/embj.2019103358","publication_identifier":{"eissn":["1460-2075"],"issn":["0261-4189"]},"publication":"EMBO Journal","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_processing_charge":"No","publication_status":"published","external_id":{"pmid":["32118314"],"isi":["000517335000001"]},"abstract":[{"lang":"eng","text":"CLC chloride/proton exchangers may support acidification of endolysosomes and raise their luminal Cl− concentration. Disruption of endosomal ClC‐3 causes severe neurodegeneration. To assess the importance of ClC‐3 Cl−/H+ exchange, we now generate Clcn3unc/unc mice in which ClC‐3 is converted into a Cl− channel. Unlike Clcn3−/− mice, Clcn3unc/unc mice appear normal owing to compensation by ClC‐4 with which ClC‐3 forms heteromers. ClC‐4 protein levels are strongly reduced in Clcn3−/−, but not in Clcn3unc/unc mice because ClC‐3unc binds and stabilizes ClC‐4 like wild‐type ClC‐3. Although mice lacking ClC‐4 appear healthy, its absence in Clcn3unc/unc/Clcn4−/− mice entails even stronger neurodegeneration than observed in Clcn3−/− mice. A fraction of ClC‐3 is found on synaptic vesicles, but miniature postsynaptic currents and synaptic vesicle acidification are not affected in Clcn3unc/unc or Clcn3−/− mice before neurodegeneration sets in. Both, Cl−/H+‐exchange activity and the stabilizing effect on ClC‐4, are central to the biological function of ClC‐3."}],"title":"Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"first_name":"Stefanie","last_name":"Weinert","full_name":"Weinert, Stefanie"},{"full_name":"Gimber, Niclas","first_name":"Niclas","last_name":"Gimber"},{"full_name":"Deuschel, Dorothea","first_name":"Dorothea","last_name":"Deuschel"},{"first_name":"Till","last_name":"Stuhlmann","full_name":"Stuhlmann, Till"},{"full_name":"Puchkov, Dmytro","last_name":"Puchkov","first_name":"Dmytro"},{"last_name":"Farsi","first_name":"Zohreh","full_name":"Farsi, Zohreh"},{"first_name":"Carmen F.","last_name":"Ludwig","full_name":"Ludwig, Carmen F."},{"last_name":"Novarino","first_name":"Gaia","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178"},{"full_name":"López-Cayuqueo, Karen I.","last_name":"López-Cayuqueo","first_name":"Karen I."},{"full_name":"Planells-Cases, Rosa","last_name":"Planells-Cases","first_name":"Rosa"},{"first_name":"Thomas J.","last_name":"Jentsch","full_name":"Jentsch, Thomas J."}],"volume":39,"pmid":1},{"has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/751958"}],"ddc":["570"],"quality_controlled":"1","file":[{"file_size":15089438,"date_updated":"2020-09-24T07:03:20Z","checksum":"396ceb2dd10b102ef4e699666b9342c3","relation":"main_file","access_level":"open_access","file_id":"8567","creator":"dernst","success":1,"content_type":"application/pdf","file_name":"2020_elife_Moon.pdf","date_created":"2020-09-24T07:03:20Z"}],"publication_identifier":{"issn":["2050-084X"]},"doi":"10.7554/elife.51512","publication":"eLife","date_created":"2020-03-20T13:16:41Z","year":"2020","article_number":"51512","title":"LIS1 determines cleavage plane positioning by regulating actomyosin-mediated cell membrane contractility","article_processing_charge":"No","external_id":{"pmid":["32159512"],"isi":["000522835800001"]},"publication_status":"published","abstract":[{"text":"Heterozygous loss of human PAFAH1B1 (coding for LIS1) results in the disruption of neurogenesis and neuronal migration via dysregulation of microtubule (MT) stability and dynein motor function/localization that alters mitotic spindle orientation, chromosomal segregation, and nuclear migration. Recently, human induced pluripotent stem cell (iPSC) models revealed an important role for LIS1 in controlling the length of terminal cell divisions of outer radial glial (oRG) progenitors, suggesting cellular functions of LIS1 in regulating neural progenitor cell (NPC) daughter cell separation. Here we examined the late mitotic stages NPCs in vivo and mouse embryonic fibroblasts (MEFs) in vitro from Pafah1b1-deficient mutants. Pafah1b1-deficient neocortical NPCs and MEFs similarly exhibited cleavage plane displacement with mislocalization of furrow-associated markers, associated with actomyosin dysfunction and cell membrane hyper-contractility. Thus, it suggests LIS1 acts as a key molecular link connecting MTs/dynein and actomyosin, ensuring that cell membrane contractility is tightly controlled to execute proper daughter cell separation.","lang":"eng"}],"pmid":1,"author":[{"full_name":"Moon, Hyang Mi","first_name":"Hyang Mi","last_name":"Moon"},{"first_name":"Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon"},{"first_name":"Liqun","last_name":"Luo","full_name":"Luo, Liqun"},{"last_name":"Wynshaw-Boris","first_name":"Anthony","full_name":"Wynshaw-Boris, Anthony"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":9,"citation":{"mla":"Moon, Hyang Mi, et al. “LIS1 Determines Cleavage Plane Positioning by Regulating Actomyosin-Mediated Cell Membrane Contractility.” <i>ELife</i>, vol. 9, 51512, eLife Sciences Publications, 2020, doi:<a href=\"https://doi.org/10.7554/elife.51512\">10.7554/elife.51512</a>.","chicago":"Moon, Hyang Mi, Simon Hippenmeyer, Liqun Luo, and Anthony Wynshaw-Boris. “LIS1 Determines Cleavage Plane Positioning by Regulating Actomyosin-Mediated Cell Membrane Contractility.” <i>ELife</i>. eLife Sciences Publications, 2020. <a href=\"https://doi.org/10.7554/elife.51512\">https://doi.org/10.7554/elife.51512</a>.","apa":"Moon, H. M., Hippenmeyer, S., Luo, L., &#38; Wynshaw-Boris, A. (2020). LIS1 determines cleavage plane positioning by regulating actomyosin-mediated cell membrane contractility. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.51512\">https://doi.org/10.7554/elife.51512</a>","ista":"Moon HM, Hippenmeyer S, Luo L, Wynshaw-Boris A. 2020. LIS1 determines cleavage plane positioning by regulating actomyosin-mediated cell membrane contractility. eLife. 9, 51512.","ama":"Moon HM, Hippenmeyer S, Luo L, Wynshaw-Boris A. LIS1 determines cleavage plane positioning by regulating actomyosin-mediated cell membrane contractility. <i>eLife</i>. 2020;9. doi:<a href=\"https://doi.org/10.7554/elife.51512\">10.7554/elife.51512</a>","ieee":"H. M. Moon, S. Hippenmeyer, L. Luo, and A. Wynshaw-Boris, “LIS1 determines cleavage plane positioning by regulating actomyosin-mediated cell membrane contractility,” <i>eLife</i>, vol. 9. eLife Sciences Publications, 2020.","short":"H.M. Moon, S. Hippenmeyer, L. Luo, A. Wynshaw-Boris, ELife 9 (2020)."},"day":"11","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_published":"2020-03-11T00:00:00Z","month":"03","language":[{"iso":"eng"}],"date_updated":"2023-08-18T07:06:31Z","department":[{"_id":"SiHi"}],"publisher":"eLife Sciences Publications","isi":1,"file_date_updated":"2020-09-24T07:03:20Z","oa":1,"scopus_import":"1","_id":"7593","oa_version":"Published Version","intvolume":"         9","article_type":"original","type":"journal_article"},{"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"citation":{"ieee":"D. Gotfryd, E. Paerschke, J. Chaloupka, A. M. Oles, and K. Wohlfeld, “How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator,” <i>Physical Review Research</i>, vol. 2, no. 1. American Physical Society, 2020.","short":"D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical Review Research 2 (2020).","ista":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. 2020. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2(1), 013353.","ama":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. <i>Physical Review Research</i>. 2020;2(1). doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.2.013353\">10.1103/PhysRevResearch.2.013353</a>","apa":"Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., &#38; Wohlfeld, K. (2020). How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevResearch.2.013353\">https://doi.org/10.1103/PhysRevResearch.2.013353</a>","chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Jiri Chaloupka, Andrzej M. Oles, and Krzysztof Wohlfeld. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” <i>Physical Review Research</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/PhysRevResearch.2.013353\">https://doi.org/10.1103/PhysRevResearch.2.013353</a>.","mla":"Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” <i>Physical Review Research</i>, vol. 2, no. 1, 013353, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.2.013353\">10.1103/PhysRevResearch.2.013353</a>."},"day":"20","status":"public","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"American Physical Society","department":[{"_id":"MiLe"}],"date_updated":"2024-10-21T06:02:21Z","language":[{"iso":"eng"}],"month":"03","date_published":"2020-03-20T00:00:00Z","oa":1,"file_date_updated":"2020-07-14T12:48:00Z","_id":"7594","scopus_import":"1","type":"journal_article","article_type":"original","intvolume":"         2","oa_version":"Published Version","ddc":["530"],"has_accepted_license":"1","file":[{"file_id":"7610","access_level":"open_access","relation":"main_file","checksum":"1be551fd5f5583635076017d7391ffdc","file_size":1436735,"date_updated":"2020-07-14T12:48:00Z","date_created":"2020-03-23T10:18:38Z","content_type":"application/pdf","file_name":"2020_PhysRevResearch_Gotfryd.pdf","creator":"dernst"}],"quality_controlled":"1","publication":"Physical Review Research","issue":"1","doi":"10.1103/PhysRevResearch.2.013353","article_number":"013353","year":"2020","date_created":"2020-03-20T15:21:10Z","title":"How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator","abstract":[{"lang":"eng","text":"The concept of the entanglement between spin and orbital degrees of freedom plays a crucial role in our understanding of various phases and exotic ground states in a broad class of materials, including orbitally ordered materials and spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator depends on the value of the spin-orbit coupling of the relativistic origin. To this end, we numerically diagonalize a one-dimensional spin-orbital model with Kugel-Khomskii exchange interactions between spins and orbitals on different sites supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit coupling with regard to the spin-orbital exchange, the ground state to a large extent resembles the one obtained in the limit of vanishing spin-orbit coupling. On the other hand, for large spin-orbit coupling the ground state can, depending on the model parameters, either still show negligible spin-orbital entanglement or evolve to a highly spin-orbitally-entangled phase with completely distinct properties that are described by an effective XXZ model. The presented results suggest that (i) the spin-orbital entanglement may be induced by large on-site spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates; (ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as, e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground state can, in the first order of perturbation theory, be neglected."}],"publication_status":"published","article_processing_charge":"No","volume":2,"author":[{"full_name":"Gotfryd, Dorota","last_name":"Gotfryd","first_name":"Dorota"},{"last_name":"Paerschke","first_name":"Ekaterina","full_name":"Paerschke, Ekaterina","orcid":"0000-0003-0853-8182","id":"8275014E-6063-11E9-9B7F-6338E6697425"},{"full_name":"Chaloupka, Jiri","last_name":"Chaloupka","first_name":"Jiri"},{"full_name":"Oles, Andrzej M.","first_name":"Andrzej M.","last_name":"Oles"},{"last_name":"Wohlfeld","first_name":"Krzysztof","full_name":"Wohlfeld, Krzysztof"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]
