- Statist. Surv.
- Volume 11 (2017), 1-47.
Basic models and questions in statistical network analysis
Extracting information from large graphs has become an important statistical problem since network data is now common in various fields. In this minicourse we will investigate the most natural statistical questions for three canonical probabilistic models of networks: (i) community detection in the stochastic block model, (ii) finding the embedding of a random geometric graph, and (iii) finding the original vertex in a preferential attachment tree. Along the way we will cover many interesting topics in probability theory such as Pólya urns, large deviation theory, concentration of measure in high dimension, entropic central limit theorems, and more.
Statist. Surv. Volume 11 (2017), 1-47.
Received: September 2016
First available in Project Euclid: 8 September 2017
Permanent link to this document
Digital Object Identifier
Rácz, Miklós Z.; Bubeck, Sébastien. Basic models and questions in statistical network analysis. Statist. Surv. 11 (2017), 1--47. doi:10.1214/17-SS117. https://projecteuclid.org/euclid.ssu/1504836152