top of page

Planar Maps, Random Walks and Circle Packing

Inside this Book

If you make use of this material, you may credit the authors as follows:

Nachmias Asaf, "Planar Maps, Random Walks and Circle Packing", Springer Nature, 2020, DOI: 10.1007/978-3-030-27968-4, License: https://creativecommons.org/licenses/by/4.0

This open access book focuses on the interplay between random walks on planar maps and Koebe’s circle packing theorem. Further topics covered include electric networks, the He–Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of finite planar maps and the almost sure recurrence of simple random walks on these limits. One of its main goals is to present a self-contained proof that the uniform infinite planar triangulation (UIPT) is almost surely recurrent. Full proofs of all statements are provided. A planar map is a graph that can be drawn in the plane without crossing edges, together with a specification of the cyclic ordering of the edges incident to each vertex. One widely applicable method of drawing planar graphs is given by Koebe’s circle packing theorem (1936). Various geometric properties of these drawings, such as existence of accumulation points and bounds on the radii, encode important probabilistic information, such as the recurrence/transience of simple random walks and connectivity of the uniform spanning forest. This deep connection is especially fruitful to the study of random planar maps. The book is aimed at researchers and graduate students in mathematics and is suitable for a single-semester course; only a basic knowledge of graduate level probability theory is assumed.

Keywords

Mathematics, Probabilities, Discrete Mathematics, Geometry, Mathematical Physics

Rights | License

Except where otherwise noted, this item has been published under the following license:

Takedown policy

If you believe that this publication infringes copyright, please contact us at info@jecasa-ltd.com and provide relevant details so that we can investigate your claim.

bottom of page