The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
Open accessAbstract
Summary: Statistical node clustering in discrete time dynamic networks is an emerging field that raises many challenges. Here, we explore statistical properties and frequentist inference in a model that combines a stochastic block model for its static part with independent Markov chains for the evolution of the nodes groups through time. We model binary data as well as weighted dynamic random graphs (with discrete or continuous edges values). Our approach, motivated by the importance of controlling for label switching issues across the different time steps, focuses on detecting groups characterized by a stable within-group connectivity behaviour. We study identifiability of the model parameters and propose an inference procedure based on a variational expectation–maximization algorithm as well as a model selection criterion to select the number of groups. We carefully discuss our initialization strategy which plays an important role in the method and we compare our procedure with existing procedures on synthetic data sets. We also illustrate our approach on dynamic contact networks: one of encounters between high school students and two others on animal interactions. An implementation of the method is available as an R package called dynsbm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
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
Latent 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
Advances in Neural Information Processing Systems 21
Griffiths, T. L., Lucas, C. G., Williams, J. J., & Kalish, M. L. (2009) · neural information processing systems · Cited by 1,854
Assessing a mixture model for clustering with the integrated completed likelihood
Biernacki, C., Celeux, G., & Govaert, G. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.865189 · Cited by 1,535
Detecting rich-club ordering in complex networks
Colizza, V., Flammini, A., Serrano, M. A., & Vespignani, A. (2006) · Nature Physics · doi:10.1038/nphys209 · Cited by 1,001
Statistical Analysis of Network Data: Methods and Models
Kolaczyk, E. D. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-88146-1 · Cited by 980
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
Mixed membership stochastic blockmodels
Airoldi, E. M., Blei, D. M., Fienberg, S. E., & Xing, E. P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.4485 · Cited by 781
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
ANNUAL REVIEW OF SOCIOLOGY, VOL 37
Snijders, T. A. B. (2011) · Annual Review of Sociology · Cited by 651
A mixture model for random graphs
Daudin, J.-J., Picard, F., & Robin, S. (2008) · Statistics and Computing · doi:10.1007/s11222-007-9046-7 · Cited by 475
Statistical Models for Social Networks
Snijders, T. A. B. (2011) · Annual Review of Sociology · doi:10.1146/annurev.soc.012809.102709 · Cited by 460
Identifiability of parameters in latent structure models with many observed variables
Allman, E. S., Matias, C., & Rhodes, J. A. (2009) · The Annals of Statistics · doi:10.1214/09-aos689 · Cited by 458
Self-citationDynamic social network analysis using latent space models
Sarkar, P., & Moore, A. W. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117459 · Cited by 422
Maximum-likelihood estimation for hidden Markov models
Leroux, B. G. (1992) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(92)90141-c · Cited by 421
Detecting communities and their evolutions in dynamic social networks—a Bayesian approach
Yang, T., Chi, Y., Zhu, S., Gong, Y., & Jin, R. (2011) · Machine Learning · doi:10.1007/s10994-010-5214-7 · Cited by 318
Contact Patterns among High School Students
Fournet, J., & Barrat, A. (2014) · PLoS ONE · doi:10.1371/journal.pone.0107878 · Cited by 304
Reconstruction and estimation in the planted partition model
Mossel, E., Neeman, J., & Sly, A. (2015) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0576-6 · Cited by 301
Dynamic Stochastic Blockmodels for Time-Evolving Social Networks
Xu, K. S., & Hero, A. O. (2014) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2014.2310294 · Cited by 247
A state-space mixed membership blockmodel for dynamic network tomography
Xing, E. P., Fu, W., & Song, L. (2010) · The Annals of Applied Statistics · doi:10.1214/09-aoas311 · Cited by 235
A STATE-SPACE MIXED MEMBERSHIP BLOCKMODEL FOR DYNAMIC NETWORK TOMOGRAPHY
Xing, E. P., Fu, W., & Song, L. (2010) · Cited by 212
Bickel, P., Choi, D., Chang, X., & Zhang, H. (2013) · The Annals of Statistics · doi:10.1214/13-aos1124 · Cited by 208
Variational Bayesian inference and complexity control for stochastic block models
Latouche, P., Birmelé, E., & Ambroise, C. (2012) · Statistical Modelling · doi:10.1177/1471082x1001200105 · Cited by 169
Convergence Theorems for Generalized Alternating Minimization Procedures
Gunawardana, A., & Byrne, B. (2005) · doi:10.5555/1046920.1194913 · Cited by 124
Fast online graph clustering via Erdős–Rényi mixture
Zanghi, H., Ambroise, C., & Miele, V. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.06.019 · Cited by 103
Self-citationAcross‐year social stability shapes network structure in wintering migrant sparrows
Shizuka, D., Chaine, A. S., Anderson, J., Johnson, O. W., Laursen, I. M., & Lyon, B. E. (2014) · Ecology Letters · doi:10.1111/ele.12304 · Cited by 100
Modeling heterogeneity in random graphs through latent space models: a selective review
Matias, C., & Robin, S. S. (2014) · ESAIM Proceedings and Surveys · doi:10.1051/proc/201447004 · Cited by 89
Self-citationRubenstein, D. I., Sundaresan, S. R., Fischhoff, I. R., Tantipathananandh, C., & Berger-Wolf, T. Y. (2015) · PLoS ONE · doi:10.1371/journal.pone.0138645 · Cited by 57
New Consistent and Asymptotically Normal Parameter Estimates for Random-Graph Mixture Models
Ambroise, C., & Matias, C. (2011) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.1467-9868.2011.01009.x · Cited by 55
Self-citationThe dynamic random subgraph model for the clustering of evolving networks
Zreik, R., Latouche, P., & Bouveyron, C. (2016) · Computational Statistics · doi:10.1007/s00180-016-0655-5 · Cited by 37
Strategies for online inference of model-based clustering in large and growing networks
Zanghi, H., Picard, F., Miele, V., & Ambroise, C. (2010) · The Annals of Applied Statistics · doi:10.1214/10-aoas359 · Cited by 24
Self-citationModeling Temporal Evolution and Multiscale Structure in Networks
Herlau, T., Mørup, M., & Schmidt, M. N. (2013) · Cited by 12
Cited by
Jusup, M., Holme, P., Kanazawa, K., Takayasu, M., Romić, I., Wang, Z., Geček, S., Lipić, T., Podobnik, B., Wang, L., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2021.10.005 · Cited by 643
Community Discovery in Dynamic Networks: A Survey
Rossetti, G., & Cazabet, R. (2019) · ACM Computing Surveys · doi:10.1145/3172867 · Cited by 468
Machine Learning for Sociology
Molina, M., & Garip, F. (2019) · Annual Review of Sociology · doi:10.1146/annurev-soc-073117-041106 · Cited by 295
Metadata
- Authors
- Matias, C., & Miele, V.
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 2016-08-22
- Volume
- 79
- Issue
- 4
- Pages
- 1119-1141
- ISSN
- 1369-7412 (ISSN-L)
- 1467-9868
- OpenAlex
- W1694128711
- Cited by
- 326
- References
- 36
- FWCI
- 20.36
- Type
- journal article
- Language
- en
- Open access
- green
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.