Statistical-mechanical approach to subgraph centrality in complex networks

Abstract

We interpret the subgraph centrality as the partition function of a network. The entropy, the internal energy and the Helmholtz free energy are defined for networks and molecular graphs on the basis of graph spectral theory. Various relations of these quantities to the structure and the dynamics of the complex networks are discussed. They include the cohesiveness of the network and the critical coupling of coupled phase oscillators. We explore several models of network growing/evolution as well as real-world networks, such as those representing metabolic and protein-protein interaction networks as well as the interaction between secondary structure elements in proteins.

17 pages, 2 figures

References in corpus (9)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Subgraph Centrality in Complex Networks
• The onset of synchronization in large networks of coupled oscillators
• Virtual Identification of Essential Proteins Within the Protein Interaction Network of Yeast
• Spectral Measures of Bipartivity in Complex Networks
• Spectral Scaling in Complex Networks
• Functional centrality in graphs

Cited by in corpus (28)

• The Physics of Communicability in Complex Networks
• Spectral entropies as information-theoretic tools for complex network comparison
• Spectral centrality measures in complex networks
• Thermodynamic characterization of networks using graph polynomials
• Communicability and multipartite structures in complex networks at negative absolute temperatures
• Electrothermal Transistor Effect and Cyclic Electronic Currents in Multithermal Charge Transfer Networks
• Similarities on Graphs: Kernels versus Proximity Measures
• The Green's Function for the Hückel (Tight Binding) Model
• A novel framework to analyze complex network dynamics
• Microdynamics and Criticality of Adaptive Regulatory Networks
• Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures
• Approximating the Spectral Sums of Large-scale Matrices using Chebyshev Approximations
• Statistical mechanics of random geometric graphs: Geometry-induced first order phase transition
• Real-Space Visualization of Quantum Phase Transition by Network Topology
• Tight-binding 'dihedral orbitals' approach to electronic communicability in macromolecular chains
• A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
• Quantum algorithms for spectral sums
• Dissecting graph measure performance for node clustering in LFR parameter space
• Node seniority ranking
• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
• Communicability and Communities in Complex Socio-Economic Networks
• New results and open problems on subgraph centrality
• Can We `Feel' the Temperature of Knowledge? Modelling Scientific Popularity Dynamics via Thermodynamics
• Communicability Angle and the Spatial Efficiency of Networks
• Communicability in complex brain networks
• Accounting for the Role of Long Walks on Networks via a New Matrix Function
• A statistical mechanics description of environmental variability in metabolic networks
• Thermodynamic stability and structural transitions in virus-host networks