Monte Carlo Algorithms for Identifying Densely Connected Subgraphs

Jingfei Zhang, Yuguo Chen

Research output: Contribution to journalArticle

Abstract

The problem of finding densely connected subgraphs in a network has attracted a lot of recent interest. Such subgraphs are sometimes referred to as communities in social networks or molecular modules in protein networks. In this article, we propose two Monte Carlo optimization algorithms for identifying the densest subgraphs with a fixed size or with size in a given range. The new algorithms combine the idea of simulated annealing and efficient moves for the Markov chain, and both algorithms are shown to converge to the set of optimal states (densest subgraphs) with probability 1. When applied to a yeast protein interaction network and a stock market graph, the algorithms identify interesting new densely connected subgraphs. Supplementary materials for the article are available online.

Original languageEnglish (US)
Pages (from-to)827-845
Number of pages19
JournalJournal of Computational and Graphical Statistics
Volume24
Issue number3
DOIs
StatePublished - Jan 1 2015

Fingerprint

Monte Carlo Algorithm
Subgraph
Monte Carlo Optimization
Protein Interaction Networks
Stock Market
Simulated Annealing
Yeast
Social Networks
Markov chain
Optimization Algorithm
Protein
Converge
Module
Graph in graph theory
Range of data

Keywords

  • Densest subgraph discovery
  • Global optimization
  • Network
  • Quasi-clique
  • Simulated annealing

ASJC Scopus subject areas

  • Statistics and Probability
  • Discrete Mathematics and Combinatorics
  • Statistics, Probability and Uncertainty

Cite this

Monte Carlo Algorithms for Identifying Densely Connected Subgraphs. / Zhang, Jingfei; Chen, Yuguo.

In: Journal of Computational and Graphical Statistics, Vol. 24, No. 3, 01.01.2015, p. 827-845.

Research output: Contribution to journalArticle

@article{334043dd0e324be8a4fb56eb0a192af0,
title = "Monte Carlo Algorithms for Identifying Densely Connected Subgraphs",
abstract = "The problem of finding densely connected subgraphs in a network has attracted a lot of recent interest. Such subgraphs are sometimes referred to as communities in social networks or molecular modules in protein networks. In this article, we propose two Monte Carlo optimization algorithms for identifying the densest subgraphs with a fixed size or with size in a given range. The new algorithms combine the idea of simulated annealing and efficient moves for the Markov chain, and both algorithms are shown to converge to the set of optimal states (densest subgraphs) with probability 1. When applied to a yeast protein interaction network and a stock market graph, the algorithms identify interesting new densely connected subgraphs. Supplementary materials for the article are available online.",
keywords = "Densest subgraph discovery, Global optimization, Network, Quasi-clique, Simulated annealing",
author = "Jingfei Zhang and Yuguo Chen",
year = "2015",
month = "1",
day = "1",
doi = "10.1080/10618600.2014.930040",
language = "English (US)",
volume = "24",
pages = "827--845",
journal = "Journal of Computational and Graphical Statistics",
issn = "1061-8600",
publisher = "American Statistical Association",
number = "3",

}

TY - JOUR

T1 - Monte Carlo Algorithms for Identifying Densely Connected Subgraphs

AU - Zhang, Jingfei

AU - Chen, Yuguo

PY - 2015/1/1

Y1 - 2015/1/1

N2 - The problem of finding densely connected subgraphs in a network has attracted a lot of recent interest. Such subgraphs are sometimes referred to as communities in social networks or molecular modules in protein networks. In this article, we propose two Monte Carlo optimization algorithms for identifying the densest subgraphs with a fixed size or with size in a given range. The new algorithms combine the idea of simulated annealing and efficient moves for the Markov chain, and both algorithms are shown to converge to the set of optimal states (densest subgraphs) with probability 1. When applied to a yeast protein interaction network and a stock market graph, the algorithms identify interesting new densely connected subgraphs. Supplementary materials for the article are available online.

AB - The problem of finding densely connected subgraphs in a network has attracted a lot of recent interest. Such subgraphs are sometimes referred to as communities in social networks or molecular modules in protein networks. In this article, we propose two Monte Carlo optimization algorithms for identifying the densest subgraphs with a fixed size or with size in a given range. The new algorithms combine the idea of simulated annealing and efficient moves for the Markov chain, and both algorithms are shown to converge to the set of optimal states (densest subgraphs) with probability 1. When applied to a yeast protein interaction network and a stock market graph, the algorithms identify interesting new densely connected subgraphs. Supplementary materials for the article are available online.

KW - Densest subgraph discovery

KW - Global optimization

KW - Network

KW - Quasi-clique

KW - Simulated annealing

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

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

U2 - 10.1080/10618600.2014.930040

DO - 10.1080/10618600.2014.930040

M3 - Article

AN - SCOPUS:84941788979

VL - 24

SP - 827

EP - 845

JO - Journal of Computational and Graphical Statistics

JF - Journal of Computational and Graphical Statistics

SN - 1061-8600

IS - 3

ER -