Signed graphs are an emergent way of representing data in a variety of contexts where antagonistic interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of communicability for signed graphs and explore in depth its mathematical properties. We also prove that the communicability induces a hyperspherical geometric embedding of the signed network, and derive communicability-based metrics that satisfy the axioms of a distance even in the presence of negative edges. We then apply these metrics to solve several problems in the data analysis of signed graphs within a unified framework. These include the partitioning of signed graphs, dimensionality reduction, finding hierarchies of alliances in signed networks, and quantifying the degree of polarization between the existing factions in social systems represented by these types of graphs.
View on arXiv@article{diaz-diaz2025_2403.07493,
title={ Signed graphs in data sciences via communicability geometry },
author={ Fernando Diaz-Diaz and Ernesto Estrada },
journal={arXiv preprint arXiv:2403.07493},
year={ 2025 }
}