Related papers: Multi-point functions of weighted cubic maps
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…
We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have…
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…
We compute the distance-dependent two-point function of vertex-bicolored planar maps, i.e., maps whose vertices are colored in black and white so that no adjacent vertices have the same color. By distance-dependent two-point function, we…
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…
We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…
Random plane wave is conjectured to be a universal model for high-energy eigenfunctions of the Laplace operator on generic compact Riemanian manifolds. This is known to be true on average. In the present paper we discuss one of important…
Present and future high-precision tests of the Standard Model and beyond for the fundamental constituents and interactions in Nature are demanding complex perturbative calculations involving multi-leg and multi-loop Feynman diagrams.…
In the dynamical triangulation model of 4D euclidean quantum gravity we measure two-point functions of the scalar curvature as a function of the geodesic distance. To get the correlations it turns out that we need to subtract a squared…
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary…
This paper concerns random bipartite planar maps which are defined by assigning weights to their faces. The paper presents a threefold contribution to the theory. Firstly, we prove the existence of the local limit for all choices of weights…
We present a new derivation of the distance-dependent two-point function for planar Eulerian triangulations and give expressions for more refined generating functions where we also control hull perimeters. These results are obtained in the…
We discuss the enumeration of planar graphs using bijections with suitably decorated trees, which allow for keeping track of the geodesic distances between faces of the graph. The corresponding generating functions obey non-linear recursion…
A geometrical way to calculate N-point Feynman diagrams is reviewed. As an example, the dimensionally-regulated three-point function is considered, including all orders of its epsilon-expansion. Analytical continuation to other regions of…
Since their introduction in the shape analysis community, functional maps have met with considerable success due to their ability to compactly represent dense correspondences between deformable shapes, with applications ranging from shape…
We present an unexpected connection between two map enumeration problems. The first one consists in counting planar maps with a boundary of prescribed length. The second one consists in counting planar maps with two points at a prescribed…
We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we…
In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic…
A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is…
We introduce and study a universal model of random geometry in two dimensions. To this end, we start from a discrete graph drawn on the sphere, which is chosen uniformly at random in a certain class of graphs with a given size $n$, for…