Gibbs partitions: The convergent case

DOI10.1002/rsa.20771zbMath1398.05184arXiv1609.08859OpenAlexW2963812984WikidataQ130181619 ScholiaQ130181619MaRDI QIDQ4961547

Benedikt Stufler

Publication date: 25 October 2018

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

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

zbMATH Keywords

random graphsgraph classesgraph limitsGibbs partitionsrandom partitions of sets

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Partitions of sets (05A18)

Related Items (10)

Quenched local convergence of Boltzmann planar maps ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ Graphon convergence of random cographs ⋮ Limits of random tree-like discrete structures ⋮ Random cubic planar maps ⋮ Local convergence of random planar graphs ⋮ Simply Generated Unrooted Plane Trees ⋮ Graph limits of random unlabelled k-trees ⋮ Unlabelled Gibbs partitions ⋮ A decorated tree approach to random permutations in substitution-closed classes

This page was built for publication: Gibbs partitions: The convergent case