An Agent-Based Algorithm for Detecting Community Structure in Networks
Maxwell Young, Jennifer Sager, Gabor Csardi, Peter Haga
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.
Create a lesson
Related papers
Orbital cancellation and reentrant localization in a quasiperiodic trimer ladder
Xin Wang, Pei-Jie Chang, Quanfeng Lu et al.
Quantum Localization in Geometric Complex Networks
Jan Lewenstein-Sanpera, Tobias Grass, M. Àngeles Serrano et al.
Eigenstate transitions and critical transport in 3D Aubry-André model
Pragna Das, Lev Vidmar, Miroslav Hopjan
Weyl's theorem and the theoretical origin of Boson peak in two-dimensional scalar spring network
Cunyuan Jiang
On physical implementability of reinforcement-learning-driven reasoning
Eiji Konishi
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin