2017
DOI: 10.1080/10586458.2017.1403982
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Chaos on Random Cayley Graphs of SL 2[Z/pZ]

Abstract: We investigate the statistical behavior of the eigenvalues and diameter of random Cayley graphs of SL 2 [Z/pZ] as the prime number p goes to infinity. We prove a density theorem for the number of exceptional eigenvalues of random Cayley graphs i.e. the eigenvalues with absolute value bigger than the optimal spectral bound. Our numerical results suggest that random Cayley graphs of SL 2 [Z/pZ] and the explicit LPS Ramanujan projective graphs of P 1 (Z/pZ) have optimal spectral gap and diameter as the prime numb… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
9
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 24 publications
(29 reference statements)
3
9
0
Order By: Relevance
“…Remark 1.5. In [Sar18,RS17], we demonstrated some numerical experiments on the diameter of the LPS Ramanujan graphs X p,m , which shows that their diameter is asymptotically (4/3) log p |X p,m |. In our experiments, p is fixed and m is growing.…”
Section: Introductionmentioning
confidence: 89%
“…Remark 1.5. In [Sar18,RS17], we demonstrated some numerical experiments on the diameter of the LPS Ramanujan graphs X p,m , which shows that their diameter is asymptotically (4/3) log p |X p,m |. In our experiments, p is fixed and m is growing.…”
Section: Introductionmentioning
confidence: 89%
“…However it is plausible that they are in fact almost Ramanujan, in the sense that for each > 0 with very high probability as p → +∞ all non-trivial eigenvalues are bounded by 2 √ k − 1+ . See [RS17] where an upper bound on the number of exceptional eigenvalues is established and numerics are given. The same could be said of the family of alternating groups Alt(n) (and perhaps even of the full family of all finite simple groups).…”
Section: This Is Still Widely Open the Best Results As Of Now Ismentioning
confidence: 99%
“…It is known that random d-regular graphs form a sequence of expander graphs, close to being Ramanujan [15]. For possible Cayley graph examples with diameter close to log d´1 n see [42][Section 4.1], who provide a numerical evidence that the diameter of SLp2, Z{pZq, with respect to a random generating set on d generators is close to ln d´1 n, as p Ñ 8.…”
Section: Weak Expansion and Infinite Order Breakpointmentioning
confidence: 99%