Related papers: Condensation in nongeneric trees
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
We consider Gibbs distributions on permutations of a locally finite infinite set $X\subset\mathbb{R}$, where a permutation $\sigma$ of $X$ is assigned (formal) energy $\sum_{x\in X}V(\sigma(x)-x)$. This is motivated by Feynman's path…
We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…
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…
A classical result by Otter shows that the complete graph has an exponential number of non-isomorphic spanning trees. This was recently extended by Lee to every almost regular graph of sufficiently large degree. In this paper, we consider…
For every sufficiently well-behaved function $g:\mathbb{R}_{\ge 0}\rightarrow\mathbb{R}_{\ge 0}$ that grows at least linearly and at most exponentially we construct a tree $T$ of uniform volume growth $g$, that is, $$C_1\cdot g(r/4)\le…
We study the relative entropy density for generalized Gibbs measures. We first show its existence and obtain a familiar expression in terms of entropy and relative energy for a class of ``almost Gibbsian measures'' (almost sure continuity…
It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…
In this article, we prove an extreme value theorem on the limit distribution of geodesics in a geometrically finite quotient of $\Gamma\backslash\mathcal{T}$ a locally finite tree. Main examples of such graphs are quotients of a Bruhat-Tits…
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…
We show that on a metric graph of genus $g$, a divisor of degree $n$ generically has $g(n-g+1)$ Weierstrass points. For a sequence of generic divisors on a metric graph whose degrees grow to infinity, we show that the associated Weierstrass…
We establish a connection between the level density of a gas of non-interacting bosons and the theory of extreme value statistics. Depending on the exponent that characterizes the growth of the underlying single-particle spectrum, we show…
We study the scaling limit of statistical mechanics models with non-convex Hamiltonians that are gradient perturbations of Gaussian measures. Characterising features of our gradient models are the imposed boundary tilt and the surface…
The metric dimension of a graph $G$ is the minimal size of a subset $R$ of vertices of $G$ that, upon reporting their graph distance from a distingished (source) vertex $v^\star$, enable unique identification of the source vertex $v^\star$…
We examine the minimization of information entropy for measures on the phase space of bounded domains, subject to constraints that are averages of grand canonical distributions. We describe the set of all such constraints and show that it…
We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…
Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of…
For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…