The random-walk tag has no usage guidance.

**3**

votes

**0**answers

61 views

### Is the family of probabilities generated by a random walk on a finitely generated amenable group asymptotically invariant?

Is the family of probabilities $\mu^n$ (convolution) generated by a random walk $\mu$ on a finitely generated amenable group $G$ asymptotically invariant ($\|g\mu^n-\mu\|_{L^1}\to 0$ for any $g\in ...

**2**

votes

**1**answer

135 views

### Gradient of Probability Distribution

Given a random walk on a lattice $L$ (not necessarily centered - we allow $E[X_i] \neq 0$ for the i.i.d. increments $X_i$), let $p_t(x)$ denote the probability measure of state $x \in L$ after $t$ ...

**3**

votes

**0**answers

155 views

### Uniform sub-linearity of sub-additive functions on groups

Suppose $G$ is a finitely generated group and suppose $f: G \to \mathbb{R}$ is subadditive function, that is: $f(g_1\circ g_2) \leq f(g_1) + f(g_2)$. One example of such $f$ is the word length in some ...

**2**

votes

**1**answer

59 views

### More precise statement about lower bounds on the cover time of general graphs

Uriel Feige has shown in 1995 in his paper "A Tight Lower Bound on the Cover Time for Random Walks on Graphs", the following result:
For any graph $G$ on $n$ vertices, and any starting vertex $u$ ...

**0**

votes

**0**answers

61 views

### Markov chains on a polyhedron

A modification of a question from Gerard Letac (1976): A m-sided q-adjacent-faced polyhedron has one of its faces "up." Each round, the polyhedron rolls so that any of the adjacent faces is now up. ...

**2**

votes

**0**answers

31 views

### probabilistic interpretation of a finite difference scheme

Let me start with some simple background.
Consider the heat equation :
$
\frac{\partial p}{ \partial t} = \frac{1}{2} \frac{\partial^2 p}{\partial y^2} \quad \mbox{in} \quad \mathbb{R}\times ...

**1**

vote

**1**answer

148 views

### Arc Sine law for Random Walk conditioned to non-absorption or not?

Let $S_n$ be simple symmetric Random walk on the integers in $[-N,N]$ with states $N$ and $-N$ absorbing. Let $\tau$ be the time to absorption when $S_0 = 0$.
Is the $E(S^{2}_{n}| \tau \geq n)$ ...

**1**

vote

**0**answers

81 views

### Scaling of First-passage times for Random Walk on integer lattices

Consider simple symmetric random walk $S_{n} = (S_{n}^{(1)},\dots,
S_{n}^{(d)})$ on the d-dimensional integer lattice with starting point the origin.
Let $\tau_{N}$ be the first time $S_{n}$ exits ...

**2**

votes

**1**answer

155 views

### Random walk on a sphere along latitude-longitude grid

Suppose a sphere is partitioned by a latitude-longitude grid, with
grid quadrilaterals $\Delta \times \Delta$.
All grid nodes have degree $4$, while the North & South poles have
degree $2 \pi / ...

**1**

vote

**0**answers

97 views

### Horizontal vs Vertical sides Exit from a Rectangle for simple symmetric Random Walk on $\textbf{Z}^{2}$

Consider simple symmetric random walk, $X_{n} = (X_{n}^{(1)}, X_{n}^{(2)})$ with $X_0= (0,0)$, on the 2 dimensional integer lattice, $\textbf{Z}^{2}$.
Let $T_{M}, T_{N}$ be the smallest $n$ such ...

**4**

votes

**2**answers

220 views

### First collision time of $n$ random walkers on a cycle

My question is somehow related to the one here First Collision Time for k Random Walkers on a Torus but, unfortunately, the answer does not cover my concern.
My problem is: consider $n$ walkers on ...

**3**

votes

**1**answer

113 views

### General ballot theorem

I am looking for a version of the Ballot Theorem for general step distributions. Specifically, let $X_1,X_2,\ldots$ be i.i.d. real random variables with some distribution. Let $S_n = S_1 + \cdots + ...

**6**

votes

**2**answers

221 views

### A variant of random walk

Standard random walk assumes a sequence of iid RVs $\{X_i\}_{i\geq 0}$ and studied the distribution of $S_n=\sum_{i=0}^n X_i$.
Here, I am wondering whether there is some work on
$T_n=\sum_{i=0}^n ...

**10**

votes

**0**answers

157 views

### Self-avoiding random walks that always turn

I am wondering if the statistics of self-avoiding random lattice-walks
on $\mathbb{Z}^2$
that turn left or right at each step (i.e., they cannot continue the
direction of the preceding step) have been ...

**2**

votes

**1**answer

170 views

### Hitting probabilities for conditioned oriented random walk monotonic?

Consider an oriented random walk on $\mathbb Z^2$ (i.e. only steps $\rightarrow$ and $\uparrow$ with equal probability.) Say we let the walk go $2m$ steps then start guessing sites at distance $2m$ ...

**6**

votes

**2**answers

156 views

### Tail sigma-algebra of a branching random walk

I am looking for any known results about the tail sigma-algebra of a branching random walk. To be specific, let $T$ be the nodes of an infinite binary tree rooted at $r \in T$. Let $\{X_t\})_{t \in ...

**18**

votes

**0**answers

477 views

### Time for Langton's ant to cover a “square” torus

Langton's ant is a cellular automaton running as follows:
Squares on a plane are colored variously either black or white. We
arbitrarily identify one square as the "ant". The ant can travel ...

**9**

votes

**5**answers

750 views

### Combinatorial\Probabilistic Proof of Stirling's Approximation

Stirling's approximation is the following well-known asymptotic result:
$$n! \approx \left(\frac{n}{e}\right)^n \sqrt{2 \pi n}$$
This result has several analytical proofs, for example via Laplace's ...

**14**

votes

**1**answer

740 views

### In how many steps a random walk visits all the elements of a finite group, with a probability 1/2?

This question is a variation of the return to the origin problem.
Let $G$ be the finite group $\mathbb{Z}/n \times \mathbb{Z}/n$ and let the random transformation $T: G \to G$ such that $T(a,b) = ...

**1**

vote

**1**answer

286 views

### The probability that a 2d continuous time random walk avoids the origin

I am trying to find a reference of a proof of a continuous time version of a result of Dvoretzky and Erdos from their paper "Some problems on random walk in space" that says the probability ...

**0**

votes

**1**answer

63 views

### Stationary distribution of random walk alias solving uncountably many linear equations [closed]

Let us have interval $I = (i_1,i_2)$, function $f_1 : I \mapsto I$, function $f_2 : I \mapsto I$.
Let $x_0$, $x_1$, $x_2$, ... be series of random variables from interval $I$ denoting random walk. ...

**7**

votes

**0**answers

159 views

### Asymmetric random walk on the line with barriers

The most commonly considered random walk on the line takes one step left or right with equal probability until a barrier is reached (if there are any barriers).
More generally, suppose we fix any ...

**0**

votes

**1**answer

254 views

### Integration of independent Brownian motions

I am wondering if the following integral of stochastic Brownian motions has an analytical solution?
$$
\int_{0}^{t}e^{\nu \tilde{V}_{\tau} - \frac{1}{2}\nu^{2}\tau}d\tilde{W}_{\tau}
$$
where ...

**0**

votes

**1**answer

98 views

### Do constrained random walks converge weakly to the Wiener measure on the space of constrained paths (that corresponds to the heat equation)?

Let $U$ be an open subset of $\mathbb{R}^n$ such that
$\partial \overline{U}$, the boundary of $\overline{U}$ is ''nice''
(for simplicity you can assume piecewise smooth). I also want to allow the ...

**2**

votes

**1**answer

135 views

### Maximizer of random walk with very small drift

This is an extended question based on
Large deviations for maximizer of random walk with drift.
Let $$S_k = X_1 + \ldots + X_k,$$ where $X_i$ are i.i.d. with mean $-\mu < 0$ and unit variance. ...

**5**

votes

**1**answer

313 views

### Properties of a finite random walk

Consider the simplest random walk - $X_0 = 0$ and from there on (i.i.d), $X_i=X_{i-1}+1$ with probability $p$ or $X_{i-1}-1$ otherwise.
Let $Y_N$ be the highest point $X$ have reached on the first ...

**1**

vote

**1**answer

122 views

### Large deviations for maximizer of random walk with drift

Is it easy to write down the large deviations rate for the maximizer of a random walk with negative drift?
Let $X_i$ be the (iid, mean $-\mu$, variance $\sigma$, arbitrarily nice tails) jumps of a ...

**6**

votes

**3**answers

420 views

### Probability that a self-avoiding walk on $\mathbb{Z}^3$ closes to a polygon

The probability that a random walk on $\mathbb{Z}^3$ returns to the origin is about 34%.
This is (part of)
Pólya's theorem.
I have been looking for an analogous (numerical) result for the probability
...

**1**

vote

**2**answers

155 views

### Speed and absence of non-constant bounded harmonic functions

For a (symmetric) random walks on countable groups generated by $\mu$, there is a "brute-force computation" argument of Avez (1974) that shows that if the entropy $h_\mu$ is trivial then there are no ...

**5**

votes

**1**answer

427 views

### Harmonic Crystal using Random Walk

Me and my advisor were looking for a specific proof of the disorder in $2d$ harmonic crystals. We could not find a paper or a textbook with it, so I thought trying my luck here.
Basically, it is a ...

**2**

votes

**1**answer

204 views

### Random walks with exponential decreasing steps

Let $g$ be the golden number (or another algebraic integer in $(0,1)$ that fullfills an equation with coefficients $\pm 1$). Consider the random walk on $\mathbb{R}$ starting with $0$ and walking ...

**2**

votes

**0**answers

60 views

### Controlling fluctuations in a Markov chain

For $N>0$, consider the Markov chain $x_n$ on $\{0,1/N,...,1\}$ that moves up by $1/N$ at rate $(c-x_n/2)N$ and down by $1/N$ at rate $(c+x_n/2)N$. As $N\rightarrow\infty$ sample paths approach ...

**0**

votes

**0**answers

23 views

### Is there effective algorithm for finding “minimal discovery time” for large graphs?

Consider a large, probably sparse graph with Markovian random walkers on it. Define discovery time as time to first
reach a vertex by random walk
from uniform start. Are there effective ways to find ...

**3**

votes

**0**answers

89 views

### hitting time of the first quadrant for a 2-d random walk

Suppose $(S_n)_{n=1}^{\infty}$ is a simple random walk in $\mathbb{R}^2$. Let $\tau_{(a,b)}$ be the hitting of the first quadrant when $S_0 = (a,b)$. Is there a way to compute or estimate the ...

**10**

votes

**3**answers

547 views

### Square filling self avoiding walk

I want to create an algorithm that fills a square grid with a random Hamiltonian path starting at a particular point. See this example.
One approach is to try a free direction as a next step, and ...

**2**

votes

**2**answers

250 views

### Distribution of a random walk on a directed line

Is there a closed formula for the distribution of $x_t$ in the following random process, describing a random walk on a directed line?
$x_0 = n$
$x_t$ is a uniformly random integer between 1 and ...

**10**

votes

**1**answer

287 views

### Trapping a particle

A particle starts a brownian walk in the middle of a long tunnel in the plane, at one end of the tunnel is a region Y of given area A.
Does the shape of region Y affect average time for the particle ...

**1**

vote

**1**answer

344 views

### Brownian motion of every point in the plane

Suppose every point in the plane undergoes brownian motion for a time t. What is the probability n particles ended up at 0? For n finite, countable or uncountable?
What proportion of the plane does ...

**4**

votes

**0**answers

203 views

### Why is the density function of a sum of many iid random variables (i.e., the Gaussian) self-dual?

In the usual proof of the central limit theorem via characteristic functions, we note that if $X_1, \dots, X_n$ are independent and identically distributed, with probability density function $f(x)$, ...

**1**

vote

**1**answer

108 views

### N random walkers that hit node v in a graph

Consider a finite, undirected graph G, with uniform edge weights. Assume that there are n number of random walkers that will start at different nodes (lets say n=3, hence the random walkers will start ...

**17**

votes

**1**answer

500 views

### Longest of random worm-like paths in $\mathbb{Z}^2$

Imagine at each lattice point of $\mathbb{Z}^2$ within $[1,3n]^2$,
with coordinates
$\equiv 2 \bmod 3$,
we place, with equal probability, one of these six patterns:
The result ...

**7**

votes

**1**answer

217 views

### First Collision Time for k Random Walkers on a Torus

I consider $k$ random walkers on $\mathbb{Z}^{d}/n \mathbb{Z}^{d}$, the $d$-dimensional torus of side length $n$. More precisely, I will define a Markov chain $Z_{t} = (X_{t}[1], \ldots, X_{t}[k])$ ...

**4**

votes

**0**answers

362 views

### Stopping time of two dimensional random walk

Let $U_n=\sum_{i=1}^n X_i,V_n=\sum_{i=1}^n Y_i$, $n\geq 1$, be a two-dimensional random walk with i.i.d. increments $(X_n, Y_n)$, where $X_n, Y_n$ are discrete random variables with joint pmf ...

**6**

votes

**2**answers

206 views

### Random walk in a convex body or convex polytope

Let $\Delta$ be a convex body (i.e. a compact convex subset) or a convex polytope in
$\mathbb{R}^n$. Let $x$ be a point inside $\Delta$ and consider a (uniform) random walk starting at $x$ inside ...

**3**

votes

**1**answer

172 views

### Diameter of $n$-unit-vector closed scribble

Suppose one creates a random, closed, likely self-crossing polygon
from $n$ unit-length vectors arranged head-to-tail,
randomly oriented except for the requirement
that their sum is zero (so the ...

**2**

votes

**0**answers

89 views

### 1d random walk probability of previous n positions

I have the following question.
(May be it is very simple, but I cannot find the answer).
Suppose I have a 1d random walk on integer numbers with equal pobabilities of unit step in either direction ...

**8**

votes

**1**answer

219 views

### Random walk on a Penrose tiling

Pólya proved that a random walk on $\mathbb{Z}^2$ almost surely returns to the
origin, or, equivalently, returns to the origin infinitely often.
It was subsequently established that in $\mathbb{Z}^3$, ...

**14**

votes

**2**answers

808 views

### Randomly walking a leashed dog

Let a human $h(t)$ random walk on $\mathbb{Z}^2$ by taking a unit-length step at every
time step $t$. A dog $d(t)$ on a leash of length $\lambda$ follows $h(t)$, also
taking a unit-length step at ...

**11**

votes

**1**answer

335 views

### Wander distance of self-avoiding walk that backs out of culs-de-sac

Suppose a self-avoiding walk on $\mathbb{Z}^2$, with random steps each one unit long,
backs out of culs-de-sac, but retaining the lattice points on which it stepped
marked as unavailable for future ...

**4**

votes

**2**answers

744 views

### Do Random Walks on the Hexagonal Lattice have a limit?

For every positive integer $n$, consider a regular hexagon $\mathrm{H}_n$ such that
the distance of each vertex from the center is $\frac{1}{\sqrt{n}}$. That in turn
induces a tiling of ...