English
Related papers

Related papers: Localization for random walks among random obstacl…

200 papers

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

Data Structures and Algorithms · Computer Science 2024-09-17 Jingbang Chen , Mehrdad Ghadiri , Hoai-An Nguyen , Richard Peng , Junzhao Yang

We consider a random walk in $\mathbb Z^d$ which jumps from a site $x$ to a nearest neighboring site $x+e$ (where $e\in V:=\{x\in\mathbb Z^d: |x|_1=1\}$) with probability $p_0(e)+\epsilon\xi(x,e)$. Here $\sum_e p_0(e)=1$, $p_0(e)> 0$,…

Probability · Mathematics 2017-01-31 Alejandro F. Ramirez

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

Probability · Mathematics 2007-10-12 Francis Comets , Francois Simenhaus

We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…

Probability · Mathematics 2020-11-23 Amine Asselah , Bruno Schapira

We study random walks in i.i.d. random environments on $\mathbb{Z}^d$ when there are two basic types of vertices, which we call "blue" and "red". Each color represents a different probability distribution on transition probability vectors.…

Probability · Mathematics 2025-01-03 Daniel J. Slonim

We study nearest-neighbors branching random walks started from a point at the interior of a hypercube. We show that the probability that the process escapes the hypercube is monotonically decreasing with respect to the distance of its…

Probability · Mathematics 2020-02-28 Achillefs Tzioufas

We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…

Probability · Mathematics 2013-09-20 Christophe Sabot , Laurent Tournier

We study the speed of a biased random walk on a percolation cluster on $\Z^d$ in function of the percolation parameter $p$. We obtain a first order expansion of the speed at $p=1$ which proves that percolating slows down the random walk at…

Probability · Mathematics 2010-11-18 Alexander Fribergh

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

Probability · Mathematics 2009-07-06 Alain-Sol Sznitman

We prove two results on the delocalization of the endpoint of a uniform self-avoiding walk on Z^d for d>1. We show that the probability that a walk of length n ends at a point x tends to 0 as n tends to infinity, uniformly in x. Also, for…

Probability · Mathematics 2021-12-17 Hugo Duminil-Copin , Alexander Glazman , Alan Hammond , Ioan Manolescu

We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…

Probability · Mathematics 2017-02-01 Siva Athreya , Alexander Drewitz , Rongfeng Sun

Consider a symmetric aperiodic random walk in $Z^d$, $d\geq 3$. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show…

Probability · Mathematics 2007-05-23 Endre Csáki , Antónia Földes , Pál Révész

We study a random walk in a random environment (RWRE) on $\Z^d$, $1 \leq d < +\infty$. The main assumptions are that conditionned on the environment the random walk is reversible. Moreover we construct our environment in such a way that the…

Probability · Mathematics 2009-03-17 Pierre Andreoletti

We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…

Combinatorics · Mathematics 2019-02-11 Kiana Mittelstaedt

We consider a continuous time random walk $X$ in random environment on $\Z^+$ such that its potential can be approximated by the function $V: \R^+\to \R$ given by $V(x)=\sig W(x) -\frac{b}{1-\alf}x^{1-\alf}$ where $\sig W$ a Brownian motion…

Probability · Mathematics 2013-06-17 Christophe Gallesco , Serguei Popov , Gunter M. Schütz

The ball-constrained weighted maximin dispersion problem $(\rm P_{ball})$ is to find a point in an $n$-dimensional Euclidean ball such that the minimum of the weighted Euclidean distance from given $m$ points is maximized. We propose a new…

Optimization and Control · Mathematics 2016-04-11 Shu Wang , Yong Xia

The eigenvalue spectra of the transition probability matrix for random walks traversing critically disordered clusters in three different types of percolation problems show that the random walker sees a developing Euclidean signature for…

Statistical Mechanics · Physics 2009-11-07 E. Cuansing , H. Nakanishi

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

Probability · Mathematics 2007-12-06 Nobuo Yoshida

We consider an infinite system of particles in one dimension, each particle performs independant Sinai's random walk in random environment. Considering an instant $t$, large enough, we prove a result in probability showing that the…

Probability · Mathematics 2009-11-13 Pierre Andreoletti

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