The degree distribution in bipartite planar maps: applications to the Ising model
arXiv:math/0211070
Abstract
We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar lattices. We thus recover and extend some results previously obtained by means of matrix integrals. Proofs are purely combinatorial and rely on the idea that planar maps are conjugacy classes of trees. In particular, these trees explain why the solutions of the Ising and hard particle models on maps of bounded degree are always algebraic.
32 pages, 15 figures
Cited by in corpus (23)
- Geodesic Distance in Planar Graphs
- Random planar curves and Schramm-Loewner evolutions
- Combinatorial aspects of matrix models
- Large deviations and stochastic calculus for large random matrices
- Counting colored planar maps: algebraicity results
- Percolation on uniform infinite planar maps
- The three-point function of planar quadrangulations
- Blocked edges on Eulerian maps and mobiles: Application to spanning trees, hard particles and the Ising model
- Combinatorics of bicubic maps with hard particles
- Spanning forests in regular planar maps
- High order expansion of matrix models and enumeration of maps
- Liouville Quantum Gravity and KPZ
- Bounds on the critical line via transfer matrix methods for an Ising model coupled to causal dynamical triangulations
- Local convergence of large random triangulations coupled with an Ising model
- Matrix integrals and enumeration of maps
- Planar maps and random partitions
- Ising model on random triangulations of the disk: phase transition
- Multiple scaling limits of multi-matrix models
- Combinatoire du polynôme de Tutte et des cartes planaires
- On triangulations with high vertex degree
- Maps of unfixed genus and blossoming trees
- Random Matrices, Graphical Enumeration and the Continuum Limit of Toda Lattices
- Rational and algebraic series in combinatorial enumeration