Signed graphs in data sciences via communicability geometry

Abstract

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.

References in corpus (10)

• Resolution limit in community detection
• Community detection in networks: A user guide
• Analysis of community structure in networks of correlated data
• Nonparametric weighted stochastic block models
• Balance and Frustration in Signed Networks
• Stochastic block model and exploratory analysis in signed networks
• Effective resistance is more than distance: Laplacians, Simplices and the Schur complement
• Multipolar social systems: Measuring polarization beyond dichotomous contexts
• Polarization and multiscale structural balance in signed networks
• Mathematical Modeling of Local Balance in Signed Networks and Its Applications to Global International Analysis