Blind Identification of Stochastic Block Models from Dynamical Observations

24Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a blind identification problem in which we aim to recover a statistical model of a network without knowledge of the network's edges but based solely on nodal observations of a certain process. More concretely, we focus on observations that consist of single snapshots taken from multiple trajectories of a diffusive process that evolves over the unknown network. We model the network as generated from an independent draw from a latent stochastic block model (SBM), and our goal is to infer both the partition of the nodes into blocks and the parameters of this SBM. We discuss some nonidentifiability issues related to this problem and present simple spectral algorithms that provably solve the partition recovery and parameter estimation problems with high accuracy. Our analysis relies on recent results in random matrix theory and covariance estimation and on associated concentration inequalities. We illustrate our results with several numerical experiments.

Cite

CITATION STYLE

APA

Schaub, M. T., Segarra, S., & Tsitsiklis, J. N. (2020). Blind Identification of Stochastic Block Models from Dynamical Observations. SIAM Journal on Mathematics of Data Science, 2(2), 335–367. https://doi.org/10.1137/19M1263340

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free