REVIEW 1 cited by
Explicit near-Ramanujan graphs of every degree
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
For every constant $d \geq 3$ and $\epsilon > 0$, we give a deterministic $\mathrm{poly}(n)$-time algorithm that outputs a $d$-regular graph on $\Theta(n)$ vertices that is $\epsilon$-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by $2\sqrt{d-1} + \epsilon$ (excluding the single trivial eigenvalue of~$d$).
Forward citations
Cited by 1 Pith paper
-
Parity families and a kernel-averaged L-function for near-Ramanujan signings
A parity-family averaging identity reduces the signed-spectral-radius problem to walk counting and yields claimed ε-versions of Bilu-Linial for dilute graphs, but the main theorems' final constant extraction is arithm...
Discussion (0). Continue with ORCID to comment.