SignedLouvain: Louvain for signed networks
<|reference_start|>SignedLouvain: Louvain for signed networks: In this article, we consider the problem of community detection in signed networks. We propose SignedLouvain, an adaptation of the Louvain method to maximise signed modularity, efficiently taking advantage of the structure induced by signed relations. We begin by identifying the inherent limitations of applying the standard Louvain algorithm to signed networks, before introducing a novel variant specifically engineered to overcome these challenges. Through extensive experiments on real-world datasets, we demonstrate that the proposed method not only maintains the speed and scalability of its predecessor but also significantly enhances accuracy in detecting communities within signed networks.<|reference_end|>
@article{pougué-biyong2024signedlouvain:,
    title={SignedLouvain: Louvain for signed networks},
    author={John N. Pougu'e-Biyong, Renaud Lambiotte},
    journal={arXiv preprint arXiv:2407.19288},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.19288},
    primaryClass={cs.SI physics.data-an physics.soc-ph}
}