The dynamic random subgraph model for the clustering of evolving networks
From MaRDI portal
Recommendations
- Clustering of dynamic networks through subgraphs: a study of the Enron scandal
- Model-based clustering of time-evolving networks through temporal exponential-family random graph models
- Statistical clustering of temporal networks through a dynamic stochastic block model
- scientific article; zbMATH DE number 7233664
- The dynamic stochastic topic block model for dynamic networks with textual edges
Cites work
- A correlated topic model of science
- A new look at the statistical model identification
- A nonparametric view of network models and Newman–Girvan and other modularities
- A state-space mixed membership blockmodel for dynamic network tomography
- An introduction to variational methods for graphical models
- Another interpretation of the EM algorithm for mixture distributions
- Community structure in social and biological networks
- Consistent estimation of a mixing distribution
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- Estimating the dimension of a model
- Estimation and Prediction for Stochastic Blockstructures
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1059776 (Why is no real title available?)
- Improved Bayesian inference for the stochastic block model with application to large networks
- Mixed membership stochastic blockmodels
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- Model selection in overlapping stochastic block models
- Modeling heterogeneity in random graphs through latent space models: a selective review
- Overlapping stochastic block models with application to the French political blogosphere
- Statistical mechanics of complex networks
- Stochastic Blockmodels for Directed Graphs
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Uncovering latent structure in valued graphs: a variational approach
- Variational Bayesian inference and complexity control for stochastic block models
Cited in
(12)- The stochastic topic block model for the clustering of vertices in networks with textual edges
- Multiple change points detection and clustering in dynamic networks
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Model-based clustering of time-evolving networks through temporal exponential-family random graph models
- The dynamic stochastic topic block model for dynamic networks with textual edges
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Variational approximation for importance sampling
- Hierarchical clustering with discrete latent variable models and the integrated classification likelihood
- Clustering of dynamic networks through subgraphs: a study of the Enron scandal
- scientific article; zbMATH DE number 7233664 (Why is no real title available?)
- Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm
- Embedded topics in the stochastic block model
This page was built for publication: The dynamic random subgraph model for the clustering of evolving networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358931)
