163 citations · 827 across the 46 of their papers we have counts for
9 papers · 1 filter
Asymmetric Exclusion Process with Global Hopping
Chikashi Arita, Jérémie Bouttier, P. L. Krapivsky +1
We study a one-dimensional totally asymmetric simple exclusion process with one special site from which particles fly to any empty site (not just to the neighboring site). The syst…
Vacancy localization in the square dimer model
J. Bouttier, M. Bowick, E. Guitter +1
We study the classical dimer model on a square lattice with a single vacancy by developing a graph-theoretic classification of the set of all configurations which extends the spann…
Statistics of planar graphs viewed from a vertex: A study via labeled trees
J. Bouttier, P. Di Francesco, E. Guitter
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 fun…
Random trees between two walls: Exact partition function
J. Bouttier, P. Di Francesco, E. Guitter
We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their po…
Geodesic Distance in Planar Graphs
J. Bouttier, P. Di Francesco, E. Guitter
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…
Combinatorics of Hard Particles on Planar Graphs
J. Bouttier, P. Di Francesco, E. Guitter
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…
Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
J. Bouttier, P. Di Francesco, E. Guitter
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt…
Counting Colored Random Triangulations
J. Bouttier, P. Di Francesco, E. Guitter
We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial devel…
Critical and Tricritical Hard Objects on Bicolorable Random Lattices: Exact Solutions
J. Bouttier, P. Di Francesco, E. Guitter
We address the general problem of hard objects on random lattices, and emphasize the crucial role played by the colorability of the lattices to ensure the existence of a crystalliz…