Advanced search
Start date
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Generalized connectivity between any two nodes in a complex network

Full text
Rodrigues, Francisco Aparecido [1] ; Costa, Luciano da Fontoura [2, 3]
Total Authors: 2
[1] Univ Sao Paulo, Dept Matemat Aplicada & Estatist, Inst Ciencias Matemat & Computacao, BR-13560970 Sao Carlos, SP - Brazil
[2] Univ Sao Paulo, Inst Fis Sao Carlos, BR-13560970 Sao Carlos, SP - Brazil
[3] Natl Inst Sci & Technol Complex Syst, Rio De Janeiro - Brazil
Total Affiliations: 3
Document type: Journal article
Source: Physical Review E; v. 81, n. 3, 2 MAR 2010.
Web of Science Citations: 6

This article focuses on the identification of the number of paths with different lengths between pairs of nodes in complex networks and how these paths can be used for characterization of topological properties of theoretical and real-world complex networks. This analysis revealed that the number of paths can provide a better discrimination of network models than traditional network measurements. In addition, the analysis of real-world networks suggests that the long-range connectivity tends to be limited in these networks and may be strongly related to network growth and organization. (AU)

FAPESP's process: 05/00587-5 - Mesh (graph) modeling and techniques of pattern recognition: structure, dynamics and applications
Grantee:Roberto Marcondes Cesar Junior
Support type: Research Projects - Thematic Grants