Network partitioning algorithms as cooperative games

Abstract : The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting dense subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from cooperative game theory: the first approach is based on the Myerson value, whereas the second approach is based on hedonic games. Both approaches allow to detect clusters with various resolutions. However, the tuning of the resolution parameter in the hedonic games approach is particularly intuitive. Furthermore, the modularity-based approach and its generalizations as well as ratio cut and normalized cut methods can be viewed as particular cases of the hedonic games. Finally, for approaches based on potential hedonic games we suggest a very efficient computational scheme using Gibbs sampling.
Complete list of metadatas

Cited literature [51 references]  Display  Hide  Download

https://hal.inria.fr/hal-01935419
Contributor : Konstantin Avrachenkov <>
Submitted on : Monday, November 26, 2018 - 4:26:50 PM
Last modification on : Friday, November 8, 2019 - 3:48:02 PM
Long-term archiving on : Wednesday, February 27, 2019 - 2:58:10 PM

File

CSON2018_5_11.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Konstantin Avrachenkov, Aleksei Kondratev, Vladimir Mazalov, Dmytro Rubanov. Network partitioning algorithms as cooperative games. Computational Social Networks, Springer, 2018, 5 (11), ⟨10.1186/s40649-018-0059-5⟩. ⟨hal-01935419⟩

Share

Metrics

Record views

66

Files downloads

126