Information geometry of reversible Markov chains
From MaRDI portal
Publication:2064255
Abstract: We analyze the information geometric structure of time reversibility for parametric families of irreducible transition kernels of Markov chains. We define and characterize reversible exponential families of Markov kernels, and show that irreducible and reversible Markov kernels form both a mixture family and, perhaps surprisingly, an exponential family in the set of all stochastic kernels. We propose a parametrization of the entire manifold of reversible kernels, and inspect reversible geodesics. We define information projections onto the reversible manifold, and derive closed-form expressions for the e-projection and m-projection, along with Pythagorean identities with respect to information divergence, leading to some new notion of reversiblization of Markov kernels. We show the family of edge measures pertaining to irreducible and reversible kernels also forms an exponential family among distributions over pairs. We further explore geometric properties of the reversible family, by comparing them with other remarkable families of stochastic matrices. Finally, we show that reversible kernels are, in a sense we define, the minimal exponential family generated by the m-family of symmetric kernels, and the smallest mixture family that comprises the e-family of memoryless kernels.
Recommendations
Cites work
- scientific article; zbMATH DE number 2130169 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- A Convexity Property in the Theory of Random Variables Defined on a Finite Markov Chain
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A. N. Kolmogorov - the founder of the theory of reversible Markov processes
- Asymptotic evaluation of certain markov process expectations for large time, I
- Bayesian analysis for reversible Markov chains
- Computing the nearest reversible Markov chain.
- Conditional exponential families and a representation theorem for asymptotic inference
- Conditional limit theorems under Markov conditioning
- Doubly autoparallel structure on the probability simplex
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Explicit limit results for minimal sufficient statistics and maximum likelihood estimators in some Markov processes: Exponential families approach
- Exponential Families of Stochastic Processes: A Unifying Semimartingale Approach
- Finite-length analysis on tail probability for Markov chain and application to simple hypothesis testing
- Handbook of Markov Chain Monte Carlo
- Information geometry approach to parameter estimation in Markov chains
- Invariant measures of time-reversible Markov chains
- Large Sample Inference for Markovian Exponential Families with Application to Branching Processes with Immigration
- Local equivalence problem in hidden Markov model
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Maximum entropy and conditional probability
- Mixing time estimation in reversible Markov chains from a single sample path
- On Large Deviations from the Invariant Measure
- On Sequential Maximum Likelihood Estimation for Exponential Families of Stochastic Processes
- On exponential families of Markov processes
- On the converse theorem in statistical hypothesis testing for Markov chains
- Reversibility and stochastic networks. With a new preface
- The algebra of reversible Markov chains
- Zur Theorie der Markoffschen Ketten
- Zur Umkehrbarkeit der statistischen Naturgesetze
Cited in
(6)- Information geometry approach to parameter estimation in Markov chains
- Information criteria for quantifying loss of reversibility in parallelized KMC
- Geometric reduction for identity testing of reversible Markov chains
- Improved estimation of relaxation time in nonreversible Markov chains
- Geometric aspects of data-processing of Markov chains
- Reversible Markov kernels and involutions on product spaces
This page was built for publication: Information geometry of reversible Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064255)
