English
Related papers

Related papers: Scaling limits for critical inhomogeneous random g…

200 papers

We show that in three different critical regimes, the masses of the connected components of rank-2 multiplicative random graph converge to lengths of excursions of a thinned L\'{e}vy process, perhaps with random coefficients. The three…

Probability · Mathematics 2024-10-15 David Clancy

We prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhorov topology, of uniform random graphs in each of the three following families of graphs: distance-hereditary graphs, $2$-connected…

Probability · Mathematics 2022-07-26 Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Adeline Pierrot

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

Probability · Mathematics 2016-08-04 Erich Baur , Grégory Miermont , Gourab Ray

We study the connected components in critical percolation on the Hamming hypercube $\{0,1\}^m$. We show that their sizes rescaled by $2^{-2m/3}$ converge in distribution, and that, considered as metric measure spaces with the graph distance…

Probability · Mathematics 2024-01-30 Arthur Blanc-Renaudie , Nicolas Broutin , Asaf Nachmias

In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…

Probability · Mathematics 2020-07-01 Souvik Dhara , Remco van der Hofstad , Johan S. H. van Leeuwaarden

We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…

Probability · Mathematics 2025-06-11 Umberto De Ambroggio

The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice is studied numerically. For most concentrations of the scatterers the trajectories close…

Condensed Matter · Physics 2007-05-23 Meng-she Cao , E. G. D. Cohen

In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and…

Probability · Mathematics 2009-11-17 Gady Kozma , Asaf Nachmias

Recently, Hammond and Sheffield introduced a model of correlated random walks that scale to fractional Brownian motions with long-range dependence. In this paper, we consider a natural generalization of this model to dimension $d\geq 2$. We…

Probability · Mathematics 2015-04-21 Hermine Biermé , Olivier Durieu , Yizao Wang

We give a short proof that the largest component of the random graph $G(n, 1/n)$ is of size approximately $n^{2/3}$. The proof gives explicit bounds for the probability that the ratio is very large or very small.

Probability · Mathematics 2011-11-10 Asaf Nachmias , Yuval Peres

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

We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…

Probability · Mathematics 2015-10-30 Gérard Ben Arous , Manuel Cabezas , Jiří Černý , Roman Royfman

We consider a class of scale-free inhomogeneous random graphs, which includes some long-range percolation models. We study the maximum degree in such graphs in a growing observation window and show that its limiting distribution is Frechet.…

Probability · Mathematics 2021-06-18 Chinmoy Bhattacharjee , Matthias Schulte

The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…

Mathematical Physics · Physics 2007-05-23 Michael Aizenman

We study random graphs with an i.i.d. degree sequence of which the tail of the distribution function $F$ is regularly varying with exponent $\tau\in (1,2)$. Thus, the degrees have infinite mean. Such random graphs can serve as models for…

Probability · Mathematics 2007-05-23 Remco van der Hofstad , Gerard Hooghiemstra , Dmitri Znamenski

We show that the Gromov-Hausdorff-Prohorov scaling limit of a critical percolation cluster on a random hyperbolic triangulation of the half-plane is the Brownian continuum random tree. As a corollary, we obtain that a simple random walk on…

Probability · Mathematics 2023-11-21 Eleanor Archer , David A. Croydon

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Probability · Mathematics 2021-12-08 David A. Croydon , Daisuke Shiraishi

Using free-fermionic techniques we study the entanglement entropy of a block of contiguous spins in a large finite quantum Ising chain in a transverse field, with couplings of different types: homogeneous, periodically modulated and random.…

Statistical Mechanics · Physics 2009-11-13 Ferenc Igloi , Yu-Cheng Lin

Finite size fluctuations are a crucial ingredient in kinetic theory of long-range interacting collisionless systems. In this Letter, we introduce a phenomenological theory which predicts an anomalous scaling close to marginal stability for…

Statistical Mechanics · Physics 2026-03-19 Yoshiyuki Y. Yamaguchi , Julien Barré

Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the…

Probability · Mathematics 2026-03-09 Riccardo Michielan , Clara Stegehuis , Bert Zwart