Contact
How to shop
Delivery
Shopping guide
Planar Maps, Random Walks and Circle Packing
École d'Été de Probabilités de Saint-Flour XLVIII - 2018
English
122 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Paperback
26.09
€
/
Paperback
15.49
€
/
Paperback
16.95
€
/
Paperback
60.79
€
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
61.59
€
/
Game
73.49
€
/
Paperback
8.69
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?