English
Related papers

Related papers: Scaling limits for simple random walks on random o…

200 papers

We introduce a model of branching interlacements for general critical offspring distributions. It consists of a countable collection of infinite tree-indexed random walk trajectories on $Z^d,d\geq5$. We show that this model turns out to be…

Probability · Mathematics 2019-12-03 Qingsan Zhu

We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the…

Probability · Mathematics 2026-05-21 Matthew Junge , Harley Kaufman , Josh Meisel

We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…

Probability · Mathematics 2010-10-22 Itai Benjamini , Sebastian Müller

Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…

Probability · Mathematics 2023-06-05 Ryuya Namba

The primary purpose of this article is to prove a tightness of skew random walks. The tightness result implies, in particular, that the skew Brownian motion can be constructed as the scaling limit of such random walks. Our proof of…

Probability · Mathematics 2011-06-28 Youngsoo Seol

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 study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…

Probability · Mathematics 2013-06-24 Nayantara Bhatnagar , Nick Crawford , Elchanan Mossel , Arnab Sen

We study systems of interacting Brownian particles in one dimension constructed as the diffusion scaling limits of Fisher's vicious walk models. We define two types of nonintersecting Brownian motions, in which we impose no condition (resp.…

Statistical Mechanics · Physics 2007-05-23 M. Katori , H. Tanemura

Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…

Probability · Mathematics 2009-09-29 Jean-François Marckert , Grégory Miermont

We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…

Statistical Mechanics · Physics 2020-05-13 Francesco Mori , Satya N. Majumdar , Gregory Schehr

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Computational Complexity · Computer Science 2016-06-07 Tali Kaufman , David Mass

In this note, we make explicit the law of the renormalized supercritical branching random walk, giving credit to a conjecture formulated in a previous works of the authors for a continuous analog of the branching random walk. Also, in the…

Probability · Mathematics 2012-05-29 Julien Barral , Rémi Rhodes , Vincent Vargas

We examine diffusion-limited aggregation for a one-dimensional random walk with long jumps. We achieve upper and lower bounds on the growth rate of the aggregate as a function of the number of moments a single step of the walk has. In this…

Probability · Mathematics 2013-06-20 Gideon Amir , Omer Angel , Gady Kozma

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…

Probability · Mathematics 2021-02-17 Charles Bordenave , Hubert Lacoin

Let $S$ be the random walk obtained from "coin turning" with some sequence $\{p_n\}_{n\ge 1}$, as introduced in [6]. In this paper we investigate the scaling limits of $S$ in the spirit of the classical Donsker invariance principle, both…

Probability · Mathematics 2019-10-08 Janos Englander , Stanislav Volkov , Zhenhua Wang

Study of random networks generally requires the nodes to be independently and uniformly distributed such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a…

Probability · Mathematics 2023-02-28 Rahul Roy , Kumarjit Saha , Anish Sarkar

Consider a random walk in random environment on a supercritical Galton--Watson tree, and let $\tau_n$ be the hitting time of generation $n$. The paper presents a large deviation principle for $\tau_n/n$, both in quenched and annealed cases.…

Probability · Mathematics 2011-01-11 Elie Aidekon

In this work, we study asymptotics of the genealogy of Galton--Watson processes conditioned on the total progeny. We consider a fixed, aperiodic and critical offspring distribution such that the rescaled Galton--Watson processes converges…

Probability · Mathematics 2007-05-23 Thomas Duquesne

Restrictions to molecular motion by barriers (membranes) are ubiquitous in biological tissues, porous media and composite materials. A major challenge is to characterize the microstructure of a material or an organism nondestructively using…

Soft Condensed Matter · Physics 2011-03-11 Dmitry S. Novikov , Els Fieremans , Jens H. Jensen , Joseph A. Helpern

Given the increments of a simple symmetric random walk $(X_n)_{n\ge0}$, we characterize all possible ways of recycling these increments into a simple symmetric random walk $(Y_n)_{n\ge0}$ adapted to the filtration of $(X_n)_{n\ge0}$. We…

Probability · Mathematics 2021-07-02 A. Collevecchio , K. Hamza , M. Shi , R. J. Williams
‹ Prev 1 8 9 10 Next ›