Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

50 relations
A Mathematical Theory of CommunicationBioinformaticsChvátal–Sankoff constantsCoarse space (numerical analysis)
Expand

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Markov chains and mixing times
For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Non-negative Matrices and Markov Chains
Finite Non-Negative Matrices.- Fundamental Concepts and Results in the Theory of Non-negative Matrices.- Some Secondary Theory… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Introduction to the numerical solution of Markov Chains
* Markov Chains * Direct Methods * Iterative Methods * Projection Methods * Block Hessenberg Matrices * Decompositional Methods… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Markov Chains and Stochastic Stability
Meyn & Tweedie is back! The bible on Markov chains in general state spaces has been brought up to date to reflect developments in… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Geometric Bounds for Eigenvalues of Markov Chains
We develop bounds for the second largest eigenvalue and spectral gap of a reversible Markov chain. The bounds depend on geometric… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Lower bounds for covering times for reversible Markov chains and random walks on graphs
For simple random walk on aN-vertex graph, the mean time to cover all vertices is at leastcN log(N), wherec>0 is an absolute… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Finite state markov-chain approximations to univariate and vector autoregressions
The paper develops a procedure for finding a discrete-valued Markov chain whose sample paths approximate well those of a vector… Expand
  • table 1
Is this relevant?
Highly Cited
1980
Highly Cited
1980
A class ofC*-algebras and topological Markov chains
In this paper we present a class of C*-algebras and point out its close relationship to topological Markov chains, whose theory… Expand
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Monte Carlo Sampling Methods Using Markov Chains and Their Applications
SUMMARY A generalization of the sampling method introduced by Metropolis et al. (1953) is presented along with an exposition of… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE