Hyperspherical embedding of graphs and networks in communicability spaces

DOI10.1016/j.dam.2013.05.032zbMath1297.05072OpenAlexW2027564922MaRDI QIDQ403566

Ernesto Estrada, José Antonio de la Peña, M. G. Sánchez-Lirola

Publication date: 29 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.032

zbMATH Keywords

Euclidean distance matriceshyperspheresgraph embeddingscircum-Euclidean matricescommunicability distances

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Network bipartitioning in the anti-communicability Euclidean space ⋮ The electron density function of the Hückel (tight-binding) model ⋮ Communicability cosine distance: similarity and symmetry in graphs/networks ⋮ Tuned communicability metrics in networks. The case of alternative routes for urban traffic ⋮ Informational cost and networks navigability ⋮ Communicability Angle and the Spatial Efficiency of Networks ⋮ Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix

Uses Software

• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The communicability distance in graphs
• The walk distances in graphs
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Random walks and diffusions on graphs and databases. An introduction.
• Spheres and hemispheres as quantum state spaces
• On Euclidean distance matrices
• Multispherical Euclidean distance matrices
• Properties of Euclidean and non-Euclidean distance matrices
• Generalized walks-based centrality measures for complex biological networks
• Connections between the real positive semidefinite and distance matrix completion problems
• Circum-Euclidean distance matrices and faces
• Shortest paths algorithms: Theory and experimental evaluation
• Complex networks: structure and dynamics
• On monotonicity of the hypersphere volume and area
• On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
• Network Properties Revealed through Matrix Functions
• Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers
• Euclidean distance matrices: new characterization and boundary properties
• On Deriving the Inverse of a Sum of Matrices
• Random walks on hyperspheres of arbitrary dimensions
• Graph Embedding for Pattern Analysis
• Functions of Matrices
• Geometrical Probability and Random Points on a Hypersphere
• Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
• Encyclopedia of Distances