ترغب بنشر مسار تعليمي؟ اضغط هنا

The three-point function of planar quadrangulations

111   0   0.0 ( 0 )
 نشر من قبل J\\'er\\'emie Bouttier
 تاريخ النشر 2008
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple universal scaling function, which is the continuous three-point function of pure 2D quantum gravity. We give explicit expressions for this universal three-point function both in the grand-canonical and canonical ensembles. Various limiting regimes are studied when some of the distances become large or small. By considering the case where the marked vertices are aligned, we also obtain the probability law for the number of geodesic points, namely vertices that lie on a geodesic path between two given vertices, and at prescribed distances from these vertices.



قيم البحث

اقرأ أيضاً

127 - J. Bouttier , E. Guitter 2010
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all closed path s passing by one of the three vertices and separating the two others in the quadrangulation. We concentrate on the universal scaling limit of large quadrangulations, also known as the Brownian map, where pairs of geodesic paths or minimal separating loops have common parts of non-zero macroscopic length. This is the phenomenon of confluence, which distinguishes the geometry of random quadrangulations from that of smooth surfaces. We characterize the universal probability distribution for the lengths of these common parts.
146 - J. Bouttier , E. Guitter 2008
We study the statistical properties of geodesics, i.e. paths of minimal length, in large random planar quadrangulations. We extend Schaeffers well-labeled tree bijection to the case of quadrangulations with a marked geodesic, leading to the notion of spine trees, amenable to a direct enumeration. We obtain the generating functions for quadrangulations with a marked geodesic of fixed length, as well as with a set of confluent geodesics, i.e. a collection of non-intersecting minimal paths connecting two given points. In the limit of quadrangulations with a large area n, we find in particular an average number 3*2^i of geodesics between two fixed points at distance i>>1 from each other. We show that, for generic endpoints, two confluent geodesics remain close to each other and have an extensive number of contacts. This property fails for a few exceptional endpoints which can be linked by truly distinct geodesics. Results are presented both in the case of finite length i and in the scaling limit i ~ n^(1/4). In particular, we give the scaling distribution of the exceptional points.
223 - J. Bouttier , E. Guitter 2010
We present a detailed calculation of the distance-dependent two-point function for quadrangulations with no multiple edges. Various discrete observables measuring this two-point function are computed and analyzed in the limit of large maps. For large distances and in the scaling regime, we recover the same universal scaling function as for general quadrangulations. We then explore the geometry of minimal neck baby universes (minbus), which are the outgrowths to be removed from a general quadrangulation to transform it into a quadrangulation with no multiple edges, the mother universe. We give a number of distance-dependent characterizations of minbus, such as the two-point function inside a minbu or the law for the distance from a random point to the mother universe.
368 - J. Bouttier , E. Guitter 2009
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 i n 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.
347 - Valentin Bonzom 2019
The rank three tensor model with tetrahedral interaction was shown by Carrozza and Tanasa to admit a $1/N$ expansion, dominated by melonic diagrams, and double tadpoles decorated with melons at next-to-leading order. This model has generated a renewe d interest in tensor models because it has the same large $N$ limit as the SYK model. In contrast with matrix models, there is no method which would be able to prove the existence of $1/N$ expansions in arbitrary tensor models. The method used by Carrozza and Tanasa proves the existence of the $1/N$ expansion using two-dimensional topology, before identifying the leading order and next-to-leading graphs. However, another method was required for complex, rank three tensor models with planar interactions, which is based on flips. The latter are moves which cut two propagators of Feynman graphs and reglue them differently. They allow transforming graphs while tracking their orders in the $1/N$ expansion. Here we use this method to re-prove the results of Carrozza and Tanasa, thereby proving the existence of the $1/N$ expansion, the melonic dominance at leading order and the melon-decorated double tadpoles at next-to-leading order, all in one go.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا