Detection of structurally homogeneous subsets in graphs
From MaRDI portal
Publication:746312
DOI10.1007/s11222-013-9395-3zbMath1322.05129WikidataQ60560746 ScholiaQ60560746MaRDI QIDQ746312
Corinne Vacher, Jean-Benoist Leger, Jean-Jacques Daudin
Publication date: 16 October 2015
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-013-9395-3
62H30: Classification and discrimination; cluster analysis (statistical aspects)
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Effective Resistance Preserving Directed Graph Symmetrization, Weighted stochastic block model, Maximum likelihood estimation of sparse networks with missing observations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Overlapping stochastic block models with application to the French political blogosphere
- Spectral clustering and the high-dimensional stochastic blockmodel
- Uncovering latent structure in valued graphs: a variational approach
- Predicting unobserved links in incompletely observed networks
- Constructing blockmodels: how and why
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Comparing latent structures of the grade of membership, Rasch, and latent class models
- Optimal information transmission in organizations: Search and congestion
- A generalization of Takane's algorithm for DEDICOM
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Model for Heterogeneous Random Networks Using Continuous Latent Variables and an Application to a Tree-Fungus Network
- Mixed membership stochastic blockmodels
- Community structure in social and biological networks
- New Consistent and Asymptotically Normal Parameter Estimates for Random-Graph Mixture Models
- Computing Communities in Large Networks Using Random Walks
- Lower Bounds for the Partitioning of Graphs