English
Related papers

Related papers: Thick points for intersections of planar sample pa…

200 papers

We consider the thick points of random walk, i.e. points where the local time is a fraction of the maximum. In two dimensions, we answer a question of Dembo, Peres, Rosen and Zeitouni and compute the number of thick points of planar random…

Probability · Mathematics 2020-03-02 Antoine Jego

It is well-known (see Dvoretzky, Erd{\H o}s and Kakutani [8] and Le Gall [12]) that a planar Brownian motion $(B_t)_{t\ge 0}$ has points of infinite multiplicity, and these points form a dense set on the range. Our main result is the…

Probability · Mathematics 2021-05-03 Elie Aïdékon , Yueyun Hu , Zhan Shi

Let $B^{\alpha_i}$ be an $(N_i,d)$-fractional Brownian motion with Hurst index ${\alpha_i}$ ($i=1,2$), and let $B^{\alpha_1}$ and $B^{\alpha_2}$ be independent. We prove that, if $\frac{N_1}{\alpha_1}+\frac{N_2}{\alpha_2}>d$, then the…

Probability · Mathematics 2009-04-07 Dongsheng Wu , Yimin Xiao

Let T(x,r) denote the first hitting time of the disc of radius r centered at x for Brownian motion on the two dimensional torus. We prove that sup_{x} T(x,r)/|log r|^2 --> 2/pi as r --> 0. The same applies to Brownian motion on any smooth,…

Probability · Mathematics 2007-05-23 Amir Dembo , Yuval Peres , Jay Rosen , Ofer Zeitouni

We derive the exact value of intersection exponents between planar Brownian motions or random walks, confirming predictions from theoretical physics by Duplantier and Kwon. Let B and B' be independent Brownian motions (or simple random…

Probability · Mathematics 2008-11-26 Gregory F. Lawler , Oded Schramm , Wendelin Werner

By considering a counting-type argument on Brownian sample paths, we prove a result similar to that of Orey and Taylor on the exact Hausdorff dimension of the rapid points of Brownian motion. Because of the nature of the proof we can then…

Computational Complexity · Computer Science 2015-07-01 Paul Potgieter

We derive asymptotics for the probability of the origin to be an extremal point of a random walk in R^n. We show that in order for the probability to be roughly 1/2, the number of steps of the random walk should be between e^{c n / log n}$…

Probability · Mathematics 2013-03-19 Ronen Eldan

Let \alpha ([0,1]^p) denote the intersection local time of p independent d-dimensional Brownian motions running up to the time 1. Under the conditions p(d-2)<d and d\ge 2, we prove lim_{t\to\infty}t^{-1}\log P\bigl{\alpha([0,1]^p)\ge…

Probability · Mathematics 2007-05-23 Xia Chen

We show that the intersection exponents for planar Brownian motions are analytic. More precisely, let $B$ and $B'$ be independent planar Brownian motions started from distinct points, and define the exponent $\xi (1, \lambda)$ by $$…

Probability · Mathematics 2008-11-26 Gregory F. Lawler , Oded Schramm , Wendelin Werner

Let \ell be the projected intersection local time of two independent Brownian paths in R^d for d=2,3. We determine the lower tail of the random variable \ell(U), where U is the unit ball. The answer is given in terms of intersection…

Probability · Mathematics 2007-05-23 Achim Klenke , Peter Morters

Fix $p>1$, not necessarily integer, with $p(d-2)<d$. We study the $p$-fold self-intersection local time of a simple random walk on the lattice $\Z^d$ up to time $t$. This is the $p$-norm of the vector of the walker's local times, $\ell_t$.…

Probability · Mathematics 2011-06-10 Mathias Becker , Wolfgang König

For a Brownian loop soup with intensity $c\in(0,1]$ in the unit disk, we show that almost surely, the set of simple (resp. double) points on any portion of boundary of any of its clusters has Hausdorff dimension $2-\xi_c(2)$ (resp.…

Probability · Mathematics 2025-05-13 Yifan Gao , Xinyi Li , Wei Qian

In this article we study the distribution of the number of points of a simple random walk, visited a given number of times (the k-multiple point range). In a previous article we had developed a graph theoretical approach which is now…

Probability · Mathematics 2013-12-02 Daniel Hoef

Let $\mathcal{T}_n(x)$ denote the time of first visit of a point $x$ on the lattice torus $\mathbb {Z}_n^2=\mathbb{Z}^2/n\mathbb{Z}^2$ by the simple random walk. The size of the set of $\alpha$, $n$-late points $\mathcal{L}_n(\alpha…

Probability · Mathematics 2007-05-23 Amir Dembo , Yuval Peres , Jay Rosen , Ofer Zeitouni

Let $(X_t, t \geq 0)$ be an $\alpha$-stable random walk with values in $\Z^d$. Let $l_t(x) = \int_0^t \delta_x(X_s) ds$ be its local time. For $p>1$, not necessarily integer, $I_t = \sum_x l_t^p(x)$ is the so-called $p$-fold self-…

Probability · Mathematics 2012-05-23 Fabienne Castell , Clément Laurent , Clothilde Mélot

We define and study a family of generalized non-intersection exponents for planar Brownian motions that is indexed by subsets of the complex plane: For each $A\subset\CC$, we define an exponent $\xi(A)$ that describes the decay of certain…

Probability · Mathematics 2007-05-23 Vincent Beffara

The main purpose of this work is to define planar self-intersection local time by an alternative approach which is based on an almost sure pathwise approximation of planar Brownian motion by simple, symmetric random walks. As a result,…

Probability · Mathematics 2012-11-27 Tamás Szabados

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where basically $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that $X_1$ is…

Probability · Mathematics 2012-02-16 Fabienne Castell , Nadine Guillotin--Plantard , Françoise Pène , Bruno Schapira

Let $X$ be a random walk on the torus of side length $N$ in dimension $d\geq 3$ with uniform starting point, and $t_{\text{cov}}$ be the expected value of its cover time, which is the first time that $X$ has visited every vertex of the…

Probability · Mathematics 2023-09-07 Alexis Prévost , Pierre-François Rodriguez , Perla Sousi

We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices $\{u,v\}$ with distance $d>1$ is added as a "long-range" edge with probability…

Discrete Mathematics · Computer Science 2020-02-27 Martin E. Dyer , Andreas Galanis , Leslie Ann Goldberg , Mark Jerrum , Eric Vigoda
‹ Prev 1 2 3 10 Next ›