2003/10/26 by Fang Wu, F. Wu, Bernardo A. Huberman · 2 citations
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Data Visualization and Analytics #Peer-to-Peer Network Technologies #cond-mat.stat-mech #cs.DS
paper · pdf · doi:10.1140/epjb/e2004-00125-x
arxiv created 2003/10/26 · openalex publication_date 2004/03/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present a method that allows for the discovery of communities within graphs of arbitrary size in times that scale linearly with their size. This method avoids edge cutting and is based on notions of voltage drops across networks that are both intuitive and easy to solve regardless of the complexity of the graph involved. We additionally show how this algorithm allows for the swift discovery of the community surrounding a given node without having to extract all the communities out of a graph.