Related papers: Disconnection, random walks, and random interlacem…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…
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…
In this paper we generalize the result of directional transience from [SabotTournier10]. This enables us, by means of [Simenhaus07], [ZernerMerkl01] and [Bouchet12] to conclude that, on Z^d (for any dimension d), random walks in i.i.d.…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
We consider the simple random walk on Z^d, d > 2, evolving in a potential of the form \beta V, where (V(x), x \in Z^d) are i.i.d. random variables taking values in [0,+\infty), and \beta\ > 0. When the potential is integrable, the…
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…
We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…
For the range-R bond percolation in d=4,5,6, we obtain a lower bound for the critical probability p_c for R large, agreeing with the conjectured asymptotics and thus complementing the corresponding results of Van der Hofstad-Sakai (2005)…
In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any $d \geq 1$ and for any exponent $s \in (d, (d+2) \wedge 2d)$ giving the…
We investigate the percolative properties of the vacant set left by random interlacements on Z^d, when d is large. A non-negative parameter u controls the density of random interlacements on Z^d. It is known from arXiv:0704.2560, and…
Distance correlation has become an increasingly popular tool for detecting the nonlinear dependence between a pair of potentially high-dimensional random vectors. Most existing works have explored its asymptotic distributions under the null…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…
We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…
The aim of this short article is to convey the basic idea of the original paper [3], without going into too much detail, about how to derive sharp asymptotics of the gyration radius for random walk, self-avoiding walk and oriented…
We consider random walks in a random environment of the type p_0+\gamma\xi_z, where p_0 denotes the transition probabilities of a stationary random walk on \BbbZ^d, to nearest neighbors, and \xi_z is an i.i.d. random perturbation. We give…
Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…
We present a multiscale analysis for the exit measures from large balls in Z^d, d\geq 3, of random walks in certain i.i.d. random environments which are small perturbations of the fixed environment corresponding to simple random walk. Our…