arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.03733math.COmath.PR
收藏

具有最小谱隙的正则图

Regular Graphs with Minimum Spectral Gap

M. Abdi, E. Ghorbani, W. Imrich

摘要:

Aldous和Fill证明了具有$n$顶点的连通正则图上随机游动的最大松弛时间为$(1+o(1)) \frac{3n^2}{2π^2}$ .这个猜想可以用谱间隙的概念来表示:$k$ -正则图在$n$顶点上的谱间隙(代数连通度)至少为$(1+o(1))\frac{2kπ^2}{3n^2}$,并且至少对$k$的一个值给出了上界.基于Brand,Guiduli和Imrich的工作,我们证明了三次图的这个猜想.我们还研究了所有连通四次图中具有最小谱间隙的四次图(即4-正则)的结构。我们表明,他们必须有一个路径样的结构,从特定的块。

英文摘要:

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2π^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the spectral gap (algebraic connectivity) of a connected $k$-regular graph on $n$ vertices is at least $(1+o(1))\frac{2kπ^2}{3n^2}$, and the bound is attained for at least one value of $k$. Based upon previous work of Brand, Guiduli, and Imrich, we prove this conjecture for cubic graphs. We also investigate the structure of quartic (i.e. 4-regular) graphs with the minimum spectral gap among all connected quartic graphs. We show that they must have a path-like structure built from specific blocks.

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

↑