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

关于图的离散化Ricci曲率的计算:局部算法与(局部化的)细粒度归约

On computing Discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions

Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee

AI总结:

本文从细粒度归约和局部查询算法角度研究Ollivier-Ricci曲率的高效计算,将其与最小权完美匹配问题关联,并首次给出查询型算法的上下界。

摘要:

通过Ricci曲率刻画高维对象的形状在数学和物理的许多研究领域中起着关键作用。然而,尽管数学家已经提出并研究了针对网络等离散组合对象的多种Ricci曲率离散化方法,但这些离散化方法的计算复杂性方面在很大程度上尚未引起理论计算机科学家的关注。本文从细粒度归约和局部查询算法的角度,研究其中一种离散化方法,即Ollivier-Ricci曲率的高效计算。我们的主要贡献如下。(a)我们通过细粒度归约,将曲率计算问题与完全二分图上的最小权完美匹配问题联系起来。(b)我们在合适的框架中形式化了曲率计算问题的计算方面,以便局部算法领域的研究者能够对其进行研究。(c)在我们的局部算法框架中,我们首次给出了针对曲率计算问题的查询型算法的查询下界和上界。在此过程中,我们还展示了细粒度归约的局部化版本。我们相信,我们的结果提出了一组引人入胜的研究问题,这些问题在理论和实践上都具有动机,涉及为对象的曲率设计高效算法。

英文摘要:

Characterizing shapes of high-dimensional objects via Ricci curvatures plays a critical role in many research areas in mathematics and physics. However, even though several discretizations of Ricci curvatures for discrete combinatorial objects such as networks have been proposed and studied by mathematicians, the computational complexity aspects of these discretizations have escaped the attention of theoretical computer scientists to a large extent. In this paper, we study one such discretization, namely the Ollivier-Ricci curvature, from the perspective of efficient computation by fine-grained reductions and local query-based algorithms. Our main contributions are the following. (a) We relate our curvature computation problem to minimum weight perfect matching problem on complete bipartite graphs via fine-grained reduction. (b) We formalize the computational aspects of the curvature computation problems in suitable frameworks so that they can be studied by researchers in local algorithms. (c) We provide the first known lower and upper bounds on queries for query-based algorithms for the curvature computation problems in our local algorithms framework. En route, we also illustrate a localized version of our fine-grained reduction. We believe that our results bring forth an intriguing set of research questions, motivated both in theory and practice, regarding designing efficient algorithms for curvatures of objects.

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

↑