Fast community detection for dynamic complex networks

Shweta Bansal, Sanjukta Bhowmick, Prashant Paymal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Citations (Scopus)

Abstract

Dynamic complex networks are used to model the evolving relationships between entities in widely varying fields of research such as epidemiology, ecology, sociology, and economics. In the study of complex networks, a network is said to have community structure if it divides naturally into groups of vertices with dense connections within groups and sparser connections between groups. Detecting the evolution of communities within dynamically changing networks is crucial to understanding complex systems. In this paper, we develop a fast community detection algorithm for real-time dynamic network data. Our method takes advantage of community information from previous time steps and thereby improves efficiency while maintaining the quality of community detection. Our experiments on citation-based networks show that the execution time improves as much as 30% (average 13%) over static methods.

Original languageEnglish (US)
Title of host publicationComplex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers
Pages196-207
Number of pages12
DOIs
StatePublished - Nov 25 2011
Event2nd International Workshop on Complex Networks, CompleNet 2010 - Rio de Janeiro, Brazil
Duration: Oct 13 2010Oct 15 2010

Publication series

NameCommunications in Computer and Information Science
Volume116 CCIS
ISSN (Print)1865-0929

Conference

Conference2nd International Workshop on Complex Networks, CompleNet 2010
CountryBrazil
CityRio de Janeiro
Period10/13/1010/15/10

Fingerprint

Complex networks
Epidemiology
Ecology
Large scale systems
Economics
Experiments

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Bansal, S., Bhowmick, S., & Paymal, P. (2011). Fast community detection for dynamic complex networks. In Complex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers (pp. 196-207). (Communications in Computer and Information Science; Vol. 116 CCIS). https://doi.org/10.1007/978-3-642-25501-4_20

Fast community detection for dynamic complex networks. / Bansal, Shweta; Bhowmick, Sanjukta; Paymal, Prashant.

Complex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers. 2011. p. 196-207 (Communications in Computer and Information Science; Vol. 116 CCIS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bansal, S, Bhowmick, S & Paymal, P 2011, Fast community detection for dynamic complex networks. in Complex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers. Communications in Computer and Information Science, vol. 116 CCIS, pp. 196-207, 2nd International Workshop on Complex Networks, CompleNet 2010, Rio de Janeiro, Brazil, 10/13/10. https://doi.org/10.1007/978-3-642-25501-4_20
Bansal S, Bhowmick S, Paymal P. Fast community detection for dynamic complex networks. In Complex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers. 2011. p. 196-207. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-25501-4_20
Bansal, Shweta ; Bhowmick, Sanjukta ; Paymal, Prashant. / Fast community detection for dynamic complex networks. Complex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers. 2011. pp. 196-207 (Communications in Computer and Information Science).
@inproceedings{e6f205a772fc42ca98202fb527380c31,
title = "Fast community detection for dynamic complex networks",
abstract = "Dynamic complex networks are used to model the evolving relationships between entities in widely varying fields of research such as epidemiology, ecology, sociology, and economics. In the study of complex networks, a network is said to have community structure if it divides naturally into groups of vertices with dense connections within groups and sparser connections between groups. Detecting the evolution of communities within dynamically changing networks is crucial to understanding complex systems. In this paper, we develop a fast community detection algorithm for real-time dynamic network data. Our method takes advantage of community information from previous time steps and thereby improves efficiency while maintaining the quality of community detection. Our experiments on citation-based networks show that the execution time improves as much as 30{\%} (average 13{\%}) over static methods.",
author = "Shweta Bansal and Sanjukta Bhowmick and Prashant Paymal",
year = "2011",
month = "11",
day = "25",
doi = "10.1007/978-3-642-25501-4_20",
language = "English (US)",
isbn = "9783642255007",
series = "Communications in Computer and Information Science",
pages = "196--207",
booktitle = "Complex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers",

}

TY - GEN

T1 - Fast community detection for dynamic complex networks

AU - Bansal, Shweta

AU - Bhowmick, Sanjukta

AU - Paymal, Prashant

PY - 2011/11/25

Y1 - 2011/11/25

N2 - Dynamic complex networks are used to model the evolving relationships between entities in widely varying fields of research such as epidemiology, ecology, sociology, and economics. In the study of complex networks, a network is said to have community structure if it divides naturally into groups of vertices with dense connections within groups and sparser connections between groups. Detecting the evolution of communities within dynamically changing networks is crucial to understanding complex systems. In this paper, we develop a fast community detection algorithm for real-time dynamic network data. Our method takes advantage of community information from previous time steps and thereby improves efficiency while maintaining the quality of community detection. Our experiments on citation-based networks show that the execution time improves as much as 30% (average 13%) over static methods.

AB - Dynamic complex networks are used to model the evolving relationships between entities in widely varying fields of research such as epidemiology, ecology, sociology, and economics. In the study of complex networks, a network is said to have community structure if it divides naturally into groups of vertices with dense connections within groups and sparser connections between groups. Detecting the evolution of communities within dynamically changing networks is crucial to understanding complex systems. In this paper, we develop a fast community detection algorithm for real-time dynamic network data. Our method takes advantage of community information from previous time steps and thereby improves efficiency while maintaining the quality of community detection. Our experiments on citation-based networks show that the execution time improves as much as 30% (average 13%) over static methods.

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

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

U2 - 10.1007/978-3-642-25501-4_20

DO - 10.1007/978-3-642-25501-4_20

M3 - Conference contribution

AN - SCOPUS:81755188411

SN - 9783642255007

T3 - Communications in Computer and Information Science

SP - 196

EP - 207

BT - Complex Networks - Second International Workshop, CompleNet 2010, Revised Selected Papers

ER -