Explicit near-fully X-Ramanujan graphs
From MaRDI portal
Publication:6348484
arXiv2009.02595MaRDI QIDQ6348484FDOQ6348484
Publication date: 5 September 2020
Abstract: Let be a self-adjoint noncommutative polynomial, with coefficients from , in the indeterminates (considered to be self-adjoint), the indeterminates , and their adjoints . Suppose are replaced by independent random matching matrices, and are replaced by independent random permutation matrices. Assuming for simplicity that 's coefficients are - matrices, the result can be thought of as a kind of random -vertex graph . As , there will be a natural limiting infinite graph that covers any finite outcome for . A recent landmark result of Bordenave and Collins shows that for any , with high probability the spectrum of a random will be -close in Hausdorff distance to the spectrum of (once the suitably defined "trivial" eigenvalues are excluded). We say that is "-near fully -Ramanujan". Our work has two contributions: First we study and clarify the class of infinite graphs that can arise in this way. Second, we derandomize the Bordenave-Collins result: for any , we provide explicit, arbitrarily large graphs that are covered by and that have (nontrivial) spectrum at Hausdorff distance at most from that of . This significantly generalizes the recent work of Mohanty et al., which provided explicit near-Ramanujan graphs for every degree (meaning -regular graphs with all nontrivial eigenvalues bounded in magnitude by ). As an application of our main technical theorem, we are also able to determine the "eigenvalue relaxation value" for a wide class of average-case degree- constraint satisfaction problems.
This page was built for publication: Explicit near-fully X-Ramanujan graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348484)