Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

We have a string consisting $n$ $1$s and $m$ $0$s. Consider a random permutation of the string. The $1$s divide all $0$s into $n+1$ consecutive pieces (including those of length $0$). Let r.v. $X_i$ be the length of the $i$th piece. For example, in $01000110$, we have $X_1=1$, $X_2=3$, $X_3=0$, $X_4=1$. My question is whether r.v.s $X_i$ are negatively associated/regressive? I couldn't find any ref on this but I think this might have been looked at before. Thanks a lot.

share|improve this question
Isn’t it straightforward? I think that it is easy to show that if i≠j and t≤t′, then Pr[Xi≥s | Xj=t] ≥ Pr[Xi≥s | Xj=t′], and that this implies that any two random variables in X1,…,X(n+1) are negatively correlated. –  Tsuyoshi Ito Jul 15 '11 at 18:18
this is also out of scope for cstheory (see the faq). Try: stats.stackexchange.com –  Artem Kaznatcheev Jul 16 '11 at 18:05
add comment

migrated from cstheory.stackexchange.com Aug 3 '11 at 6:04

This question came from our site for theoretical computer scientists and researchers in related fields.

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.