Emmanuel Guitter
Research Subjects
Emmanuel Guitter has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Philippe Di Francesco
Unité de Recherche Associée au CNRS
19 shared publications - J. Bouttier
Service de Physique Théorique CEA/DSM SPhT
10 shared publications - Charlotte Kristjansen
University of Copenhagen
6 shared publications P. Di Francesco
3 shared publications- Bertrand Eynard
Department of Mathematical Sciences University of Durham Science Laboratories South Road DH1 3HP DURHAM U.K
2 shared publications - Jérémie Bouttier
Institut de Physique Théorique CEA 91191 Gif-sur-Yvette IPhT France
2 shared publications
Latest Publications
- Open Access
Blocked edges on Eulerian maps and mobiles: Application to spanning trees, hard particles and the Ising model
We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees with labeled vertices, leading to a closed system of recursion relations for their generating functions. We discuss particular solvable cases in detail, as well as various applications of our method to several statistical systems such as spanning trees on quadrangulations, mutually excluding particles on Eulerian triangulations or the Ising model on quadrangulations.
Open AccessBlocked edges on Eulerian maps and mobiles: Application to spanning trees, hard particles and the Ising model
We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees with labeled vertices, leading to a closed system of recursion relations for their generating functions. We discuss particular solvable cases in detail, as well as various applications of our method to several statistical systems such as spanning trees on quadrangulations, mutually excluding particles on Eulerian triangulations or the Ising model on quadrangulations.
- Open Access
Multicritical continuous random trees
We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root singularity in their generating function. The scaling limit involves continuous trees with branching points of order up to k+1. We derive explicit integral representations for the average profile of this k-th order multicritical continuous random tree, as well as for its history distributions measuring multi-point correlations. The latter distributions involve non-positive universal weights at the branching points together with fractional derivative couplings. We prove universality by rederiving the same results within a purely continuous axiomatic approach based on the resolution of a set of consistency relations for the multi-point correlations. The average profile is shown to obey a fractional differential equation whose solution involves hypergeometric functions and matches the integral formula of the discrete approach.
Open AccessMulticritical continuous random trees
We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root singularity in their generating function. The scaling limit involves continuous trees with branching points of order up to k+1. We derive explicit integral representations for the average profile of this k-th order multicritical continuous random tree, as well as for its history distributions measuring multi-point correlations. The latter distributions involve non-positive universal weights at the branching points together with fractional derivative couplings. We prove universality by rederiving the same results within a purely continuous axiomatic approach based on the resolution of a set of consistency relations for the multi-point correlations. The average profile is shown to obey a fractional differential equation whose solution involves hypergeometric functions and matches the integral formula of the discrete approach.
- 31 August 2005
- Published by Elsevier in Physics Reports
- Vol. 415 (1) , 1-88
Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
- 31 August 2005
- Published by Elsevier in Physics Reports
- Vol. 415 (1) , 1-88
Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
- Open Access
Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating the topologically inequivalent configurations of a meandering road crossing a straight river through a given number of bridges. All these problems turn out to have reformulations in terms of fully packed loop models allowing for a unified Coulomb gas description of their statistical properties. A number of exact results and physically motivated conjectures are presented in detail, including the remarkable meander configuration exponent alpha=(29+sqrt(145))/12.
Open AccessGeometrically constrained statistical systems on regular and random lattices: From folding to meanders
We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating the topologically inequivalent configurations of a meandering road crossing a straight river through a given number of bridges. All these problems turn out to have reformulations in terms of fully packed loop models allowing for a unified Coulomb gas description of their statistical properties. A number of exact results and physically motivated conjectures are presented in detail, including the remarkable meander configuration exponent alpha=(29+sqrt(145))/12.
- Open Access
Combinatorics of bicubic maps with hard particles
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class of "admissible" trees with possibly doubly-occupied edges and summing them with appropriate signed weights. The proof relies on an extension of the cutting procedure allowing for the presence on the maps of special non-sectile edges. The admissible trees are characterized by simple local rules, allowing eventually for an exact enumeration of planar bicubic maps with hard particles. We also discuss generalizations for maps with particles subject to more general exclusion rules and show how to re-derive the enumeration of quartic maps with Ising spins in the present framework of admissible trees. We finally comment on a possible interpretation in terms of branching processes.
Open AccessCombinatorics of bicubic maps with hard particles
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class of "admissible" trees with possibly doubly-occupied edges and summing them with appropriate signed weights. The proof relies on an extension of the cutting procedure allowing for the presence on the maps of special non-sectile edges. The admissible trees are characterized by simple local rules, allowing eventually for an exact enumeration of planar bicubic maps with hard particles. We also discuss generalizations for maps with particles subject to more general exclusion rules and show how to re-derive the enumeration of quartic maps with Ising spins in the present framework of admissible trees. We finally comment on a possible interpretation in terms of branching processes.
- Top Cited PapersOpen Access
- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R69
Planar Maps as Labeled Mobiles
We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bijection with a new class of labeled trees, which we call mobiles. Our bijection covers all the classes of maps previously enumerated by either the two-matrix model used by physicists or by the bijection with blossom trees used by combinatorists. Our bijection reduces the enumeration of maps to that, much simpler, of mobiles and moreover keeps track of the geodesic distance within the initial maps via the mobiles' labels. Generating functions for mobiles are shown to obey systems of algebraic recursion relations.
- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R69
Top Cited PapersOpen AccessPlanar Maps as Labeled Mobiles
We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bijection with a new class of labeled trees, which we call mobiles. Our bijection covers all the classes of maps previously enumerated by either the two-matrix model used by physicists or by the bijection with blossom trees used by combinatorists. Our bijection reduces the enumeration of maps to that, much simpler, of mobiles and moreover keeps track of the geodesic distance within the initial maps via the mobiles' labels. Generating functions for mobiles are shown to obey systems of algebraic recursion relations.
- 1 December 2003
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 36 (50) , 12349-12366
Random trees between two walls: exact partition function
- 1 December 2003
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 36 (50) , 12349-12366
Random trees between two walls: exact partition function
- Open Access
Statistics of planar graphs viewed from a vertex: A study via labeled trees
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of edges and vertices at given geodesic distances from the origin. Our analysis relies on bijections with labeled trees, in which the labels encode the information on the geodesic distance from the origin. In the case of infinitely large graphs, we give in particular explicit formulas for the probabilities that the origin have given numbers of neighboring edges and/or vertices, as well as explicit values for the corresponding moments.
Open AccessStatistics of planar graphs viewed from a vertex: A study via labeled trees
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of edges and vertices at given geodesic distances from the origin. Our analysis relies on bijections with labeled trees, in which the labels encode the information on the geodesic distance from the origin. In the case of infinitely large graphs, we give in particular explicit formulas for the probabilities that the origin have given numbers of neighboring edges and/or vertices, as well as explicit values for the corresponding moments.
- Open Access
Geodesic Distance in Planar Graphs
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 with decorated trees, leading to a recursion relation on the geodesic distance. The latter is solved exactly in terms of discrete soliton-like expressions, suggesting an underlying integrable structure. We extract from this solution the fractal dimensions at the various (multi)-critical points, as well as the precise scaling forms of the continuum two-point functions and the probability distributions for the geodesic distance in (multi)-critical random surfaces. The two-point functions are shown to obey differential equations involving the residues of the KdV hierarchy.
Open AccessGeodesic Distance in Planar Graphs
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 with decorated trees, leading to a recursion relation on the geodesic distance. The latter is solved exactly in terms of discrete soliton-like expressions, suggesting an underlying integrable structure. We extract from this solution the fractal dimensions at the various (multi)-critical points, as well as the precise scaling forms of the continuum two-point functions and the probability distributions for the geodesic distance in (multi)-critical random surfaces. The two-point functions are shown to obey differential equations involving the residues of the KdV hierarchy.
- Open Access
Combinatorics of Hard Particles on Planar Graphs
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in this purely combinatorial language.
Open AccessCombinatorics of Hard Particles on Planar Graphs
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in this purely combinatorial language.