Signed graphs in data sciences via communicability geometry

DOI10.1016/J.INS.2025.122096MaRDI QIDQ6958133zbMATH OpenFDO

Authors Fernando Diaz-Diaz, Ernesto Estrada

Publication date 16 July 2025

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2025.122096

zbMATH Keywords

alliances in signed networkscommunicability-based metrics

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Applications of graph theory (05C90) Social networks; opinion dynamics (91D30)

Cites work

• Effective resistance is more than distance: Laplacians, simplices and the Schur complement
• Hyperspherical embedding of graphs and networks in communicability spaces
• Modern Multivariate Statistical Techniques
• Network bypasses sustain complexity
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• On the Laplacian Eigenvalues of Signed Graphs
• On the notion of balance of a signed graph
• Scikit-learn: machine learning in Python
• Signed distance in signed graphs
• Signed graphs
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• The communicability distance in graphs
• The many facets of the Estrada indices of graphs and networks
• The Wiener index of signed graphs

Cited in

(3)

• Global balance and systemic risk in financial correlation networks
• Analyzing communicability and connectivity in the Indian stock market during crises
• Balance with memory in signed networks via Mittag-Leffler matrix functions

This page was built for publication: Signed graphs in data sciences via communicability geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6958133)