A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees

TL;DR

This paper introduces a new matrix Chernoff bound for Strongly Rayleigh distributions and demonstrates that a small number of random spanning trees suffice to produce spectral sparsifiers, advancing graph sparsification techniques.

Contribution

The authors prove a novel matrix Chernoff bound for Strongly Rayleigh distributions and show that spectral sparsifiers can be constructed from few random spanning trees, answering an open question.

Findings

Adding $ ext{O}(rac{1}{ ext{ extepsilon}^2} ext{log}^2 n)$ random spanning trees yields spectral sparsifiers.

A single random spanning tree's Laplacian is bounded by $ ext{O}( ext{log} n)$ times the original graph Laplacian.

Lower bounds indicate the necessity of $ ext{O}(rac{1}{ ext{ extepsilon}^2} ext{log} n)$ spanning trees for spectral sparsification.

Abstract

Strongly Rayleigh distributions are a class of negatively dependent distributions of binary-valued random variables [Borcea, Branden, Liggett JAMS 09]. Recently, these distributions have played a crucial role in the analysis of algorithms for fundamental graph problems, e.g. Traveling Salesman Problem [Gharan, Saberi, Singh FOCS 11]. We prove a new matrix Chernoff bound for Strongly Rayleigh distributions. As an immediate application, we show that adding together the Laplacians of $\epsilon^{-2} \log^2 n$ random spanning trees gives an $(1\pm \epsilon)$ spectral sparsifiers of graph Laplacians with high probability. Thus, we positively answer an open question posed in [Baston, Spielman, Srivastava, Teng JACM 13]. Our number of spanning trees for spectral sparsifier matches the number of spanning trees required to obtain a cut sparsifier in [Fung, Hariharan, Harvey, Panigraphi STOC 11]. The previous best result was by naively applying a classical matrix Chernoff bound which requires $\epsilon^{-2} n \log n$ spanning trees. For the tree averaging procedure to agree with the original graph Laplacian in expectation, each edge of the tree should be reweighted by the inverse of the edge leverage score in the original graph. We also show that when using this reweighting of the edges, the Laplacian of single random tree is bounded above in the PSD order by the original graph Laplacian times a factor $\log n$ with high probability, i.e. $L_T \preceq O(\log n) L_G$. We show a lower bound that almost matches our last result, namely that in some graphs, with high probability, the random spanning tree is $\it{not}$ bounded above in the spectral order by $\frac{\log n}{\log\log n}$ times the original graph Laplacian. We also show a lower bound that in $\epsilon^{-2} \log n$ spanning trees are necessary to get a $(1\pm \epsilon)$ spectral sparsifier.