Let $S_n = \sum_{k=1}^n X_n$, $n \geq 1$, be a random walk defined on $\mathbb{Z}$, where $X_i$, $ i \geq 1$, are i.i.d. bounded integers random variables. It is possible $S_n$ to be positive recurrent?
2026-04-06 21:10:11.1775509811
Positive recurrent random walk on Z
740 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
Related Questions in RANDOM-WALK
- Random walk on $\mathbb{Z}^2$
- Density distribution of random walkers in a unit sphere with an absorbing boundary
- Monkey Random walk using binomial distribution
- Find probability function of random walk, stochastic processes
- Random walk with probability $p \neq 1$ of stepping at each $\Delta t$
- Average distance between consecutive points in a one-dimensional auto-correlated sequence
- Return probability random walk
- Random Walk: Quantiles, average and maximal walk
- motion on the surface of a 3-sphere
- Probability of symmetric random walk being in certain interval on nth step
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?
Suppose it was possible for the chain given by a sum of iid $X_k$ to be positive recurrent. This is true in the trivial case of $X_k$ being constant (and zero) with probability 1, so assume $X_k$ takes on at least 2 values with positive probability each.
1.) It is should be immediate that $E[X_k]=0$ -- e.g. if instead the walk had negative drift, then for small $t\gt 0$
$P\big(S_n \gt 0\big) = P\big(t\cdot S_n \gt 0\big)=P\big(e^{t\cdot S_n} \gt 1\big)\leq E[e^{t\cdot S_n}] = E[e^{t\cdot X_1}]^k = M(t)^k= p^k$
for some $p\in(0,1)$, noting e.g. that by differentiating $M'(0) = \mu \lt 0$ and $M(0)= 1$, so for $t$ small enough $0\lt M(t)\lt 1$.
hence the expected number of visits to the positive integers is finite (geometric series). And thus the steady state probability of visiting positive integers is zero which implies $X_k$ takes on strictly non-positive values and the chain is transient. (For the case of positive drift, rerun the argument on $S_n^* := -S_n$)
Alternative justifications: You can also do this with SLLN or adapt the below CLT argument to the case of non-zero drift.
2.) Since the chain is positive recurrent, we have, for any $m\gt 0$
$P\big(S_n \gt m\big) \rightarrow c$ for some $c\in \big(0,1\big)$ and as $m\to \infty$, $c\to 0$
this implies
$P\big(\frac{S_n}{\sqrt{n}} \gt m\big) \rightarrow 0$
but by Central Limit Theorem
$\frac{S_n}{\sqrt{n}} \to N\big(0,\sigma^2\big)$ hence
$P\big(\frac{S_n}{\sqrt{n}} \gt m\big) \rightarrow c'$ for $c'\in \big(0,1\big)$
which is a contradiction.
addendum
for a slightly different finish with a few more details spelled out, consider that since the chain starts at state 0 and by assumption it is positive recurrent, it suffices to tease out a contradiction with $P\big(S_n =0\big)$.
By positive recurrence assumption $P\big(S_n = 0\big)\to \pi_0 \in (0,1)$, or $\big \vert P\big(S_n = 0\big) - \pi_0\big \vert \lt \epsilon$ for any $\epsilon \gt 0$ for $n\geq n^*$.
And we also have
$0\leq P\big(S_n = 0\big) = P\big(\frac{S_n}{\sqrt{n}} = 0\big) \lt \epsilon'$
for $n\geq n'$ by CLT (and e.g. using Stein's Method or Berry-Essen for explicit error bounds).
Now select $\epsilon: =\epsilon' := \frac{\pi_0}{3} $ and $m:=\max\big(n',n^*\big)$ and we get
$\frac{2}{3}\pi_0 \lt \Big \vert \big \vert\pi_0\big \vert- \big \vert P\big(\frac{S_{m}}{\sqrt{m}} = 0\big)\big \vert \Big \vert \leq \Big \vert \pi_0- P\big(\frac{S_{m}}{\sqrt{m}} = 0\big) \Big \vert=\big \vert P\big(S_{m} = 0\big) - \pi_0\big \vert \lt \epsilon = \frac{1}{3}\pi_0$
which is a contradiction