Overlapping Modularity at the Critical Point of k-Clique Percolation

Bálint Tóth, T. Vicsek, Gergely Palla

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

One of the most remarkable social phenomena is the formation of communities in social networks corresponding to families, friendship circles, work teams, etc. Since people usually belong to several different communities at the same time, the induced overlaps result in an extremely complicated web of the communities themselves. Thus, uncovering the intricate community structure of social networks is a non-trivial task with great potential for practical applications, gaining a notable interest in the recent years. The Clique Percolation Method (CPM) is one of the earliest overlapping community finding methods, which was already used in the analysis of several different social networks. In this approach the communities correspond to k-clique percolation clusters, and the general heuristic for setting the parameters of the method is to tune the system just below the critical point of k-clique percolation. However, this rule is based on simple physical principles and its validity was never subject to quantitative analysis. Here we examine the quality of the partitioning in the vicinity of the critical point using recently introduced overlapping modularity measures. According to our results on real social and other networks, the overlapping modularities show a maximum close to the critical point, justifying the original criteria for the optimal parameter settings.

Original languageEnglish
Pages (from-to)689-706
Number of pages18
JournalJournal of Statistical Physics
Volume151
Issue number3-4
DOIs
Publication statusPublished - 2013

Fingerprint

modularity
Modularity
Clique
Overlapping
Critical point
critical point
Social Networks
Team Work
Community Structure
Optimal Parameter
Quantitative Analysis
Overlap
Partitioning
Circle
quantitative analysis
Community
Heuristics

Keywords

  • Clique percolation
  • Community finding
  • Critical point
  • Modularity

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Mathematical Physics

Cite this

Overlapping Modularity at the Critical Point of k-Clique Percolation. / Tóth, Bálint; Vicsek, T.; Palla, Gergely.

In: Journal of Statistical Physics, Vol. 151, No. 3-4, 2013, p. 689-706.

Research output: Contribution to journalArticle

Tóth, Bálint ; Vicsek, T. ; Palla, Gergely. / Overlapping Modularity at the Critical Point of k-Clique Percolation. In: Journal of Statistical Physics. 2013 ; Vol. 151, No. 3-4. pp. 689-706.
@article{b2bca3222d56401f921b9e343ca8ef05,
title = "Overlapping Modularity at the Critical Point of k-Clique Percolation",
abstract = "One of the most remarkable social phenomena is the formation of communities in social networks corresponding to families, friendship circles, work teams, etc. Since people usually belong to several different communities at the same time, the induced overlaps result in an extremely complicated web of the communities themselves. Thus, uncovering the intricate community structure of social networks is a non-trivial task with great potential for practical applications, gaining a notable interest in the recent years. The Clique Percolation Method (CPM) is one of the earliest overlapping community finding methods, which was already used in the analysis of several different social networks. In this approach the communities correspond to k-clique percolation clusters, and the general heuristic for setting the parameters of the method is to tune the system just below the critical point of k-clique percolation. However, this rule is based on simple physical principles and its validity was never subject to quantitative analysis. Here we examine the quality of the partitioning in the vicinity of the critical point using recently introduced overlapping modularity measures. According to our results on real social and other networks, the overlapping modularities show a maximum close to the critical point, justifying the original criteria for the optimal parameter settings.",
keywords = "Clique percolation, Community finding, Critical point, Modularity",
author = "B{\'a}lint T{\'o}th and T. Vicsek and Gergely Palla",
year = "2013",
doi = "10.1007/s10955-012-0640-5",
language = "English",
volume = "151",
pages = "689--706",
journal = "Journal of Statistical Physics",
issn = "0022-4715",
publisher = "Springer New York",
number = "3-4",

}

TY - JOUR

T1 - Overlapping Modularity at the Critical Point of k-Clique Percolation

AU - Tóth, Bálint

AU - Vicsek, T.

AU - Palla, Gergely

PY - 2013

Y1 - 2013

N2 - One of the most remarkable social phenomena is the formation of communities in social networks corresponding to families, friendship circles, work teams, etc. Since people usually belong to several different communities at the same time, the induced overlaps result in an extremely complicated web of the communities themselves. Thus, uncovering the intricate community structure of social networks is a non-trivial task with great potential for practical applications, gaining a notable interest in the recent years. The Clique Percolation Method (CPM) is one of the earliest overlapping community finding methods, which was already used in the analysis of several different social networks. In this approach the communities correspond to k-clique percolation clusters, and the general heuristic for setting the parameters of the method is to tune the system just below the critical point of k-clique percolation. However, this rule is based on simple physical principles and its validity was never subject to quantitative analysis. Here we examine the quality of the partitioning in the vicinity of the critical point using recently introduced overlapping modularity measures. According to our results on real social and other networks, the overlapping modularities show a maximum close to the critical point, justifying the original criteria for the optimal parameter settings.

AB - One of the most remarkable social phenomena is the formation of communities in social networks corresponding to families, friendship circles, work teams, etc. Since people usually belong to several different communities at the same time, the induced overlaps result in an extremely complicated web of the communities themselves. Thus, uncovering the intricate community structure of social networks is a non-trivial task with great potential for practical applications, gaining a notable interest in the recent years. The Clique Percolation Method (CPM) is one of the earliest overlapping community finding methods, which was already used in the analysis of several different social networks. In this approach the communities correspond to k-clique percolation clusters, and the general heuristic for setting the parameters of the method is to tune the system just below the critical point of k-clique percolation. However, this rule is based on simple physical principles and its validity was never subject to quantitative analysis. Here we examine the quality of the partitioning in the vicinity of the critical point using recently introduced overlapping modularity measures. According to our results on real social and other networks, the overlapping modularities show a maximum close to the critical point, justifying the original criteria for the optimal parameter settings.

KW - Clique percolation

KW - Community finding

KW - Critical point

KW - Modularity

UR - http://www.scopus.com/inward/record.url?scp=84875633776&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875633776&partnerID=8YFLogxK

U2 - 10.1007/s10955-012-0640-5

DO - 10.1007/s10955-012-0640-5

M3 - Article

AN - SCOPUS:84875633776

VL - 151

SP - 689

EP - 706

JO - Journal of Statistical Physics

JF - Journal of Statistical Physics

SN - 0022-4715

IS - 3-4

ER -