Explicit near-Ramanujan graphs of every degree

09/16/2019
by   Sidhanth Mohanty, et al.
0

For every constant d ≥ 3 and ϵ > 0, we give a deterministic poly(n)-time algorithm that outputs a d-regular graph on Θ(n) vertices that is ϵ-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by 2√(d-1) + ϵ (excluding the single trivial eigenvalue of d).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2020

Spectrum preserving short cycle removal on regular graphs

We describe a new method to remove short cycles on regular graphs while ...
research
03/25/2020

Explicit expanders of every degree and size

An (n,d,λ)-graph is a d regular graph on n vertices in which the absolut...
research
09/05/2020

Explicit near-fully X-Ramanujan graphs

Let p(Y_1, …, Y_d, Z_1, …, Z_e) be a self-adjoint noncommutative polynom...
research
05/12/2020

Estimating the Cheeger constant using machine learning

In this paper, we use machine learning to show that the Cheeger constant...
research
01/12/2018

A fast new algorithm for weak graph regularity

We provide a deterministic algorithm that finds, in ϵ^-O(1) n^2 time, an...
research
04/22/2022

An Algorithm to Find Sums of Consecutive Powers of Primes

We present and analyze an algorithm to enumerate all integers n≤ x that ...
research
11/13/2019

On the Relativized Alon Second Eigenvalue Conjecture I: Main Theorems, Examples, and Outline of Proof

This is the first in a series of six articles devoted to showing that a ...

Please sign up or login with your details

Forgot password? Click here to reset