arXiv subjects

Fernando Diaz-Diaz

Publications and source records attributed to Fernando Diaz-Diaz.

9 recordsLinked to original sources

arXiv2026

Signed Networks: theory, methods, and applications

Signed networks provide a principled framework for representing systems in which interactions are not merely present or absent but qualitatively distinct: friendly or antagonistic, supportive or conflicting, excitatory or inhibitory. This polarity reshapes how we think about structure and dynamics in complex systems: a negative tie is not simply a missing positive one but a constraint that generates tension, and possibly asymmetry. Across disciplines, from sociology to neuroscience and machine learning, signed networks provide a shared language to formalise duality, balance, and opposition as integral components of system behaviour. This review provides a comprehensive and foundational summary of signed network theory. It formalises the mathematical principles of signed graphs and surveys signed-network-specific measures, including signed degree distributions, clustering, centralities, motifs, and Laplacians. It revisits balance theory, tracing its cognitive and structural formulations and their connections to frustration. Structural aspects of signed networks are examined, analysing key topics such as null models, node embeddings, sign prediction, and community detection. Subsequent sections address dynamical processes on and of signed networks, such as opinion dynamics, contagion models, and data-driven approaches for studying evolving networks. Practical challenges in constructing, inferring and validating signed data from real-world systems are also highlighted, and we offer an overview of currently available datasets. We also address common pitfalls and challenges that arise when modelling or analysing signed data. Overall, this review integrates theoretical foundations, methodological approaches, and cross-domain examples, providing a structured entry point and a reference framework for researchers interested in the study of signed networks in complex systems.

physics.soc-ph↗

arXiv2025

Gremban Expansion for Signed Networks: Algebraic and Combinatorial Foundations for Community-Faction Detection

This article deals with the characterization and detection of community and faction structures in signed networks. We approach the study of these mesoscale structures through the lens of the Gremban expansion. This graph operation lifts a signed graph to a larger unsigned graph, and allows the extension of standard techniques from unsigned to signed graphs. We develop the combinatorial and algebraic properties of the Gremban expansion, with a focus on its inherent involutive symmetry. The main technical result is a bijective correspondence between symmetry-respecting cut-sets in the Gremban expansion, and regular cut-sets and frustration sets in the signed graph (i.e., the combinatorial structures that underlie communities and factions respectively). This result forms the basis for our new approach to community-faction detection in signed networks, which makes use of spectral clustering techniques that naturally respect the required symmetries. We demonstrate how this approach distinguishes the two mesoscale structures, how to generalize the approach to multi-way clustering and discuss connections to network dynamical systems.

cs.DM↗

arXiv2025

Global Balance and Systemic Risk in Financial Correlation Networks

The global balance index is used in the network literature to quantify how balanced a signed network is. In this paper we show that the global balance index of financial correlation networks can be used as a systemic risk measure. We define the global balance index of a network starting from a diffusive process that describes how the information spreads across nodes in a network, providing an alternative derivation to the usual combinatorial one. The steady state of this process is the solution of a linear system governed by the exponential of the replication matrix of the process. We provide a bridge between the numerical stability of this linear system, measured by the condition number in an opportune norm, and the structural predictability of the underlying signed network. The link between the condition number and related systemic risk measures, such as the market rank indicators, allows the global balance index to be interpreted as a new systemic risk measure. A comprehensive empirical application to real financial data finally confirms that the global balance index of financial correlation networks represents a valuable and effective systemic risk indicator.

q-fin.RM↗

arXiv2025

Signed graphs in data sciences via communicability geometry

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.

math.MG↗

arXiv2025

Echo chamber effects in signed networks

Echo chamber effects in social networks are generally attributed to the prevalence of interactions among like-minded peers. However, recent evidence has emphasized the role of hostile interactions between opposite-minded groups. We investigate the role of polarization, identified with structural balance, in the formation of echo chambers in signed networks. To do so, we generalize the Independent Cascade Model and the Linear Threshold Model to describe information propagation in presence of negative edges. Antagonistic connections do not disrupt the flow of information, but instead, alter the way information is framed. Our results show that echo chambers spontaneously emerge in balanced networks, but also in antibalanced ones for specific parameters. This highlights that structural polarization and echo chambers do not necessarily display a one-to-one correspondence, showing instead a complex and often counterintuitive interplay. The robustness of our results is confirmed with a complex contagion model and through simulations in different network topologies, including real-world datasets.

physics.soc-ph↗

arXiv2024

Mathematical Modeling of Local Balance in Signed Networks and Its Applications to Global International Analysis

Alliances and conflicts in social, political and economic relations can be represented by positive and negative edges in signed networks. A cycle is said to be positive if the product of its edge signs is positive, otherwise it is negative. Then, a signed network is balanced if and only if all its cycles are positive. An index characterizing how much a signed network deviates from being balanced is known as a global balance index. Here we give a step forward in the characterization of signed networks by defining a local balance index, which characterizes how much a given vertex of a signed network contributes to its global balance. We analyze the mathematical foundations and unique structural properties of this index. Then, we apply this index to the study of the evolution of international relations in the globe for the period 1816-2014. In this way we detect and categorize major historic events based on balance fluctuations, helping our understanding towards new mixed approaches to history based on network theory.

physics.soc-ph↗

arXiv2023

Beyond Active Engagement: The Significance of Lurkers in a Polarized Twitter Debate

The emergence of new public forums in the shape of online social media has introduced unprecedented challenges to public discourse, including polarization, misinformation, and the emergence of echo chambers. While existing research has extensively studied the behavior of active users within echo chambers, little attention has been given to the hidden audience, also known as lurkers, who passively consume content without actively engaging. This study aims to estimate the share of the hidden audience and investigate their interplay with the echo chamber effect. Using Twitter as a case study, we analyze a polarized political debate to understand the engagement patterns and factors influencing the hidden audience's presence. Our findings reveal a relevant fraction of users that consume content without active interaction, which underscores the importance of considering their presence in online debates. Notably, our results indicate that the engagement of the hidden audience is primarily influenced by factors such as the reliability of media sources mentioned in tweets rather than the ideological stance of the user that produced the content. These findings highlight the need for a comprehensive understanding of the hidden audience's role in online debates and how they may influence public opinion.

cs.SI↗

arXiv2022

Echo chambers and information transmission biases in homophilic and heterophilic networks

We study how information transmission biases arise by the interplay between the structural properties of the network and the dynamics of the information in synthetic scale-free homophilic/heterophilic networks. We provide simple mathematical tools to quantify these biases. Both Simple and Complex Contagion models are insufficient to predict significant biases. In contrast, a Hybrid Contagion model -- in which both Simple and Complex Contagion occur -- gives rise to three different homophily-dependent biases: emissivity and receptivity biases,and echo chambers. Simulations in an empirical network with high homophily confirm the existence of these biases. Our results shed light into the mechanisms that cause inequalities in the visibility of information sources, reduced access to information, and lack of communication among distinct groups.

physics.soc-ph↗

arXiv2022

Time and space generalized diffusion equation on graphs/networks

Normal and anomalous diffusion are ubiquitous in many complex systems [1] . Here, we define a time and space generalized diffusion equation (GDE), which uses fractional-time derivatives and transformed d-path Laplacian operators on graphs/networks. We find analytically the solution of this equation and prove that it covers the regimes of normal, sub- and superdiffusion as a function of the two parameters of the model. We extend the GDE to consider a system with temporal alternancy of normal and anomalous diffusion which can be observed for instance in the diffusion of proteins along a DNA chain. We perform computational experiments on a one-dimensional system emulating a linear DNA chain. It is shown that a subdiffusive-superdiffusive alternant regime allows the diffusive particle to explore more slowly small regions of the chain with a faster global exploration, than a subdiffusive-subdiffusive regime. Therefore, an alternancy of sliding (subdiffusive) with hopping and intersegmental transfer (superdiffusive) mechanisms show important advances for protein-DNA interactions.

physics.soc-ph↗