Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

hp.com home

Discovering Communities in Linear Time: a Physics Approach

printable version

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here

Fang Wu and Bernardo A. Huberman

HP Laboratories
Palo Alto, CA 94304


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


Full paper: linear.pdf

» Information Dynamics Lab

» Research areas
» Results
» People
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.