Communicability cosine distance: similarity and symmetry in graphs/networks

DOI10.1007/s40314-023-02571-9OpenAlexW4390691173MaRDI QIDQ6192347

Ernesto Estrada

Publication date: 12 February 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-023-02571-9

zbMATH Keywords

matrix functionscentrality measuresgraph automorphismgraph symmetrycommunicabilityvertex similarity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Symmetric functions and generalizations (05E05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperspherical embedding of graphs and networks in communicability spaces
• The communicability distance in graphs
• Complex networks and symmetry. I: A review
• A remark on the faces of the cone of Euclidean distance matrices
• Constructing graphs with pairs of pseudo-similar vertices
• On the full automorphism group of a graph
• Circum-Euclidean distance matrices and faces
• Symmetry breaking in graphs
• Network diffusion with centrality measures to identify disease-related genes
• Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
• The many facets of the Estrada indices of graphs and networks
• On stochastic generation of ultrametrics in high-dimensional Euclidean spaces
• A new status index derived from sociometric analysis
• Communicability Angle and the Spatial Efficiency of Networks
• Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
• Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
• Ultrametric sets in Euclidean point spaces
• ARPACK Users' Guide
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• The on-line encyclopedia of integer sequences
• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• The Scaling and Squaring Method for the Matrix Exponential Revisited
• Network Centrality: An Introduction
• Perturbation bounds for means of eigenvalues and invariant subspaces
• Symmetry in complex networks