具有黄金光谱比的图(网络)
Graphs (networks) with golden spectral ratio
摘要:
我们提出了两个新的频谱措施的图和网络的特征之间的比率的“散装”部分的频谱和频谱间隙的宽度,以及频谱长度和“散装”部分的频谱的宽度之间的比率。使用这些定义,我们介绍了黄金谱图(GSG)的概念,这是图的两个频谱比是相同的黄金比例。然后,我们证明了几个分析结果,找到最小的GSG以及建立家庭的GSG。我们还证明了某些类别的图的不存在性结果。我们用计算机研究了几类图,发现了一些几乎GSG。两个代表真实世界系统的网络也被发现具有非常接近黄金比例的频谱比。我们在这项工作中已经表明,GSG显示出良好的扩展性能,其中许多是Ramanujan图,也有望有很好的同步性。最后,从拓扑和动力学的角度来看,黄金谱图是最优网络
英文摘要:
We propose two new spectral measures for graphs and networks which characterize the ratios between the width of the "bulk" part of the spectrum and the spectral gap, as well as the ratio between spectral length and the width of the "bulk" part of the spectrum. Using these definitions we introduce the concept of golden spectral graphs (GSG), which are graphs for which both spectral ratios are identical to the golden ratio. Then, we prove several analytic results to finding the smallest GSG as well as to build families of GSGs. We also prove some non-existence results for certain classes of graphs. We explore by computer several classes of graphs and found some almost GSGs. Two networks representing real-world systems were also found to have spectral ratios very close to the golden ratio. We have shown in this work that GSG display good expansion properties, many of them are Ramanujan graphs and also are expected to have very good synchronizability. In closing golden spectral graphs are optimal networks from a topological and dynamical point of view
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。