Detection of structurally homogeneous subsets in graphs

DOI10.1007/s11222-013-9395-3zbMath1322.05129OpenAlexW2015927884WikidataQ60560746 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

zbMATH Keywords

graphsbipartite graphsrandom walkclustersspectral clusteringstochastic block model

Mathematics Subject Classification ID

Related Items (3)

Effective Resistance Preserving Directed Graph Symmetrization ⋮ Maximum likelihood estimation of sparse networks with missing observations ⋮ Weighted stochastic block model

Uses Software

• igraph
• Mixnet

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

This page was built for publication: Detection of structurally homogeneous subsets in graphs