English
Related papers

Related papers: Pinning of a random walk by a random walk: proof o…

200 papers

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

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

We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…

Probability · Mathematics 2015-06-03 Arnaud Rousselle

We consider trap models on Z^d, namely continuous time Markov jump process on Z^d with embedded chain given by a generic discrete time random walk, and whose mean waiting time at x is given by tau_x, with tau = (tau_x, x in Z^d) a family of…

Probability · Mathematics 2017-05-17 Luiz Renato Fontes , Pierre Mathieu

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,…

Probability · Mathematics 2016-08-04 Darcy Camargo , Serguei Popov

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…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

Probability · Mathematics 2016-02-09 D. A. Dawson , L. G. Gorostiza

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 consider the Random Walk Pinning Model studied in [3,2]: this is a random walk X on Z^d, whose law is modified by the exponential of \beta times L_N(X,Y), the collision local time up to time N with the (quenched) trajectory Y of another…

Probability · Mathematics 2010-07-22 Q. Berger , F. Toninelli

We consider a one-dimensional simple random walk surviving among a field of static soft traps : each time it meets a trap the walk is killed with probability 1--e --$\beta$ , where $\beta$ is a positive and fixed parameter. The positions of…

Probability · Mathematics 2018-10-02 Julien Poisat , François Simenhaus

Consider a continuous time random walk in $\mathbb{Z}$ with independent and exponentially distributed jumps $\pm1$. The model in this paper consists in an infinite number of such random walks starting from the complement of…

Mathematical Physics · Physics 2013-07-25 Mark Adler , Patrik L. Ferrari , Pierre van Moerbeke

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

Probability · Mathematics 2015-05-20 Daniel Paulin , Domokos Szász

We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…

Probability · Mathematics 2025-04-25 Conrado da Costa , Mikhail Menshikov , Andrew Wade

We consider a random walk on top of the contact process on $\mathbb{Z}^d$ with $d\geq 1$. In particular, we focus on the "contact process as seen from the random walk". Under the assumption that the infection rate of the contact process is…

Probability · Mathematics 2016-07-13 Stein Andreas Bethuelsen

We consider a model of random walk in ${\mathbb Z}^2$ with (fixed or random) orientation of the horizontal lines (layers) and with non constant iid probability to stay on these lines. We prove the transience of the walk for any fixed…

Probability · Mathematics 2012-11-27 Alexis Devulder , Francoise Pene

We give a complete classification of scaling limits of randomly trapped random walks and associated clock processes on $\mathbb Z^d$, $d\ge 2$. Namely, under the hypothesis that the discrete skeleton of the randomly trapped random walk has…

Probability · Mathematics 2014-10-02 Jiří Černý , Tobias Wassmer

We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…

Probability · Mathematics 2020-09-17 Jian Ding , Ryoki Fukushima , Rongfeng Sun , Changji Xu

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…

Probability · Mathematics 2023-11-30 Matteo Quattropani , Federico Sau

We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…

Probability · Mathematics 2009-05-15 Michael J. Kozdron , Gregory F. Lawler

We consider d independent walkers on Z, m of them performing simple symmetric random walk and r = d -- m of them performing recurrent RWRE (Sinai walk), in I independent random environments. We show that the product is recurrent, almost…

Probability · Mathematics 2018-07-12 Alexis Devulder , Nina Gantert , Françoise Pene
‹ Prev 1 2 3 10 Next ›