Related papers: Phase transition for tree-rooted maps
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…
We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ grows…
We give a complete classification of scaling limits of randomly trapped random walks and associated clock processes on $\mathbb Z^d$, $d\ge 2$. Namely, under the hypothesis that the discrete skeleton of the randomly trapped random walk has…
A recent preprint (arXiv:1402.2632) introduced a growth procedure for planar maps, whose almost sure limit is "the uniform infinite 3-connected planar map". A classical construction of Brooks, Smith, Stone and Tutte (1940) associates a…
In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…
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 demonstrate the full power of nonperturbative renormalisation group methods for nonequilibrium situations by calculating the quantitative phase diagrams of simple branching and annihilating random walks and checking these results against…
The global phase diagram of wetting in the two-dimensional (2d) Ising model is obtained through exact calculation of the surface excess free energy. Besides a surface field for inducing wetting, a surface-coupling enhancement is included.…
Unidirectionally coupled systems which exhibit phase transitions into an absorbing state are investigated at the multicritical point. We find that for initial conditions with isolated particles, each hierarchy level exhibits an…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
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…
We postulate the existence of a natural Poissonian marking of the double (touching) points of SLE(6) and hence of the related continuum nonsimple loop process that describes macroscopic cluster boundaries in 2D critical percolation. We…
Random Constraint Satisfaction Problems exhibit several phase transitions when their density of constraints is varied. One of these threshold phenomena, known as the clustering or dynamic transition, corresponds to a transition for an…
A hyperbolic plane can be modeled by a structure called the enhanced binary tree. We study the ferromagnetic Ising model on top of the enhanced binary tree using the renormalization-group analysis in combination with transfer-matrix…
An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…
We investigate fluctuation phenomena for the graph distance and the number of cut points associated with random media arising from the range of a random walk. Our results demonstrate a sequence of dimension-dependent phase transitions in…
We study a directed polymer model in a random environment on infinite binary trees. The model is characterized by a phase transition depending on the inverse temperature. We concentrate on the asymptotics of the partition function in the…