Large Deviations for Random Graphs

Sourav Chatterjee

ISBN 10: 3319658158 / ISBN 13: 9783319658155

Published by Springer Nature Switzerland, Springer International Publishing Sep 2017, 2017

About this Item

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 184 pp. Englisch.

Seller Inventory # 9783319658155

Bibliographic Details

• Title: Large Deviations for Random Graphs
• Publisher: Springer Nature Switzerland, Springer International Publishing Sep 2017
• Publication Date: 2017
• Language: English
• ISBN 10: 3319658158
• ISBN 13: 9783319658155
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 11D millimeters 235 millimeters width by 155 millimeters height by 11 millimeters depth
• Weight: 289 grams

About this title

Synopsis

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

From the Back Cover

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.