Contacto
Cómo comprar
Entrega
Guía de compras
Planar Maps, Random Walks and Circle Packing
École d'Été de Probabilités de Saint-Flour XLVIII - 2018
Inglés
136 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
33.59
€
/
Tapa blanda
19.09
€
/
Tapa blanda
16.89
€
/
Tapa blanda
67.89
€
/
Tapa blanda
48.29
€
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.
Sobre el libro
Inglés
Categorías
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
12.59
€
/
Tapa blanda
68.79
€
/
Juego
77.29
€
/
Tapa blanda
10.69
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?