A stochastic block model for interaction lengths
From MaRDI portal
Abstract: We propose a new dynamic stochastic blockmodel that focuses on the analysis of interaction lengths in networks. The model does not rely on a discretization of the time dimension and may be used to analyze networks that evolve continuously over time. The framework relies on a clustering structure on the nodes, whereby two nodes belonging to the same latent group tend to create interactions and non-interactions of similar lengths. We introduce a fast variational expectation-maximization algorithm to perform inference, and adapt a widely used clustering criterion to perform model choice. Finally, we test our methodology on artificial data, and propose a demonstration on a dataset concerning face-to-face interactions between students in a high-school.
Recommendations
- A semiparametric extension of the stochastic block model for longitudinal networks
- Statistical clustering of temporal networks through a dynamic stochastic block model
- scientific article; zbMATH DE number 7056839
- Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models
- Mixed membership stochastic blockmodels
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 7056839 (Why is no real title available?)
- A semiparametric extension of the stochastic block model for longitudinal networks
- An Exponential Family of Probability Distributions for Directed Graphs
- Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models
- Computational aspects of fitting mixture models via the expectation-maximization algorithm
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Dealing With Label Switching in Mixture Models
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- Discrete temporal models of social networks
- EM for mixtures
- Finite mixture and Markov switching models.
- Improved initialisation of model-based clustering using Gaussian hierarchical partitions
- Latent Space Approaches to Social Network Analysis
- Latent space models for dynamic networks
- Mixed membership stochastic blockmodels
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- New consistent and asymptotically normal parameter estimates for random-graph mixture models
- On the convergence properties of the EM algorithm
- Statistical clustering of temporal networks through a dynamic stochastic block model
- Stochastic Blockmodels for Directed Graphs
- The stochastic topic block model for the clustering of vertices in networks with textual edges
Cited in
(11)- Survival Mixed Membership Blockmodel
- Dealing with reciprocity in dynamic stochastic block models
- Statistical inference for continuous‐time Markov processes with block structure based on discrete‐time network data
- Chain-referral sampling on stochastic block models
- expSBM
- Stochastic block model in a new critical regime and the interacting multiplicative coalescent
- Disentangling group and link persistence in dynamic stochastic block models
- Semirandom Stochastic Block Models
- Overlapping stochastic block models with application to the French political blogosphere
- The hierarchy of block models
- A semiparametric extension of the stochastic block model for longitudinal networks
This page was built for publication: A stochastic block model for interaction lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q143078)
