English
Related papers

Related papers: Transient Random Walks in Random Environment on a …

200 papers

In this paper we prove that under certain assumptions the transient random walk in random environment with bounded jumps (in $\mathbb{Z}$) grows much slower than the speed $n$. Precisely, there is $0<s<1$, such that although $X_n\rto$ we…

Probability · Mathematics 2013-03-06 Wang Huaming

Consider $(1,2)$ random walk in random environment $\{X_n\}_{n\ge0}.$ In each step, the walk jumps at most a distance $2$ to the right or a distance $1$ to the left. For the walk transient to the right, it is proved that almost surely…

Probability · Mathematics 2016-02-10 Hua-Ming Wang

Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…

Probability · Mathematics 2010-02-16 Nina Gantert , Yueyun Hu , Zhan Shi

We consider a random walk in an i.i.d. non-negative potential on the d-dimensional integer lattice. The walk starts at the origin and is conditioned to hit a remote location y on the lattice. We prove that the expected time under the…

Probability · Mathematics 2012-01-04 Elena Kosygina , Thomas Mountford

By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high…

Probability · Mathematics 2022-04-12 Tianyi Bai , Yijun Wan

We consider an irreducible finite range random walk on the $d$-dimensional integer lattice and study asymptotic behaviour of its transition function $p(n; x)$. In particular, for simple random walk our asymptotic formula is valid as long as…

Probability · Mathematics 2015-12-31 Bartosz Trojan

In this paper we study the recurrence and transience of the $\mathbb{Z}^d$-valued branching random walk in random environment indexed by a critical Bienaym\'e-Galton-Watson tree, conditioned to survive. The environment is made either of…

Probability · Mathematics 2025-01-03 Alexandre Legrand , Christophe Sabot , Bruno Schapira

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…

Probability · Mathematics 2011-12-19 Pierre Andreoletti , Pierre Debs

We consider one-dimensional Brownian motion conditioned (in a suitable sense) to have a local time at every point and at every moment bounded by some fixed constant. Our main result shows that a phenomenon of entropic repulsion occurs: that…

Probability · Mathematics 2010-04-22 Itai Benjamini , Nathanael Berestycki

We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…

Probability · Mathematics 2019-04-17 Josh Rosenberg

We consider a recurrent random walk in random environment on a regular tree. Under suitable general assumptions upon the distribution of the environment, we show that the walk exhibits an unusual slow movement: the order of magnitude of the…

Probability · Mathematics 2007-05-23 Yueyun Hu , Zhan Shi

We study the asymptotic behaviour of the probability that a weighted sum of centered i.i.d. random variables X_k does not exceed a constant barrier. For regular random walks, the results follow easily from classical fluctuation theory,…

Probability · Mathematics 2011-05-24 Frank Aurzada , Christoph Baumgarten

Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…

Probability · Mathematics 2011-04-21 Elisabetta Candellero , Lorenz A. Gilch

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

Probability · Mathematics 2010-02-10 Fabienne Castell , Nadine Guillotin-Plantard , Françoise Pène , Bruno Schapira

We consider random walks X_n in Z+, obeying a detailed balance condition, with a weak drift towards the origin when X_n tends to infinity. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional…

Probability · Mathematics 2015-05-13 Joel De Coninck , Francois Dunlop , Thierry Huillet

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

Probability · Mathematics 2020-01-06 Marek Biskup , Pierre-François Rodriguez

We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…

Probability · Mathematics 2022-07-05 Souvik Ray , Rajat Subhra Hazra , Parthanil Roy , Philippe Soulier

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Probability · Mathematics 2023-07-13 Ben Morris , Hamilton Samraj Santhakumar

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

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

Probability · Mathematics 2012-10-24 David Croydon
‹ Prev 1 4 5 6 7 8 10 Next ›