English
Related papers

Related papers: Large deviation Local Limit Theorems and limits of…

200 papers

We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…

Probability · Mathematics 2019-03-07 Nicolas Curien , Tom Hutchcroft , Asaf Nachmias

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Probability · Mathematics 2016-06-14 Jonathon Peterson

We derive a scaling limit in law for the cover time of a simple random walk on a lattice version of a scaled-up planar domain with wired boundary conditions. The limiting distribution is that of a Gumbel Random Variable shifted randomly by…

Probability · Mathematics 2026-02-26 Oren Louidor , Santiago Saglietti

We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…

Probability · Mathematics 2026-05-27 Guillaume Conchon--Kerjan , Toril Palaniappan

Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…

Probability · Mathematics 2015-04-21 Alberto Lanconelli

We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly…

Probability · Mathematics 2021-10-18 Gérard Ben Arous , Manuel Cabezas , Alexander Fribergh

In this paper, we study a class of random walks that build their own tree. At each step, the walker attaches a random number of leaves to its current position. The model can be seen as a subclass of the Random Walk in Changing Environments…

Probability · Mathematics 2024-05-08 Rodrigo Ribeiro

In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…

Probability · Mathematics 2022-07-26 Zhen-Qing Chen , Takashi Kumagai , Laurent Saloff-Coste , Jian Wang , Tianyi Zheng

Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…

Probability · Mathematics 2026-03-31 Bálint Vető , Bálint Virág

We prove that uniform random quadrangulations of the sphere with $n$ faces, endowed with the usual graph distance and renormalized by $n^{-1/4}$, converge as $n\to\infty$ in distribution for the Gromov-Hausdorff topology to a limiting…

Probability · Mathematics 2011-05-11 Grégory Miermont

We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…

Probability · Mathematics 2022-06-08 Raffaella Carbone , Federico Girotti , Anderson Melchor Hernandez

We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…

Probability · Mathematics 2018-02-09 Benedikt Stufler

We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that…

Probability · Mathematics 2019-12-17 Bénédicte Haas , Robin Stephenson

We identify the local scaling limit of the Uniform Infinite Planar Quadrangulation (UIPQ) and of critical Boltzmann quadrangulations, when one simultaneously rescales the distances and reroot them far away from the root of a distinguished…

Probability · Mathematics 2025-11-21 Mathieu Mourichoux

We discuss asymptotics for the boundary of critical Boltzmann planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha \in (1,2)$.…

Probability · Mathematics 2017-11-30 Loïc Richier

We prove large deviation results for the position of the rightmost particle, denoted by $M_n$, in a one-dimensional branching random walk in a case when Cram\'er's condition is not satisfied. More precisely we consider step size…

Probability · Mathematics 2020-06-17 Piotr Dyszewski , Nina Gantert , Thomas Höfelsauer

We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified approach for the enumeration of several classes of cubic…

Combinatorics · Mathematics 2022-10-04 Michael Drmota , Marc Noy , Clément Requilé , Juanjo Rué

This paper studies particle propagation in a one-dimensional inhomogeneous medium where the laws of motion are generated by chaotic and deterministic local maps. Assuming that the particle's initial location is random and uniformly…

Probability · Mathematics 2011-10-18 Lasse Leskelä , Mikko Stenlund

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

Probability · Mathematics 2011-09-02 Gabriel Faraud

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

Probability · Mathematics 2024-12-18 Sam Olesker-Taylor , Thomas Sauerwald , John Sylvester