From e2eb15396e0376312bfca8d45f147277eccbb01e Mon Sep 17 00:00:00 2001
From: Jiacheng Du <471735672@qq.com>
Date: Tue, 21 Jan 2025 14:07:32 +0800
Subject: [PATCH] Update markov_chains_II.md (#565)

---
 lectures/markov_chains_II.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lectures/markov_chains_II.md b/lectures/markov_chains_II.md
index 25996829..e6da714e 100644
--- a/lectures/markov_chains_II.md
+++ b/lectures/markov_chains_II.md
@@ -58,7 +58,7 @@ import numpy as np
 
 To explain irreducibility, let's take $P$ to be a fixed stochastic matrix.
 
-State $x$ is called **accessible** (or **reachable**) from state $y$ if $P^t(x,y)>0$ for some integer $t\ge 0$. 
+State $y$ is called **accessible** (or **reachable**) from state $x$ if $P^t(x,y)>0$ for some integer $t\ge 0$. 
 
 Two states, $x$ and $y$, are said to **communicate** if $x$ and $y$ are accessible from each other.