Pith. sign in

REVIEW 1 cited by

Concentration of Lipschitz functionals of determinantal and other strong Rayleigh measures

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1108.0687 v3 pith:644C42FU submitted 2011-08-02 math.PR

classification math.PR
keywords concentrationmeasuresdeterminantalinequalitylipschitzrayleighstrongfunctionals
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Diffusive Speed Limits for U(1)-Covariant Quantum Error Correction

    quant-ph 2026-08 conditional novelty 8.0 of 10

    U(1)-covariant adjacent-charge encoders have an exact n^{-1/2} optimal flagged-erasure error, and the studied local-Haar brickwork circuits cannot reach it before Omega(n^2) cycles.

Pith tools