Questions tagged [markov-chains]

Stochastic processes (with either discrete or continuous time dependence) on a discrete (finite or countably infinite) state space in which the distribution of the next state depends only on the current state. For Markov processes on continuous state spaces please use (markov-process) instead.

A Markov chain is a stochastic process on a discrete (finite or countably infinite) space in which the distribution of the next state depends only on the current state. These objects show up in probability and computer science both in discrete-time and continuous-time models. For Markov processes on continuous spaces please use .

A discrete-time Markov chain is a sequence of random variables $\{X_n\}_{n\geq1}$ with the Markov property, namely that the probability of moving to the next state depends only on the present state and not on the previous states, i.e. $$\mathbb P(X_{n+1}=x\mid X_{1}=x_{1},X_{2}=x_{2},\ldots ,X_{n}=x_{n})=\mathbb P(X_{n+1}=x\mid X_{n}=x_{n}),$$ if both conditional probabilities are well defined, i.e. if $\mathbb P(X_{1}=x_{1},\ldots ,X_{n}=x_{n})>0.$

5938 questions
0
votes
1 answer

Markov Chain that isn't Irreducible

What is an example of a Markov chain that isn't irreducible but has a unique distribution, such that its distribution converges to that unique invariant distribution for any initial distribution.
0
votes
1 answer

Relating the stationary distribution of an ergodic Markov chain to its mean return time

Let $X_t$, $t=0,1,2...$ be an ergodic Markov chain on $S=\{1,...,n\}$ with transition matrix $P=\left(P_{ij}\right)_{i,j\in S}$. Let $T^i=\inf\{t\geq1:X_t=i\}$ and $h_j^i=\mathbb{E}\left(T^i\right\vert X_0=j)$. I want to show that…
0
votes
1 answer

2 Questions about Markov chain

The first question: $ (X_n : n = 1, 2, ...) $ is a Markov chain with state space $(-1, 0, 1)$. $(sin(X_n) : n = 1, 2, ...$) is a Markov chain. $(cos(X_n) : n = 1, 2, ...$) is a Markov chain. $(|X_n| : n = 1, 2, ...$) is a Markov chain. $(X_n^2 : n…
user109403
  • 289
  • 2
  • 10
0
votes
0 answers

Geometrically bounded transition probability in Markov Chains

Consider a Markov Chain with finitely many transition states. Show there is $M>0$ and $\alpha<1$ such that $p_{ij}^{(n)}\leq M\alpha^n$ for all $n$, whenever $i,j$ are transient states. I was thinking of considering $\displaystyle \sup_{i,j \text{…
shadow10
  • 5,616
0
votes
1 answer

Just a little confusion with recurrence in Markov Chains

Is it possible that in a Markov Chain one can go to a null recurrent state from a positive recurrent state? Note I assume the state space to be infinite otherwise the question makes no sense. If so give an example. If not, well then how does one…
shadow10
  • 5,616
0
votes
2 answers

Markov chains steady-state distribution

Ok so we are given a Markov chain $X_n$, $P=P(ij)$ as the transition matrix and the $(\pi_1,\pi_2,\pi_3,...,\pi_n)$ as steady-state distribution of the chain. We are asked to prove that for every $i$: $\sum_{i\neq j} \pi_iPij = \sum_{j\neq i}…
0
votes
1 answer

Why do recurrence and transience follow the $0-1$ law?

We say that a state $i\in S$ (where $S$ is the state space of a Markov Chain) is recurrent iff $P_i[X_n=i \space\text{i.o.}]=1$ and transient iff $P_i[X_n=i \space\text{i.o.}]=0$. My question is, cannot we have anything in between? Why/why not? I…
Landon Carter
  • 12,906
  • 4
  • 32
  • 79
0
votes
0 answers

Skeleton of a continuous Markov Chain

I have a continuous Markov Chain with transition matrix $\Bbb P$ and with initial state $X_0=1$ and state space $I=\{1,2,3,4,5\}$ $$\Bbb P= \begin{bmatrix} -3 & 1 & 0 & 1 & 1\\ 0 & -1 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & 0 \\ 1 & 0 & 1 & -3 & 1 \\ 0 & 1 …
Federico
  • 59
  • 7
0
votes
0 answers

Average length of a rainy period

Weather is modelled as a Markov chain(first row corresponds to state $0$ (sunny), second row to state $1$(rainy)): $$ \begin{bmatrix} 0.8 & 0.2 \\ 0.4 & 0.6 \end{bmatrix} $$ The problem is to find the average length of a rainy period. Now the hint…
Priyatham
  • 2,607
0
votes
0 answers

Markov Chain (DTMC)

What is the expected number of times we need to roll a die until we get three consecutive 6's? I am trying to construct the transition matrix; however, I am not sure how also how to go from here.
0
votes
1 answer

Is a Markovian chain irreducible when one state does not have a recursive path?

Let be the following homogeneous Markovian chain with three state: \begin{pmatrix} 1/2 & 1/4 & 1/4 \\ 2/3 & 0 & 1/3\\ 3/5 & 1/5 & 1/5 \end{pmatrix} Is this Markovian chain irreducible? From wikipedia: A Markov chain is said to be…
0
votes
0 answers

Transient state of Markov chain

I have one exercise about state of Markov chain. The Markov chain is as shown below: The answer shows B and F are transient as they could reach to absorbing state. But how can I tell, for example, state C is not transient? As the definition of my…
whoisit
  • 811
0
votes
1 answer

Stochastic(Markov) matrix

We say that a matrix $P $ = $(P_{ij} : i, j \in I)$ where $I$ is a countable set, is stochastic if every row $(P_{ij} : j \in I)$ is a distribution. What do we mean by $distribution$ here?
0
votes
1 answer

Umbrella Markov chain problem

A man has an umbrella, and he commutes from his house to work and back. If it is raining, and he has an umbrella, he takes his umbrella. If it is not raining, or he does not have an umbrella, he does not take it. I am trying to establish the…
0
votes
1 answer

Show that $\lambda_1 S_1$ is exponential of parameter 1.

In Norris his book about Markov Chains the following question pops up: Let $S_1, S_2\dots$ be independent exponential random variables with parameters $\lambda_1, \lambda_2 \dots$ respectively. Show that $\lambda_1 S_1$ is exponential of parameter…
Nescrio
  • 623