Hyperspherical embedding of graphs and networks in communicability spaces
DOI10.1016/J.DAM.2013.05.032zbMATH Open1297.05072OpenAlexW2027564922MaRDI QIDQ403566FDOQ403566
Authors: Ernesto Estrada, M. G. Sánchez-Lirola, José A. de la Peña 
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
Recommendations
- Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
- The communicability distance in graphs
- Network bipartitioning in the anti-communicability Euclidean space
- Metric embedding, hyperbolic space, and social networks
- Metric embedding, hyperbolic space, and social networks
Euclidean distance matricesgraph embeddingscircum-Euclidean matricescommunicability distanceshyperspheres
Applications of graph theory (05C90) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Functions of Matrices
- Network properties revealed through matrix functions
- A note on two problems in connexion with graphs
- Complex networks: structure and dynamics
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- On Deriving the Inverse of a Sum of Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Properties of Euclidean and non-Euclidean distance matrices
- Connections between the real positive semidefinite and distance matrix completion problems
- Circum-Euclidean distance matrices and faces
- Euclidean distance matrices: new characterization and boundary properties
- Title not available (Why is that?)
- Random walks and diffusions on graphs and databases. An introduction.
- Title not available (Why is that?)
- Encyclopedia of Distances
- Geometrical Probability and Random Points on a Hypersphere
- Shortest paths algorithms: Theory and experimental evaluation
- Title not available (Why is that?)
- Title not available (Why is that?)
- The walk distances in graphs
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- Generalized walks-based centrality measures for complex biological networks
- On monotonicity of the hypersphere volume and area
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- Euclidean and circum-Euclidean distance matrices: characterizations and linear preservers
- The communicability distance in graphs
- Random walks on hyperspheres of arbitrary dimensions
- Graph embedding for pattern analysis.
- Title not available (Why is that?)
- Spheres and hemispheres as quantum state spaces
- On Euclidean distance matrices
- Multispherical Euclidean distance matrices
Cited In (7)
- Communicability cosine distance: similarity and symmetry in graphs/networks
- Communicability angle and the spatial efficiency of networks
- Informational cost and networks navigability
- The electron density function of the Hückel (tight-binding) model
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
- Network bipartitioning in the anti-communicability Euclidean space
Uses Software
This page was built for publication: Hyperspherical embedding of graphs and networks in communicability spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403566)
