Details

Subject(s)

• Probabilities [Browse]
• Graph theory [Browse]
• Geometry [Browse]
• Stochastic processes [Browse]

Series

• Lecture notes in mathematics (Springer-Verlag) ; 2335. [More in this series]
• Lecture notes in mathematics (Springer-Verlag). École d'été de probabilités de Saint-Flour. [More in this series]
• Lecture notes in mathematics, 0075-8434 ; volume 2335. École d'été de probabilités de Saint-Flour, 0721-5363

Summary note

"These Lecture Notes provide an introduction to the study of those discrete surfaces which are obtained by randomly gluing polygons along their sides in a plane. The focus is on the geometry of such random planar maps (diameter, volume growth, scaling and local limits...) as well as the behavior of statistical mechanics models on them (percolation, simple random walks, self-avoiding random walks...). A "Markovian" approach is adopted to explore these random discrete surfaces, which is then related to the analogous one-dimensional random walk processes. This technique, known as "peeling exploration" in the literature, can be seen as a generalization of the well-known coding processes for random trees (e.g. breadth first or depth first search). It is revealed that different types of Markovian explorations can yield different types of information about a surface. Based on an École d'Été de Probabilités de Saint-Flour course delivered by the author in 2019, the book is aimed at PhD students and researchers interested in graph theory, combinatorial probability and geometry. Featuring open problems and a wealth of interesting figures, it is the first book to be published on the theory of random planar maps."-- Back cover.

Bibliographic references

Includes bibliographical references (pages 277-284).

ISBN

• 9783031368530 ((paperback))
• 3031368533 ((paperback))

OCLC

1415227730

Statement on language in description

Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...