Network partitioning algorithms as cooperative games

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

Full description

Saved in:

Bibliographic Details
Published in:	Computational social networks Vol. 5; no. 1; pp. 11 - 28
Main Authors:	Avrachenkov, Konstantin E., Kondratev, Aleksei Y., Mazalov, Vladimir V., Rubanov, Dmytro G.
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.12.2018 Springer Nature B.V Springer
Subjects:	Article Collection of the 6th International Conference on Complex Networks and Their Applications Communities Computer Science Data-driven Science Database Management Game theory Graph theory Industrial and Production Engineering Industrial Organization Machine Learning Mathematical Models of Cognitive Processes and Neural Networks Mathematics Mathematics and Statistics Media Sociology Modeling and Theory Building Modularity Social and Information Networks Statistics Network partitioning Community detection Gibbs sampling Hedonic game Myerson value Cooperative game
ISSN:	2197-4314, 2197-4314
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!