• Corpus ID: 239024553

Coarse-graining and reconstruction for Markov matrices

@inproceedings{Stephan2021CoarsegrainingAR,
  title={Coarse-graining and reconstruction for Markov matrices},
  author={Artur Stephan},
  year={2021}
}
We present a coarse-graining (or model order reduction) procedure for stochastic matrices by clustering. The method is consistent with the natural structure of Markov theory, preserving positivity and mass, and does not rely on any tools from Hilbert space theory. The reconstruction is provided by a generalized Penrose-Moore inverse of the coarsegraining operator incorporating the inhomogeneous invariant measure of the Markov matrix. As we show, the method provides coarse-graining and… 

References

SHOWING 1-10 OF 16 REFERENCES
Ricci Curvature of Finite Markov Chains via Convexity of the Entropy
We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott,
Modified Logarithmic Sobolev Inequalities in Discrete Settings
Motivated by the rate at which the entropy of an ergodic Markov chain relative to its stationary distribution decays to zero, we study modified versions of logarithmic Sobolev inequalities in the
Sum-of-Squares proofs of logarithmic Sobolev inequalities on finite Markov chains
Logarithmic Sobolev inequalities play an important role in understanding the mixing times of Markov chains on finite state spaces. It is typically not easy to determine, or indeed approximate, the
Curvature and transport inequalities for Markov chains in discrete spaces
We study various transport-information inequalities under three different notions of Ricci curvature in the discrete setting: the curvature-dimension condition of Bakry and \'Emery, the exponential
Clustering-Based Model Reduction of Laplacian Dynamics With Weakly Connected Topology
TLDR
A reduced-order model, which is established using the generalized balanced form of the original network, preserves the weakly connection structure and consensus property and is illustrated by a numerical example.
EDP-convergence for a linear reaction-diffusion system with fast reversible reaction
  • Artur Stephan
  • Mathematics, Physics
    Calculus of Variations and Partial Differential Equations
  • 2021
We perform a fast-reaction limit for a linear reaction-diffusion system consisting of two diffusion equations coupled by a linear reaction. We understand the linear reaction-diffusion system as a
A discrete log-Sobolev inequality under a Bakry-Emery type condition
TLDR
Under this condition, a modified logarithmic Sobolev inequality is proved, generalizing and strengthening results of Wu, Bobkov and Ledoux, and Caputo, Dai Pra and Posta, and discussing how it may extend to higher dimensions.
Reduction and solution of the chemical master equation using time scale separation and finite state projection.
TLDR
This work presents a model reduction method for study of stochastic chemical kinetic systems that takes advantage of multiple time scales and is implemented in a novel numerical algorithm that exploits the time scale separation to achieve model order reductions while enabling error checking and control.
Model Order Reduction: Theory, Research Aspects and Applications
Basic Concepts.- to Model Order Reduction.- Linear Systems, Eigenvalues, and Projection.- Theory.- Structure-Preserving Model Order Reduction of RCL Circuit Equations.- A Unified Krylov Projection
Reduced Order Modeling of Diffusively Coupled Network Systems: An Optimal Edge Weighting Approach
TLDR
This paper studies reduced-order modeling of dynamic networks with strongly connected topology by constructing a quotient graph with less number of vertices, and then an edge weighting procedure is devised, aiming to select an optimal set of edge weights that minimizes the approximation error.
...
1
2
...