Planar Maps, Random Walks and Circle Packing École d'Été de Probabilités de Saint-Flour XLVIII - 2018

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...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Glavni avtor: Nachmias, Asaf (auth)
Format: Elektronski Book Chapter
Jezik:angleščina
Izdano: Springer Nature 2020
Serija:Lecture Notes in Mathematics
Teme:
Online dostop:OAPEN Library: download the publication
OAPEN Library: description of the publication
Oznake: Označite
Brez oznak, prvi označite!

MARC

LEADER 00000naaaa2200000uu 4500
001 oapen_2024_20_500_12657_23323
005 20200318
003 oapen
006 m o d
007 cr|mn|---annan
008 20200318s2020 xx |||||o ||| 0|eng d
020 |a 978-3-030-27968-4 
040 |a oapen  |c oapen 
024 7 |a 10.1007/978-3-030-27968-4  |c doi 
041 0 |a eng 
042 |a dc 
072 7 |a PBD  |2 bicssc 
072 7 |a PBM  |2 bicssc 
072 7 |a PBT  |2 bicssc 
072 7 |a PHU  |2 bicssc 
100 1 |a Nachmias, Asaf  |4 auth 
245 1 0 |a Planar Maps, Random Walks and Circle Packing  |b École d'Été de Probabilités de Saint-Flour XLVIII - 2018 
260 |b Springer Nature  |c 2020 
300 |a 1 electronic resource (120 p.) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Mathematics 
506 0 |a Open Access  |2 star  |f Unrestricted online access 
520 |a 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. 
536 |a H2020 European Research Council 
540 |a Creative Commons  |f https://creativecommons.org/licenses/by/4.0  |2 cc  |4 https://creativecommons.org/licenses/by/4.0 
546 |a English 
650 7 |a Discrete mathematics  |2 bicssc 
650 7 |a Geometry  |2 bicssc 
650 7 |a Probability & statistics  |2 bicssc 
650 7 |a Mathematical physics  |2 bicssc 
653 |a Mathematics 
653 |a Probabilities 
653 |a Discrete mathematics 
653 |a Geometry 
653 |a Mathematical physics 
856 4 0 |a www.oapen.org  |u https://library.oapen.org/bitstream/id/e672427a-4b1b-4573-a2a2-b064be3b204d/1006832.pdf  |7 0  |z OAPEN Library: download the publication 
856 4 0 |a www.oapen.org  |u http://library.oapen.org/handle/20.500.12657/23323  |7 0  |z OAPEN Library: description of the publication