Criterions for locally dense subgraphs
Physics and Society
2015-05-27 v3 Social and Information Networks
Computational Physics
Abstract
Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two necessary properties of communities, separation and internal cohesion, the latter being a new concept. I propose a local method of community detection based on two-dimensional local optimization, which I tested on common benchmarks and on the word association database.
Cite
@article{arxiv.1103.3397,
title = {Criterions for locally dense subgraphs},
author = {Gergely Tibély},
journal= {arXiv preprint arXiv:1103.3397},
year = {2015}
}
Comments
Revised version. 26 pages, 8 figures, 1 table