Finding communities in linear time: a physics approach
Applied Physics Department, Stanford University, Stanford, CA 94305, USA
2 HP Labs, Palo Alto, CA 94304, USA
Corresponding author: a firstname.lastname@example.org
Published online: 14 May 2004
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.
PACS: 89.75.Fb – Structures and organization in complex systems / 89.75.Hc – Networks and genealogical trees
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2004