Balance with Memory in Signed Networks via Mittag-Leffler Matrix Functions

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Tian, Yu, Estrada, Ernesto
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909223973027840
author Tian, Yu
Estrada, Ernesto
author_facet Tian, Yu
Estrada, Ernesto
contents Structural balance is an important characteristic of graphs/networks where edges can be positive or negative, with direct impact on the study of real-world complex systems. When a network is not structurally balanced, it is important to know how much balance still exists in it. Although several measures have been proposed to characterize the degree of balance, the use of matrix functions of the signed adjacency matrix emerges as a very promising area of research. Here, we take a step forward to using Mittag-Leffler (ML) matrix functions to quantify the notion of balance of signed networks. We show that the ML balance index can be obtained from first principles on the basis of a nonconservative diffusion dynamic, and that it accounts for the memory of the system about the past, by diminishing the penalization that long cycles typically receive in other matrix functions. Finally, we demonstrate the important information in the ML balance index with both artificial signed networks and real-world networks in various contexts, ranging from biological and ecological to social ones.
format Preprint
id arxiv_https___arxiv_org_abs_2406_09907
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Balance with Memory in Signed Networks via Mittag-Leffler Matrix Functions
Tian, Yu
Estrada, Ernesto
Social and Information Networks
Dynamical Systems
Spectral Theory
Physics and Society
05C22, 05C38, 05C50, 37E25, 91D30, 94C15
Structural balance is an important characteristic of graphs/networks where edges can be positive or negative, with direct impact on the study of real-world complex systems. When a network is not structurally balanced, it is important to know how much balance still exists in it. Although several measures have been proposed to characterize the degree of balance, the use of matrix functions of the signed adjacency matrix emerges as a very promising area of research. Here, we take a step forward to using Mittag-Leffler (ML) matrix functions to quantify the notion of balance of signed networks. We show that the ML balance index can be obtained from first principles on the basis of a nonconservative diffusion dynamic, and that it accounts for the memory of the system about the past, by diminishing the penalization that long cycles typically receive in other matrix functions. Finally, we demonstrate the important information in the ML balance index with both artificial signed networks and real-world networks in various contexts, ranging from biological and ecological to social ones.
title Balance with Memory in Signed Networks via Mittag-Leffler Matrix Functions
topic Social and Information Networks
Dynamical Systems
Spectral Theory
Physics and Society
05C22, 05C38, 05C50, 37E25, 91D30, 94C15
url https://arxiv.org/abs/2406.09907