9 citations · 18 across the 10 of their papers we have counts for
4 papers · 1 filter
A Complete Linear Programming Hierarchy for Linear Codes
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
A longstanding open problem in coding theory is to determine the best (asymptotic) rate of binary codes with minimum constant (relative) distance . An existential lower…
Sum-of-Squares Lower Bounds for Sparse Independent Set
Chris Jones, Aaron Potechin, Goutham Rajendran +2
The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems.…
Almost-Orthogonal Bases for Inner Product Polynomials
Chris Jones, Aaron Potechin
In this paper, we consider low-degree polynomials of inner products between a collection of random vectors. We give an almost orthogonal basis for this vector space of polynomials…
Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness
Chris Jones, Karoline Wiesner
It is often claimed that the entropy of a network's degree distribution is a proxy for its robustness. Here, we clarify the link between degree distribution entropy and giant compo…