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

DOI10.1002/rsa.20802zbMath1423.05152arXiv1605.05191OpenAlexW2962918059WikidataQ92682842 ScholiaQ92682842MaRDI QIDQ5236927

Benedikt Stufler, Michael Drmota, Emma Yu Jin

Publication date: 16 October 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.05191

zbMATH Keywords

continuum random treepartial \(k\)-treesmodified Galton-Watson tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Limits of random tree-like discrete structures ⋮ Graph limits of random unlabelled k-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An asymptotic analysis of labeled and unlabeled \(k\)-trees
• Scaling limits of random graphs from subcritical classes
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• The scaling limit of random outerplanar maps
• Condensation in nongeneric trees
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The specification of 2-trees
• The continuum random tree. I
• The Brownian continuum random tree as the unique solution to a fixed point equation
• Random trees and applications
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Subdiffusive behavior of random walk on a random cluster
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Tree-valued Markov chains derived from Galton-Watson processes
• Chernoff-type bound for finite Markov chains
• Largest component in random combinatorial structures
• A limit theorem for the contour process of conditioned Galton-Watson trees
• Random enriched trees with applications to random graphs
• Probabilistic and fractal aspects of Lévy trees
• Recurrence of distributional limits of finite planar graphs
• Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
• Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
• \(\Gamma \)-species and the enumeration of \(k\)-trees
• Scaling limit of random planar quadrangulations with a boundary
• Scaling limits of random planar maps with a unique large face
• The continuum random tree. III
• Counting unlabeled \(k\)-trees
• Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
• Enumerating k-trees
• On non-serial dynamic programming
• Handbook of Graph Theory
• Random trees with superexponential branching weights
• The CRT is the scaling limit of random dissections
• Tessellations of random maps of arbitrary genus
• Limiting Distribution for Distances in k-Trees
• The Galton-Watson process conditioned on the total progeny
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Practical algorithms on partial k-trees with an application to domination-like problems
• Boltzmann Sampling of Unlabelled Structures
• The CRT is the scaling limit of unordered binary trees
• Formulae and Asymptotics for Coefficients of Algebraic Functions
• Asymptotics of trees with a prescribed degree sequence and applications
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees
• The number of labeled k-trees
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Graph limits of random graphs from a subset of connected k‐trees