Structural patterns in complex networks through spectral analysis

Ernesto Estrada

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

2 Citations (Scopus)

Abstract

The study of some structural properties of networks is introduced from a graph spectral perspective. First, subgraph centrality of nodes is defined and used to classify essential proteins in a proteomic map. This index is then used to produce a method that allows the identification of superhomogeneous networks. At the same time this method classify non-homogeneous network into three universal classes of structure. We give examples of these classes from networks in different real-world scenarios. Finally, a communicability function is studied and showed as an alternative for defining communities in complex networks. Using this approach a community is unambiguously defined and an algorithm for its identification is proposed and exemplified in a real-world network.
LanguageEnglish
Title of host publicationStructural, Syntactic, and Statistical Pattern Recognition
PublisherSpringer
Pages43-59
Number of pages17
Volume6218
ISBN (Print)978-3-642-14979-5
DOIs
Publication statusPublished - 28 Aug 2010

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume6218

Fingerprint

Complex networks
Spectrum analysis
Structural properties
Proteins
Proteomics

Keywords

  • subgraph centrality
  • Estrada index
  • network communities
  • communicability

Cite this

Estrada, E. (2010). Structural patterns in complex networks through spectral analysis. In Structural, Syntactic, and Statistical Pattern Recognition (Vol. 6218, pp. 43-59). (Lecture Notes in Computer Science; Vol. 6218). Springer. https://doi.org/10.1007/978-3-642-14980-1_4
Estrada, Ernesto. / Structural patterns in complex networks through spectral analysis. Structural, Syntactic, and Statistical Pattern Recognition. Vol. 6218 Springer, 2010. pp. 43-59 (Lecture Notes in Computer Science).
@inproceedings{239cc2744f7747d09fa9cd79c5cd914b,
title = "Structural patterns in complex networks through spectral analysis",
abstract = "The study of some structural properties of networks is introduced from a graph spectral perspective. First, subgraph centrality of nodes is defined and used to classify essential proteins in a proteomic map. This index is then used to produce a method that allows the identification of superhomogeneous networks. At the same time this method classify non-homogeneous network into three universal classes of structure. We give examples of these classes from networks in different real-world scenarios. Finally, a communicability function is studied and showed as an alternative for defining communities in complex networks. Using this approach a community is unambiguously defined and an algorithm for its identification is proposed and exemplified in a real-world network.",
keywords = "subgraph centrality , Estrada index , network communities , communicability",
author = "Ernesto Estrada",
year = "2010",
month = "8",
day = "28",
doi = "10.1007/978-3-642-14980-1_4",
language = "English",
isbn = "978-3-642-14979-5",
volume = "6218",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "43--59",
booktitle = "Structural, Syntactic, and Statistical Pattern Recognition",

}

Estrada, E 2010, Structural patterns in complex networks through spectral analysis. in Structural, Syntactic, and Statistical Pattern Recognition. vol. 6218, Lecture Notes in Computer Science, vol. 6218, Springer, pp. 43-59. https://doi.org/10.1007/978-3-642-14980-1_4

Structural patterns in complex networks through spectral analysis. / Estrada, Ernesto.

Structural, Syntactic, and Statistical Pattern Recognition. Vol. 6218 Springer, 2010. p. 43-59 (Lecture Notes in Computer Science; Vol. 6218).

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

TY - GEN

T1 - Structural patterns in complex networks through spectral analysis

AU - Estrada, Ernesto

PY - 2010/8/28

Y1 - 2010/8/28

N2 - The study of some structural properties of networks is introduced from a graph spectral perspective. First, subgraph centrality of nodes is defined and used to classify essential proteins in a proteomic map. This index is then used to produce a method that allows the identification of superhomogeneous networks. At the same time this method classify non-homogeneous network into three universal classes of structure. We give examples of these classes from networks in different real-world scenarios. Finally, a communicability function is studied and showed as an alternative for defining communities in complex networks. Using this approach a community is unambiguously defined and an algorithm for its identification is proposed and exemplified in a real-world network.

AB - The study of some structural properties of networks is introduced from a graph spectral perspective. First, subgraph centrality of nodes is defined and used to classify essential proteins in a proteomic map. This index is then used to produce a method that allows the identification of superhomogeneous networks. At the same time this method classify non-homogeneous network into three universal classes of structure. We give examples of these classes from networks in different real-world scenarios. Finally, a communicability function is studied and showed as an alternative for defining communities in complex networks. Using this approach a community is unambiguously defined and an algorithm for its identification is proposed and exemplified in a real-world network.

KW - subgraph centrality

KW - Estrada index

KW - network communities

KW - communicability

U2 - 10.1007/978-3-642-14980-1_4

DO - 10.1007/978-3-642-14980-1_4

M3 - Conference contribution book

SN - 978-3-642-14979-5

VL - 6218

T3 - Lecture Notes in Computer Science

SP - 43

EP - 59

BT - Structural, Syntactic, and Statistical Pattern Recognition

PB - Springer

ER -

Estrada E. Structural patterns in complex networks through spectral analysis. In Structural, Syntactic, and Statistical Pattern Recognition. Vol. 6218. Springer. 2010. p. 43-59. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-14980-1_4