Issue
EPL
Volume 85, Number 4, February 2009
Article Number 48001
Number of page(s) 6
Section Interdisciplinary Physics and Related Areas of Science and Technology
DOI http://dx.doi.org/10.1209/0295-5075/85/48001
Published online 04 March 2009
EPL, 85 (2009) 48001
DOI: 10.1209/0295-5075/85/48001

Seeking for simplicity in complex networks

L. da F. Costa and F. A. Rodrigues

Instituto de Física de São Carlos, Universidade de São Paulo - Av. Trabalhador São Carlense 400, Caixa Postal 369, CEP 13560-970, São Carlos, São Paulo, Brazil

luciano@if.sc.usp.br

received 5 November 2008; accepted in final form 6 February 2009; published February 2009
published online 4 March 2009

Abstract
Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being “simple”. While a great deal of the attention so far dedicated to complex networks has been duly driven by the “complex” nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time.

PACS
89.75.Fb - Structures and organization in complex systems.
89.75.-k - Complex systems.
02.10.Ox - Combinatorics; graph theory.

© EPLA 2009