Mixture models and exploratory analysis in networks
From MaRDI portal
Abstract: Networks are widely used in the biological, physical, and social sciences as a concise mathematical representation of the topology of systems of interacting components. Understanding the structure of these networks is one of the outstanding challenges in the study of complex systems. Here we describe a general technique for detecting structural features in large-scale network data which works by dividing the nodes of a network into classes such that the members of each class have similar patterns of connection to other nodes. Using the machinery of probabilistic mixture models and the expectation-maximization algorithm, we show that it is possible to detect, without prior knowledge of what we are looking for, a very broad range of types of structure in networks. We give a number of examples demonstrating how the method can be used to shed light on the properties of real-world networks, including social and information networks.
Recommendations
- Mixture models and networks: The stochastic blockmodel
- Estimation of multiple networks in Gaussian mixture models
- Mixed membership stochastic blockmodels for heterogeneous networks
- scientific article; zbMATH DE number 434919
- Mixture models with entropy regularization for community detection in networks
- A survey of statistical network models
- Sub-modular resolution analysis by network mixture models
- scientific article; zbMATH DE number 3856794
- Network structure exploration via Bayesian nonparametric models
- scientific article; zbMATH DE number 934450
Cites work
Cited in
(69)- Rate-optimal graphon estimation
- An online expectation maximization algorithm for exploring general structure in massive networks
- Network structure exploration in networks with node attributes
- Overlapping community detection using a generative model for networks
- Random walks and diffusion on networks
- Group detection in complex networks: an algorithm and comparison of the state of the art
- Potential links by neighbor communities
- Consistency of community detection in networks under degree-corrected stochastic block models
- Attributed graph clustering with subspace stochastic block model
- Additive and multiplicative effects network models
- A clustering procedure for mixed-type data to explore ego network typologies: an application to elderly people living alone in Italy
- Edgeworth expansions for network moments
- On equivalence of likelihood maximization of stochastic block model and constrained nonnegative matrix factorization
- Mixture models with entropy regularization for community detection in networks
- Modular representation of layered neural networks
- Spectral clustering-based community detection using graph distance and node attributes
- Community detection based on first passage probabilities
- Sub-modular resolution analysis by network mixture models
- Network modelling and variational Bayesian inference for structure analysis of signed networks
- An improved multi-objective evolutionary algorithm for simultaneously detecting separated and overlapping communities
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Improved Bayesian inference for the stochastic block model with application to large networks
- Magnetic eigenmaps for the visualization of directed networks
- Mining the hidden link structure from distribution flows for a spatial social network
- A generative model for exploring structure regularities in attributed networks
- A survey of community detection methods in multilayer networks
- Detecting communities in networks using a Bayesian nonparametric method
- A nonparametric view of network models and Newman–Girvan and other modularities
- Structure in networks
- Local multiresolution order in community detection
- Network structure exploration via Bayesian nonparametric models
- Correlation enhanced modularity-based belief propagation method for community detection in networks
- Statistical mechanics of the directed 2-distance minimal dominating set problem
- Community detection for networks with unipartite and bipartite structure
- Group-Level Analysis and Visualization of Social Networks
- Improved spectral community detection in large heterogeneous networks
- Active discovery of network roles for predicting the classes of network nodes
- A classification for community discovery methods in complex networks
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- scientific article; zbMATH DE number 7370527 (Why is no real title available?)
- Community detection with structural and attribute similarities
- Clustering and community detection in directed networks: a survey
- Efficient discovery of overlapping communities in massive networks
- Variational Bayesian inference and complexity control for stochastic block models
- Network measures of mixing
- scientific article; zbMATH DE number 6452615 (Why is no real title available?)
- Mixing patterns and community structure in networks
- Overlapping stochastic block models with application to the French political blogosphere
- A network embedding-enhanced Bayesian model for generalized community detection in complex networks
- Clustering multivariate count data via Dirichlet-multinomial network fusion
- Graphical Assistant Grouped Network Autoregression Model: A Bayesian Nonparametric Recourse
- Parameter identifiability in a class of random graph mixture models
- Two-sample test of stochastic block models
- Mixture of Networks for Clustering Categorical Data: A Penalized Composite Likelihood Approach
- A spectral based goodness-of-fit test for stochastic block models
- Community detection: concepts, algorithms, evaluation and challenges
- Nonparametric identification and estimation of stochastic block models from many small networks
- PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection
- Modeling Endogenous Mobility in Earnings Determination
- Robust asymmetric non-negative matrix factorization for clustering nodes in directed networks
- Two-sample test of stochastic block models via the maximum sampling entry-wise deviation
- Joint Network Reconstruction and Community Detection from Rich but Noisy Data
- Community detection in attributed networks using stochastic block models
- A Riemannian optimization approach to clustering problems
- Anti-modularity and anti-community detecting in complex networks
- Pseudo-likelihood methods for community detection in large sparse networks
- Role models for complex networks
- Large-scale structure of time evolving citation networks
- Strategies for online inference of model-based clustering in large and growing networks
This page was built for publication: Mixture models and exploratory analysis in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615233)
