Hyperspherical embedding of graphs and networks in communicability spaces
From MaRDI portal
(Redirected from Publication:403566)
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
Cites work
- scientific article; zbMATH DE number 3141674 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 3774424 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 1356198 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3331438 (Why is no real title available?)
- scientific article; zbMATH DE number 2230269 (Why is no real title available?)
- scientific article; zbMATH DE number 3048077 (Why is no real title available?)
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- A note on two problems in connexion with graphs
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Circum-Euclidean distance matrices and faces
- Complex networks: structure and dynamics
- Connections between the real positive semidefinite and distance matrix completion problems
- Encyclopedia of Distances
- Euclidean and circum-Euclidean distance matrices: characterizations and linear preservers
- Euclidean distance matrices: new characterization and boundary properties
- Functions of Matrices
- Generalized walks-based centrality measures for complex biological networks
- Geometrical Probability and Random Points on a Hypersphere
- Graph embedding for pattern analysis.
- Multispherical Euclidean distance matrices
- Network properties revealed through matrix functions
- On Deriving the Inverse of a Sum of Matrices
- On Euclidean distance matrices
- On monotonicity of the hypersphere volume and area
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- Properties of Euclidean and non-Euclidean distance matrices
- Random walks and diffusions on graphs and databases. An introduction.
- Random walks on hyperspheres of arbitrary dimensions
- Shortest paths algorithms: Theory and experimental evaluation
- Spheres and hemispheres as quantum state spaces
- The communicability distance in graphs
- The walk distances in graphs
Cited in
(7)- Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
- The electron density function of the Hückel (tight-binding) model
- Network bipartitioning in the anti-communicability Euclidean space
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- Communicability angle and the spatial efficiency of networks
- Informational cost and networks navigability
- Communicability cosine distance: similarity and symmetry in graphs/networks
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)
