TL;DR
This paper introduces novel methods for extracting signed backbones from dense, unsigned weighted networks using statistical significance and vigor filters, enabling meaningful analysis of complex systems.
Contribution
It presents the first techniques for inferring edge signs in dense unsigned networks, enhancing network simplification and interpretability.
Findings
Extracted meaningful signed backbones from various real-world networks.
Preserved multiscale network properties such as reciprocity and community structure.
Produced sparse, interpretable signed networks that reflect underlying relationships.
Abstract
Networks provide useful tools for analyzing diverse complex systems from natural, social, and technological domains. Growing size and variety of data such as more nodes and links and associated weights, directions, and signs can provide accessory information. Link and weight abundance, on the other hand, results in denser networks with noisy, insignificant, or otherwise redundant data. Moreover, typical network analysis and visualization techniques presuppose sparsity and are not appropriate or scalable for dense and weighted networks. As a remedy, network backbone extraction methods aim to retain only the important links while preserving the useful and elucidative structure of the original networks for further analyses. Here, we provide the first methods for extracting signed network backbones from intrinsically dense unsigned unipartite weighted networks. Utilizing a null model based…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
