English
Related papers

Related papers: Randomly biased walks on subcritical trees

200 papers

We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…

Probability · Mathematics 2007-12-03 Iddo Ben-Ari , Mathieu Merle , Alexander Roitershtein

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

Probability · Mathematics 2018-06-13 Igor Kortchemski , Loïc Richier

We study a model of multi-excited random walk with non-nearest neighbour steps on $\mathbb Z$, in which the walk can jump from a vertex $x$ to either $x+1$ or $x-i$ with $i\in \{1,2,\dots,L\}$, $L\ge 1$. We first point out the multi-type…

Probability · Mathematics 2022-05-12 Tuan-Minh Nguyen

Given a random walk $(S_n)$ with typical step distributed according to some fixed law and a fixed parameter $p \in (0,1)$, the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with…

Probability · Mathematics 2022-10-19 Marco Bertenghi , Alejandro Rosales-Ortiz

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

Probability · Mathematics 2007-05-23 Robin Pemantle , Russell Lyons

We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…

Probability · Mathematics 2018-09-20 Andrea Collevecchio , Paul Jung

We use maximal entropy random walk (MERW) to study the trapping problem in dendrimers modeled by Cayley trees with a deep trap fixed at the central node. We derive an explicit expression for the mean first passage time from any node to the…

Statistical Mechanics · Physics 2014-06-19 Xin Peng , Zhongzhi Zhang

We consider a one dimensional asymmetric random walk whose jumps are identical, independent and drawn from a distribution \phi(\eta) displaying asymmetric power law tails (i.e. \phi(\eta) \sim c/\eta^{\alpha +1} for large positive jumps and…

Statistical Mechanics · Physics 2014-02-24 Clélia de Mulatier , Alberto Rosso , Gregory Schehr

We study the asymptotic behavior of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step…

Probability · Mathematics 2015-06-04 Denis Denisov , Vitali Wachtel

In this paper, we study the random walk on a supercritical branching process with an uncountable and unbounded set of types supported on the $d$-regular tree $\mathbb{T}_d$ ($d\geq 3$), namely the cluster $\mathcal{C}_\circ^h$ of the root…

Probability · Mathematics 2023-04-19 Guillaume Conchon--Kerjan

We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…

Probability · Mathematics 2018-02-06 Marcus Michelen , Robin Pemantle , Josh Rosenberg

We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…

Statistical Mechanics · Physics 2024-12-11 Ana Gabriela Guerrero-Estrada , Alejandro P. Riascos , Denis Boyer

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

Probability · Mathematics 2021-03-29 Yiping Hu , Russell Lyons , Pengfei Tang

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

Probability · Mathematics 2015-01-14 Masato Shinoda , Elmar Teufl , Stephan Wagner

We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…

Probability · Mathematics 2024-03-05 Marek Biskup , Minghao Pan

We consider a branching random walk initiated by a single particle at location 0 in which particles alternately reproduce according to the law of a Galton-Watson process and disperse according to the law of a driftless random walk on the…

Probability · Mathematics 2014-03-31 Steven P. Lalley , Yuan Shao

We study random walks evolving in continuous time on a one-dimensional lattice where each site $x$ hosts a quenched random potential $U_x$. The potentials on different sites are independent, identically distributed Gaussian random…

Statistical Mechanics · Physics 2026-02-27 Silvio Kalaj , Enzo Marinari , Gleb Oshanin , Luca Peliti

We provide a complete picture of the local convergence of critical or subcritical Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set. The generic case, where the limit is a random tree with…

Probability · Mathematics 2014-07-01 Romain Abraham , Jean-Francois Delmas

Branching processes in a random environment are natural generalisations of Galton-Watson processes. In this paper we analyse the asymptotic decay of the survival probability for a sequence of slightly supercritical branching processes in an…

Probability · Mathematics 2024-12-23 Florin Boenkost , Götz Kersting

We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…

Probability · Mathematics 2024-07-24 Eleanor Archer , Quirin Vogel