{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:42Z","timestamp":1763468022345},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2011,2,22]],"date-time":"2011-02-22T00:00:00Z","timestamp":1298332800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p>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\u2013Mihail 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.<\/jats:p>","DOI":"10.1017\/s0963548311000095","type":"journal-article","created":{"date-parts":[[2011,2,22]],"date-time":"2011-02-22T09:46:30Z","timestamp":1298367990000},"page":"347-361","source":"Crossref","is-referenced-by-count":5,"title":["Negative Dependence and Srinivasan's Sampling Process"],"prefix":"10.1017","volume":"20","author":[{"given":"JOSH BROWN","family":"KRAMER","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JONATHAN","family":"CUTLER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"RADCLIFFE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,2,22]]},"reference":[{"key":"S0963548311000095_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399004113"},{"key":"S0963548311000095_ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346079"},{"key":"S0963548311000095_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306007772"},{"key":"S0963548311000095_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129716"},{"key":"S0963548311000095_ref9","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/SFCS.2001.959935","volume-title":"42nd IEEE Symposium on Foundations of Computer Science","author":"Srinivasan","year":"2001"},{"key":"S0963548311000095_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008978"},{"key":"S0963548311000095_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200029326"},{"key":"S0963548311000095_ref2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M"},{"key":"S0963548311000095_ref4","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20012"},{"key":"S0963548311000095_ref6","doi-asserted-by":"publisher","DOI":"10.1063\/1.533200"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548311000095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T08:46:55Z","timestamp":1556354815000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548311000095\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,22]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["S0963548311000095"],"URL":"https:\/\/doi.org\/10.1017\/s0963548311000095","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,22]]}}}