Large deviations for random graphs : Ecole d'Ete de Probabilites de Saint-Flour XLV - 2015 / Sourav Chatterjee.
Material type:
- 9783319658155 (alk. paper)
- 511.5 23 Sa132
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 511.5 Sa132 (Browse shelf(Opens below)) | Available | 138235 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
No cover image available | No cover image available | |||||||
511.5 R581 Map color theorem | 511.5 R814 Graph separators, with applications | 511.5 Sa112 Four-color problem : assaults and conquest | 511.5 Sa132 Large deviations for random graphs : | 511.5 Se488 Trees | 511.5 Sh556 How to construct graphs | 511.5 So683 Mathematical coloring book |
Include index and bibliographical references and index.
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.
This book addresses the emerging body of literature on the study of rare events in random graphs and networks.
There are no comments on this title.