Scalable Graph Clustering Using Stochastic Flows: Applications to Community Discovery
Published on Sep 14, 20094402 Views
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of scalability and frag