Steady-state probabilities in Markov Chains
Last Updated :
23 Jul, 2025
A Markov chain is a statistical model that explains how a system transitions from one state to another, with the next state depending only on the present state and not on previous states. This Markov property makes it easier to study complex systems using probabilities.
An important component of a Markov chain is the transition matrix, which reflects the probabilities of transitions from one state to another. In the long term, the system can enter a steady-state, with the probabilities remaining constant.
Understanding Steady-State Probabilities
A Markov chain models a stochastic process in which the transition from one state to another is governed by a fixed probability distribution. The steady-state probabilities of a Markov chain are the long-run probabilities of the system being in a specific state. They do not change with time, that is, after enough transitions, the system settles into a constant distribution.
Mathematically, the vector of steady-state probabilities satisfies:
\pi P = \pi
where P is the transition probability matrix. Also, the sum of all steady-state probabilities should be 1:
\sum_{i} \pi_i = 1
This equation guarantees that the system will arrive at an balance in which the probability of transitioning between states does not change.
Markov Chains and Transition Matrices
A Markov chain consists of:
- A state space (set of possible states).
- A transition probability matrix P, where Pij represents the probability of moving from state i to j.
The system reaches a steady state when the probability of being in each state remains unchanged over time.
For ergodic Markov chains (both irreducible and aperiodic), a unique steady-state distribution always exists.
Methods for Calculating Steady-State Probabilities
There are several methods to calculate steady-state probabilities:
1. Solving the Linear System
Rewriting \pi P = \pi
as: (P^T - I) \pi = 0
We add the constraint \sum_{i} \pi_i = 1 and solve for \pi.
Computing Steady-State Probabilities of a Markov Chain Using Linear Algebra
Python
import numpy as np
def steady_state_linear(P):
n = P.shape[0]
A = np.transpose(P) - np.eye(n)
A[-1] = np.ones(n) # Constraint: sum(pi) = 1
b = np.zeros(n)
b[-1] = 1
return np.linalg.solve(A, b)
# Example Transition Matrix
P = np.array([[0.7, 0.2, 0.1],
[0.3, 0.5, 0.2],
[0.2, 0.3, 0.5]])
steady_probs = steady_state_linear(P)
print("Steady-State Probabilities:", steady_probs)
OutputSteady-State Probabilities: [0.46341463 0.31707317 0.2195122 ]
2. Power Method (Iterative Approach)
This method iteratively updates \pi until convergence:
- Begin with an initial probability vector.
- Update iteratively using \pi^{(t+1)} = \pi^{(t)} P.
- Stop when \| \pi^{(t+1)} - \pi^{(t)} \| < \epsilon.
Computing Steady-State Probabilities Using the Power Method
Python
import numpy as np
P = np.array([[0.7, 0.2, 0.1],
[0.3, 0.5, 0.2],
[0.4, 0.3, 0.3]])
def steady_state_power_method(P, tol=1e-6, max_iter=1000):
n = P.shape[0]
pi = np.ones(n) / n # Start with uniform distribution
for _ in range(max_iter):
new_pi = np.dot(pi, P)
if np.linalg.norm(new_pi - pi) < tol:
break
pi = new_pi
return pi
# Call the function after defining P
steady_probs = steady_state_power_method(P)
print("Steady-State Probabilities (Power Method):", steady_probs)
OutputSteady-State Probabilities (Power Method): [0.52727197 0.30909138 0.16363665]
3. Eigenvector Method
The steady-state distribution is the dominant eigenvector of P^T \pi = \picorresponding to eigenvalue 1.
Computing Steady-State Probabilities Using the Eigenvector Method
Python
import numpy as np
P = np.array([[0.7, 0.2, 0.1],
[0.3, 0.5, 0.2],
[0.4, 0.3, 0.3]])
def steady_state_eigenvector(P):
eigenvalues, eigenvectors = np.linalg.eig(P.T)
# Find the index of the eigenvalue closest to 1
index = np.abs(eigenvalues - 1).argmin()
steady_state = eigenvectors[:, index].real
# Normalize the vector to sum to 1
return steady_state / np.sum(steady_state)
steady_probs = steady_state_eigenvector(P)
print("Steady-State Probabilities (Eigenvector Method):", steady_probs)
OutputSteady-State Probabilities (Eigenvector Method): [0.52727273 0.30909091 0.16363636]
Applications in Machine Learning
1. Reinforcement Learning (RL)- In RL, the transition probability matrix characterizes state-action transitions. Steady-state distribution facilitates the study of long-run behavior of policies.
2. Hidden Markov Models (HMMs)- HMMs apply steady-state probabilities to represent long-run state distributions and assist in speech recognition and sequence prediction.
3. PageRank Algorithm- Google's PageRank algorithm relies on the steady-state probabilities of a web-link transition matrix.
4. Queuing Systems and Customer Behavior Modeling- Steady-state probabilities can be employed for modeling customer waiting times, load balancing in a system, and optimal resource scheduling.
5. Markov Decision Processes (MDPs)- MDPs assume the use of steady-state probabilities to analyze the stability of the policy in models of decision making.
Similar Reads
Basics & Prerequisites
Data Structures
Getting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr
14 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem