Estrada, Ernesto (2010) Structural patterns in complex networks through spectral analysis. In: Structural, Syntactic, and Statistical Pattern Recognition. Lecture Notes in Computer Science, 6218 . Springer, pp. 4359. ISBN 9783642149795

PDF
LNCS_Estrada.pdf  Submitted Version Download (842kB)  Preview 
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 nonhomogeneous network into three universal classes of structure. We give examples of these classes from networks in different realworld 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 realworld network.
Item type:  Book Section 

ID code:  29069 
Keywords:  subgraph centrality , Estrada index , network communities , communicability , Mathematics 
Subjects:  Science > Mathematics 
Department:  Faculty of Science > Mathematics and Statistics 
Depositing user:  Pure Administrator 
Date Deposited:  07 Mar 2011 23:24 
Last modified:  27 Mar 2015 00:52 
URI:  http://strathprints.strath.ac.uk/id/eprint/29069 
Actions (login required)
View Item 