Geodesic Distance in Planar Graphs

Details Geodesic Distance in Planar Graphs Geodesic Distance in Planar Graphs

2003-03-14

arxiv.org/abs/cond-mat/0303272v1

Nucl.Phys. B663 (2003) 535-567

Physics

Condensed Matter

Statistical Mechanics

38 pages, 8 figures, tex, harvmac, epsf

Scientific paper

10.1016/S0550-3213(03)00355-9

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.

Affiliated with

Also associated with

No associations

Rating

Geodesic Distance in Planar Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Geodesic Distance in Planar Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geodesic Distance in Planar Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-291772