Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

High-girth near-Ramanujan graphs with localized eigenvectors (1908.03694v1)

Published 10 Aug 2019 in math.CO, cs.DM, math-ph, math.MP, and math.SP

Abstract: We show that for every prime $d$ and $\alpha\in (0,1/6)$, there is an infinite sequence of $(d+1)$-regular graphs $G=(V,E)$ with girth at least $2\alpha \log_{d}(|V|)(1-o_d(1))$, second adjacency matrix eigenvalue bounded by $(3/\sqrt{2})\sqrt{d}$, and many eigenvectors fully localized on small sets of size $O(|V|\alpha)$. This strengthens the results of Ganguly-Srivastava, who constructed high girth (but not expanding) graphs with similar properties, and may be viewed as a discrete analogue of the "scarring" phenomenon observed in the study of quantum ergodicity on manifolds. Key ingredients in the proof are a technique of Kahale for bounding the growth rate of eigenfunctions of graphs, discovered in the context of vertex expansion and a method of Erd\H{o}s and Sachs for constructing high girth regular graphs.

Citations (18)

Summary

We haven't generated a summary for this paper yet.