Network partitioning algorithms as cooperative games

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...

Full description

Bibliographic Details
Main Authors: Konstantin E. Avrachenkov, Aleksei Y. Kondratev, Vladimir V. Mazalov, Dmytro G. Rubanov
Format: Article
Language:English
Published: SpringerOpen 2018-10-01
Series:Computational Social Networks
Subjects:
Network partitioning
Community detection
Cooperative game
Myerson value
Hedonic game
Gibbs sampling
Online Access:http://link.springer.com/article/10.1186/s40649-018-0059-5

Internet

http://link.springer.com/article/10.1186/s40649-018-0059-5

Similar Items