Constant communities in complex networks

Tanmoy Chakraborty, Sriram Srinivasan, Niloy Ganguly, Sanjukta Bhowmick, Animesh Mukherjee

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to the community. However, there has been less study on how vertex ordering influences the results of the community detection algorithms. Here we identify and study the properties of invariant groups of vertices (constant communities) whose assignment to communities are, quite remarkably, not affected by vertex ordering. The percentage of constant communities can vary across different applications and based on empirical results we propose metrics to evaluate these communities. Using constant communities as a pre-processing step, one can significantly reduce the variation of the results. Finally, we present a case study on phoneme network and illustrate that constant communities, quite strikingly, form the core functional units of the larger communities.

Original languageEnglish (US)
Article number1825
JournalScientific Reports
Volume3
DOIs
StatePublished - May 20 2013

ASJC Scopus subject areas

  • General

Cite this

Chakraborty, T., Srinivasan, S., Ganguly, N., Bhowmick, S., & Mukherjee, A. (2013). Constant communities in complex networks. Scientific Reports, 3, [1825]. https://doi.org/10.1038/srep01825

Constant communities in complex networks. / Chakraborty, Tanmoy; Srinivasan, Sriram; Ganguly, Niloy; Bhowmick, Sanjukta; Mukherjee, Animesh.

In: Scientific Reports, Vol. 3, 1825, 20.05.2013.

Research output: Contribution to journalArticle

Chakraborty, T, Srinivasan, S, Ganguly, N, Bhowmick, S & Mukherjee, A 2013, 'Constant communities in complex networks', Scientific Reports, vol. 3, 1825. https://doi.org/10.1038/srep01825
Chakraborty T, Srinivasan S, Ganguly N, Bhowmick S, Mukherjee A. Constant communities in complex networks. Scientific Reports. 2013 May 20;3. 1825. https://doi.org/10.1038/srep01825
Chakraborty, Tanmoy ; Srinivasan, Sriram ; Ganguly, Niloy ; Bhowmick, Sanjukta ; Mukherjee, Animesh. / Constant communities in complex networks. In: Scientific Reports. 2013 ; Vol. 3.
@article{33ce211240a647229f30e922024167ac,
title = "Constant communities in complex networks",
abstract = "Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to the community. However, there has been less study on how vertex ordering influences the results of the community detection algorithms. Here we identify and study the properties of invariant groups of vertices (constant communities) whose assignment to communities are, quite remarkably, not affected by vertex ordering. The percentage of constant communities can vary across different applications and based on empirical results we propose metrics to evaluate these communities. Using constant communities as a pre-processing step, one can significantly reduce the variation of the results. Finally, we present a case study on phoneme network and illustrate that constant communities, quite strikingly, form the core functional units of the larger communities.",
author = "Tanmoy Chakraborty and Sriram Srinivasan and Niloy Ganguly and Sanjukta Bhowmick and Animesh Mukherjee",
year = "2013",
month = "5",
day = "20",
doi = "10.1038/srep01825",
language = "English (US)",
volume = "3",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",

}

TY - JOUR

T1 - Constant communities in complex networks

AU - Chakraborty, Tanmoy

AU - Srinivasan, Sriram

AU - Ganguly, Niloy

AU - Bhowmick, Sanjukta

AU - Mukherjee, Animesh

PY - 2013/5/20

Y1 - 2013/5/20

N2 - Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to the community. However, there has been less study on how vertex ordering influences the results of the community detection algorithms. Here we identify and study the properties of invariant groups of vertices (constant communities) whose assignment to communities are, quite remarkably, not affected by vertex ordering. The percentage of constant communities can vary across different applications and based on empirical results we propose metrics to evaluate these communities. Using constant communities as a pre-processing step, one can significantly reduce the variation of the results. Finally, we present a case study on phoneme network and illustrate that constant communities, quite strikingly, form the core functional units of the larger communities.

AB - Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to the community. However, there has been less study on how vertex ordering influences the results of the community detection algorithms. Here we identify and study the properties of invariant groups of vertices (constant communities) whose assignment to communities are, quite remarkably, not affected by vertex ordering. The percentage of constant communities can vary across different applications and based on empirical results we propose metrics to evaluate these communities. Using constant communities as a pre-processing step, one can significantly reduce the variation of the results. Finally, we present a case study on phoneme network and illustrate that constant communities, quite strikingly, form the core functional units of the larger communities.

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

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

U2 - 10.1038/srep01825

DO - 10.1038/srep01825

M3 - Article

VL - 3

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

M1 - 1825

ER -