HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

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

Rasmus Kyng
Rasmus Kyng
Zhao Song
Zhao Song

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 373.0-384, 2018.

Cited by: 10|Bibtex|Views6|DOI:https://doi.org/10.1109/FOCS.2018.00043
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org
Keywords:
Matrix Chernoff boundsrandom spanning treesStrongly RayleighSpectral sparsifier

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 p...More

Code:

Data:

Your rating :
0

 

Tags
Comments