Graphs with high second eigenvalue multiplicity
Graphs with high second eigenvalue multiplicity
复制标题
具有高第二特征值重数的图
DOI:
10.1112/blms.12647
复制
发表时间:
2022
影响因子:
0.9
通讯作者:
Zhao, Yufei
中科院分区:
文献类型:
--
作者:
Haiman, Milan;Schildkraut, Carl;Zhang, Shengtong;Zhao, Yufei
Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of equiangular lines with fixed angles. It led to the natural question: what is the maximum second eigenvalue multiplicity of a connected bounded degree n$n$‐vertex graph? The best‐known upper bound is O(n/loglogn)$O(n/\log \log n)$. The previously known best‐known lower bound is on the order of n1/3$n^{1/3}$ (for infinitely many n$n$), coming from Cayley graphs on PSL(2,q)$\operatorname{PSL}(2,q)$. Here we give a construction showing a lower bound of n/log2n$\sqrt {n/\log _2 n}$. We also construct Cayley graphs with second eigenvalue multiplicity at least n2/5−1$n^{2/5}-1$. Earlier techniques show that there are at most O(n/loglogn)$O(n/\log \log n)$ eigenvalues (counting multiplicities) within O(1/logn)$O(1/\log n)$ of the second eigenvalue. We give a construction showing this upper bound on approximate second eigenvalue multiplicity is tight up to a constant factor. This demonstrates a barrier to earlier techniques for upper bounding eigenvalue multiplicities.
影响因子:
4.9
作者:
Zilin Jiang;Jonathan Tidor;Yuan Yao;Shengtong Zhang;Yufei Zhao
通讯作者:
Zilin Jiang;Jonathan Tidor;Yuan Yao;Shengtong Zhang;Yufei Zhao
影响因子:
1.1
作者:
Zilin Jiang;Jonathan Tidor;Yuan Yao;Shengtong Zhang;Yufei Zhao
通讯作者:
Yufei Zhao
影响因子:
2.2
作者:
Gilbert, Seth;Lynch, Nancy A.
通讯作者:
Lynch, Nancy A.