English
Related papers

Related papers: Gaussian approximation for rooted edges in a rando…

200 papers

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

Combinatorics · Mathematics 2025-04-01 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

Consider a $d$-ary rooted tree ($d\geq3$) where each edge $e$ is assigned an i.i.d. (bounded) random variable $X(e)$ of negative mean. Assign to each vertex $v$ the sum $S(v)$ of $X(e)$ over all edges connecting $v$ to the root, and assume…

Probability · Mathematics 2014-07-03 Pascal Maillard , Ofer Zeitouni

We consider the problem $(\rm P)$ of exactly fitting an ellipsoid (centered at $0$) to $n$ standard Gaussian random vectors in $\mathbb{R}^d$, as $n, d \to \infty$ with $n / d^2 \to \alpha > 0$. This problem is conjectured to undergo a…

Probability · Mathematics 2025-08-21 Afonso S. Bandeira , Antoine Maillard

Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly…

Probability · Mathematics 2023-03-29 Emma Bailey , Matthew Junge , Jiaqi Liu

We consider deterministic random walks on the real line driven by irrational rotations, or equivalently, skew product extensions of a rotation by $\alpha$ where the skewing cocycle is a piecewise constant mean zero function with a jump by…

Dynamical Systems · Mathematics 2017-05-23 Michael Bromberg , Corinna Ulcigrai

For a measure mu supported on a compact connected subset of a Euclidean space which satisfies a uniform d-dimensional decay of the volume of balls we show that the maximal edge in the minimum spanning tree of n indepndent samples from mu…

Probability · Mathematics 2007-05-23 Gady Kozma , Zvi Lotker , Gideon Stupp

In this note, we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton-Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves is considered. A…

Probability · Mathematics 2017-01-17 Adam Bowditch

We consider the top tree compression scheme introduced by Bille et al. [ICALP 2013] and construct an infinite family of trees on $n$ nodes labeled from an alphabet of size $\sigma$, for which the size of the top DAG is…

Data Structures and Algorithms · Computer Science 2018-01-04 Bartłomiej Dudek , Paweł Gawrychowski

Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…

Probability · Mathematics 2013-07-23 Jean Bertoin , Grégory Miermont

We present a new approach, inspired by Stein's method, to prove a central limit theorem (CLT) for linear statistics of $\beta$-ensembles in the one-cut regime. Compared with the previous proofs, our result requires less regularity on the…

Probability · Mathematics 2019-02-20 Gaultier Lambert , Michel Ledoux , Christian Webb

We consider exclusion processes on a rooted $d$-regular tree. We start from a Bernoulli product measure conditioned on having a particle at the root, which we call the tagged particle. For $d\geq 3$, we show that the tagged particle has…

Probability · Mathematics 2019-01-29 Dayue Chen , Peng Chen , Nina Gantert , Dominik Schmid

The metric $D_\alpha (q,q')$ on the set $Q$ of particle locations of a homogeneous Poisson process on $R^d$, defined as the infimum of $(\sum_i |q_i - q_{i+1}|^\alpha)^{1/\alpha}$ over sequences in $Q$ starting with $q$ and ending with $q'$…

Probability · Mathematics 2007-05-23 C. D. Howard , C. M. Newman

We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…

Probability · Mathematics 2007-05-23 Francois Baccelli , Charles Bordenave

Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…

Probability · Mathematics 2026-02-20 Christian Hirsch , Kyeongsik Nam , Moritz Otto

Consider the point process (in $\mathbb{R}^d$) of local maxima of smooth Gaussian fields, with sufficient decay of correlation at infinity, above a level $u$. We show that this point process, rescaled appropriately, converges weakly to a…

Probability · Mathematics 2026-02-25 Dmitry Beliaev , Akshay Hegde

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…

Probability · Mathematics 2023-12-11 Miklós Abert , Mikołaj Frączyk , Ben Hayes

Let $W_{\infty}(\beta)$ be the limit of the Biggins martingale $W_n(\beta)$ associated to a supercritical branching random walk with mean number of offspring $m$. We prove a functional central limit theorem stating that as $n\to\infty$ the…

Probability · Mathematics 2015-05-12 Rudolf Grübel , Zakhar Kabluchko

P\'olya trees are rooted trees considered up to symmetry. We establish the convergence of large uniform random P\'olya trees with arbitrary degree restrictions to Aldous' Continuum Random Tree with respect to the Gromov-Hausdorff metric.…

Probability · Mathematics 2016-12-12 Konstantinos Panagiotou , Benedikt Stufler

A $d$-dimensional elastic manifold at depinning is described by a renormalized field theory, based on the Functional Renormalization Group (FRG). Here we analyze this theory to 3-loop order, equivalent to third order in $\epsilon=4-d$,…

Disordered Systems and Neural Networks · Physics 2025-11-11 Mikhail N. Semeikin , Kay Joerg Wiese

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

Probability · Mathematics 2012-10-26 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra
‹ Prev 1 4 5 6 7 8 10 Next ›