Related papers: Uniform attachment with freezing: Scaling limits
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
Condensation is the phenomenon whereby one of a sum of random variables contributes a finite fraction to the sum. It is manifested as an aggregation phenomenon in diverse physical systems such as coalescence in granular media, jamming in…
Consider a homogeneous Poisson point process in a compact convex set in $d$-dimensional Euclidean space which has interior points and contains the origin. The radial spanning tree is constructed by connecting each point of the Poisson point…
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with…
This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D…
We study a general model of recursive trees where vertices are equipped with independent weights and at each time-step a vertex is sampled with probability proportional to its fitness function (a function of its weight and degree) and…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…
We propose a unified scaling theory of entanglement entropy in the confinements of finite bond dimensions, dynamics and system sizes. Within the theory, the finite-entanglement scaling introduced recently is generalized to the dynamics…
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…
Numerical and theoretical studies of a one-dimensional spin model with locally broken spin symmetry are presented. The multi-species annihilating random walk transition found at zero branching rate previously is investigated now concerning…
We establish the scaling limit of the geodesics to the root for the first passage percolation distance on random planar maps. We first describe the scaling limit of the number of faces along the geodesics. This result enables us to compare…
We give evidence of a clear structural signature of the glass transition, in terms of a static correlation length with the same dependence on the system size which is typical of critical phenomena. Our approach is to introduce an external,…
Using an exact mapping to disordered Coulomb gases, we introduce a novel method to study two dimensional Dirac fermions with quenched disorder in two dimensions which allows to treat non perturbative freezing phenomena. For purely random…
A numerical study of Anderson transition on random regular graphs (RRG) with diagonal disorder is performed. The problem can be described as a tight-binding model on a lattice with N sites that is locally a tree with constant connectivity.…
The adhesion dynamics of a membrane confined between two permeable walls is studied using a two-dimensional hydrodynamic model. The membrane morphology decomposes into adhesion patches on the upper and the lower walls and obeys a nonlinear…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
We consider uniform spanning tree (UST) in topological polygons with $2N$ marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants…