Cantitate/Preț
Produs

Large Deviations for Random Graphs: École d'Été de Probabilités de Saint-Flour XLV - 2015: Lecture Notes in Mathematics, cartea 2197

Autor Sourav Chatterjee
en Limba Engleză Paperback – 2 sep 2017

This book addresses the emerging body of literature on the study of rare events in random graphs and networks. For example, what does a random graph look like if by chance it has far more triangles than expected? Until recently, probability theory offered no tools to help answer such questions. Important advances have been made in the last few years, employing tools from the newly developed theory of graph limits. This work represents the first book-length treatment of this area, while also exploring the related area of exponential random graphs. All required results from analysis, combinatorics, graph theory and classical large deviations theory are developed from scratch, making the text self-contained and doing away with the need to look up external references. Further, the book is written in a format and style that are accessible for beginning graduate students in mathematics and statistics.



Citește tot Restrânge

Din seria Lecture Notes in Mathematics

Preț: 51157 lei

Preț vechi: 60185 lei
-15% Nou

Puncte Express: 767

Preț estimativ în valută:
9791 10178$ 8111£

Carte tipărită la comandă

Livrare economică 04-18 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319658155
ISBN-10: 3319658158
Pagini: 170
Ilustrații: XI, 170 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.27 kg
Ediția:1st ed. 2017
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

1. Introduction.- 2. Preparation.- 3. Basics of graph limit theory.- 4. Large deviation preliminaries.- 5. Large deviations for dense random graphs.- 6. Applications of dense graph large deviations.- 7. Exponential random graph models.- 8. Large deviations for sparse graphs.- Index.

Recenzii

“This nice book is recommended to all probabilists who wish to study the beautiful theory of large deviations for random graphs.” (Zakhar Kabluchko, Mathematical Reviews, April, 2018)

Textul de pe ultima copertă

This book addresses the emerging body of literature on the study of rare events in random graphs and networks. For example, what does a random graph look like if by chance it has far more triangles than expected? Until recently, probability theory offered no tools to help answer such questions. Important advances have been made in the last few years, employing tools from the newly developed theory of graph limits. This work represents the first book-length treatment of this area, while also exploring the related area of exponential random graphs. All required results from analysis, combinatorics, graph theory and classical large deviations theory are developed from scratch, making the text self-contained and doing away with the need to look up external references. Further, the book is written in a format and style that are accessible for beginning graduate students in mathematics and statistics.

Caracteristici

First book-length treatment of large deviations for random graphs, plus a chapter on exponential random graphs Contains a summary of important results from graph limit theory with complete proofs Written in a style for beginning graduate students, self-contained with essentially no need for background knowledge other than some amount of graduate probability and analysis