HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Random Triangulations and Planar Maps

Gilles Schaeffer 1
1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Random triangulations or more generally random planar maps have proved useful as an alternative to regular lattices for the definition and study of some simple discrete models of physics. On the other hand, some classical problems in enumeration (e.g. for alternating knots or plane "meanders") can be recasted as discrete models on random lattices. A natural question when introduced to these models is first to understand the random lattice itself: how does it look like in the limit? I will discuss some combinatorial characteristics for which results or conjectures are available. Although some of these results have been derived by physicists using matrix models, the few ingredients of proofs that I might mention will rely on a different approach. Indeed, following the work of W. Tutte in the sixties, the properties of random planar maps have been studied in enumerative combinatorics via decompositions and generating functions.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:49:06 PM
Last modification on : Friday, February 4, 2022 - 3:30:22 AM


  • HAL Id : inria-00100681, version 1



Gilles Schaeffer. Random Triangulations and Planar Maps. Séminaire du groupe Theory de Microsoft Research, 2001, Seattle, USA. ⟨inria-00100681⟩



Record views