English
Related papers

Related papers: Random walk on barely supercritical branching rand…

200 papers

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

Probability · Mathematics 2023-09-01 Fabian Michel

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

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

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

Probability · Mathematics 2011-01-24 Gerard Ben Arous , Alan Hammond

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

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

Probability · Mathematics 2025-09-30 George Andriopoulos

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

Probability · Mathematics 2016-05-02 A. D. Barbour , A. Collevecchio

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

Probability · Mathematics 2007-05-23 Yuval Peres , Ofer Zeitouni

Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong…

Probability · Mathematics 2011-01-25 Daniela Bertacchi , Fabio Zucca

In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…

Probability · Mathematics 2025-11-25 Irene Ayuso Ventura , Quentin Berger

In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…

Probability · Mathematics 2025-10-28 Hindy Drillick , Shalin Parekh

We consider a subcritical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We consider the event $% \mathcal{A}_{i}(n)$ that all individuals alive at time $n$ are offspring of the…

Probability · Mathematics 2020-09-09 E. E. Dyakonova , V. A. Vatutin

We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…

Probability · Mathematics 2017-07-03 Katja Miller

We consider critical site percolation ($p=p_c=1/2$) on the triangular lattice $\mathbf{T}$ in two dimensions. We show that the simple random walk on the clusters of open vertices converges in the scaling limit to a continuous diffusion…

Probability · Mathematics 2026-04-16 Irina Đanković , Maarten Markering , Jason Miller , Yizheng Yuan

We consider a null recurrent random walk $\mathbb{X}$ on a super-critical Galton Watson marked tree $\mathbb{T}$ in the (sub-)diffusive regime. We are interested in the asymptotic behaviour of the local time of its root at $n$, which is the…

Probability · Mathematics 2023-12-27 Alexis Kagan

We consider a branching random walk on a multi($Q$)-type, supercritical Galton-Watson tree which satisfies Kesten-Stigum condition. We assume that the displacements associated with the particles of type $Q$ have regularly varying tails of…

Probability · Mathematics 2019-09-25 Ayan Bhattacharya , Krishanu Maulik , Zbigniew Palmowski , Parthanil Roy

Let $\{Z_n\}_{n\geq 0 }$ be a $d$-dimensional supercritical branching random walk started from the origin. Write $Z_n(S)$ for the number of particles located in a set $S\subset\mathbb{R}^d$ at time $n$. Denote by…

Probability · Mathematics 2023-07-19 Shuxiong Zhang

Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…

Probability · Mathematics 2022-10-10 Janos Englander , Stanislav Volkov

We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like…

Probability · Mathematics 2013-05-30 Xinxin Chen

We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which…

Probability · Mathematics 2011-12-22 Erik Broman , Ronald Meester