title: Generalized connectivity between any two nodes in a complex network.
abstract: 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.
authors.affiliation: Departamento de Matemática Aplicada e Estatística, Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo-Campus de São Carlos, Caixa Postal 668, 13560-970, São Carlos, SP, Brazil. francisco@icmc.usp.br
authors.forename: Francisco Aparecido
authors.initials: FA
authors.lastname: Rodrigues
authors.forename: Luciano
authors.initials: L
authors.lastname: da Fontoura Costa
mesh_terms: D000465:Algorithms; D000818:Animals; D017173:Caenorhabditis elegans; D002415:Cats; D002540:Cerebral Cortex / Q000502:physiology; D005060:Europe; D006801:Humans; D016139:Martial Arts; D008962:Models, Theoretical; D018986:Motor Vehicles; D009434:Neural Pathways / Q000502:physiology; D009520:New Zealand; D025341:Principal Component Analysis; D011890:Railroads; D014197:Trees