EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks

DOI10.1140/EPJB/E2012-30697-5zbMath1515.91130OpenAlexW2035188969MaRDI QIDQ6135122

Yan Wu, Guodong Zhao, YuanFang Ren, Ming Zhu

Publication date: 26 July 2023

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1140/epjb/e2012-30697-5

zbMATH Keywords

statistical and nonlinear physics

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sums of independent random variables; random walks (60G50)

Cites Work

• Predicting missing links via local information
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks

This page was built for publication: EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks