Network comparison plays a central role in characterizing structural differences and cross-network correlations in complex systems. In many real-world settings, however, interactions are inherently signed, with positive and negative links altering both connection semantics and structural organization. This challenges conventional comparison methods built upon unsigned assumptions, which are unable to adequately capture such heterogeneity. To address this limitation, we introduce a network comparison method based on Signed Communicability Embedding (SCE). SCE employs the matrix exponential of the signed adjacency matrix to capture the cumulative contributions of positive and negative walks across multiple scales. Network-level dissimilarity is then quantified through discrepancies in pairwise node distances within the resulting embedding space, thereby integrating topological structure and relation polarity into a unified measure. To further ensure consistency across networks, a spectral correction strategy is incorporated to mitigate scale-induced bias. Extensive experiments on diverse real-world signed networks show that SCE yields stable and discriminative performance under a variety of perturbation scenarios, particularly in capturing structural shifts induced by negative edge changes. Additional analyses based on null models and network clustering further show that SCE not only disentangles differences arising from topology and sign configurations but also organizes networks into distinct structural regimes, reflecting variations in connectivity density, local closure, and signed interaction heterogeneity. Overall, SCE provides a coherent and interpretable approach to network comparison in complex signed systems.
A statistical filter that benchmarks node-level bipartite clustering against degree-preserving randomizations to classify nodes as geometric (signal) or degree constrained noise is introduced, offering a simple, scalable way to disentangle structure from noise in bipartite networks.
L. Ramirez, Roya Aliakbarisani, M. Serrano et al.· Nature Communications· 0 citations
This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process and demonstrates that the proposed framework consistently outperforms existing techniques in terms of accuracy, resolution, and computational simplicity.
This work proposes a novel and practical framework for dependence testing in labeled graphs via mutual information over a structure-weighted joint label distribution and demonstrates that the proposed test is a statistically sound and an effective tool for uncovering nontrivial dependencies in graph data.
Nikolaos Papagiannis, Vasam Manjveekar Prabantu, A. Grama et al.· Proceedings of the 32nd ACM...· 0 citations
This work identifies a fundamental inconsistency across the structural, propagation, and semantic layers of existing models that leads to biased representations learned from sparse or noisy datasets, and proposes a unified framework named SSC-Loop that treats signed social recommendation as the maximization of structural consistency.
The Diverse top-k-pc problem is introduced, which is the first principled formulation of top-k polarized communities with controlled overlap, and a greedy sequential algorithm that solves a generalized eigenvector problem at each step, efficiently discovering diverse polarized pairs.
Francesco Gullo, Domenico Mandaglio, Andrea Tagarelli· Machine-mediated learning· 0 citations
This work proposes a self-expressive solver that captures the complementary homophily between meta-paths and node features to obtain ho-mophilous representations and designs separate path encoders to model diverse interactions, thus explicitly including cross-type interactions while mitigating noise via adaptive fusion.
Minda Chen, Yujie Mo, Junkai Huang et al.· 0 citations