New norm bounds for graph matrices on random d-regular graphs are proven, yielding a stated switch of Sum-of-Squares lower bounds from Erdős-Rényi to regular graphs, with the switch proof deferred.
Verification of Non-trivial Middle Shapes Let us first unpack the lemma statement for the reader
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Switching Graph Matrix Norm Bounds: from i.i.d. to Random Regular Graphs
New norm bounds for graph matrices on random d-regular graphs are proven, yielding a stated switch of Sum-of-Squares lower bounds from Erdős-Rényi to regular graphs, with the switch proof deferred.