On Some Weak Positive Dependence Notions

A random vector $\b{X} = (X_1,\cdots,X_n)$ is weakly associated if and only if for every pair of partitions $\b{X}_1 = (X_{\pi(1)},\cdots,X_{\pi(k)}), \b{X}_2 = (X_{\pi(k+1),\cdots,X_{\pi(n)})$ of $\b{X}, P(\b{X}_1 \in A, \b{X}_2 \in B) \geq P(\b{X}_1 \in A)\b{P}(\b{X}_2 \in B)$ whenever A and B are open upper sets and $\pi$ is a permutation of ${1,\cdots,n}$. In this paper, we develop notions of weak positive dependence, which are weaker than a positive version of negative association (weak association) but stronger than positive orthant dependence by arguments similar to those of Shaked. We also illustrate some concepts of a particular interest. Various properties and interrelationships are derived.