Spectrally indistinguishable pseudorandom graphs
Combinatorics
2025-11-27 v1 Discrete Mathematics
Number Theory
Abstract
We construct explicit families of graphs whose eigenvalues are asymptotically distributed according to Wigner's semicircle law; in other words, that are spectrally indistinguishable from random graphs. However, in other respects they are strikingly dissimilar from random graphs; for example, they are -free graphs with almost the maximum possible edge density.
Cite
@article{arxiv.2511.21351,
title = {Spectrally indistinguishable pseudorandom graphs},
author = {Arthur Forey and Javier Fresán and Emmanuel Kowalski and Yuval Wigderson},
journal= {arXiv preprint arXiv:2511.21351},
year = {2025}
}
Comments
v1; 23 pages