English
Related papers

Related papers: The range of tree-indexed random walk

200 papers

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 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 review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…

Probability · Mathematics 2007-05-23 Franz Merkl , Silke W. W. Rolles

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…

Probability · Mathematics 2014-11-10 Ágnes Backhausz , Tamás F. Móri

We prove a law of large numbers for random walks in certain kinds of i.i.d. random environments in Z^d that is an extension of a result of Bolthausen, Sznitman and Zeitouni (2003). We use this result, along with the lace expansion for…

Probability · Mathematics 2016-11-25 Mark Holmes , Rongfeng Sun

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

Probability · Mathematics 2025-05-12 Aritra Majumdar , Krishanu Maulik

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

Let $\Gamma$ be a non-elementary relatively hyperbolic group with a finite generating set. Consider a finitely supported admissible and symmetric probability measure $\mu$ on $\Gamma$ and a probability measure $\nu$ on $\mathbb{N}$ with…

Probability · Mathematics 2022-11-15 Matthieu Dussaule , Longmin Wang , Wenyuan Yang

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

Probability · Mathematics 2023-02-14 E. Filichkina , E. Yarovaya

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

Probability · Mathematics 2019-03-05 Thomas Sauerwald , Luca Zanetti

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

Probability · Mathematics 2012-06-19 Michael Aizenman , Almut Burchard , Charles M. Newman , David B. Wilson

Consider a branching random walk $(V_u)_{u\in \mathcal T^{IGW}}$ in $\mathbb Z^d$ with the genealogy tree $\mathcal T^{IGW}$ formed by a sequence of i.i.d. critical Galton-Watson trees. Let $R_n $ be the set of points in $\mathbb Z^d$…

Probability · Mathematics 2022-07-22 Tianyi Bai , Yueyun Hu

One can define a random walk on a hypercubic lattice in a space of integer dimension $D$. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given…

High Energy Physics - Lattice · Physics 2009-10-22 Carl M. Bender , Stefan Boettcher , Lawrence R. Mead

We study the boundary of the range of simple random walk on $\mathbb{Z}^d$ in the transient regime $d\ge 3$. We show that volumes of the range and its boundary differ mainly by a martingale. As a consequence, we obtain a bound on the…

Probability · Mathematics 2016-06-10 Amine Asselah , Bruno Schapira

We establish both the $\limsup$ and the $\liminf$ law of the iterated logarithm (LIL), for the capacity of the range of a simple random walk in any dimension $d\ge 3$. While for $d \ge 4$, the order of growth in $n$ of such LIL at dimension…

Probability · Mathematics 2024-03-05 Amir Dembo , Izumi Okada

We prove a strong law of large numbers and an annealed invariance principle for a random walk in a one-dimensional dynamic random environment evolving as the simple exclusion process with jump parameter $\gamma$. First, we establish that if…

Probability · Mathematics 2015-11-02 François Huveneers , François Simenhaus

In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate…

Probability · Mathematics 2024-09-10 Alice Guionnet , Jiaoyang Huang

We prove that the growth constants for nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd are asymptotic to 2de as the dimension goes to infinity, and that their critical one-point functions converge to e.…

Probability · Mathematics 2011-02-18 Yuri Mejia Miranda , Gordon Slade

We study the asymptotic behavior of a nonlattice random walk in a general cone of $R^d$ . Following the approach initiated by D. Denisov and V. Wachtel in [8], we use a strong approximation of random walks by the Brownian motion and prove…

Probability · Mathematics 2026-03-30 Thi da Cam Pham , Marc Peigné , Doan Thai Son

We study the statistics of the number of records R_{n,N} for N identical and independent symmetric discrete-time random walks of n steps in one dimension, all starting at the origin at step 0. At each time step, each walker jumps by a…

Statistical Mechanics · Physics 2012-07-24 Gregor Wergen , Satya N. Majumdar , Gregory Schehr