On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916000583122944 |
|---|---|
| author | DasGupta, Bhaskar Kruzan, Katie |
| author_facet | DasGupta, Bhaskar Kruzan, Katie |
| contents | In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas ranging over metabolic systems, transcriptional regulatory networks, protein-protein-interaction networks, social networks and brain networks to deep learning models but, in contrast, they have been looked at by relatively fewer researchers in the algorithms and computational complexity community. As an attempt to bring these network Ricci-curvature related problems under the lens of computational complexity and foster further inter-disciplinary interactions, we provide a formal framework for studying algorithmic and computational complexity issues for detecting critical edges in an undirected graph using Ollivier-Ricci curvatures and provide several algorithmic and inapproximability results for problems in this framework. Our results show some interesting connections between our problems, the exact perfect matching and perfect matching blocker problems for bipartite graphs and two well-known combinatorial packing/covering problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_19328 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures) DasGupta, Bhaskar Kruzan, Katie Data Structures and Algorithms Computational Complexity 68W20, 68W25, 68W40, 68Q25 F.2.2; G.2.2 In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas ranging over metabolic systems, transcriptional regulatory networks, protein-protein-interaction networks, social networks and brain networks to deep learning models but, in contrast, they have been looked at by relatively fewer researchers in the algorithms and computational complexity community. As an attempt to bring these network Ricci-curvature related problems under the lens of computational complexity and foster further inter-disciplinary interactions, we provide a formal framework for studying algorithmic and computational complexity issues for detecting critical edges in an undirected graph using Ollivier-Ricci curvatures and provide several algorithmic and inapproximability results for problems in this framework. Our results show some interesting connections between our problems, the exact perfect matching and perfect matching blocker problems for bipartite graphs and two well-known combinatorial packing/covering problems. |
| title | On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures) |
| topic | Data Structures and Algorithms Computational Complexity 68W20, 68W25, 68W40, 68Q25 F.2.2; G.2.2 |
| url | https://arxiv.org/abs/2602.19328 |