@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 = aug,

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",

}