A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks

Sarah Michele Rajtmajer, Damir Vukičević

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Recently Estrada and Hatano proposed an algorithm for the detection of community structure in complex networks using the concept of network communicability. Here we amend this algorithm by eliminating the subjectivity of choosing degree of overlapping and including an additional check of the fitness of detected communities. We show that this amendment can detect some communities which remain undetected by Estrada and Hatano's algorithm. For instance, let G(p, q) be a graph obtained from two cliques, Kp and Kq(p ≥ q ≥ 3), joined by a single edge. It is apparent that this graph contains two communities, namely the two cliques. However, Estrada and Hatano's algorithm detects only Kq as a community when p is sufficiently larger than q. Our algorithm correctly detects both communities. Also, our method also finds the correct community structure in one of the classic benchmark networks, the Zachary karate club.

Original languageEnglish (US)
Pages (from-to)3516-3521
Number of pages6
JournalApplied Mathematics and Computation
Volume217
Issue number7
DOIs
StatePublished - Dec 1 2010

Fingerprint

Community Structure
Complex networks
Complex Networks
Clique
Graph in graph theory
Fitness
Overlapping
Community
Benchmark

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics

Cite this

@article{a2085956cc1f4a8a87d2e8ed3cc9aee9,
title = "A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks",
abstract = "Recently Estrada and Hatano proposed an algorithm for the detection of community structure in complex networks using the concept of network communicability. Here we amend this algorithm by eliminating the subjectivity of choosing degree of overlapping and including an additional check of the fitness of detected communities. We show that this amendment can detect some communities which remain undetected by Estrada and Hatano's algorithm. For instance, let G(p, q) be a graph obtained from two cliques, Kp and Kq(p ≥ q ≥ 3), joined by a single edge. It is apparent that this graph contains two communities, namely the two cliques. However, Estrada and Hatano's algorithm detects only Kq as a community when p is sufficiently larger than q. Our algorithm correctly detects both communities. Also, our method also finds the correct community structure in one of the classic benchmark networks, the Zachary karate club.",
author = "{Michele Rajtmajer}, Sarah and Damir Vukičević",
year = "2010",
month = "12",
day = "1",
doi = "10.1016/j.amc.2010.09.026",
language = "English (US)",
volume = "217",
pages = "3516--3521",
journal = "Applied Mathematics and Computation",
issn = "0096-3003",
publisher = "Elsevier Inc.",
number = "7",

}

A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks. / Michele Rajtmajer, Sarah; Vukičević, Damir.

In: Applied Mathematics and Computation, Vol. 217, No. 7, 01.12.2010, p. 3516-3521.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks

AU - Michele Rajtmajer, Sarah

AU - Vukičević, Damir

PY - 2010/12/1

Y1 - 2010/12/1

N2 - Recently Estrada and Hatano proposed an algorithm for the detection of community structure in complex networks using the concept of network communicability. Here we amend this algorithm by eliminating the subjectivity of choosing degree of overlapping and including an additional check of the fitness of detected communities. We show that this amendment can detect some communities which remain undetected by Estrada and Hatano's algorithm. For instance, let G(p, q) be a graph obtained from two cliques, Kp and Kq(p ≥ q ≥ 3), joined by a single edge. It is apparent that this graph contains two communities, namely the two cliques. However, Estrada and Hatano's algorithm detects only Kq as a community when p is sufficiently larger than q. Our algorithm correctly detects both communities. Also, our method also finds the correct community structure in one of the classic benchmark networks, the Zachary karate club.

AB - Recently Estrada and Hatano proposed an algorithm for the detection of community structure in complex networks using the concept of network communicability. Here we amend this algorithm by eliminating the subjectivity of choosing degree of overlapping and including an additional check of the fitness of detected communities. We show that this amendment can detect some communities which remain undetected by Estrada and Hatano's algorithm. For instance, let G(p, q) be a graph obtained from two cliques, Kp and Kq(p ≥ q ≥ 3), joined by a single edge. It is apparent that this graph contains two communities, namely the two cliques. However, Estrada and Hatano's algorithm detects only Kq as a community when p is sufficiently larger than q. Our algorithm correctly detects both communities. Also, our method also finds the correct community structure in one of the classic benchmark networks, the Zachary karate club.

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

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

U2 - 10.1016/j.amc.2010.09.026

DO - 10.1016/j.amc.2010.09.026

M3 - Article

AN - SCOPUS:78049272791

VL - 217

SP - 3516

EP - 3521

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

IS - 7

ER -