A survey on theoretical advances of community detection in networks

Research output: Contribution to journalReview article

2 Citations (Scopus)

Abstract

Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sciences, among others. Numerous approaches for community detection have been proposed in literature, from ad hoc algorithms to systematic model-based approaches. The large number of available methods leads to a fundamental question: whether a certain method can provide consistent estimates of community labels. The stochastic blockmodel (SBM) and its variants provide a convenient framework for the study of such problems. This article is a survey on the recent theoretical advances of community detection. The authors review a number of community detection methods and their theoretical properties, including graph cut methods, profile likelihoods, the pseudo-likelihood method, the variational method, belief propagation, spectral clustering, and semidefinite relaxations of the SBM. The authors also briefly discuss other research topics in community detection such as robust community detection, community detection with nodal covariates and model selection, as well as suggest a few possible directions for future research. WIREs Comput Stat 2017, 9:e1403. doi: 10.1002/wics.1403. For further resources related to this article, please visit the WIREs website.

Original languageEnglish (US)
Article numbere1403
JournalWiley Interdisciplinary Reviews: Computational Statistics
Volume9
Issue number5
DOIs
StatePublished - Sep 1 2017
Externally publishedYes

Fingerprint

Community Detection
Semidefinite Relaxation
Pseudo-likelihood
Profile Likelihood
Spectral Clustering
Consistent Estimates
Graph Cuts
Belief Propagation
Community Structure
Likelihood Methods
Social Sciences
Variational Methods
Model Selection
Covariates
Computer Science
Model-based
Statistics
Resources
Vertex of a graph

Keywords

  • community detection
  • consistency
  • stochastic blockmodels

ASJC Scopus subject areas

  • Statistics and Probability

Cite this

A survey on theoretical advances of community detection in networks. / Zhao, Yunpeng.

In: Wiley Interdisciplinary Reviews: Computational Statistics, Vol. 9, No. 5, e1403, 01.09.2017.

Research output: Contribution to journalReview article

@article{7346ee9792444dfaad5c45416d58ecf6,
title = "A survey on theoretical advances of community detection in networks",
abstract = "Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sciences, among others. Numerous approaches for community detection have been proposed in literature, from ad hoc algorithms to systematic model-based approaches. The large number of available methods leads to a fundamental question: whether a certain method can provide consistent estimates of community labels. The stochastic blockmodel (SBM) and its variants provide a convenient framework for the study of such problems. This article is a survey on the recent theoretical advances of community detection. The authors review a number of community detection methods and their theoretical properties, including graph cut methods, profile likelihoods, the pseudo-likelihood method, the variational method, belief propagation, spectral clustering, and semidefinite relaxations of the SBM. The authors also briefly discuss other research topics in community detection such as robust community detection, community detection with nodal covariates and model selection, as well as suggest a few possible directions for future research. WIREs Comput Stat 2017, 9:e1403. doi: 10.1002/wics.1403. For further resources related to this article, please visit the WIREs website.",
keywords = "community detection, consistency, stochastic blockmodels",
author = "Yunpeng Zhao",
year = "2017",
month = "9",
day = "1",
doi = "10.1002/wics.1403",
language = "English (US)",
volume = "9",
journal = "Wiley Interdisciplinary Reviews: Computational Statistics",
issn = "1939-5108",
publisher = "John Wiley and Sons Inc.",
number = "5",

}

TY - JOUR

T1 - A survey on theoretical advances of community detection in networks

AU - Zhao, Yunpeng

PY - 2017/9/1

Y1 - 2017/9/1

N2 - Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sciences, among others. Numerous approaches for community detection have been proposed in literature, from ad hoc algorithms to systematic model-based approaches. The large number of available methods leads to a fundamental question: whether a certain method can provide consistent estimates of community labels. The stochastic blockmodel (SBM) and its variants provide a convenient framework for the study of such problems. This article is a survey on the recent theoretical advances of community detection. The authors review a number of community detection methods and their theoretical properties, including graph cut methods, profile likelihoods, the pseudo-likelihood method, the variational method, belief propagation, spectral clustering, and semidefinite relaxations of the SBM. The authors also briefly discuss other research topics in community detection such as robust community detection, community detection with nodal covariates and model selection, as well as suggest a few possible directions for future research. WIREs Comput Stat 2017, 9:e1403. doi: 10.1002/wics.1403. For further resources related to this article, please visit the WIREs website.

AB - Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sciences, among others. Numerous approaches for community detection have been proposed in literature, from ad hoc algorithms to systematic model-based approaches. The large number of available methods leads to a fundamental question: whether a certain method can provide consistent estimates of community labels. The stochastic blockmodel (SBM) and its variants provide a convenient framework for the study of such problems. This article is a survey on the recent theoretical advances of community detection. The authors review a number of community detection methods and their theoretical properties, including graph cut methods, profile likelihoods, the pseudo-likelihood method, the variational method, belief propagation, spectral clustering, and semidefinite relaxations of the SBM. The authors also briefly discuss other research topics in community detection such as robust community detection, community detection with nodal covariates and model selection, as well as suggest a few possible directions for future research. WIREs Comput Stat 2017, 9:e1403. doi: 10.1002/wics.1403. For further resources related to this article, please visit the WIREs website.

KW - community detection

KW - consistency

KW - stochastic blockmodels

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

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

U2 - 10.1002/wics.1403

DO - 10.1002/wics.1403

M3 - Review article

AN - SCOPUS:85027731695

VL - 9

JO - Wiley Interdisciplinary Reviews: Computational Statistics

JF - Wiley Interdisciplinary Reviews: Computational Statistics

SN - 1939-5108

IS - 5

M1 - e1403

ER -