Graph limits of random graphs from a subset of connected k‐trees

@article{Drmota2019GraphLO,
title={Graph limits of random graphs from a subset of connected k‐trees},
author={Michael Drmota and Emma Yu Jin and Benedikt Stufler},
journal={Random Structures \& Algorithms},
year={2019},
volume={55},
pages={125 - 152}
}
• Published 17 May 2016
• Mathematics
• Random Structures & Algorithms
For any set Ω of non‐negative integers such that {0,1}⊊Ω , we consider a random Ω‐k‐tree Gn,k that is uniformly selected from all connected k‐trees of (n + k) vertices such that the number of (k + 1)‐cliques that contain any fixed k‐clique belongs to Ω. We prove that Gn,k, scaled by (kHkσΩ)/(2n) where Hk is the kth harmonic number and σΩ > 0, converges to the continuum random tree Te . Furthermore, we prove local convergence of the random Ω‐k‐tree Gn,k∘ to an infinite but locally finite random…
3 Citations

Limits of random tree-like discrete structures

The Benjamini--Schramm convergence of random $k$-dimensional trees is proved, and a central limit theorem for the size of the largest $2$-connected component in random graphs from planar-like classes is recover in a probabilistic way.

Graph limits of random unlabelled k-trees

• Mathematics
Combinatorics, Probability and Computing
• 2020
The main applications are Gromov–Hausdorff–Prokhorov and Benjamini–Schramm limits that describe their asymptotic geometric shape on a global and local scale as the number of (k + 1)-cliques tends to infinity.

Asymptotic Enumeration and Limit Laws for Multisets: the Subexponential Case

• Mathematics
• 2020
For a given combinatorial class $\mathcal{C}$ we study the class $\mathcal{G} = \mathrm{MSET}(\mathcal{C})$ satisfying the multiset construction, that is, any object in $\mathcal{G}$ is uniquely

References

SHOWING 1-10 OF 70 REFERENCES

Limiting Distribution for Distances in k-Trees

• Mathematics
IWOCA
• 2009
This paper examines the distances between vertices in a rooted k-tree, for a fixed k, by exhibiting a correspondence with a variety of trees that can be specified in terms of combinatorial

Recurrence of Distributional Limits of Finite Planar Graphs

• Mathematics
• 2000
Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional

The Continuum Random Tree III

Let (W(k), k 2 1) be random trees with k leaves, satisfying a consistency condition: Removing a random leaf from R(k) gives R(k - 1). Then under an extra condition, this family determines a random

Limits of random tree-like discrete structures

The Benjamini--Schramm convergence of random $k$-dimensional trees is proved, and a central limit theorem for the size of the largest $2$-connected component in random graphs from planar-like classes is recover in a probabilistic way.

Γ-Species and the Enumeration of k-Trees

A system of recursive functional equations giving the generating function for unlabeled k-trees which allows for fast, efficient computation of their numbers is studied.

Scaling limits of random planar maps with a unique large face

• Mathematics
• 2015
We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to

An Asymptotic Analysis of Labeled and Unlabeled k-Trees

• Mathematics, Computer Science
Algorithmica
• 2015
The number of leaves and more generally the number of nodes of given degree satisfy a central limit theorem with mean value and variance that are asymptotically linear in the size of the k-tree.

Random Enriched Trees with Applications to Random Graphs

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled

The continuum random tree is the scaling limit of unlabeled unrooted trees

We show that the uniform unlabeled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov‐Hausdorff sense after a suitable rescaling to the Brownian continuum random

Random trees with superexponential branching weights

• Mathematics
• 2011
We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors wn associated with the vertices of the tree and depending only on their