Reversal symmetries for cyclic paths away from thermodynamic equilibrium

Steady-state probabilities for Markov jump processes in terms of powers of the transition rate matrix

Several types of dynamics at stationarity can be described in terms of a Markov jump process among a finite number N of representative sites. Before dealing with the dynamical aspects, one basic problem consists in expressing the a priori steady-state occupation probabilities of the sites. In particular, one wishes to go beyond the mere black-box computational tools and find expressions in which the jump rate constants appear explicitly, therefore allowing for a potential design/control of the network. For strongly connected networks admitting a unique stationary state with all sites populated, here we express the occupation probabilities in terms of a formula that involves powers of the transition rate matrix up to order N - 1. We also provide an expression of the derivatives with respect to the jump rate constants, possibly useful in sensitivity analysis frameworks. Although we refer to dynamics in (bio)chemical networks at thermal equilibrium or under nonequilibrium steady-state conditions, the results are valid for any Markov jump process under the same assumptions.

Governing principles of transcriptional logic out of equilibrium

To survive, adapt, and develop, cells respond to external and internal stimuli by tightly regulating transcription. Transcriptional regulation involves the combinatorial binding of a repertoire of transcription factors to DNA, which often results in switch-like binary outputs akin to Boolean logic gates. Recent experimental studies have demonstrated that in eukaryotes, transcription factor binding to DNA often involves energy expenditure, thereby driving the system out of equilibrium. The governing principles of transcriptional logic operations out of equilibrium remain unexplored. Here, we employ a simple two-input, single-locus model of transcription that can accommodate both equilibrium and nonequilibrium mechanisms. Using this model, we find that nonequilibrium regimes can give rise to all the logic operations accessible in equilibrium. Strikingly, energy expenditure alters the regulatory function of the two transcription factors in a mutually exclusive manner. This allows for the emergence of new logic operations that are inaccessible in equilibrium. Overall, our results show that energy expenditure can expand the range of cellular decision-making without the need for more complex promoter architectures.

Reformulating nonequilibrium steady states and generalized Hopfield discrimination

Despite substantial progress in nonequilibrium physics, steady-state (s.s.) probabilities remain intractable to analysis. For a Markov process, s.s. probabilities can be expressed in terms of transition rates using the graph-theoretic matrix-tree theorem (MTT). The MTT reveals that, away from equilibrium, s.s. probabilities become globally dependent on all rates, with expressions growing exponentially in the system size. This overwhelming complexity and lack of thermodynamic interpretation have greatly impeded analysis. Here we show that s.s. probabilities are proportional to the average of exp(-S(P)), where S(P) is the entropy generated along minimal paths P in the graph, and the average is taken over a probability distribution on spanning trees. Assuming Arrhenius rates, this "arboreal" distribution becomes Boltzmann-like, with the energy of a tree being its total edge barrier energy. This reformulation offers a thermodynamic interpretation that smoothly generalizes equilibrium statistical mechanics and reorganizes the expression complexity: the number of distinct minimal-path entropies depends not on graph size but on the entropy production index, a measure of nonequilibrium complexity. We demonstrate the power of this reformulation by extending Hopfield's analysis of discrimination by kinetic proofreading to any graph with index 1. We derive a general formula for the error ratio and use it to show how local energy dissipation can yield optimal discrimination through global synergy.

Eukaryotic gene regulation at equilibrium, or non?

Models of transcriptional regulation that assume equilibrium binding of transcription factors have been less successful at predicting gene expression from sequence in eukaryotes than in bacteria. This could be due to the non-equilibrium nature of eukaryotic regulation. Unfortunately, the space of possible non-equilibrium mechanisms is vast and predominantly uninteresting. The key question is therefore how this space can be navigated efficiently, to focus on mechanisms and models that are biologically relevant. In this review, we advocate for the normative role of theory-theory that prescribes rather than just describes-in providing such a focus. Theory should expand its remit beyond inferring mechanistic models from data, towards identifying non-equilibrium gene regulatory schemes that may have been evolutionarily selected, despite their energy consumption, because they are precise, reliable, fast, or otherwise outperform regulation at equilibrium. We illustrate our reasoning by toy examples for which we provide simulation code.

The linear framework: using graph theory to reveal the algebra and thermodynamics of biomolecular systems

The linear framework uses finite, directed graphs with labelled edges to model biomolecular systems. Graph vertices represent biochemical species or molecular states, edges represent reactions or transitions and labels represent rates. The graph yields a linear dynamics for molecular concentrations or state probabilities, with the graph Laplacian as the operator, and the labels encode the nonlinear interactions between system and environment. The labels can be specified by vertices of other graphs or by conservation laws or, when the environment consists of thermodynamic reservoirs, they may be constants. In the latter case, the graphs correspond to infinitesimal generators of Markov processes. The key advantage of the framework has been that steady states are determined as rational algebraic functions of the labels by the Matrix-Tree theorems of graph theory. When the system is at thermodynamic equilibrium, this prescription recovers equilibrium statistical mechanics but it continues to hold for non-equilibrium steady states. The framework goes beyond other graph-based approaches in treating the graph as a mathematical object, for which general theorems can be formulated that accommodate biomolecular complexity. It has been particularly effective at analysing enzyme-catalysed modification systems and input-output responses.

Simulating a chemically fueled molecular motor with nonequilibrium molecular dynamics

Most computer simulations of molecular dynamics take place under equilibrium conditions-in a closed, isolated system, or perhaps one held at constant temperature or pressure. Sometimes, extra tensions, shears, or temperature gradients are introduced to those simulations to probe one type of nonequilibrium response to external forces. Catalysts and molecular motors, however, function based on the nonequilibrium dynamics induced by a chemical reaction's thermodynamic driving force. In this scenario, simulations require chemostats capable of preserving the chemical concentrations of the nonequilibrium steady state. We develop such a dynamic scheme and use it to observe cycles of a particle-based classical model of a catenane-like molecular motor. Molecular motors are frequently modeled with detailed-balance-breaking Markov models, and we explicitly construct such a picture by coarse graining the microscopic dynamics of our simulations in order to extract rates. This work identifies inter-particle interactions that tune those rates to create a functional motor, thereby yielding a computational playground to investigate the interplay between directional bias, current generation, and coupling strength in molecular information ratchets.

Cycle counts and affinities in stochastic models of nonequilibrium systems

For nonequilibrium systems described by finite Markov processes, we consider the number of times that a system traverses a cyclic sequence of states (a cycle). The joint distribution of the number of forward and backward instances of any given cycle is described by universal formulas which depend on the cycle affinity, but are otherwise independent of system details. We discuss the similarities and differences of this result to fluctuation theorems, and generalize the result to families of cycles, relevant under coarse graining. Finally, we describe the application of large deviation theory to this cycle-counting problem.

Gene Regulation in and out of Equilibrium

Determining whether and how a gene is transcribed are two of the central processes of life. The conceptual basis for understanding such gene regulation arose from pioneering biophysical studies in eubacteria. However, eukaryotic genomes exhibit vastly greater complexity, which raises questions not addressed by this bacterial paradigm. First, how is information integrated from many widely separated binding sites to determine how a gene is transcribed? Second, does the presence of multiple energy-expending mechanisms, which are absent from eubacterial genomes, indicate that eukaryotes are capable of improved forms of genetic information processing? An updated biophysical foundation is needed to answer such questions. We describe the linear framework, a graph-based approach to Markov processes, and show that it can accommodate many previous studies in the field. Under the assumption of thermodynamic equilibrium, we introduce a language of higher-order cooperativities and show how it can rigorously quantify gene regulatory properties suggested by experiment. We point out that fundamental limits to information processing arise at thermodynamic equilibrium and can only be bypassed through energy expenditure. Finally, we outline some of the mathematical challenges that must be overcome to construct an improved biophysical understanding of gene regulation.