Key points are not available for this paper at this time.
Many networks display community structure--groups of vertices within which connections are dense but between which they are sparser--and sensitive computer algorithms have in recent years been developed for detecting this structure. These algorithms, however, are computationally demanding, which limits their application to small networks. Here we describe an algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms. We give several example applications, including one to a collaboration network of more than 50,000 physicists.
Building similarity graph...
Analyzing shared references across papers
Loading...
M. E. J. Newman
Physical Review E
University of Michigan
Building similarity graph...
Analyzing shared references across papers
Loading...
M. E. J. Newman (Fri,) studied this question.
www.synapsesocial.com/papers/69d72a92b815ed77c2bef189 — DOI: https://doi.org/10.1103/physreve.69.066133
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: