Finding network communities using random walkers with improved accuracy

DOI10.1007/978-3-642-38768-5_73MaRDI QIDQ4925298zbMATH OpenOpenAlexFDO

Authors You Li, Benyuan Liu, Qilian Liang, Jie Wang

Publication date 11 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38768-5_73

zbMATH Keywords

random walkersaccuracy of community identification

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81)

Recommendations

• Computing Communities in Large Networks Using Random Walks
• Fast unfolding of communities in large networks
• Detecting network communities: a new systematic and efficient algorithm
• Algorithms and Models for the Web-Graph
• Community identification algorithm using relative edge density measure

Cited in

(5)

• Detecting the fuzzy clusters of complex networks
• Computing Communities in Large Networks Using Random Walks
• Ant colony optimization based on random walk for community detection in complex networks
• Fast Low-Cost Estimation of Network Properties Using Random Walks
• A Random Network Ensemble Model Based Generalized Network Community Mining Algorithm

This page was built for publication: Finding network communities using random walkers with improved accuracy

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