arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.11676cs.CGcs.DM
收藏

赋权图的连续平均距离

Continuous mean distance of a weighted graph

Delia Garijo, Alberto Márquez, Rodrigo I. Silveira

摘要:

研究了赋权图的连续平均距离的概念。对于连通无权图,平均距离可以定义为所有顶点对之间距离的算术平均值。这个参数提供了图的紧致性的自然度量,并且已经被深入研究,以及几个变体,包括它的加权图版本。(离散)平均距离的连续模拟是图的边缘上所有点对之间的距离的平均值。尽管这是一个非常自然的推广,但据我们所知,这个概念几乎没有被研究过,因为从离散到连续的跳跃意味着必须处理无限数量的距离,这增加了参数的难度。在本文中,我们表明,连续的平均距离的加权图可以计算在时间平方的边数,通过两种不同的方法,应用离散算法和计算几何的基本概念。我们还提出了结构的结果,允许更快地计算这个连续参数的几类加权图。最后,我们研究了(离散)平均距离与连续平均距离之间的关系,主要讨论了加权图边的迭代细分的收敛性问题。

英文摘要:

We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a natural measure of the compactness of the graph, and has been intensively studied, together with several variants, including its version for weighted graphs. The continuous analog of the (discrete) mean distance is the mean of the distances between all pairs of points on the edges of the graph. Despite being a very natural generalization, to the best of our knowledge this concept has been barely studied, since the jump from discrete to continuous implies having to deal with an infinite number of distances, something that increases the difficulty of the parameter. In this paper we show that the continuous mean distance of a weighted graph can be computed in time quadratic in the number of edges, by two different methods that apply fundamental concepts in discrete algorithms and computational geometry. We also present structural results that allow a faster computation of this continuous parameter for several classes of weighted graphs. Finally, we study the relation between the (discrete) mean distance and its continuous counterpart, mainly focusing on the relevant question of the convergence when iteratively subdividing the edges of the weighted graph.

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

↑