اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDistance statistics in quadrangulations with a boundary, or with a self-avoiding loop
411
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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.
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.
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 scali
ng 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.
In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Greens function for the process equals 1/x^2. If the process is modified so as to be weakly self-repelling, it was shown that at the crit
ical killing rate (mass-squared) beta^c, the Greens function behaves like the free one. - Now we analyze the end-to-end distance of the model and show that its expected value grows as a constant times sqrt{T} log^{1/8}T (1+O((log log T)/log T)), which is the same law as has been conjectured for self-avoiding walks on the simple cubic lattice Z^4. The proof uses inverse Laplace transforms to obtain the end-to-end distance from the Greens function, and requires detailed properties of the Greens function throughout a sector of the complex beta plane. These estimates are derived in a companion paper [math-ph/0205028].
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
