To refer to this page use:
|Abstract:||© 2017, Institute of Mathematical Statistics. All rights reserved. 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.|
|Citation:||Rácz, MZ, Bubeck, S. (2017). Basic models and questions in statistical network analysis. Statistics Surveys, 11 (1 - 47. doi:10.1214/17-SS117|
|Pages:||1 - 47|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||Statistics Surveys|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.