What the occupation law of a finite Markov chain determines: time reversal and principal minors
math.PR, math.RA
Submitted: 2026-11-10
Updated: 2026-11-16
Comments: 29 pages. Code and Lean library in the ancillary files and at https://doi.org/10.5281/zenodo.24099075
License: http://creativecommons.org/licenses/by/4.0/
The gist: What does the occupation law of a finite Markov chain determine about its generator Q ? From the stationary start…
Abstract
What does the occupation law of a finite Markov chain determine about its generator Q ? From the stationary start, the law of the occupation times at one time determines Q exactly up to time reversal and reversals of memoryless blocks, the sets of states that are all left at one rate with one landing law and are entered in proportion to the stationary law. These reversals commute and give exactly 2 k generators, with k read off a tree of memoryless blocks. This leaves only time reversal when Q has no rank-one cut, when there are at most 4 states, and generically. The law at one time determines the law at every time, and a generic start determines Q. A renewal block is a set of states that is left at the same rates from each of its states, is entered with one law, and is charged by the start in proportion to that law. From every start the law determines Q exactly up to lumped reversals, which lump disjoint renewal blocks to single states and reverse a memoryless block of the lumped chain. We also find every start that hides time reversal. At the scale of large deviations, the functional of Donsker and Varadhan determines exactly the principal minors of-Q.
Sources
- The Fiber of the Principal Minor Map
- From level 2.5 to level 2 large deviations for continuous time Markov chains
- Characterizing and Testing Principal Minor Equivalence of Matrices
- $\Gamma$-expansion of the measure-current large deviations rate functional of non-reversible finite-state Markov chains
- Occupation counts of rarely switching Markov chains: stratified local laws, support selection and the boundary layer
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves