Topology protects chiral edge currents in stochastic systems

Authors: Evelyn Tang, Jaime Agudo-Canalejo, Ramin Golestanian

Phys. Rev. X 11, 031015 (2021)
arXiv: 2010.02845v5 - DOI (cond-mat.stat-mech)
14 pages, with appendices and 3 supplementary videos

Abstract: Constructing systems that exhibit time-scales much longer than those of the underlying components, as well as emergent dynamical and collective behavior, is a key goal in fields such as synthetic biology and materials self-assembly. Inspiration often comes from living systems, in which robust global behavior prevails despite the stochasticity of the underlying processes. Here, we present two-dimensional stochastic networks that consist of minimal motifs representing out-of-equilibrium cycles at the molecular scale and support chiral edge currents in configuration space. These currents arise in the topological phase due to the bulk-boundary correspondence and dominate the system dynamics in the steady-state, further proving robust to defects or blockages. We demonstrate the topological properties of these networks and their uniquely non-Hermitian features such as exceptional points and vorticity, while characterizing the edge state localization. As these emergent edge currents are associated to macroscopic timescales and length scales, simply tuning a small number of parameters enables varied dynamical phenomena including a global clock, dynamical growth and shrinkage, and synchronization. Our construction provides a novel topological formalism for stochastic systems and fresh insights into non-Hermitian physics, paving the way for the prediction of robust dynamical states in new classical and quantum platforms.

Submitted to arXiv on 06 Oct. 2020

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.