Communicability Angle and the Spatial Efficiency of Networks

DOI10.1137/141000555zbMath1348.05199OpenAlexW262792004MaRDI QIDQ2832109

Ernesto Estrada, Naomichi Hatano

Publication date: 7 November 2016

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/59247/

zbMATH Keywords

complex networkgraph distanceEuclidean distancecommunicabilitygraph planarity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (10)

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Network bipartitioning in the anti-communicability Euclidean space ⋮ The electron density function of the Hückel (tight-binding) model ⋮ Monitoring effective connectivity in the preterm brain: a graph approach to study maturation ⋮ Matrix functions in network analysis ⋮ Communicability cosine distance: similarity and symmetry in graphs/networks ⋮ Tuned communicability metrics in networks. The case of alternative routes for urban traffic ⋮ Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis ⋮ ``Melting of complex networks. A mathematical model of complex networks resilience to external stress ⋮ Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix

Uses Software

• VADAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperspherical embedding of graphs and networks in communicability spaces
• The communicability distance in graphs
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Communicability graph and community structures in complex networks
• Isoperimetric inequalities, growth, and the spectrum of graphs
• Penny-packing and two-dimensional codes
• Harmony in the small-world
• Network Properties Revealed through Matrix Functions
• Expander graphs in pure and applied mathematics
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Expander graphs and their applications
• The Structure and Function of Complex Networks

This page was built for publication: Communicability Angle and the Spatial Efficiency of Networks