Skip to search formSkip to main contentSkip to account menu

Markov chain

Known as: Discrete time Markov chain, Discrete-time Markov process, Markoff Chain 
In probability theory and statistics, a Markov chain or Markoff chain, named after the Russian mathematician Andrey Markov, is a stochastic process… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j… 
Highly Cited
2008
Highly Cited
2008
Finite Non-Negative Matrices.- Fundamental Concepts and Results in the Theory of Non-negative Matrices.- Some Secondary Theory… 
Highly Cited
2005
Highly Cited
2005
This paper provides basic information and theorems about finite Markov chains. The inspiration for this paper came from Professor… 
Highly Cited
2004
Highly Cited
2004
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between… 
Review
2000
Review
2000
Preface * 1 Probability Review * 2 Discrete Time Markov Models * 3 Recurrence and Ergodicity * 4 Long Run Behavior * 5 Lyapunov… 
Highly Cited
1994
Highly Cited
1994
* Markov Chains * Direct Methods * Iterative Methods * Projection Methods * Block Hessenberg Matrices * Decompositional Methods… 
Highly Cited
1993
Highly Cited
1993
  • S. Meyn, R. Tweedie
  • Communications and Control Engineering Series
  • 1993
  • Corpus ID: 58179897
Meyn & Tweedie is back! The bible on Markov chains in general state spaces has been brought up to date to reflect developments in… 
Highly Cited
1991
Highly Cited
1991
We develop bounds for the second largest eigenvalue and spectral gap of a reversible Markov chain. The bounds depend on geometric… 
Highly Cited
1970
Highly Cited
1970
SUMMARY A generalization of the sampling method introduced by Metropolis et al. (1953) is presented along with an exposition of… 
Review
1960
Review
1960
Markov chains are one of the most useful classes of stochastic processes, being • simple, flexible and supported by many elegant…