Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
480 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 ...
JGH's user avatar
  • 19
4 votes
0 answers
158 views

Using Crump-Mode-Jagers processes to get logarithmic bound on a random tree height

I am currently pursuing my PhD degree and in my research I came across a family of random trees. I need to prove a logarithmic asymptotic bound for the heights of such trees as their size grows. I ...
user43932's user avatar
3 votes
2 answers
3k views

Quadratic variation for discrete Martingale

Is there any analogue of continuous martingale quadratic variation for the discrete case? If so, are there any theorems which characterize simple random walk using quadratic variation - similar to ...
Chandrasekhar's user avatar
18 votes
2 answers
1k views

Random Walk on $\mathbb{R}$ with Uniformly Distributed Steps and "Reflective" Boundary at Origin

A particle lies on the real number line at the origin. For each step taken, the particle moves from its current position a distance (and direction) chosen equi-probably from range $[-1,r]$. However, ...
Nick Broderick's user avatar
12 votes
3 answers
666 views

An "inchworm-like" random walk on an integer interval

Imagine I place $k$ stones on an infinite one-dimensional integer interval $Z$ s.t. no stone is more than some distance $d$ from any other stone. For example, if $d=1$ and $k = 5$, we might place the ...
AmberWave's user avatar
  • 121
5 votes
1 answer
421 views

Memory of Uniformly Random Dyck Paths

Let $D$ be the set of all Dyck paths on square grid of size $n\times n$. For any particular Dyck path, let $S(t)=X_1+X_2+\ldots +X_t$ store the path, where $X_i=\pm 1$. Being a Dyck path, we have $S(0)...
Alex R.'s user avatar
  • 4,952
3 votes
1 answer
2k views

Hitting time probability in a Random Walk with possibility to die.

A Random Walker can move of one unit to the right with probability $p$, to the left with probability $q$ and it can jump again to the starting point with probability $r$ and die. Naturally $p+q+r=1$. ...
QuantumLogarithm's user avatar
2 votes
1 answer
6k views

asymmetric random walk, hitting time probability

Let's consider an asymmetric Random Walk on $Z$, with transition probabilities $p_{i, i+1}=p$, $~~p_{i, i+1}=q$, $\forall i \in \mathcal{Z}$, $p+q=1$ and $p>q$. I am interested in the probability ...
QuantumLogarithm's user avatar
4 votes
1 answer
829 views

Probability that a "closable" self-avoiding random walk forms a polygon

Consider a self-avoiding random walk on an infinite graph (for concreteness, the grid of 2-dimensional lattice points $\mathbb{Z}^2$), in which on each step, the next position is chosen uniformly at ...
Mechanical snail's user avatar
2 votes
1 answer
421 views

Extending Wald's equation to two classes of i.d. random variables?

I try to adopt Wald's equation to a slightly more complex problem. In fact, after a full day, I found some solution now, but it has a confusing argument in the middle. Perhaps somebody can help me at ...
cubic lettuce's user avatar
7 votes
1 answer
2k views

Generating function for Random Walk Hitting Time, taking the wrong root

In a calculation of the hitting time for a Bernoulli random walk we have to calculate the hitting time $\tau(1)=\inf\{n\ge 0:S_n=1\}$ to reach $+1$ and the generating function has the recursion ...
David's user avatar
  • 71
8 votes
2 answers
853 views

A discrete random walk that avoids previously visited vertices for an exponentially distributed time interval

Imagine a discrete random walk on an infinite one-dimensional lattice where, for every unit interval of time, $(t_1, t_2, ...)$, the walker takes a step with uniform probability to its left or right. ...
14 votes
2 answers
2k views

Markov chains: invariant measures and explosion

The following seems like such an elementary question, but I didn't get anywhere with it. Suppose you are considering a Markov chain in continuous time which is transient and has an invariant measure (...
Nathanael Berestycki's user avatar
2 votes
1 answer
447 views

MCMC with progressive demollification of delta distributions

Edit: I simplified the example to a canonical case for clarity. Given an integral $\int_{\Omega}{g(\mathbf{x})}$ with a well-posed integrand $g(\mathbf{x})$ defined on some multidimensional space $\...
2 votes
1 answer
521 views

Limit of a rescaled random sum of i.i.d. random variables

Consider a sequence of i.i.d. random variables $(X_i)_{i \in \mathbb N}$ and let $S_n=X_1+\dots+X_n$ For every $\alpha \in ]0,+\infty[$, let $N(\alpha)$ be a discrete random variable on $\mathbb N$, ...
alezok's user avatar
  • 418
1 vote
2 answers
772 views

Gibbs sampling step size

I have some data generated using MCMC methods and in particular Gibbs sampling. I computed the autocorrelation but I'm unsure how to determine how many samples to skip. I'd like to determine that ...
s5s's user avatar
  • 87
9 votes
1 answer
488 views

Mixing time of unitary Brownian motion

Let $B_t$ be the unitary Brownian motion, i.e. Brownian motion on the unitary group $U(N)$. What is known about the mixing time of $B_t$, that is, how fast does the measure $B_t(\delta_{\{Id\}})$ ...
Marcin Kotowski's user avatar
3 votes
1 answer
2k views

first passage time, brownian motion

Hi, If X(t) is Brownian motion in 2D, where X(0) = 0, then we can ask what is the expected time required to first hit a circle of radius R, centered at the origin. This is a First Passage Time ...
chris in physics's user avatar
2 votes
3 answers
300 views

How long does it take a Brownian particle to achieve a uniform probability distribution across a space?

Imagine I have a point-like Brownian particle, with diffusion constant $D$, and I place it at some initial coordinate in a cage of known geometry. Assuming the volume $V$ of the cage is "everywhere" ...
Rob Grey's user avatar
  • 599
4 votes
3 answers
620 views

Averaging over random walk on binary lattice

I have a function $f$ defined over a bit vector of length $n$. Equivalently, this is a function defined on the set of integers $[0,\ldots,2^n-1]$. I would like to compute the mean or variance or some ...
Victor Liu's user avatar
13 votes
1 answer
1k views

How far can a particle travel from its origin if it exhibits self-avoiding Brownian motion in two-dimensions?

Let's say I have a point-like Brownian particle undergoing two-dimensional diffusion on an infinite plane with the caveat is that the particle can never return to a coordinate that it previously ...
Rob Grey's user avatar
  • 599
4 votes
1 answer
368 views

Self Avoiding Walk Pair Correlation

Let $\gamma(i)$ be a self avoiding walk (SAW) on a 2D lattice $L$ (a square lattice for example) starting at a predefined origin ( $\gamma(0)=(0,0)$ ) and having length $n:=\ell(\gamma)$. Furthermore, ...
Alex R.'s user avatar
  • 4,952
8 votes
2 answers
655 views

Random walks on graphs: Cover time and blanket time

Winkler and Zuckerman conjectured that the blanket time is within a constant factor of the cover time. The conjecture was recently proved. The cover time $C$ is the expectation of the first time $t$ ...
Probabilist's user avatar
0 votes
2 answers
3k views

Two dimensional brownian motion first passage time

Hello, I am looking for information on how to solve/compute first passage time for two dimensional Brownian motion. any papers, references, books or web links for study will be helpful. thanks ...
Lakshmi's user avatar
  • 21

1 2
3