2 options
Planar Maps, Random Walks and Circle Packing : École d'Été de Probabilités de Saint-Flour XLVIII - 2018 / by Asaf Nachmias.
- Format:
- Book
- Author/Creator:
- Nachmias, Asaf, author.
- Series:
- Mathematics and Statistics (Springer-11649)
- École d'Été de Probabilités de Saint-Flour, 0721-5363 ; 2243.
- École d'Été de Probabilités de Saint-Flour, 0721-5363 ; 2243
- Language:
- English
- Subjects (All):
- Probabilities.
- Discrete mathematics.
- Geometry.
- Mathematical physics.
- Probability Theory and Stochastic Processes.
- Discrete Mathematics.
- Mathematical Physics.
- Local Subjects:
- Probability Theory and Stochastic Processes.
- Discrete Mathematics.
- Geometry.
- Mathematical Physics.
- Physical Description:
- 1 online resource (XII, 120 pages) : 36 illustrations, 8 illustrations in color.
- Edition:
- First edition 2020.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2020.
- System Details:
- text file PDF
- Summary:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-27968-4
- 9783030279684
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.