Detection of structurally homogeneous subsets in graphs

DOI10.1007/S11222-013-9395-3zbMATH Open1322.05129DBLPjournals/sac/LegerVD14OpenAlexW2015927884WikidataQ60560746 ScholiaQ60560746MaRDI QIDQ746312FDOQ746312

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

random walkstochastic block modelgraphsclustersspectral clusteringbipartite graphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A nonparametric view of network models and Newman–Girvan and other modularities
• Spectral clustering and the high-dimensional stochastic blockmodel
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• Mixed membership stochastic blockmodels
• Community structure in social and biological networks
• Overlapping stochastic block models with application to the French political blogosphere
• Uncovering latent structure in valued graphs: a variational approach
• Stochastic blockmodels with a growing number of classes
• 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
• Predicting unobserved links in incompletely observed networks
• Constructing blockmodels: how and why
• Optimal information transmission in organizations: Search and congestion
• Model for Heterogeneous Random Networks Using Continuous Latent Variables and an Application to a Tree-Fungus Network
• Comparing latent structures of the grade of membership, Rasch, and latent class models
• A generalization of Takane's algorithm for DEDICOM

Cited In (3)

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

Uses Software

• igraph
• Mixnet

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746312)