arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.19328cs.DScs.CC
收藏

通过分析形状(曲率)的变化来识别关键网络边

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)

University of Illinois Chicago(伊利诺伊大学芝加哥分校)

Bhaskar DasGupta, Katie Kruzan

AI总结:

本文提出利用Ollivier-Ricci曲率研究无向图中关键边的算法与复杂性问题,揭示了与二分图完美匹配及组合打包/覆盖问题的关联。

摘要:

近年来,将流形Ricci曲率扩展到离散组合对象如图和超图(俗称

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑