Geodesic distance in planar graphs

DOI10.1016/S0550-3213(03)00355-9zbMath1022.05022arXivcond-mat/0303272WikidataQ56453459 ScholiaQ56453459MaRDI QIDQ1396153

Philippe Di Francesco, Emmanuel Guitter, Jérémie Bouttier

Publication date: 29 June 2003

Published in: Nuclear Physics. B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0303272

zbMATH Keywords

recursion relation; discrete soliton-like expressions; exact planar-map generating function

Mathematics Subject Classification ID

05C12: Distance in graphs

Related Items

Statistics of planar graphs viewed from a vertex: A study via labeled trees, A conditional limit theorem for tree-indexed random walk, Local limit of labeled trees and expected volume growth in a random quadrangulation, Geodesic distance in planar graphs: an integrable approach

Cites Work

• Unnamed Item
• Counting colored random triangulations
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Solitons and infinite dimensional Lie algebras
• Eigenvalue distribution of large random matrices, from one matrix to several coupled matrices
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Random planar lattices and integrated superBrownian excursion
• Scaling in quantum gravity
• Enumeration of planar constellations
• Numerical study for the \(c\)-dependence of fractal dimension in two-dimensional quantum gravity
• Planar diagrams
• Combinatorics of hard particles on planar graphs
• On the fractal structure of two-dimensional quantum gravity
• Critical and multicritical semi-random (1 +d)-dimensional lattices and hard objects inddimensions
• A Census of Planar Maps