Graph-combinatorial approach for large deviations of Markov chains
arXiv:2201.00582 · doi:10.1088/1751-8121/ac79e6
Abstract
We consider discrete-time Markov chains and study large deviations of the pair empirical occupation measure, which is useful to compute fluctuations of pure-additive and jump-type observables. We provide an exact expression for the finite-time moment generating function, which is split in cycles and paths contributions, and scaled cumulant generating function of the pair empirical occupation measure via a graph-combinatorial approach. The expression obtained allows us to give a physical interpretation of interaction and entropic terms, and of the Lagrange multipliers, and may serve as a starting point for sub-leading asymptotics. We illustrate the use of the method for a simple two-state Markov chain.
17 pages, 13 figures
References in corpus (13)
- The large deviation approach to statistical mechanics
- Non equilibrium steady states: fluctuations and large deviations of the density and of the current
- Fluctuations and response of nonequilibrium states
- The unlikely Carnot efficiency
- Universal theory of efficiency fluctuations
- Large deviation function for entropy production in driven one-dimensional systems
- Efficiency fluctuations in microscopic machines
- Efficiency and Large Deviations in Time-Asymmetric Stochastic Heat Engines
- Finite time large deviations via matrix product states
- Role of current fluctuations in nonreversible samplers
- Glass transition and random walks on complex energy landscapes
- Generalized optimal paths and weight distributions revealed through the large deviations of random walks on networks
- Varied phenomenology of models displaying dynamical large-deviation singularities