Chatterjee Large Deviations for Random Graphs

École d'Été de Probabilités de Saint-Flour XLV - 2015
1. Auflage 2017
ISBN: 978-3-319-65816-2
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 170 Seiten, eBook

Reihe: École d'Été de Probabilités de Saint-Flour

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.

Zielgruppe

Research

Autoren/Hrsg.

Chatterjee, Sourav

Inhaltsverzeichnis

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.