English
Related papers

Related papers: Persistence probabilities for an integrated random…

200 papers

The subject of this paper is the simple random walk on $\mathbb{Z}$. We give a very simple answer to the following problem: under the condition that a random walk has already spent $\alpha$-percent of the traveling time on the positive side…

Probability · Mathematics 2017-01-30 Norio Konno , Hayato Saigo , Hiroki Sako

Let $\{S_n\}$ be a random walk in the domain of attraction of a stable law $\mathcal{Y}$, i.e. there exists a sequence of positive real numbers $(a_n)$ such that $S_n/a_n$ converges in law to $\mathcal{Y}$. Our main result is that the…

Probability · Mathematics 2009-09-29 Francesco Caravenna , Loïc Chaumont

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

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…

Probability · Mathematics 2011-04-20 Peter Gacs

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

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön , Elmar Teufl

We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…

Probability · Mathematics 2017-11-29 Sergey Foss , Zbigniew Palmowski , Stan Zachary

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

Probability · Mathematics 2017-06-19 Alain-Sol Sznitman

In this paper we consider two branching processes living in a joint random environment. Assuming that both processes are critical we address the following question: What is the probability that both populations survive up to a large time…

Probability · Mathematics 2025-02-27 Nikita Elizarov , Vitali Wachtel

Sina\u{i} initiated the study of random walks with persistently positive area processes, motivated by shock waves in solutions to the inviscid Burgers' equation. We find the precise asymptotic probability that the area process of a random…

Probability · Mathematics 2025-07-04 Serte Donderwinkel , Brett Kolesnik

We consider a class of inhomogeneous media known as composite media that is often encountered in experimental sciences and investigate the persistence probability of a random walker in such a system. Analytical and numerical results for the…

Statistical Mechanics · Physics 2009-11-13 D. Chakraborty

There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…

Probability · Mathematics 2019-10-25 Siva Athreya , Alexander Drewitz , Rongfeng Sun

In this article we consider transient random walks on free products of graphs. We prove that the asymptotic range of these random walks exists and is strictly positive. In particular, we show that the range varies real-analytically in terms…

Probability · Mathematics 2022-12-05 Lorenz A. Gilch

We consider random walks conditioned to stay positive. When the mean of increments is zero and variance is finite it is known that they converge to the Rayleigh distribution. In the present paper we derive a Berry-Esseen type estimate and…

Probability · Mathematics 2024-12-12 Denis Denisov , Alexander Tarasov , Vitali Wachtel

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

Probability · Mathematics 2012-11-19 Laurent Tournier

We review some old and prove some new results on the survival probability of a random walk among a Poisson system of moving traps on Z^d, which can also be interpreted as the solution of a parabolic Anderson model with a random…

Probability · Mathematics 2012-05-04 Alexander Drewitz , Jürgen Gärtner , Alejandro F. Ramírez , Rongfeng Sun

We derive a quenched invariance principle for random walks in random environments whose transition probabilities are defined in terms of weighted cycles of bounded length. To this end, we adapt the proof for random walks among random…

Probability · Mathematics 2008-12-18 Jean-Dominique Deuschel , Holger Kösters

Let S_0=0,{S_n, n>0} be a random walk generated by a sequence of i.i.d. random variables X_1,X_2,... and let \tau^{-} be the first descending ladder epoch. Assuming that the distribution of X_1 belongs to the domain of attraction of an…

Probability · Mathematics 2007-11-09 Vladimir Vatutin , Vitali Wachtel

The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…

Statistical Mechanics · Physics 2007-05-23 L. Turban

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