Geodesic distance in planar graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Nuclear Physics B Année : 2003

Geodesic distance in planar graphs

Résumé

We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection with decorated trees, leading to a recursion relation on the geodesic distance. The latter is solved exactly in terms of discrete soliton-like expressions, suggesting an underlying integrable structure. We extract from this solution the fractal dimensions at the various (multi)-critical points, as well as the precise scaling forms of the continuum two-point functions and the probability distributions for the geodesic distance in (multi)-critical random surfaces. The two-point functions are shown to obey differential equations involving the residues of the KdV hierarchy.

Dates et versions

hal-00586662 , version 1 (18-04-2011)

Identifiants

Citer

Jérémie Bouttier, Philippe Di Francesco, Emmanuel Guitter. Geodesic distance in planar graphs. Nuclear Physics B, 2003, 663 (3), pp.535 - 567. ⟨10.1016/S0550-3213(03)00355-9⟩. ⟨hal-00586662⟩
271 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More