Volume 85, Number 4, February 2009
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||04 March 2009|
Seeking for simplicity in complex networks
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
Corresponding author: firstname.lastname@example.org
Accepted: 6 February 2009
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.