A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks

DOI10.1016/J.AMC.2010.09.026zbMATH Open1202.05140OpenAlexW1978704094MaRDI QIDQ613303FDOQ613303

Sarah Michele Rajtmajer, Damir Vukičević

Publication date: 20 December 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.09.026

Recommendations

• Community detection based on network communicability
• A clustering algorithm of a complex network based on a transition matrix \(P\)
• Communicability graph and community structures in complex networks
• Detecting network communities: a new systematic and efficient algorithm
• Finding community structure in networks using a shortest-path-based \(k\)-means algorithm

zbMATH Keywords

complex networksgraph spectracommunity structurecommunicability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Community structure in social and biological networks
• Title not available (Why is that?)
• Collective dynamics of ‘small-world’ networks
• Communicability graph and community structures in complex networks

Cited In (1)

• Community detection based on network communicability

This page was built for publication: A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks

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