Related papers: Uniform attachment with freezing: Scaling limits

We propose experimentally feasible ways to probe universal features of absorbing phase transitions from two different approaches, both based on numerical validations. On one hand, we numerically study a probability distribution of…

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with $n$ vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of…

This work examines the coalescence of two unequal-size spherical liquid droplets in the inviscid regime, with an emphasis on exploring the scaling of the liquid bridge evolution. Our experiment suggests that the classical 1/2 power-law…

We derive theorems which outline explicit mechanisms by which anomalous scaling for the probability density function of the sum of many correlated random variables asymptotically prevails. The results characterize general anomalous scaling…

We introduce a non-increasing tree growth process $((T_n,\sigma_n),\, n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and ${\sigma}_n$ is a permutation of the vertex labels. The construction of $(T_{n},{\sigma}_n)$ from…

Aldous constructed a growth process for the binary tree where clusters freeze as soon as they become infinite. It was pointed out by Benjamini and Schramm that such a process does not exist for the square lattice. This motivated us to…

Phenomenological scaling arguments suggest the existence of universal amplitudes in the finite-size scaling of certain correlation lengths in strongly anisotropic or dynamical phase transitions. For equilibrium systems, provided that…

We study the Anderson transition in lattices with the connectivity of a random-regular graph. Our results indicate that fractal dimensions are continuous across the transition, but a discontinuity occurs in their derivatives, implying the…

We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…

We study the Anderson transition on a generic model of random graphs with a tunable branching parameter $1<K\le 2$, through large scale numerical simulations and finite-size scaling analysis. We find that a single transition separates a…

We consider the following, intuitively described process: at time zero, all sites of a binary tree are at rest. Each site becomes activated at a random uniform [0,1] time, independent of the other sites. As soon as a site is in an infinite…

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…

Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing ("freeze") as…

Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the discrete torus in dimensions 5 and above. Moreover, on this…

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…

We propose a general class of co-evolving tree network models driven by local exploration where new vertices attach to the current network via randomly sampling a vertex and then exploring the graph for a random number of steps in the…

Quantum phase transitions occur at zero temperature and involve the appearance of long-range correlations. These correlations are not due to thermal fluctuations but to the intricate structure of a strongly entangled ground state of the…

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…