A Markov chain is a stochastic process where future states depend only on the present state, not on past events.A Markov chain is a stochastic model describing a sequence of states in which the probability of transitioning to the next state depends solely on the current state (Markov property). Formally: P(X_{n+1}=x | X_n=x_n,...,X_0=x_0) = P(X_{n+1}=x | X_n=x_n). Chains can be discrete or continuous in time, with a finite or countable number of states. Main tools: transition probability matrix, stationary distribution, Chapman–Kolmogorov equations.
Andrey Andreyevich Markov introduced chains in 1906 while studying the law of large numbers for dependent quantities. He was motivated by a desire to refute Nekrasov's claim that independence is necessary for statistical laws. Later, in the 1930s, Kolmogorov developed the general theory of Markov processes. In the mid-20th century, Markov chains became a central tool in operations research, physics (Ising model), and computer science (text generation, PageRank).
Mathematically, a Markov chain is defined by an initial probability vector π^{(0)} and a stochastic matrix P. Then the distribution after n steps: π^{(n)} = π^{(0)} P^n. The memoryless property means that to predict the future, it is sufficient to know only the current state. The long-term behavior is determined by the spectral decomposition of the matrix P: if there exists a unique left eigenvector with eigenvalue 1 (the stationary distribution), then π^{(n)} → π as n→∞. Chapman–Kolmogorov equations: P^{(n+m)} = P^{(n)} P^{(m)}, expressing the composition of transitions. For continuous time: dπ/dt = πQ, where Q is the transition intensity matrix.
Markov chains model queues in stores, search engine algorithms (Google's PageRank), random walks of stock prices, and text generation by artificial intelligence.
The first practical application of Markov chains was the analysis of the alternation of vowels and consonants in "Eugene Onegin" — Markov showed that it is not random and predicted future letters of the text.











