Universal thermodynamic bounds on the Fano factor of discriminatory networks with unidirectional transitions

Abstract

We derive a universal lower bound on the Fano factors of general biochemical discriminatory networks involving irreversible catalysis steps, based on the thermodynamic uncertainty relation, and compare it to a numerically exact Pareto optimal front. This bound is completely general, involving only the reversible entropy production per product formed and the error fraction of the system. We then show that by judiciously choosing which transitions to include in the reversible entropy production, one can derive a family of bounds that can be fine-tuned to include physical observables at hand. Lastly, we test our bound by considering three discriminatory schemes: a multi-stage Michaelis-Menten network, a Michaelis-Menten network with correlations between subsequent products, and a multi-stage kinetic proofreading network, where for the latter application the bound is altered to include the hydrolytic cost of the proofreading steps. We find that our bound is remarkably tight.

arXiv comment7 pages, 6 figures

References in corpus (13)

• Thermodynamic uncertainty relation for biomolecular processes
• Dissipation bounds all steady-state current fluctuations
• Stochastic mechano-chemical kinetics of molecular motors: a multidisciplinary enterprise from a physicist's perspective
• Thermodynamic uncertainty relation for time-dependent driving
• Uncertainty relations in stochastic processes: An information inequality approach
• Energetic costs, precision, and efficiency of a biological motor in cargo transport
• Universal Bound on the Fano Factor in Enzyme Kinetics
• Unified thermodynamic-kinetic uncertainty relation
• General technique of calculating drift velocity and diffusion coefficient in arbitrary periodic systems
• Thermodynamics of accuracy in kinetic proofreading: Dissipation and efficiency trade-offs
• Kinetic Proofreading and the Limits of Thermodynamic Uncertainty
• The energy cost and optimal design of networks for biological discrimination
• Pareto optimal fronts of kinetic proofreading

Cited by in corpus (4)

• Characterization and optimization of heat engines: Pareto-optimal fronts and universal features
• Trade-offs and thermodynamics of energy-relay proofreading
• Optimising finite-time quantum information engines using Pareto bounds
• Acceleration of enzymatic reactions due to nearby inactive binding sites