arXiv (Cornell University) · 2013 · 118 citations · 19 references
ComputingComputer ScienceComputer NetworksStochastic ModelingUncertainty QuantificationGraph AnalyticsGraph TheoryNetwork AnalysisNetwork InferenceNetwork ModelingStochastic NetworksEstimation ErrorGraph Theory In NetworksGraph-theoretic Network AnalysisNetwork ApproximationRandom GraphsStochastic ApproximationStochastic Network ModelsStochastic Processes On Networks
Non-parametric approaches for analyzing network data based on exchangeable graph models (ExGM) have recently gained interest. The key object that defines an ExGM is often referred to as a graphon. This non-parametric perspective on network modeling poses challenging questions on how to make inference on the graphon underlying observed network data. In this paper, we propose a computationally efficient procedure to estimate a graphon from a set of observed networks generated from it. This procedure is based on a stochastic blockmodel approximation (SBA) of the graphon. We show that, by approximating the graphon with a stochastic block model, the graphon can be consistently estimated, that is, the estimation error vanishes as the size of the graph approaches infinity.
19
Mixed Membership Stochastic Blockmodels.
Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg et al. · PubMed · 2008 · 1.5K citations · Full text