1.

Record Nr.

UNINA9910257379303321

Autore

Chatterjee Sourav

Titolo

Large Deviations for Random Graphs : École d'Été de Probabilités de Saint-Flour XLV - 2015 / / by Sourav Chatterjee

Pubbl/distr/stampa

Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017

ISBN

3-319-65816-6

Edizione

[1st ed. 2017.]

Descrizione fisica

1 online resource (XI, 170 p.)

Collana

École d'Été de Probabilités de Saint-Flour, , 0721-5363 ; ; 2197

Disciplina

511.5

Soggetti

Probabilities

Combinatorics

Probability Theory and Stochastic Processes

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di contenuto

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.

Sommario/riassunto

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.