On the statistical detection of clusters in undirected networks

DOI10.1016/j.csda.2013.06.019zbMath1471.62159OpenAlexW1993486820MaRDI QIDQ1615145

Marcus B. Perry, Gregory V. Michaelson, M. Alan Ballard

Publication date: 2 November 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2013.06.019

zbMATH Keywords

hypothesis testinglog-likelihoodlog-likelihood rationetwork clusteringundirected networkscommunity structure detection

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (4)

On the detection of transitive clusters in undirected networks ⋮ Finite-time synchronization of delayed complex dynamical network via pinning control ⋮ Computing exact \(p\)-values for community detection ⋮ Collaboration mechanisms and community detection of statisticians based on ERGMs and \(k\)NN-walktrap

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Fast online graph clustering via Erdős-Rényi mixture
• Estimating the dimension of a model
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• An Efficient Heuristic Procedure for Partitioning Graphs
• Community structure in social and biological networks
• A Review of Hierarchical Classification
• Multilevel graph partitioning: an evolutionary approach
• A new look at the statistical model identification

This page was built for publication: On the statistical detection of clusters in undirected networks