Finding communities in linear time: a physics approach
F Wu, BA Huberman - The European Physical Journal B, 2004 - Springer
F Wu, BA Huberman
The European Physical Journal B, 2004•SpringerWe 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.
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.
Abstract
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.
Springer
Showing the best result for this search. See all results
