Basic models and questions in statistical network analysis
M. Racz, and S. Bubeck. (2016)cite arxiv:1609.03511Comment: 38 pages, 10 figures. Lecture notes for a graduate minicourse presented at University of Washington and the XX Brazilian School of Probability in June/July 2016.
Abstract
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.
Description
[1609.03511] Basic models and questions in statistical network analysis
cite arxiv:1609.03511Comment: 38 pages, 10 figures. Lecture notes for a graduate minicourse presented at University of Washington and the XX Brazilian School of Probability in June/July 2016
%0 Journal Article
%1 racz2016basic
%A Racz, Miklos Z.
%A Bubeck, Sébastien
%D 2016
%K clustering optimization stats
%T Basic models and questions in statistical network analysis
%U http://arxiv.org/abs/1609.03511
%X 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.
@article{racz2016basic,
abstract = {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\'olya urns,
large deviation theory, concentration of measure in high dimension, entropic
central limit theorems, and more.},
added-at = {2020-01-03T03:47:54.000+0100},
author = {Racz, Miklos Z. and Bubeck, Sébastien},
biburl = {https://www.bibsonomy.org/bibtex/2f776857528c904b468f2a0a9461a8351/kirk86},
description = {[1609.03511] Basic models and questions in statistical network analysis},
interhash = {b85564053a24bb97f601c202fc40a626},
intrahash = {f776857528c904b468f2a0a9461a8351},
keywords = {clustering optimization stats},
note = {cite arxiv:1609.03511Comment: 38 pages, 10 figures. Lecture notes for a graduate minicourse presented at University of Washington and the XX Brazilian School of Probability in June/July 2016},
timestamp = {2020-01-03T03:47:54.000+0100},
title = {Basic models and questions in statistical network analysis},
url = {http://arxiv.org/abs/1609.03511},
year = 2016
}