Negative dependence and srinivasan's sampling process

Authors:
Josh brown Kramer;Jonathan Cutler;A. j. Radcliffe
Affiliations:
Department of mathematics and computer science department, illinois wesleyan university, bloomington, il, usa (e-mail: jbrownkr@iwu.edu);Department of mathematical sciences, montclair state university, montclair, nj, usa (e-mail: jonathan.cutler@montclair.edu);Department of mathematics, university of nebraska–lincoln, lincoln, ne, usa (e-mail: aradcliffe1@math.unl.edu)
Venue:
Combinatorics, Probability and Computing
Year:
2011

Citing 7
Cited 0

Balanced matroids

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Balls and bins: a study in negative dependence

Random Structures & Algorithms
Distributions on Level-Sets with Applications to Approximation Algorithms

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Proof of the Van den Berg–Kesten Conjecture

Combinatorics, Probability and Computing
Negative association in uniform forests and connected graphs

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Positive Influence and Negative Dependence

Combinatorics, Probability and Computing
Negative correlation in graphs and matroids

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dubhashi, Jonasson and Ranjan Dubhashi, Jonasson and Ranjan (2007) study the negative dependence properties of Srinivasan's sampling processes (SSPs), random processes which sample sets of a fixed size with prescribed marginals. In particular they prove that linear SSPs have conditional negative association, by using the Feder–Mihail theorem and a coupling argument. We consider a broader class of SSPs that we call tournament SSPs (TSSPs). These have a tree-like structure and we prove that they have conditional negative association. Our approach is completely different from that of Dubhashi, Jonasson and Ranjan. We give an abstract characterization of TSSPs, and use this to deduce that certain conditioned TSSPs are themselves TSSPs. We show that TSSPs have negative association, and hence conditional negative association. We also give an example of an SSP that does not have negative association.