English
Related papers

Related papers: Exponential tail bounds for loop-erased random wal…

200 papers

For a random walk $S_n, n\geq 0$ in $\mathbb{Z}^d$, let $l(n,x)$ be its local time at the site $x\in \mathbb{Z}^d$. Define the $\alpha$-fold self intersection local time $L_n(\alpha) := \sum_{x} l(n,x)^{\alpha}$, and let…

Probability · Mathematics 2015-06-04 George Deligiannidis , Sergey Utev

Given any $\gamma>0$ and for $\eta=\{\eta_v\}_{v\in \mathbb Z^2}$ denoting a sample of the two-dimensional discrete Gaussian free field on $\mathbb Z^2$ pinned at the origin, we consider the random walk on~$\mathbb Z^2$ among random…

Probability · Mathematics 2020-01-28 Marek Biskup , Jian Ding , Subhajit Goswami

We consider a branching system of random walk in random environment (in location) in $\mathbb{N}$. We will give the exact limit value of $\frac{M_{n}}{n}$, where $M_{n}$ denotes the minimal position of branching random walk at time $n$. A…

Probability · Mathematics 2018-09-18 Wenming Hong , Wanting Hou , Xiaoyue Zhang

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

Probability · Mathematics 2019-02-20 Thibault Espinasse , Nadine Guillotin-Plantard , Philippe Nadeau

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

Probability · Mathematics 2007-05-23 Timothy Prescott , Francis Edward Su

We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation…

Probability · Mathematics 2020-12-16 Pierre Mathieu , Alessandro Sisto

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

Probability · Mathematics 2007-05-23 Yuval Peres , Ofer Zeitouni

We consider a discrete time simple symmetric random walk among Bernoulli obstacles on $\mathbb{Z}^d$, $d\geq 2$, where the walk is killed when it hits an obstacle. It is known that conditioned on survival up to time $N$, the random walk…

Probability · Mathematics 2020-05-19 Jian Ding , Ryoki Fukushima , Rongfeng Sun , Changji Xu

On a locally compact group $E$ with countable base, we consider a random walk $X$ that has a unique (up to a positive factor) $r$-invariant measure for some $r>0$. Under some weak conditions on the measure, there is a unique continuous…

Probability · Mathematics 2015-11-10 M. G. Shur

A random walk $w_n$ on a separable, geodesic hyperbolic metric space $X$ converges to the boundary $\partial X$ with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes…

Geometric Topology · Mathematics 2021-01-22 Matt Sunderland

We consider a d-dimensional random walk in random scenery X(n), where the scenery consists of i.i.d. with exponential moments but a tail decay of the form exp(-c t^a) with a<d/2. We study the probability, when averaged over both randomness,…

Probability · Mathematics 2007-05-23 Amine Asselah , Fabienne Castell

It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z},…

Probability · Mathematics 2022-02-04 Itai Benjamini , Oded Schramm

We study the asymptotic tail probability of the first-passage time over a moving boundary for a random walk conditioned to return to zero, where the increments of the random walk have finite variance. Typically, the asymptotic tail behavior…

Probability · Mathematics 2017-08-09 Fiona Sloothaak , Vitali Wachtel , Bert Zwart

We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-18 Danupon Nanongkai , Atish Das Sarma , Gopal Pandurangan

Consider a random walk whose (light-tailed) increments have positive mean. Lower and upper bounds are provided for the expected maximal value of the random walk until it experiences a given drawdown d. These bounds, related to the Calmar…

Probability · Mathematics 2008-07-23 Isaac Meilijson

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

Probability · Mathematics 2017-02-09 Alan Hammond

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

Probability · Mathematics 2016-11-03 Denis Denisov , Alexander Sakhanenko , Vitali Wachtel

We calculate, for a branching random walk $X_n(l)$ to a leaf $l$ at depth $n$ on a binary tree, the positive integer moments of the random variable $\frac{1}{2^{n}}\sum_{l=1}^{2^n}e^{2\beta X_n(l)}$, for $\beta\in\mathbb{R}$. We obtain…

Mathematical Physics · Physics 2021-01-15 E. C. Bailey , J. P. Keating

Let $\nu\in M^1([0,\infty[)$ be a fixed probability measure. For each dimension $p\in \mathbb{N}$, let $(X_n^{p})_{n\geq1}$ be i.i.d. $\mathbb{R}^p$-valued random variables with radially symmetric distributions and radial distribution…

Probability · Mathematics 2019-02-20 Waldemar Grundmann

We consider the simple random walk conditioned to stay forever in a finite domain $D_N \subset \mathbb{Z}^d, d \geq 3$ of typical size $N$. This confined walk is a random walk on the conductances given by the first eigenvector of the…

Probability · Mathematics 2025-11-13 Nicolas Bouchot
‹ Prev 1 4 5 6 7 8 10 Next ›