The minimum coefficient of ergodicity for a Markov chain with a given directed graph
From MaRDI portal
Publication:2451657
Recommendations
- Some properties of ergodicity coefficients with applications in spectral graph theory
- Load balancing for Markov chains with a specified directed graph
- Coefficients of ergodicity for stochastically monotone Markov chains
- The maximal value for coefficients of ergodicity
- Digraph-based conditioning for Markov chains
Cites work
- A Google-like model of road network dynamics and its application to regulation and control
- Combinatorial matrix theory
- Ergodicity coefficients defined by vector norms
- Fastest expected time to mixing for a Markov chain on a directed graph
- scientific article; zbMATH DE number 1250163 (Why is no real title available?)
- scientific article; zbMATH DE number 2144322 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Load balancing for Markov chains with a specified directed graph
- Non-negative matrices and Markov chains. 2nd ed
- Perturbation of the stationary distribution measured by ergodicity coefficients
Cited in
(2)
This page was built for publication: The minimum coefficient of ergodicity for a Markov chain with a given directed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451657)