Spectral Scaling in Complex Networks

Abstract

A complex network is said to show topological isotropy if the topological structure around a particular node looks the same in all directions of the whole network. Topologically anisotropic networks are those where the local neighborhood around a node is not reproduced at large scale for the whole network. The existence of topological isotropy is investigated by the existence of a power-law scaling between a local and a global topological characteristic of complex networks obtained from graph spectra. We investigate this structural characteristic of complex networks and its consequences for 32 real-world networks representing informational, technological, biological, social and ecological systems.

9 pages, 3 figures

References in corpus (4)

• Self-similarity of complex networks
• Subgraph Centrality in Complex Networks
• Subnetwork hierarchies of biochemical pathways
• Spectral Measures of Bipartivity in Complex Networks

Cited by in corpus (29)

• Structural Properties of the Caenorhabditis elegans Neuronal Network
• Communicability in complex networks
• Structure and dynamics of core-periphery networks
• The Physics of Communicability in Complex Networks
• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Consistency and differences between centrality measures across distinct classes of networks
• Statistical-mechanical approach to subgraph centrality in complex networks
• Graph Vulnerability and Robustness: A Survey
• On the limiting behavior of parameter-dependent network centrality measures
• Spectral properties of the Google matrix of the World Wide Web and other directed networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Dimensionality of social networks using motifs and eigenvalues
• Communicability and multipartite structures in complex networks at negative absolute temperatures
• Spectral Properties of Directed Random Networks with Modular Structure
• Spectral analysis of deformed random networks
• Phase transitions in social networks inspired by the Schelling model
• Models of on-line social networks
• Measuring nodes centrality when local and global measures overlap
• "Clumpiness" Mixing in Complex Networks
• Centralities in Simplicial Complexes
• Robustness of Regular Graphs Based on Natural Connectivity
• Detecting highly cyclic structure with complex eigenpairs
• Geometric protean graphs
• Communication on structure of biological networks
• Evaluating links through spectral decomposition
• On Rich Clubs of Path-Based Centralities in Networks
• Common adversaries form alliances: modelling complex networks via anti-transitivity
• Graph Metrics for Internet Robustness -- A Survey
• Accounting for the Role of Long Walks on Networks via a New Matrix Function