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

Inequality on time to reach absorption for Markov chain

Take any Markov chain on the state set $\{0,1,...,n\}$ with the condition that the transition probability $P_ij$ to go from state $i$ to state $j$ is zero whenever $j>i$. Define the random variable $T_n$ to be the number of steps before the process…
0
votes
1 answer

Expected number of unique transient states visited in an absorbing markov chain.

If I have an absorbing Markov chain represented as a transition matrix P - same notation as Wikipedia article. $ P = \begin{pmatrix} Q & R \\ 0 & I_r \end{pmatrix} $ How would I compute the expected number of unique transient states visited before…
Roy
  • 145
0
votes
1 answer

Markov chains: showing $P$ has unique eigenvalue $1$

I have a $4\times 4$ matrix and I tried solving for the determinant of $P-\lambda I$. This came out really messy and when I put the matrix into a matrix calculator my solution was $1,0$ and $-1$. Does this still mean $1$ is a unique eigenvalue…
0
votes
1 answer

Opposite of Transition Matrix

I have a markov process with a transition matrix. However, I'm studying certain the affect of removing certain transitions from the process. My emphasis is on the transitions that are removed or prohibited. I'd like a terminology that reflects…
Chris
  • 189
0
votes
0 answers

Is part of Markov chain is a Markov chain?

I try to solve this question: Let X be a Markov chain and let nr : r ≥ 0 be an unbounded increasing sequence of positive integers. Show that Yr = Xnr constitutes a (possibly inhomogeneous) Markov chain. Find the transition matrix of Y when nr…
Super Mario
  • 123
  • 4
0
votes
1 answer

recurrence for 2nd order Markov Chain

Given that $X_n$ given $X_{n-1},...,X_0$ is Poisson distributed with mean $a+bX_{n-1}+cX_{n-2}$, for $n\geq 2, a>0,b,c\geq 0$. Define $Y_n=\begin{pmatrix}X_n\\X_{n-1} \end{pmatrix}$. Prove that $Y=(Y_n)_{n\in\mathrm{N}}$ is recurrent if $b+c<1$. I…
meta_warrior
  • 3,288
  • 18
  • 34
0
votes
1 answer

Homogeneous Markov Chain $(X_{2n})_{n\in\mathbb{N_0}}$

Let $(X_n)_{n\in\mathbb{N_0}}$ be a homogeneous markov chain with initial distribution $\mu$ and transition matrix $P$. Is $(X_{2n})_{n\in\mathbb{N}_0}$ a homogeneous markov chain? What are the initial distribution and transition matrix of it? How…
Tino
  • 137
  • 7
0
votes
1 answer

Markov chains: discrete state space

I'm not that good with math, and recently I got confused on what exactly a discrete state space means, and the difference between DTMC and CTMC. For DTMC and CTMC, I know that it means Sx is finite or countable and normally represented by the set…
0
votes
1 answer

(Countably) Infinite Markov Chain - Expected number of steps to reach the origin

I am given a chain with state space $S=\{0, 1, 2, \ldots \}$, with transition probabilities $p(0,0)=3/4$, $p(0,1)=1/4$, $p(x, x-1)=3/4$, and $p(x,x+1)=1/4$ for $x \geq 1$. For $x > 0$, let $e(x)$ denote the expected number of steps in the chain…
0
votes
1 answer

Markov Chains terminology questions

I would like to get some clarification on some terminology used in descriptions of Markov chains. I've seen some resources say that "a markov chain consists of a sequence of random variables" and other sources state that it "consists of a sequence…
0
votes
1 answer

Finding limiting expected state of random walk

Let ${X_t}$ be an ergodic Markov chain such that $E(X_{t+1}-X_t)=-\epsilon$ for $X_t\in [2,n-1]$, $E(X_{t+1}-X_t)<-\epsilon$ for $X_t=n$, and $E(X_{t+1}-X_t)=\beta$ for $0\leq X_t\leq 1$, where $\epsilon$ is a small positive number,…
John
  • 41
  • 6
0
votes
0 answers

Markov Chain: Turn a problem into a markov chain

We have 2 machines, which are working in 0.75 precent if it wasn't out o order the day before. When a machine goes out of order, it takes 2 days to fix her up. let Xn be the num of working machines in day n (including those who were back from…
adamco
  • 413
0
votes
1 answer

Balls in urns, markov chains. how to think about process?

I have a question I don't understand; I need help how to think about the process. The question is the following: In the two urns A and B there are three red balls and two green balls. One ball is drawn from the urn containing three balls and it is…
Daniel
  • 1
0
votes
1 answer

How many stationary distributions does the chain admit?

Consider the Markov chain whose transition matrix is $$ P = \left( \begin{array}{ccc} 1 & 0 & 0 \\ \frac{1}{4} & \frac{1}{2} & \frac{1}{4} \\ 0 & 0 & 1 \\ \end{array} \right) $$ How many stationary distributions does the chain admit? I did the…
0
votes
0 answers

Markov Chains conditional probability

I got an exercise I don't know how to solve. Maybe you can help? Suppose that there are three fashion brands, which we call $A$, $B$ and $C$. Customers tend to stick to the same brand. Those who choose type $A$ choose it the next time around with…