# Tagged Questions

For questions on random walks, a mathematical formalization of a path that consists of a succession of random steps.

32 views

### Three person simultaneous random walk

So let's say you have 3 people walking 100m, from one wall to another. Each move each person independently draws 3 integers, each between -10 and 5 with equal probability. You, as the coordinator, ...
51 views

### What is the expected number of steps in a random walk from leaf to leaf in a full binary tree?

Let $h \geq 2$ be a natural number. Consider a complete binary tree of height $h$. Say we take a random walk starting from the "leftmost" leaf. What is the expected number of steps before the "...
46 views

### (Random Walk) Probability of Returning to Origin

I want to find out the probability that a 1-dimensional asymmetric random walk, which steps to the right with probability $p > \frac{1}{2}$ and to the left with probability $1-p$, ever returns to ...
26 views

### Equal distribution only for finite dimensional distributions

Two processes $(X_t)_{t \in T}$, $(Y_t)_{t \in T}$ are known to be equal in distribution if and only if they agree on all finite-dimensional distributions, i.e., for all $t_1$, $t_2$, $\ldots$, $t_n$, ...
28 views

### Is every discrete martingale a time-changed simple random walk?

While going through the book by Revuz and Yor titled 'Continuous Martingales and Brownian Motion', I came accross the notion of time change. In a nutshell, if X is a stochastic process and C is an (...
29 views

### Recurrence of 0 in a random walk

Assume $\mathcal{S} := \{0, 1, \cdots \}$, $p(0,1)=1$ and $p(n,0)=p(n,n+1)=\frac{1}{2}$ for $n=1,2, \cdots$. Is $0$ recurrent or transient? So, basically this is an irreducible, closed but infinite ...
45 views

40 views

### Binomial Random Walk

For the random walk with step sizes: $S_i = \begin{cases} &+1 &\text{probability} &p, \\ &-2 &\text{probability} &q=1-p \end{cases}$ Let $T_n = \sum_{i=1}^mS_i$ be the ...
26 views

### Probability of one outcome in random walk

This question is really throwing me off: Lets say there's two players, A and B. Each game consists of betting \$1. Gameplay ends when one player has all of the money. Player A starts with \$3, B ...
45 views

31 views

15 views

### How do you find the expected Cover Time of a graph?

I can only find resources that give an upper bound on the cover time, but not how to find the exact expected cover time of a graph. Somebody told me it's related to the coupon collector problem, but I ...
43 views

### Random walk with reflection and skips in linear system

Let's take a case of simple and linear Random walk (0, 1...n) with only one absorbing state n and reflecting state -1, which we can define as: P (move right at state i) = 1/2 and P (moving left at ...
40 views

113 views

### Random Walk of a drunk man

Problem Statement: From where he stands, one step toward the cliff would send the drunken man over the edge. He takes random steps, either toward or away from the cliff. At any step his probability ...
38 views

### Random walk in high dimensional space with stationarity

I have a vector of high dimension ( say 100). When I take a random walk ( i.e add a step value to each components of the vector, the step value being drawn randomly drawn from standard normal ...
62 views

51 views

### Density function of $\sqrt{(\mathcal{N}_1(\mu,\sigma^2))^2+(\mathcal{N}_2(\mu,\sigma^2))^2}$ (Random walk)

I have 2D random walk and I would like to find out what distance I will travel after 200 steps. So I introduce two random variables $Z^{(200)}_x$ and $Z^{(200)}_y$ which tell me probabilities of my $x$...
19 views

### Multiplicative Super-martingales

Let $\{X_n\}$ be a stochastic process which is strictly positive, i.e. $X_n > 0$ almost surely for all $n$. It then follows that $\{Z_n = \log(X_n) \}$ is a well-defined stochastic process as well....
83 views

### Number of steps in a 2D random walk return to origin

We have a random walk in 2D. In this many dimensions, we return to the origin with probability $1$. However, the number of steps it takes to do so seems to vary greatly from computer simulations I've ...
92 views

### Expected infimum of a 1d random walk

Consider a simple symmetric random walk on $\mathbb{Z}$ starting from $0$, $S_n$. Let $I_n := \inf\{S_0, S_1, S_2, \ldots S_n\}$. Is an explicit formula for $E[I_n]$ known?
28 views

### Symmetric Simple Random Walk - Definition Clarification

I'm finding conflicting answers everywhere, including in my own notes. In the phrase "symmetric simple random walk", which part, "symmetric" or "simple" refers to having a probability of $0.5$ to go ...
48 views

### Why does infinite expected number of returns to the origin imply a random walk returns to the origin with probability 1?

In proving that a simple symmetric 2-d random walk a.s. returns to the origin, the proofs generally start by showing (*) that the expected number of returns to the origin is infinite, and then use a ...
42 views

### Random Walk on a Grid

Consider the $k \times (k+1) \times (k+2)$ grid G. Starting from a point $\vec x = (x_1,x_2,x_3)$, we perform the following random walk. We choose a coordinate $i \in \{1,2,3\}$ uniformly at random ...
68 views

### Proving how to reduce a Brownian walk on a plane to a line (2D to 1D)

I have a Brownian motion on a plane and would like to find the time of when it is expected to hit a set of parallel lines, i.e the hitting time. In order to do so, I understand that I can reduce the ...
25 views

37 views

### Let $X_n$ be a one-dimensional random walk with $p \neq 0.5$. Show that $P(\lim_{n \rightarrow \infty} \frac{1}{n} X_n = 0)$ equals $0$.

Let $X_n$ be a one-dimensional random walk on the integers that starts at $0$ (as normally) but has $p \neq \frac{1}{2}$, i.e. so that it moves to its right neighbor with probability $p$ and left ...