My problem is about a simple random walk $ X_{n} $ with transition probabilities $ P_{i,i + 1} = p $ and $ P_{i, i-1} = 1-p $. I must prove that $ [\mathbb{E}_{1}(s^{T})]^2 = \mathbb{E}_{2}(s^{T}) $, where $ T = \min \{ n \ge 0: X_{n} = 0\} $. I would appreciate any hints. I've thought about it a lot but can't find a way to do it. I know I must apply the Markov property at some point but no more.
2026-04-06 14:13:08.1775484788
Simple Random Walk, Generating Function and Markov Property
156 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in STOCHASTIC-PROCESSES
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
- Probability being in the same state
- Random variables coincide
- Reference request for a lemma on the expected value of Hermitian polynomials of Gaussian random variables.
- Why does there exists a random variable $x^n(t,\omega')$ such that $x_{k_r}^n$ converges to it
- Compute the covariance of $W_t$ and $B_t=\int_0^t\mathrm{sgn}(W)dW$, for a Brownian motion $W$
- Why has $\sup_{s \in (0,t)} B_s$ the same distribution as $\sup_{s \in (0,t)} B_s-B_t$ for a Brownian motion $(B_t)_{t \geq 0}$?
- What is the name of the operation where a sequence of RV's form the parameters for the subsequent one?
- Markov property vs. transition function
- Variance of the integral of a stochastic process multiplied by a weighting function
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 MARKOV-PROCESS
- Definition of a Markov process in continuous state space
- What is the name of the operation where a sequence of RV's form the parameters for the subsequent one?
- Given a probability $p$, what is the upper bound of how many columns in a row-stochastic matrix exceed $p$?
- Infinitesimal generator of $3$-dimensional Stochastic differential equation
- Controlled Markov process - proper notation and set up
- Easy way to determine the stationary distribution for Markov chain?
- Why cant any 3 events admit Markov Property?
- Absorbing Markov chain and almost sure convergence
- Transition probabilities for many-states Markov model
- How to derive a diffusion tensor and stationary states given a Markov process transition matrix?
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?
Maybe it's easier to see what Will M. said if you rephrase the problem a little. Let's define $$T_i^j = \min \{n \ge 0 : X_0=i, X_n=j\}$$ Note that $E(s^{T_i^{i-1}}) = E(s^{T_1^0}) = E(s^T) \text{, for every $i\in Z$}$, which is the generator function of the first passage time for $1$ step to the left.
Now for the exercise, it's easy to prove that: $$E(s^T | X_0=1) = s (1-p) + psE(s^T|X_0=2)$$ What you then have to note is that $E(s^T|X_0=1)^2 = E(s^T|X_0=2)$ since the first passage time for $2$ step to the left means that you first have to step $1$ to the left, then another. More precisely: $$T_i^{i-2} = T_{i}^{i-1} + T_{i-1}^{i-2}$$ $T_{i}^{i-1}$ and $T_{i-1}^{i-2}$ are independent, so $$E(s^{T_i^{i-2}}) = E(s^{T_{i}^{i-1} + T_{i-1}^{i-2}}) = E(s^{T_{i}^{i-1}}) E(s^{T_{i-1}^{i-2}}) = {E(s^T)}^2$$
You can substitute it to the above equation, and solve it, and you get: $$ E(s^T) = \frac{1 - \sqrt{1-4p(1-p)s^2}}{2ps} $$