Negative dependence and Srinivasan's sampling process

Josh Brown Kramer, Jonathan Cutler, A. J. Radcliffe

Research output: Contribution to journalArticle

8 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)347-361
Number of pages15
JournalCombinatorics Probability and Computing
Volume20
Issue number3
DOIs
StatePublished - 1 May 2011

Fingerprint

Negative Dependence
Negative Association
Tournament
Sampling
Random process
Random processes
Deduce
Theorem

Cite this

Kramer, Josh Brown ; Cutler, Jonathan ; Radcliffe, A. J. / Negative dependence and Srinivasan's sampling process. In: Combinatorics Probability and Computing. 2011 ; Vol. 20, No. 3. pp. 347-361.
@article{6233b68dee4d489a8a1df223c066ad59,
title = "Negative dependence and Srinivasan's sampling process",
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.",
author = "Kramer, {Josh Brown} and Jonathan Cutler and Radcliffe, {A. J.}",
year = "2011",
month = "5",
day = "1",
doi = "10.1017/S0963548311000095",
language = "English",
volume = "20",
pages = "347--361",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "3",

}

Negative dependence and Srinivasan's sampling process. / Kramer, Josh Brown; Cutler, Jonathan; Radcliffe, A. J.

In: Combinatorics Probability and Computing, Vol. 20, No. 3, 01.05.2011, p. 347-361.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Negative dependence and Srinivasan's sampling process

AU - Kramer, Josh Brown

AU - Cutler, Jonathan

AU - Radcliffe, A. J.

PY - 2011/5/1

Y1 - 2011/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80054926748&partnerID=8YFLogxK

U2 - 10.1017/S0963548311000095

DO - 10.1017/S0963548311000095

M3 - Article

AN - SCOPUS:80054926748

VL - 20

SP - 347

EP - 361

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 3

ER -