Growing uniform planar maps face by face

DOI10.1002/rsa.21165arXiv2110.14575OpenAlexW3210725436MaRDI QIDQ6063346

Alessandra Caraceni, Alexandre Stauffer

Publication date: 7 November 2023

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

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

zbMATH Keywords

triangulationsrandom generationrandom treesrandom planar maps

Mathematics Subject Classification ID

Numerical analysis (65-XX) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unified bijections for maps with prescribed degrees and girth
• Growing random 3-connected maps or \textit{Comment s'enfuir de l'hexagone}
• A generic method for bijections between blossoming trees and planar maps
• A bijection for triangulations, quadrangulations, pentagulations, etc.
• A linear-time algorithm for the generation of trees
• Optimal coding and sampling of triangulations
• Uniform infinite planar triangulations
• Planar maps as labeled mobiles
• A polynomial upper bound for the mixing time of edge rotations on planar maps
• Scaling limits of multi-type Markov branching trees
• Polynomial mixing time of edge flips on quadrangulations
• Increasing forests and quadrangulations via a bijective approach
• Planar Maps are Well Labeled Trees
• A Census of Planar Triangulations
• Building uniformly random subtrees
• Scaling limits of random trees and planar maps
• A Census of Planar Maps

This page was built for publication: Growing uniform planar maps face by face