Uncovering latent structure in valued graphs: A variational approach
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502 · cited 2×
“A natural and intuitive way to capture an underlying structure is to look for groups of edges having similar connection profiles [Getoor and Diehl (2004), Newman, Watts and Strogatz (2002)], which is refereed to as community detection [Girvan and Newman (2002), Newman (2004)].”
BackgroundMethodMcLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791 · cited 1×
“We propose to use an approximate maximum likelihood strategy based on a variational approach [see Jordan et al. (1999) or the tutorial by Jaakkola (2000)].”
MethodLatent Space Approaches to Social Network Analysis
Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502388618906 · Cited by 1,917
(2005) · Edinburgh Research Explorer (University of Edinburgh) · doi:10.5555/1046920.1088695 · Cited by 650
Consistency of spectral clustering
von Luxburg, U., Belkin, M., & Bousquet, O. (2008) · The Annals of Statistics · doi:10.1214/009053607000000640 · Cited by 540
Beal, M. J., & Ghahramani, Z. (2003) · Bayesian Statistics 7 · doi:10.1093/oso/9780198526155.003.0025 · Cited by 458
Cited by
Exponential-family random graph models for valued networks
Krivitsky, P. N. (2012) · Electronic Journal of Statistics · doi:10.1214/12-ejs696 · Cited by 295
Pseudo-likelihood methods for community detection in large sparse networks
Amini, A. A., Chen, A., Bickel, P. J., & Levina, E. (2013) · The Annals of Statistics · doi:10.1214/13-aos1138 · Cited by 259
Hierarchical Block Structures and High-Resolution Model Selection in Large Networks
Peixoto, T. P. (2014) · Physical Review X · doi:10.1103/physrevx.4.011047 · Cited by 248
“…of the many principled methods one could use to do model selection, which include, e.g., Bayesian model selection via integrated likelihood [21, 38, 39, 41, 42, 55], likelihood ratios [56] or more approximative methods such as Bayesian information criterion (BIC) [57] and Akaike information…”
MethodStochastic blockmodels with a growing number of classes
Choi, D. S., Wolfe, P. J., & Airoldi, E. M. (2012) · Biometrika · doi:10.1093/biomet/asr053 · Cited by 220
“…been applied in a variety of disciplines (Wang & Wong, 1987; Nowicki & Snijders, 2001; Girvan & Newman, 2002; Airoldi et al., 2005; Doreian et al., 2005; Newman, 2006; Handcock et al., 2007; Hoff, 2008; Airoldi et al., 2008; Copic et al., 2009; Mariadassou et al., 2010; Karrer & Newman, 2011).”
BackgroundInferring the mesoscale structure of layered, edge-valued, and time-varying networks
Peixoto, T. P. (2015) · Physical Review E · doi:10.1103/physreve.92.042807 · Cited by 164
“This work extends recent developments on layered [37], edge-valued [38–41] and temporal [42–44] generative processes, not only by incorporating many important topological patterns simultaneously (i.e. hierarchical structure, degree correction and overlapping groups), but also by tying all these…”
Background
Metadata
- Authors
- Mariadassou, M., Robin, S., & Vacher, C.
- Venue
- The Annals of Applied Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2010-06-01
- Volume
- 4
- Issue
- 2
- Pages
- 715-742
- ISSN
- 1932-6157 (ISSN-L)
- OpenAlex
- W2018312367
- Cited by
- 220
- References
- 9
- FWCI
- 7.39
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.