37 pages, 18 color figures, improved version with several clarifications (mostly in sections 2.1 and 2.4) and one added section (3.1) on ensembles of random quadrangulationsInternational audienceWe study the statistical properties of geodesics, i.e. paths of minimal length, in large random planar quadrangulations. We extend Schaeffer's 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 quadrangulati...
Given a cost functional F on paths gamma in a domain D subset of R-d, in the form 1 F(gamma) = integ...
51 pages, 8 figuresWe first rephrase and unify known bijections between bipartite plane maps and lab...
Let us consider Euclidean first-passage percolation on the Poisson–Delaunay triangulation. We prove ...
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles...
Abstract. A geodesic in a graph G is a shortest path between two vertices of G. For a specific funct...
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) o...
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) o...
58pp, 6 figures. One figure added, minor corrections.International audienceWe investigate Voronoi-li...
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within ...
43 pages, 16 color figures, misprints and figure 15 correctedInternational audienceWe compute the ge...
The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which...
We provide a direct proof of Cramér’s theorem for geodesic random walks in a complete Riemannian man...
Abstract: The directed last-passage percolation (LPP) model with independent exponential times is co...
International audienceA method for computing upper-bounds on the length of geodesics spanning random...
We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbi...
Given a cost functional F on paths gamma in a domain D subset of R-d, in the form 1 F(gamma) = integ...
51 pages, 8 figuresWe first rephrase and unify known bijections between bipartite plane maps and lab...
Let us consider Euclidean first-passage percolation on the Poisson–Delaunay triangulation. We prove ...
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles...
Abstract. A geodesic in a graph G is a shortest path between two vertices of G. For a specific funct...
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) o...
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) o...
58pp, 6 figures. One figure added, minor corrections.International audienceWe investigate Voronoi-li...
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within ...
43 pages, 16 color figures, misprints and figure 15 correctedInternational audienceWe compute the ge...
The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which...
We provide a direct proof of Cramér’s theorem for geodesic random walks in a complete Riemannian man...
Abstract: The directed last-passage percolation (LPP) model with independent exponential times is co...
International audienceA method for computing upper-bounds on the length of geodesics spanning random...
We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbi...
Given a cost functional F on paths gamma in a domain D subset of R-d, in the form 1 F(gamma) = integ...
51 pages, 8 figuresWe first rephrase and unify known bijections between bipartite plane maps and lab...
Let us consider Euclidean first-passage percolation on the Poisson–Delaunay triangulation. We prove ...