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 prove it?
2026-04-19 12:53:54.1776603234
Just a little confusion with recurrence in Markov Chains
48 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MARKOV-CHAINS
- Calculating probabilities using Markov chains.
- Probability being in the same state
- Random walk on $\mathbb{Z}^2$
- Polya's Urn and Conditional Independence
- Markov Chain never reaches a state
- Finding a mixture of 1st and 0'th order Markov models that is closest to an empirical distribution
- Find probability function of random walk, stochastic processes
- Generating cycles on a strongly connected graph
- Will be this random walk a Markov chain?
- An irreducible Markov chain cannot have an absorbing state
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
No, it is not possible.
For every state $i$ in a Markov chain, the limit of ${1\over N}\sum_{m=1}^N p_{ii}^{(m)}$ exists as $N\to\infty$. The state $i$ is called null when the limit is zero, but called positive when the limit is positive.
For two states $i,j$ and fixed $\ell,n>0$ we have $${1\over N}\sum_{m=1}^N p_{ii}^{(\ell+m+n)}\geq p_{ij}^{(\ell)}\,{1\over N}\sum_{m=1}^N p_{jj}^{(m)}\,p_{ji}^{(n)}.$$ Letting $N\to\infty$ shows that if $i$ is null then either $j$ is null, or $i$ and $j$ fail to communicate.
However, if $i$ is recurrent and $i\to j$, then $i$ and $j$ communicate. If $i$ is also null, the argument above shows that $j$ must be null as well.