### Skapa referens, olika format (klipp och klistra)

**Harvard**

Jonasson, J. (2013) *The BK inequality for pivotal sampling a.k.a. the Srinivasan sampling process*.

** BibTeX **

@article{

Jonasson2013,

author={Jonasson, Johan},

title={The BK inequality for pivotal sampling a.k.a. the Srinivasan sampling process},

journal={Electronic Communications in Probability},

issn={1083-589X},

volume={18},

issue={artikel nr 35},

pages={1-6},

abstract={The pivotal sampling algorithm, a.k.a. the Srinivasan sampling process, is a simply described recursive algorithm for sampling from a finite population a fixed number of items such that each item is included in the sample with a prescribed desired inclusion probability.The algorithm has attracted quite some interest in recent years due to the fact that despite its simplicity, it has been shown to satisfy strong properties of negative dependence, e.g. conditional negative association.In this paper it is shown that (tree-ordered) pivotal/Srinivasan sampling also satisfies the BK inequality.This is done via a mapping from increasing sets of samples to sets of match sequencesand an application of the van den Berg-Kesten-Reimer inequality.The result is one of only very few non-trivial situations where the BK inequality is known to hold.},

year={2013},

keywords={Srinivasan sampling, negative association, Reimer's inequality, LaTeX, negative dependence },

}

** RefWorks **

RT Journal Article

SR Electronic

ID 179406

A1 Jonasson, Johan

T1 The BK inequality for pivotal sampling a.k.a. the Srinivasan sampling process

YR 2013

JF Electronic Communications in Probability

SN 1083-589X

VO 18

IS artikel nr 35

SP 1

OP 6

AB The pivotal sampling algorithm, a.k.a. the Srinivasan sampling process, is a simply described recursive algorithm for sampling from a finite population a fixed number of items such that each item is included in the sample with a prescribed desired inclusion probability.The algorithm has attracted quite some interest in recent years due to the fact that despite its simplicity, it has been shown to satisfy strong properties of negative dependence, e.g. conditional negative association.In this paper it is shown that (tree-ordered) pivotal/Srinivasan sampling also satisfies the BK inequality.This is done via a mapping from increasing sets of samples to sets of match sequencesand an application of the van den Berg-Kesten-Reimer inequality.The result is one of only very few non-trivial situations where the BK inequality is known to hold.

LA eng

DO 10.1214/ECP.v18-2045

LK http://publications.lib.chalmers.se/records/fulltext/179406/local_179406.pdf

LK http://dx.doi.org/10.1214/ECP.v18-2045

OL 30