arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1309.2172math.OCcs.SYeess.SY
收藏

环形图的平均电阻

Average resistance of toroidal graphs

University of Twente(特文特大学);Politecnico di Torino(都灵理工大学)

Wilbert Samuel Rossi, Paolo Frasca, Fabio Fagnani

AI总结:

本文研究了图拓扑及维度对平均电阻的影响,分析了二维环形网格中平均电阻发散现象,并在高维情况下证明了其均匀有界性。

摘要:

图的平均有效电阻是许多应用中的重要性能指标,包括网络系统的分布式估计和控制。本文研究了平均电阻如何依赖于图拓扑和具体维度。我们专注于d维环形网格,并利用电阻与拉普拉斯特征值之间的联系。我们的分析提供了平均电阻的紧估计,这对于研究节点数量趋于无穷时的渐进行为至关重要。在二维情况下,平均电阻发散:在这种情况下,我们能够捕捉当网格边长以不同速率增长时的发散速率。在更高维度情况下,平均电阻在节点数量上是均匀有界的:在这种情况下,我们猜想其值随维度增大而为1/d量级。我们对超立方体和边长趋于无穷的情况证明了这一点。

英文摘要:

The average effective resistance of a graph is a relevant performance index in many applications, including distributed estimation and control of network systems. In this paper, we study how the average resistance depends on the graph topology and specifically on the dimension of the graph. We concentrate on $d$-dimensional toroidal grids and we exploit the connection between resistance and Laplacian eigenvalues. Our analysis provides tight estimates of the average resistance, which are key to study its asymptotic behavior when the number of nodes grows to infinity. In dimension two, the average resistance diverges: in this case, we are able to capture its rate of growth when the sides of the grid grow at different rates. In higher dimensions, the average resistance is bounded uniformly in the number of nodes: in this case, we conjecture that its value is of order $1/d$ for large $d$. We prove this fact for hypercubes and when the side lengths go to infinity.

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

↑