Concentration of Lipschitz functionals of determinantal and other strong Rayleigh measures

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a concentration inequality generalizing the classical Gaussian concentration inequality for sums of independent Bernoullis: P (S_n - E S_n > a) < exp (-2 a^2 / n). The class of strong Rayleigh measures includes determinantal measures, weighted uniform matroids and exclusion measures; some familiar examples from these classes are generalized negative binomials and spanning tree measures. For instance, the number of vertices of odd degree in a uniform random spanning tree of a graph satisfies a Gaussian concentration inequality with n replaced by |V|, the number of vertices. We also prove a continuous version for concentration of Lipschitz functionals of a determinantal point process.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Concentration of Lipschitz functionals of determinantal and other strong Rayleigh measures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Concentration of Lipschitz functionals of determinantal and other strong Rayleigh measures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concentration of Lipschitz functionals of determinantal and other strong Rayleigh measures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-662614

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.