---
_id: '6358'
abstract:
- lang: eng
  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.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Eric A.
  full_name: Carlen, Eric A.
  last_name: Carlen
- first_name: Jan
  full_name: Maas, Jan
  id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
  last_name: Maas
  orcid: 0000-0002-0845-1338
citation:
  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>
  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>.
  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.
  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.
  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>.
  short: E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.
corr_author: '1'
date_created: 2019-04-30T07:34:18Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2025-06-12T07:27:20Z
day: '01'
ddc:
- '500'
department:
- _id: JaMa
doi: 10.1007/s10955-019-02434-w
ec_funded: 1
external_id:
  arxiv:
  - '1811.04572'
  isi:
  - '000498933300001'
  pmid:
  - '33223567'
file:
- access_level: open_access
  checksum: 7b04befbdc0d4982c0ee945d25d19872
  content_type: application/pdf
  creator: dernst
  date_created: 2019-12-23T12:03:09Z
  date_updated: 2020-07-14T12:47:28Z
  file_id: '7209'
  file_name: 2019_JourStatistPhysics_Carlen.pdf
  file_size: 905538
  relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: '       178'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 319-378
pmid: 1
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
- _id: 260482E2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: F06504
  name: Taming Complexity in Partial Differential Systems
publication: Journal of Statistical Physics
publication_identifier:
  eissn:
  - 1572-9613
  issn:
  - 0022-4715
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - relation: erratum
    url: https://doi.org/10.1007/s10955-020-02671-4
scopus_import: '1'
status: public
title: Non-commutative calculus, optimal transport and functional inequalities  in
  dissipative quantum systems
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 178
year: '2020'
...
---
_id: '6359'
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.
article_number: '82'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Konstantinos
  full_name: Dareiotis, Konstantinos
  last_name: Dareiotis
- first_name: Mate
  full_name: Gerencser, Mate
  id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
  last_name: Gerencser
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>
  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>
  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>.
  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.
  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.
  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>.
  short: K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020).
date_created: 2019-04-30T07:40:17Z
date_published: 2020-07-16T00:00:00Z
date_updated: 2023-10-16T09:22:50Z
day: '16'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1214/20-EJP479
external_id:
  arxiv:
  - '1812.04583'
  isi:
  - '000550150700001'
file:
- access_level: open_access
  checksum: 8e7c42e72596f6889d786e8e8b89994f
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-21T13:15:02Z
  date_updated: 2020-09-21T13:15:02Z
  file_id: '8549'
  file_name: 2020_EJournProbab_Dareiotis.pdf
  file_size: 273042
  relation: main_file
  success: 1
file_date_updated: 2020-09-21T13:15:02Z
has_accepted_license: '1'
intvolume: '        25'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Electronic Journal of Probability
publication_identifier:
  eissn:
  - 1083-6489
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the regularisation of the noise for the Euler-Maruyama scheme with irregular
  drift
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2020'
...
---
OA_place: publisher
_id: '19986'
abstract:
- lang: eng
  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.'
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."
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Hongfei
  full_name: Fu, Hongfei
  id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
  last_name: Fu
- first_name: Petr
  full_name: Novotný, Petr
  id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
  last_name: Novotný
citation:
  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>'
  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>.
  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.
  ista: 'Chatterjee K, Fu H, Novotný P. 2020.Termination Analysis of Probabilistic
    Programs with Martingales. In: Foundations of Probabilistic Programming. , 221–258.'
  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.
corr_author: '1'
date_created: 2025-07-10T13:28:51Z
date_published: 2020-11-18T00:00:00Z
date_updated: 2025-09-23T12:10:25Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1017/9781108770750.008
file:
- access_level: open_access
  checksum: 28ece115e8d2d9263e253a598e7caef2
  content_type: application/pdf
  creator: dernst
  date_created: 2025-09-23T12:03:09Z
  date_updated: 2025-09-23T12:03:09Z
  file_id: '20380'
  file_name: 2020_ProbProgramming_Chatterjee.pdf
  file_size: 316681
  relation: main_file
  success: 1
file_date_updated: 2025-09-23T12:03:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 221-258
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
publication: Foundations of Probabilistic Programming
publication_identifier:
  eisbn:
  - '9781108770750'
  isbn:
  - '9781108488518'
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
status: public
title: Termination Analysis of Probabilistic Programs with Martingales
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10012'
abstract:
- lang: eng
  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.
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.
article_number: '2003.05478'
article_processing_charge: No
arxiv: 1
author:
- first_name: Julian L
  full_name: Fischer, Julian L
  id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
  last_name: Fischer
  orcid: 0000-0002-0479-558X
- first_name: Sebastian
  full_name: Hensel, Sebastian
  id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
  last_name: Hensel
  orcid: 0000-0001-7252-8072
- first_name: Tim
  full_name: Laux, Tim
  last_name: Laux
- first_name: Thilo
  full_name: Simon, Thilo
  last_name: Simon
citation:
  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>'
  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>'
  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>.'
  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>. .'
  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.'
  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>.'
  short: J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).
date_created: 2021-09-13T12:17:11Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2026-04-08T07:01:01Z
day: '11'
department:
- _id: JuFi
doi: 10.48550/arXiv.2003.05478
ec_funded: 1
external_id:
  arxiv:
  - '2003.05478'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2003.05478
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication: arXiv
publication_status: draft
related_material:
  record:
  - id: '10007'
    relation: dissertation_contains
    status: public
status: public
title: 'The local structure of the energy landscape in multiphase mean curvature flow:
  weak-strong uniqueness and stability of evolutions'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10022'
abstract:
- lang: eng
  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.
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.
article_number: '2008.10962'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dominik L
  full_name: Forkert, Dominik L
  id: 35C79D68-F248-11E8-B48F-1D18A9856A87
  last_name: Forkert
- first_name: Jan
  full_name: Maas, Jan
  id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
  last_name: Maas
  orcid: 0000-0002-0845-1338
- first_name: Lorenzo
  full_name: Portinale, Lorenzo
  id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
  last_name: Portinale
citation:
  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>
  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>.
  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>. .
  ista: Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient
    flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962.
  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>.
  short: D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).
corr_author: '1'
date_created: 2021-09-17T10:57:27Z
date_published: 2020-08-25T00:00:00Z
date_updated: 2026-04-08T07:00:03Z
day: '25'
department:
- _id: JaMa
doi: 10.48550/arXiv.2008.10962
ec_funded: 1
external_id:
  arxiv:
  - '2008.10962'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2008.10962
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
  grant_number: F6504
  name: Taming Complexity in Partial Differential Systems
publication: arXiv
publication_status: draft
related_material:
  record:
  - id: '11739'
    relation: later_version
    status: public
  - id: '10030'
    relation: dissertation_contains
    status: public
status: public
title: Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck
  equations in multiple dimensions
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10328'
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.
alternative_title:
- OSA Technical Digest
article_number: QTu8A.1
article_processing_charge: No
author:
- first_name: Nicholas J.
  full_name: Lambert, Nicholas J.
  last_name: Lambert
- first_name: Sonia
  full_name: Mobassem, Sonia
  last_name: Mobassem
- first_name: Alfredo R
  full_name: Rueda Sanchez, Alfredo R
  id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
  last_name: Rueda Sanchez
  orcid: 0000-0001-6249-5860
- first_name: Harald G.L.
  full_name: Schwefel, Harald G.L.
  last_name: Schwefel
citation:
  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>'
  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>'
  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>.
  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.
  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.'
  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>.
  short: N.J. Lambert, S. Mobassem, A.R. Rueda Sanchez, H.G.L. Schwefel, in:, OSA
    Quantum 2.0 Conference, Optica Publishing Group, 2020.
conference:
  end_date: 2020-09-17
  location: Washington, DC, United States
  name: 'OSA: Optical Society of America'
  start_date: 2020-09-14
date_created: 2021-11-21T23:01:31Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-10-18T08:32:34Z
day: '01'
department:
- _id: JoFi
doi: 10.1364/QUANTUM.2020.QTu8A.1
language:
- iso: eng
month: '01'
oa_version: None
publication: OSA Quantum 2.0 Conference
publication_identifier:
  isbn:
  - 9-781-5575-2820-9
publication_status: published
publisher: Optica Publishing Group
quality_controlled: '1'
scopus_import: '1'
status: public
title: New designs and noise channels in electro-optic microwave to optical up-conversion
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10556'
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.
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.
article_processing_charge: No
author:
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: Dahlia
  full_name: Malkhi, Dahlia
  last_name: Malkhi
- first_name: Alexander
  full_name: Spiegelman, Alexander
  last_name: Spiegelman
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>'
  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>'
  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>.
  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.
  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.'
  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>.
  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.
conference:
  end_date: 2020-11-13
  location: Virtual, United States
  name: 'CCS: Conference on Computer and Communications Security'
  start_date: 2020-11-09
date_created: 2021-12-16T13:23:27Z
date_published: 2020-10-30T00:00:00Z
date_updated: 2025-07-10T11:49:52Z
day: '30'
department:
- _id: ElKo
doi: 10.1145/3372297.3423364
external_id:
  isi:
  - '000768470400104'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/1015
month: '10'
oa: 1
oa_version: Preprint
page: 1751–1767
publication: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
  Security
publication_identifier:
  isbn:
  - 978-1-4503-7089-9
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asynchronous distributed key generation for computationally-secure randomness,
  consensus, and threshold signatures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10557'
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.
applicant:
- Ecole Polytechnique Federale de Lausanne
application_date: 2017-06-09
article_processing_charge: No
author:
- first_name: Bryan
  full_name: Ford, Bryan
  last_name: Ford
- first_name: Linus
  full_name: Gasse, Linus
  last_name: Gasse
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: Philipp
  full_name: Jovanovic, Philipp
  last_name: Jovanovic
citation:
  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.
  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.
  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.
  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.
  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.
  mla: Ford, Bryan, et al. <i>Cryptographically Verifiable Data Structure Having Multi-Hop
    Forward and Backwards Links and Associated Systems and Methods</i>. 2020.
  short: B. Ford, L. Gasse, E. Kokoris Kogias, P. Jovanovic, (2020).
date_created: 2021-12-16T13:28:59Z
date_published: 2020-03-03T00:00:00Z
date_updated: 2021-12-21T10:04:50Z
day: '03'
department:
- _id: ElKo
extern: '1'
ipc: ' H04L9/3247 ; G06Q20/29 ; G06Q20/382 ; H04L9/3236'
ipn: '10581613'
main_file_link:
- open_access: '1'
  url: https://patents.google.com/patent/US10581613B2/en
month: '03'
oa: 1
oa_version: Published Version
publication_date: 2020-03-03
related_material:
  link:
  - relation: earlier_version
    url: https://patents.google.com/patent/US20180359096A1/en
status: public
title: Cryptographically verifiable data structure having multi-hop forward and backwards
  links and associated systems and methods
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '10672'
abstract:
- lang: eng
  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.
acknowledgement: "This research was supported in part by the Austrian Science Fund
  (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n"
article_processing_charge: No
author:
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
citation:
  ama: 'Lechner M. Learning representations for binary-classification without backpropagation.
    In: <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.
  ieee: M. Lechner, “Learning representations for binary-classification without backpropagation,”
    in <i>8th International Conference on Learning Representations</i>, Virtual ;
    Addis Ababa, Ethiopia, 2020.
  ista: 'Lechner M. 2020. Learning representations for binary-classification without
    backpropagation. 8th International Conference on Learning Representations. ICLR:
    International Conference on Learning Representations.'
  mla: Lechner, Mathias. “Learning Representations for Binary-Classification without
    Backpropagation.” <i>8th International Conference on Learning Representations</i>,
    ICLR, 2020.
  short: M. Lechner, in:, 8th International Conference on Learning Representations,
    ICLR, 2020.
conference:
  end_date: 2020-05-01
  location: Virtual ; Addis Ababa, Ethiopia
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2020-04-26
corr_author: '1'
date_created: 2022-01-25T15:50:00Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '11'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
  checksum: ea13d42dd4541ddb239b6a75821fd6c9
  content_type: application/pdf
  creator: mlechner
  date_created: 2022-01-26T07:35:17Z
  date_updated: 2022-01-26T07:35:17Z
  file_id: '10677'
  file_name: iclr_2020.pdf
  file_size: 249431
  relation: main_file
  success: 1
file_date_updated: 2022-01-26T07:35:17Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
  url: https://openreview.net/forum?id=Bke61krFvS
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: 8th International Conference on Learning Representations
publication_status: published
publisher: ICLR
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning representations for binary-classification without backpropagation
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
    3.0)
  short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10673'
abstract:
- lang: eng
  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.
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"
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Ramin
  full_name: Hasani, Ramin
  last_name: Hasani
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
- first_name: Alexander
  full_name: Amini, Alexander
  last_name: Amini
- first_name: Daniela
  full_name: Rus, Daniela
  last_name: Rus
- first_name: Radu
  full_name: Grosu, Radu
  last_name: Grosu
citation:
  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.'
  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.'
  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.'
  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.'
  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.'
  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.
conference:
  end_date: 2020-07-18
  location: Virtual
  name: 'ML: Machine Learning'
  start_date: 2020-07-12
date_created: 2022-01-25T15:50:34Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
  checksum: c9a4a29161777fc1a89ef451c040e3b1
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-01-26T11:08:51Z
  date_updated: 2022-01-26T11:08:51Z
  file_id: '10691'
  file_name: 2020_PMLR_Hasani.pdf
  file_size: 2329798
  relation: main_file
  success: 1
file_date_updated: 2022-01-26T11:08:51Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://proceedings.mlr.press/v119/hasani20a.html
oa: 1
oa_version: Published Version
page: 4082-4093
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the 37th International Conference on Machine Learning
publication_identifier:
  issn:
  - 2640-3498
publication_status: published
quality_controlled: '1'
scopus_import: '1'
series_title: PMLR
status: public
title: 'A natural lottery ticket winner: Reinforcement learning with ordinary neural
  circuits'
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
    3.0)
  short: CC BY-NC-ND (3.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '7567'
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.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Aruni
  full_name: Choudhary, Aruni
  last_name: Choudhary
- first_name: Siargey
  full_name: Kachanovich, Siargey
  last_name: Kachanovich
- first_name: Mathijs
  full_name: Wintraecken, Mathijs
  id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
  last_name: Wintraecken
  orcid: 0000-0002-7472-2220
citation:
  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>
  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>
  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>.
  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.
  ista: Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have
    good quality. Mathematics in Computer Science. 14, 141–176.
  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>.
  short: A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science
    14 (2020) 141–176.
corr_author: '1'
date_created: 2020-03-05T13:30:18Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2025-04-14T07:44:03Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s11786-020-00461-5
ec_funded: 1
file:
- access_level: open_access
  checksum: 1d145f3ab50ccee735983cb89236e609
  content_type: application/pdf
  creator: dernst
  date_created: 2020-11-20T10:18:02Z
  date_updated: 2020-11-20T10:18:02Z
  file_id: '8783'
  file_name: 2020_MathCompScie_Choudhary.pdf
  file_size: 872275
  relation: main_file
  success: 1
file_date_updated: 2020-11-20T10:18:02Z
has_accepted_license: '1'
intvolume: '        14'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 141-176
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Mathematics in Computer Science
publication_identifier:
  eissn:
  - 1661-8289
  issn:
  - 1661-8270
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coxeter triangulations have good quality
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2020'
...
---
_id: '7569'
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.'
article_number: e1007642
article_processing_charge: No
article_type: original
author:
- first_name: Rok
  full_name: Grah, Rok
  id: 483E70DE-F248-11E8-B48F-1D18A9856A87
  last_name: Grah
  orcid: 0000-0003-2539-3560
- first_name: Tamar
  full_name: Friedlander, Tamar
  last_name: Friedlander
citation:
  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>
  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>.
  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.
  ista: Grah R, Friedlander T. 2020. The relation between crosstalk and gene regulation
    form revisited. PLOS Computational Biology. 16(2), e1007642.
  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>.
  short: R. Grah, T. Friedlander, PLOS Computational Biology 16 (2020).
date_created: 2020-03-06T07:39:38Z
date_published: 2020-02-25T00:00:00Z
date_updated: 2026-04-08T07:25:08Z
day: '25'
ddc:
- '000'
- '570'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pcbi.1007642
external_id:
  isi:
  - '000526725200019'
  pmid:
  - '32097416'
file:
- access_level: open_access
  checksum: 5239dd134dc6e1c71fe7b3ce2953da37
  content_type: application/pdf
  creator: dernst
  date_created: 2020-03-09T15:12:21Z
  date_updated: 2020-07-14T12:48:00Z
  file_id: '7579'
  file_name: 2020_PlosCompBio_Grah.pdf
  file_size: 2209325
  relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: '        16'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLOS Computational Biology
publication_identifier:
  issn:
  - 1553-7358
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
  record:
  - id: '9716'
    relation: research_data
    status: deleted
  - id: '9776'
    relation: research_data
    status: public
  - id: '9779'
    relation: research_data
    status: public
  - id: '9777'
    relation: research_data
    status: public
  - id: '8155'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: The relation between crosstalk and gene regulation form revisited
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2020'
...
---
_id: '7570'
abstract:
- lang: eng
  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.
article_number: '011055'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Alexios
  full_name: Michailidis, Alexios
  id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
  last_name: Michailidis
  orcid: 0000-0002-8443-1064
- first_name: C. J.
  full_name: Turner, C. J.
  last_name: Turner
- first_name: Z.
  full_name: Papić, Z.
  last_name: Papić
- first_name: D. A.
  full_name: Abanin, D. A.
  last_name: Abanin
- first_name: Maksym
  full_name: Serbyn, Maksym
  id: 47809E7E-F248-11E8-B48F-1D18A9856A87
  last_name: Serbyn
  orcid: 0000-0002-2399-5827
citation:
  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>
  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>
  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>.
  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.
  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.
  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>.
  short: A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review
    X 10 (2020).
date_created: 2020-03-08T18:02:01Z
date_published: 2020-03-04T00:00:00Z
date_updated: 2023-08-18T07:01:07Z
day: '04'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.1103/physrevx.10.011055
external_id:
  arxiv:
  - '1905.08564'
  isi:
  - '000517969300001'
file:
- access_level: open_access
  checksum: 4b3f2c13873d35230173c73d0e11c408
  content_type: application/pdf
  creator: dernst
  date_created: 2020-03-12T12:13:07Z
  date_updated: 2020-07-14T12:48:00Z
  file_id: '7581'
  file_name: 2020_PhysicalReviewX_Michailidis.pdf
  file_size: 17828638
  relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: '        10'
isi: 1
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Physical Review X
publication_identifier:
  issn:
  - 2160-3308
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/classical-physics-helps-predict-fate-of-interacting-quantum-systems/
scopus_import: '1'
status: public
title: Slow quantum thermalization and many-body revivals from mixed phase space
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 10
year: '2020'
...
---
_id: '7572'
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.
alternative_title:
- Methods in Cell Biology
article_processing_charge: No
author:
- first_name: Paulo R
  full_name: Dos Santos Caldas, Paulo R
  id: 38FCDB4C-F248-11E8-B48F-1D18A9856A87
  last_name: Dos Santos Caldas
  orcid: 0000-0001-6730-4461
- first_name: Philipp
  full_name: Radler, Philipp
  id: 40136C2A-F248-11E8-B48F-1D18A9856A87
  last_name: Radler
  orcid: '0000-0001-9198-2182 '
- first_name: Christoph M
  full_name: Sommer, Christoph M
  id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
  last_name: Sommer
  orcid: 0000-0003-1216-9105
- first_name: Martin
  full_name: Loose, Martin
  id: 462D4284-F248-11E8-B48F-1D18A9856A87
  last_name: Loose
  orcid: 0000-0001-7309-9724
citation:
  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>'
  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>.
  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.'
  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.
date_created: 2020-03-08T23:00:47Z
date_published: 2020-02-27T00:00:00Z
date_updated: 2026-04-08T07:26:30Z
day: '27'
department:
- _id: MaLo
doi: 10.1016/bs.mcb.2020.01.006
ec_funded: 1
editor:
- first_name: 'Phong '
  full_name: 'Tran, Phong '
  last_name: Tran
external_id:
  isi:
  - '000611826500008'
intvolume: '       158'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/839571
month: '02'
oa: 1
oa_version: Preprint
page: 145-161
project:
- _id: 2595697A-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '679239'
  name: Self-Organization of the Bacterial Cell
- _id: 260D98C8-B435-11E9-9278-68D0E5697425
  name: Reconstitution of Bacterial Cell Division Using Purified Components
publication: Methods in Cell Biology
publication_identifier:
  issn:
  - 0091-679X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  record:
  - id: '8358'
    relation: part_of_dissertation
    status: public
scopus_import: '1'
status: public
title: Computational analysis of filament polymerization dynamics in cytoskeletal
  networks
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 158
year: '2020'
...
---
_id: '7573'
abstract:
- lang: eng
  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.
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_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Peter
  full_name: Gladbach, Peter
  last_name: Gladbach
- first_name: Eva
  full_name: Kopfer, Eva
  last_name: Kopfer
- first_name: Jan
  full_name: Maas, Jan
  id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
  last_name: Maas
  orcid: 0000-0002-0845-1338
- first_name: Lorenzo
  full_name: Portinale, Lorenzo
  id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
  last_name: Portinale
citation:
  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>
  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>.
  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.
  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.
  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>.
  short: P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Journal de Mathematiques Pures
    et Appliquees 139 (2020) 204–234.
date_created: 2020-03-08T23:00:47Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2026-04-08T07:00:03Z
day: '01'
department:
- _id: JaMa
doi: 10.1016/j.matpur.2020.02.008
ec_funded: 1
external_id:
  arxiv:
  - '1905.05757'
  isi:
  - '000539439400008'
intvolume: '       139'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1905.05757
month: '07'
oa: 1
oa_version: Preprint
page: 204-234
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
- _id: 260482E2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: F06504
  name: Taming Complexity in Partial Differential Systems
- _id: 260788DE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: W1245
  name: Dissipation and dispersion in nonlinear partial differential equations
publication: Journal de Mathematiques Pures et Appliquees
publication_identifier:
  issn:
  - 0021-7824
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  record:
  - id: '10030'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Homogenisation of one-dimensional discrete optimal transport
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2020'
...
---
_id: '7580'
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.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
article_processing_charge: No
article_type: original
author:
- first_name: Urban
  full_name: Bezeljak, Urban
  id: 2A58201A-F248-11E8-B48F-1D18A9856A87
  last_name: Bezeljak
  orcid: 0000-0003-1365-5631
- first_name: Hrushikesh
  full_name: Loya, Hrushikesh
  last_name: Loya
- first_name: Beata M
  full_name: Kaczmarek, Beata M
  id: 36FA4AFA-F248-11E8-B48F-1D18A9856A87
  last_name: Kaczmarek
- first_name: Timothy E.
  full_name: Saunders, Timothy E.
  last_name: Saunders
- first_name: Martin
  full_name: Loose, Martin
  id: 462D4284-F248-11E8-B48F-1D18A9856A87
  last_name: Loose
  orcid: 0000-0001-7309-9724
citation:
  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>
  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>
  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>.
  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.
  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>.
  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.
date_created: 2020-03-12T05:32:26Z
date_published: 2020-03-24T00:00:00Z
date_updated: 2026-04-08T07:24:55Z
day: '24'
department:
- _id: MaLo
- _id: CaBe
doi: 10.1073/pnas.1921027117
external_id:
  isi:
  - '000521821800040'
  pmid:
  - '32161136'
intvolume: '       117'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/776567
month: '03'
oa: 1
oa_version: Preprint
page: 6504-6549
pmid: 1
project:
- _id: 2599F062-B435-11E9-9278-68D0E5697425
  grant_number: RGY0083/2016
  name: Reconstitution of cell polarity and axis determination in a cell-free system
publication: Proceedings of the National Academy of Sciences of the United States
  of America
publication_identifier:
  eissn:
  - 1091-6490
  issn:
  - 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/proteins-as-molecular-switches/
  record:
  - id: '8341'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Stochastic activation and bistability in a Rab GTPase regulatory network
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 117
year: '2020'
...
---
_id: '7582'
abstract:
- lang: eng
  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.
article_number: '299'
article_processing_charge: No
article_type: original
author:
- first_name: Taraka Ramji
  full_name: Moturu, Taraka Ramji
  last_name: Moturu
- first_name: Sansrity
  full_name: Sinha, Sansrity
  last_name: Sinha
- first_name: Hymavathi
  full_name: Salava, Hymavathi
  last_name: Salava
- first_name: Sravankumar
  full_name: Thula, Sravankumar
  last_name: Thula
- first_name: Tomasz
  full_name: Nodzyński, Tomasz
  last_name: Nodzyński
- first_name: Radka Svobodová
  full_name: Vařeková, Radka Svobodová
  last_name: Vařeková
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
- first_name: Sibu
  full_name: Simon, Sibu
  id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
  last_name: Simon
  orcid: 0000-0002-1998-6741
citation:
  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>
  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>.
  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.
  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.
  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>.
  short: T.R. Moturu, S. Sinha, H. Salava, S. Thula, T. Nodzyński, R.S. Vařeková,
    J. Friml, S. Simon, Plants 9 (2020).
corr_author: '1'
date_created: 2020-03-15T23:00:52Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2026-04-02T14:35:47Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3390/plants9030299
ec_funded: 1
external_id:
  isi:
  - '000525315000035'
  pmid:
  - '32121542'
file:
- access_level: open_access
  checksum: 6d5af3e17266a48996b4af4e67e88a85
  content_type: application/pdf
  creator: dernst
  date_created: 2020-03-23T13:37:00Z
  date_updated: 2020-07-14T12:48:00Z
  file_id: '7614'
  file_name: 2020_Plants_Moturu.pdf
  file_size: 2373484
  relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: '         9'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '282300'
  name: Polarity and subcellular dynamics in plants
publication: Plants
publication_identifier:
  eissn:
  - 2223-7747
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular evolution and diversification of proteins involved in miRNA maturation
  pathway
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 9
year: '2020'
...
---
_id: '7586'
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.
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."
article_number: e103358
article_processing_charge: No
article_type: original
author:
- first_name: Stefanie
  full_name: Weinert, Stefanie
  last_name: Weinert
- first_name: Niclas
  full_name: Gimber, Niclas
  last_name: Gimber
- first_name: Dorothea
  full_name: Deuschel, Dorothea
  last_name: Deuschel
- first_name: Till
  full_name: Stuhlmann, Till
  last_name: Stuhlmann
- first_name: Dmytro
  full_name: Puchkov, Dmytro
  last_name: Puchkov
- first_name: Zohreh
  full_name: Farsi, Zohreh
  last_name: Farsi
- first_name: Carmen F.
  full_name: Ludwig, Carmen F.
  last_name: Ludwig
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
- first_name: Karen I.
  full_name: López-Cayuqueo, Karen I.
  last_name: López-Cayuqueo
- first_name: Rosa
  full_name: Planells-Cases, Rosa
  last_name: Planells-Cases
- first_name: Thomas J.
  full_name: Jentsch, Thomas J.
  last_name: Jentsch
citation:
  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>
  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>.
  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.
  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.
  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>.
  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).
date_created: 2020-03-15T23:00:55Z
date_published: 2020-03-02T00:00:00Z
date_updated: 2026-04-16T09:35:48Z
day: '02'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.15252/embj.2019103358
external_id:
  isi:
  - '000517335000001'
  pmid:
  - '32118314'
file:
- access_level: open_access
  checksum: 82750a7a93e3740decbce8474004111a
  content_type: application/pdf
  creator: dernst
  date_created: 2020-03-23T13:51:11Z
  date_updated: 2020-07-14T12:48:00Z
  file_id: '7615'
  file_name: 2020_EMBO_Weinert.pdf
  file_size: 12243278
  relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: '        39'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: EMBO Journal
publication_identifier:
  eissn:
  - 1460-2075
  issn:
  - 0261-4189
publication_status: published
publisher: EMBO Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
_id: '7593'
abstract:
- lang: eng
  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.
article_number: '51512'
article_processing_charge: No
article_type: original
author:
- first_name: Hyang Mi
  full_name: Moon, Hyang Mi
  last_name: Moon
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
- first_name: Liqun
  full_name: Luo, Liqun
  last_name: Luo
- first_name: Anthony
  full_name: Wynshaw-Boris, Anthony
  last_name: Wynshaw-Boris
citation:
  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>
  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>
  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>.
  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.
  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.
  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>.
  short: H.M. Moon, S. Hippenmeyer, L. Luo, A. Wynshaw-Boris, ELife 9 (2020).
date_created: 2020-03-20T13:16:41Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2023-08-18T07:06:31Z
day: '11'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.7554/elife.51512
external_id:
  isi:
  - '000522835800001'
  pmid:
  - '32159512'
file:
- access_level: open_access
  checksum: 396ceb2dd10b102ef4e699666b9342c3
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-24T07:03:20Z
  date_updated: 2020-09-24T07:03:20Z
  file_id: '8567'
  file_name: 2020_elife_Moon.pdf
  file_size: 15089438
  relation: main_file
  success: 1
file_date_updated: 2020-09-24T07:03:20Z
has_accepted_license: '1'
intvolume: '         9'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/751958
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
  issn:
  - 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: LIS1 determines cleavage plane positioning by regulating actomyosin-mediated
  cell membrane contractility
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 9
year: '2020'
...
---
_id: '7594'
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.
article_number: '013353'
article_processing_charge: No
article_type: original
author:
- first_name: Dorota
  full_name: Gotfryd, Dorota
  last_name: Gotfryd
- first_name: Ekaterina
  full_name: Paerschke, Ekaterina
  id: 8275014E-6063-11E9-9B7F-6338E6697425
  last_name: Paerschke
  orcid: 0000-0003-0853-8182
- first_name: Jiri
  full_name: Chaloupka, Jiri
  last_name: Chaloupka
- first_name: Andrzej M.
  full_name: Oles, Andrzej M.
  last_name: Oles
- first_name: Krzysztof
  full_name: Wohlfeld, Krzysztof
  last_name: Wohlfeld
citation:
  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>.
  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.
  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.
  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>.
  short: D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical
    Review Research 2 (2020).
date_created: 2020-03-20T15:21:10Z
date_published: 2020-03-20T00:00:00Z
date_updated: 2024-10-21T06:02:21Z
day: '20'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/PhysRevResearch.2.013353
ec_funded: 1
file:
- access_level: open_access
  checksum: 1be551fd5f5583635076017d7391ffdc
  content_type: application/pdf
  creator: dernst
  date_created: 2020-03-23T10:18:38Z
  date_updated: 2020-07-14T12:48:00Z
  file_id: '7610'
  file_name: 2020_PhysRevResearch_Gotfryd.pdf
  file_size: 1436735
  relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: '         2'
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Physical Review Research
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: How spin-orbital entanglement depends on the spin-orbit coupling in a Mott
  insulator
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2020'
...
