An Agent-Based Algorithm for Detecting Community Structure in Networks

Abstract

We present a simple stochastic agent-based community finding algorithm. Our algorithm is tested on network data from the Zachary karate club study, data from Victor Hugo's "Les Miserables", and data obtained from a musical piece by J.S. Bach. In all three cases, the algorithm partitions the vertices of the graph sensibly.

Report for a student project at the Complex Systems Summer School organized by the Santa Fe Institute, 2004 - Withdrawn because the results are no longer relevant

References in corpus (2)

• Finding and evaluating community structure in networks
• Fast algorithm for detecting community structure in networks

Cited by in corpus (4)

• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Accuracy and Precision of Methods for Community Identification in Weighted Networks
• Process Flow Diagram of an Ammonia Plant as a Complex Network
• Community Detection in Complex Networks Using Agents