2016
DOI: 10.1051/ps/2016002
|View full text |Cite
|
Sign up to set email alerts
|

Negative dependence and stochastic orderings

Abstract: We explore negative dependence and stochastic orderings, showing that if an integer-valued random variable W satisfies a certain negative dependence assumption, then W is smaller (in the convex sense) than a Poisson variable of equal mean. Such W include those which may be written as a sum of totally negatively dependent indicators. This is generalised to other stochastic orderings. Applications include entropy bounds, Poisson approximation and concentration. The proof uses thinning and size-biasing. We also s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…In (ii), the lower bound is standard and the upper bound is from Theorem 1.1 of Daly and Johnson [14]. (iii) follows from Theorem 2.2 and Corollary 2.8 of Daly [13].…”
Section: Ordering Results For Cmp Distributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…In (ii), the lower bound is standard and the upper bound is from Theorem 1.1 of Daly and Johnson [14]. (iii) follows from Theorem 2.2 and Corollary 2.8 of Daly [13].…”
Section: Ordering Results For Cmp Distributionsmentioning
confidence: 99%
“…However, in the case ν < 1 we cannot adapt the proof of Theorem 1.1 of Daly and Johnson [14] to give an analogue of Proposition 2.12 (ii). By suitably modifying the proof of Theorem 2.2 of Daly [13], we may note that Z ≤ cx X in this case, where Z ∼ Po(µ). There is, however, no concentration inequality corresponding to that given in Proposition 2.12 (iii).…”
Section: Ordering Results For Cmp Distributionsmentioning
confidence: 99%
“…Property P3 provides a form of negative association. It is weaker than the usual form of negative association [which corresponds to the analogue of (3.2) with i and Λ \ {i} replaced by arbitrary disjoint subsets A, B ⊂ Λ], but stronger than other related notions, such as totally negative dependence (see [11] for this and other forms of negative dependence).…”
Section: A Representation Of Fields Satisfying (Fe) and (Fkg)mentioning
confidence: 94%
“…This is a stronger assumption than that P * is stochastically dominated by P (write P * ≤ st P ) -see [82] for a review of stochastic ordering results. As described in [34,35,75], such orderings naturally arise in many contexts where P is the mass function of a sum of negatively dependent random variables.…”
Section: Technical Definitions In the Discrete Casementioning
confidence: 99%
“…We would like to introduce concavity conditions mirroring Conditions 1 or 2, under which results of the form Theorem 5.4 and 5.5 can be proved for the derivative ∇ n of (25). In addition, it would be of interest to see whether a version of Theorem 5.5 holds under a stochastic ordering assumption P * ≤ st P , in the spirit of [34].…”
Section: [Concentration Inequalities]mentioning
confidence: 99%