Explicit near-fully X-Ramanujan graphs

@article{ODonnell2020ExplicitNX,
  title={Explicit near-fully X-Ramanujan graphs},
  author={R. O'Donnell and Xinyu Wu},
  journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2020},
  pages={1045-1056}
}
  • R. O'Donnell, Xinyu Wu
  • Published 2020
  • Mathematics, Computer Science
  • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
Let p(Y1, …, Yd, Z1, …, Ze) be a self-adjoint noncommutative polynomial, with coefficients from $\mathrm{C}^{\mathrm{r}\times \mathrm{r}}$, in the indeterminates Y1,…, Yd (considered to be self-adjoint), the indeterminates Z1, …, Ze, and their adjoints Z1*, …, Ze*. Suppose Y1, …, Yd are replaced by independent random n x n matching matrices, and Z1, …, Ze are replaced by independent random n x n permutation matrices. Assuming for simplicity that p's coefficients are 0–1 matrices, the result can… Expand
7 Citations

Figures from this paper

$\ell_p$-Spread Properties of Sparse Matrices
Random subspaces of R= of dimension proportional to = are, with high probability, wellspread with respect to the l?-norm (for ? ∈ [1, 2]). Namely, every nonzero G ∈ is “robustly non-sparse” in theExpand
The metric relaxation for 0-extension admits an Ω(log2/3k) gap
TLDR
This work presents an improved integrality gap of Ω(log2/3k) for the metric relaxation, based on the randomized extension of one graph by another, a notion that captures lifts of graphs as a special case and might be of independent interest. Expand
𝓁p-Spread Properties of Sparse Matrices
Random subspaces of R= of dimension proportional to = are, with high probability, wellspread with respect to the l?-norm (for ? ∈ [1, 2]). Namely, every nonzero G ∈ is “robustly non-sparse” in theExpand
Computational phase transitions in sparse planted problems?
TLDR
This work investigates the predictions made by the cavity method for the algorithmic problems of detecting and recovering a planted signal in a general model of sparse random graphs and proposes rigorous algorithms based on the spectra of matrices that arise as the derivatives of the belief propagation update rule. Expand
On statistical inference when fixed points of belief propagation are unstable
TLDR
This work considers a general model of statistical inference problems that includes both community detection in stochastic block models, and all planted constraint satisfaction problems as special cases, and devise a spectral algorithm based on the spectra of a matrix that arises as the derivatives of the belief propagation update rule. Expand
The SDP value of random 2CSPs
TLDR
This work shows that the SDP optimum of a random n-variable instance is (when normalized by n) in the range (sM−, sM+ ) with high probability. Expand
Table of Contents
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity 24 Susanna de Rezende (Institute of Mathematics of the Czech Academy of Sciences, Czech Republic), Or Meir (University ofExpand

References

SHOWING 1-10 OF 107 REFERENCES
X-Ramanujan Graphs
TLDR
The existence of infinitely many k-quasi-X-Ramanujan graphs for a variety of infinite $X need not be a tree and all of its roots have magnitude at most $\rho(\mathsf{AddProd}(A_1, \dots, A_c))). Expand
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
TLDR
It is shown that every graph of maximal degree d has a 2-lift such that all “new” eigenvalues are in the range, leading to a deterministic polynomial time algorithm for constructing arbitrarily large d-regular graphs, with second eigenvalue O(d/α)+1. Expand
Group-invariant Percolation on Graphs
Abstract. Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability and unimodularity, to properties of G-invariant percolation processesExpand
Bounds on Gromov hyperbolicity constant in graphs
If X is a geodesic metric space and x1,x2,x3 ∈ X, a geodesic triangleT = {x1,x2,x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in the GromovExpand
Ramanujan Graphs
In the last two decades, the theory of Ramanujan graphs has gained prominence primarily for two reasons. First, from a practical viewpoint, these graphs resolve an extremal problem in communicationExpand
Eigenvalues of random lifts and polynomial of random permutations matrices
Consider a finite sequence of independent random permutations, chosen uniformly either among all permutations or among all matchings on n points. We show that, in probability, as n goes to infinity,Expand
Hyperbolic graphs for free products, and the Gromov boundary of the graph of cyclic splittings
We define analogues of the graphs of free splittings and of (maximally-)cyclic splittings of $F_N$ for free products of groups, and show their hyperbolicity. Given a countable group $G$ which splitsExpand
Relative expanders or weakly relatively Ramanujan graphs
Let G be a fixed graph with largest (adjacency matrix) eigenvalue λ0 and with its universal cover having spectral radius ρ. We show that a random cover of large degree over G has its “new”Expand
Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q
TLDR
For any prime power q, explicit constructions for many infinite linear families of q + 1 regular Ramanujan graphs are given as Cayley graphs of PGL2 or PSL2 over finite fields, with respect to very simple generators. Expand
Hyperbolicity and Chordality of a Graph
TLDR
The Brinkmann, Koolen and Moulton find that every $3$-chordal graph is $1$-hyperbolic and that graph is not $\frac{1}{2}$-Hyperbolic if and only if it contains one of two special graphs as an isometric subgraph. Expand
...
1
2
3
4
5
...