Probabilities for Intersecting Systems and Random Subsets of Finite Sets

From MaRDI portal





Let \({\mathcal F}_ k\) be a family of subsets of \(\{\) 1,2,...,n\(\}\), each two of which have at least k elements in common, and let S be a random subset (sample) of \(\{\) 1,2,...,n\(\}\) obtained by choosing each \(i\leq n\) independently with probability \(p_ i\). Assuming that \(1>p_ 1\geq p_ 2\geq...\geq p_ n>0\), we investigate the problem of determining an \({\mathcal F}_ k\) that maximizes the probability that at least one of the sets in \({\mathcal F}_ k\) will be included in S. Complete solutions are obtained for the following cases: for \(k=1\), \(p_ i=p\) for all i, or variable \(p_ i\) with \(\geq p_ 2\) or \(p_ n>\); for \(k\geq 2\), \(p_ i=p\geq\) for all i, and small \(p_{k+1}\). A partial solution is given for \(k=2\) when \(p_ i=p\) for all i.











This page was built for publication: Probabilities for Intersecting Systems and Random Subsets of Finite Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3704664)