Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop

Physics – Mathematical Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

55 pages, 14 figures, final version with minor corrections

Scientific paper

10.1088/1751-8113/42/46/465208

We consider quadrangulations with a boundary and derive explicit expressions for the generating functions of these maps with either a marked vertex at a prescribed distance from the boundary, or two boundary vertices at a prescribed mutual distance in the map. For large maps, this yields explicit formulas for the bulk-boundary and boundary-boundary correlators in the various encountered scaling regimes: a small boundary, a dense boundary and a critical boundary regime. The critical boundary regime is characterized by a one-parameter family of scaling functions interpolating between the Brownian map and the Brownian Continuum Random Tree. We discuss the cases of both generic and self-avoiding boundaries, which are shown to share the same universal scaling limit. We finally address the question of the bulk-loop distance statistics in the context of planar quadrangulations equipped with a self-avoiding loop. Here again, a new family of scaling functions describing critical loops is discovered.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop 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 Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-670722

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.