Cantitate/Preț
Produs
Total produse
Vezi coșul
Planar Maps, Random Walks and Circle Packing de Asaf Nachmias

Planar Maps, Random Walks and Circle Packing

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

This work was published by Saint Philip Street Press pursuant to a Creative Commons license permitting commercial use. All rights not granted by the work's license are retained by the author or authors.

Citește tot Restrânge

Toate formatele și edițiile

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

Preț: 24155 lei

Nou

Puncte Express: 362
Preț estimativ în valută:
4622€ • 4848$ • 3854£

Carte tipărită la comandă

Livrare economică 07-21 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781013271120
ISBN-10: 1013271122
Pagini: 122
Dimensiuni: 216 x 280 x 6 mm
Greutate: 0.3 kg
Editura: Saint Philip Street Press

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