Integrability of graph combinatorics via random walks and heaps of dimers

DOI10.1088/1742-5468/2005/09/P09001zbMath1459.05300arXivmath/0506542OpenAlexW2059657531MaRDI QIDQ4968875

Philippe Di Francesco, Emmanuel Guitter

Publication date: 9 July 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

zbMATH Keywords

networksrandom graphsexact resultsclassical integrabilitytopology and combinatorics

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (1)

Belief propagation and loop series on planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Solitons and infinite dimensional Lie algebras
• Les hypercartes planaires sont des arbres très bien étiquetés. (Planar hypermaps are well-labeled trees)
• Discrete Painlevé equations and their appearance in quantum gravity
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Geodesic distance in planar graphs
• Statistics of planar graphs viewed from a vertex: A study via labeled trees
• Enumeration of planar constellations
• Planar maps as labeled mobiles
• Planar diagrams
• Lattice animals and heaps of dimers
• Geodesic distance in planar graphs: an integrable approach
• Planar Maps are Well Labeled Trees
• Random trees between two walls: exact partition function
• Critical and multicritical semi-random (1 +d)-dimensional lattices and hard objects inddimensions

This page was built for publication: Integrability of graph combinatorics via random walks and heaps of dimers