Uncovering latent structure in valued graphs: A variational approach
arXiv:1011.1813 · doi:10.1214/10-AOAS361
Abstract
As more and more network-structured data sets are available, the statistical analysis of valued graphs has become common place. Looking for a latent structure is one of the many strategies used to better understand the behavior of a network. Several methods already exist for the binary case. We present a model-based strategy to uncover groups of nodes in valued graphs. This framework can be used for a wide span of parametric random graphs models and allows to include covariates. Variational tools allow us to achieve approximate maximum likelihood estimation of the parameters of these models. We provide a simulation study showing that our estimation method performs well over a broad range of situations. We apply this method to analyze host--parasite interaction networks in forest ecosystems.
Published in at http://dx.doi.org/10.1214/10-AOAS361 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (4)
Cited by in corpus (10)
- Uncovering latent structure in valued graphs: A variational approach
- Model selection and hypothesis testing for large-scale network models with overlapping groups
- Stochastic Block Models for Multiplex networks: an application to networks of researchers
- GANC: Greedy Agglomerative Normalized Cut
- New consistent and asymptotically normal estimators for random graph mixture models
- Clustering in networks with the collapsed Stochastic Block Model
- The Strength of Arcs and Edges in Interaction Networks: Elements of a Model-Based Approach
- Model Selection in Overlapping Stochastic Block Models
- Estimation and Model Selection for Model-Based Clustering with the Conditional Classification Likelihood
- Clustering based on Random Graph Model embedding Vertex Features