The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP

Marcus, Spielman, and Srivastava in their seminal work \cite{MSS13} resolved the Kadison-Singer conjecture by proving that for any set of finitely supported independently distributed random vectors $v_1,\dots, v_n$ which have "small" expected squared norm and are in isotropic position (in expectation), there is a positive probability that the sum $\sum v_i v_i^\intercal$ has small spectral norm. Their proof crucially employs real stability of polynomials which is the natural generalization of real-rootedness to multivariate polynomials. Strongly Rayleigh distributions are families of probability distributions whose generating polynomials are real stable \cite{BBL09}. As independent distributions are just special cases of strongly Rayleigh measures, it is a natural question to see if the main theorem of \cite{MSS13} can be extended to families of vectors assigned to the elements of a strongly Rayleigh distribution. In this paper we answer this question affirmatively; we show that for any homogeneous strongly Rayleigh distribution where the marginal probabilities are upper bounded by $\epsilon_1$ and any isotropic set of vectors assigned to the underlying elements whose norms are at most $\sqrt{\epsilon_2}$, there is a set in the support of the distribution such that the spectral norm of the sum of the natural quadratic forms of the vectors assigned to the elements of the set is at most $O(\epsilon_1+\epsilon_2)$. We employ our theorem to provide a sufficient condition for the existence of spectrally thin trees. This, together with a recent work of the authors \cite{AO14}, provides an improved upper bound on the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem.

[1]  D. Wagner,et al.  Multivariate stable polynomials: theory and applications , 2009, 0911.3569.

[2]  Mohit Singh,et al.  Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.

[3]  Michel X. Goemans,et al.  Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[4]  Jean-Pierre Dedieu,et al.  Obreschkoff's theorem revisited: what convex sets are contained in the set of hyperbolic polynomials? , 1992 .

[5]  Proceedings of the London Mathematical Society , 1877, Nature.

[6]  D. Spielman,et al.  Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem , 2013, 1306.3969.

[7]  Nicholas Weaver The Kadison-Singer problem in discrepancy theory , 2004, Discret. Math..

[8]  Mohit Singh,et al.  Entropy, optimization and counting , 2013, STOC.

[9]  Nima Anari,et al.  Effective-Resistance-Reducing Flows and Asymmetric TSP , 2014, ArXiv.

[10]  J. Borcea,et al.  Applications of stable polynomials to mixed determinants: Johnson's conjectures, unimodality, and symmetrized Fischer products , 2006, math/0607755.

[11]  Mohit Singh,et al.  A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[12]  Neil Olver,et al.  Pipage Rounding, Pessimistic Estimators and Matrix Concentration , 2013, SODA.

[13]  Amin Saberi,et al.  An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.

[14]  Nikhil Srivastava,et al.  Twice-ramanujan sparsifiers , 2008, STOC '09.

[15]  Julius Borcea,et al.  Multivariate Pólya–Schur classification problems in the Weyl algebra , 2006, math/0606360.

[16]  C. Nash-Williams Edge-disjoint spanning trees of finite graphs , 1961 .

[17]  Amin Saberi,et al.  The asymmetric traveling salesman problem on graphs with bounded genus , 2009, SODA '11.

[18]  T. Liggett,et al.  Negative dependence and the geometry of polynomials , 2007, 0707.2340.

[19]  I. Singer,et al.  EXTENSIONS OF PURE STATES. , 1959 .

[20]  Nikhil Srivastava,et al.  Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[21]  Jstor,et al.  Proceedings of the American Mathematical Society , 1950 .

[22]  A. Lewis,et al.  The lax conjecture is true , 2003, math/0304104.

[23]  G. Winskel What Is Discrete Mathematics , 2007 .

[24]  Yuval Peres,et al.  Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures , 2011, Combinatorics, Probability and Computing.

[25]  American Journal of Mathematics , 1886, Nature.