Cantitate/Preț
Produs

Planar Maps, Random Walks and Circle Packing: École d'Été de Probabilités de Saint-Flour XLVIII - 2018: Lecture Notes in Mathematics, cartea 2243

Autor Asaf Nachmias
en Limba Engleză Paperback – 5 oct 2019
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.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 24366 lei  6-8 săpt.
  Saint Philip Street Press – 7 oct 2020 24366 lei  6-8 săpt.
  Springer International Publishing – 5 oct 2019 40385 lei  6-8 săpt.
Hardback (1) 32983 lei  6-8 săpt.
  Saint Philip Street Press – 7 oct 2020 32983 lei  6-8 săpt.

Din seria Lecture Notes in Mathematics

Preț: 40385 lei

Nou

Puncte Express: 606

Preț estimativ în valută:
7730 8034$ 6403£

Carte tipărită la comandă

Livrare economică 04-18 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030279677
ISBN-10: 3030279677
Pagini: 120
Ilustrații: XII, 120 p. 36 illus., 8 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.2 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Mathematics, École d'Été de Probabilités de Saint-Flour

Locul publicării:Cham, Switzerland

Cuprins

- Introduction. - Random Walks and Electric Networks. - The Circle Packing Theorem. - Parabolic and Hyperbolic Packings. - Planar Local Graph Limits. - Recurrence of Random Planar Maps. - Uniform Spanning Trees of Planar Graphs. - Related Topics.

Recenzii

“The most remarkable aspect of the Lecture Notes is the reader-friendly structure and the style in which it has been written. There are masses of examples either worked out in the text or left for the reader. A number of facts are equipped with graphical illustrations. The importance of this Lecture Notes by the author both from the practical and from the theoretical standpoint is unquestionable.” (Viktor Ohanyan, zbMATH 1471.60007, 2021)
“The whole material is very nicely presented and the book may serve as the support for a graduate course in probability.” (Nicolas Curien, Mathematical Reviews, November, 2020)

Textul de pe ultima copertă

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.



Caracteristici

Entirely self-contained and aimed to fully accompany a single-semester graduate course Many classical proofs have been simplified and streamlined Contains numerous useful exercises