This work introduces a non-parametric partition of a network derived from its persistent homology, defined using the concept of a persistence surface, and demonstrates that persistent homology can reveal distinctive structural features that are not detected by conventional methods.
Abstract
Determining network structures that are neither local nor global is an area of research that has received considerable attention. The study of these intermediate structures has been primarily concerned with the detection of network communities but also includes the examination of network roles, core and peripheral structure, etc. In an increasingly relevant line of research, persistent homology has also been used to analyze the shape of a network in terms of the network’s cycle structure and its higher-dimensional analogues. In this work, we bring these two perspectives together by introducing a non-parametric partition of a network derived from its persistent homology. This partition, which we call the network’s persistence partition, is defined using the concept of a
persistence surface
, assigning to each node a measure of its individual persistence relative to its position in the network. We examine the extent to which this partition aligns with standard notions of network roles defined via combinatorial equivalence. We then compare how persistence partitions relate to communities and to the core–periphery structure of a network. Our analysis draws on both real and synthetic networks and demonstrates that persistent homology can reveal distinctive structural features that are not detected by conventional methods.
The proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions, indicating that the physics of network dismantling is insensitive...
L. Cirigliano, Claudio Castellano, Minsuk Kim et al.· 0 citations
The results show that smaller clusters are generally more vulnerable to attacks on central nodes, whereas larger and less centralized clusters retain more topological efficiency.
A hybrid centrality measure that integrates information from both smallest-cycle structures and non-smallest-cycle structures associated with each target node provides a more comprehensive characterization of a node’s role in complex networks.
Fu-Rui Tan, Xiaolong Chen, Ruijie Wang et al.· Entropy· 0 citations
This work introduces a principled extension of Ollivier's Ricci curvature to complex-weighted graphs, which encompasses directed graphs as a special case and establishes fundamental theoretical properties of this new notion, including relations to the magnetic Laplacian and combinatorial upper and lower bounds that rel...
Yu Tian, Eleanor P. Wiesler, Melanie Weber· 0 citations
This book shows how citation graphs, the web, social ties, protein interactions, and project schedules all grow themselves from the same handful of local rules -- one local decision at a time.
This work generalizes three distance-based topological measures, namely closeness centrality, betweenness centrality and node eccentricity, using this new hypergraph distance, and shows that hypergraphs can be divided into three distinct classes, corresponding to the possible dominance of specific orders of interaction...
E. Vasil'yeva, L. Tupikina, D. Musatov et al.· Chaos, Solitons & Fracta...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.