arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.07940physics.data-ancs.DMphysics.soc-ph
收藏

均匀随机树中最小边长和的标度

The scaling of the minimum sum of edge lengths in uniformly random trees

Juan Luis Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez

摘要:

网络上的最小线性排列问题包括找到当顶点线性排列时可以实现的最小边长和。虽然有算法可以在多项式时间内解决这个问题,但据我们所知,它们仍然停留在理论上,尚未在实际环境中实现。在这里,我们使用这些算法之一,调查的增长,这个总和作为一个函数的大小的树在均匀随机树。我们表明,这个总和是有界的,它的值在一个星树。我们还表明,平均边长的增长在最佳线性安排,在形成鲜明对比的线性增长,预计最佳安排的星树或随机线性安排。

英文摘要:

The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial time, they have remained theoretical and have not been implemented in practical contexts to our knowledge. Here we use one of those algorithms to investigate the growth of this sum as a function of the size of the tree in uniformly random trees. We show that this sum is bounded above by its value in a star tree. We also show that the mean edge length grows logarithmically in optimal linear arrangements, in stark contrast to the linear growth that is expected on optimal arrangements of star trees or on random linear arrangements.

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

↑