Information flow in bipartite Markov systems is split into a housekeeping part that maintains correlations through cyclic modes and an excess part that changes mutual information through conservative forces.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cond-mat.stat-mech 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A unified framework based on generalized means derives an infinite family of thermodynamic speed limits for Markov jump processes and chemical reaction networks, each giving a lower bound on entropy production.
A geometric decomposition of entropy production rate in reaction-diffusion systems isolates excess dissipation driving patterns and yields speed limits, uncertainty relations, and an optimal-transport extension for efficient pattern formation.
citing papers explorer
-
Geometric decomposition of information flow: New insights into information thermodynamics
Information flow in bipartite Markov systems is split into a housekeeping part that maintains correlations through cyclic modes and an excess part that changes mutual information through conservative forces.
-
Infinite variety of thermodynamic speed limits with general activities
A unified framework based on generalized means derives an infinite family of thermodynamic speed limits for Markov jump processes and chemical reaction networks, each giving a lower bound on entropy production.
-
Geometric thermodynamics of reaction-diffusion systems: Thermodynamic trade-off relations and optimal transport for pattern formation
A geometric decomposition of entropy production rate in reaction-diffusion systems isolates excess dissipation driving patterns and yields speed limits, uncertainty relations, and an optimal-transport extension for efficient pattern formation.