--- title: Conditional Negative Association url: https://www.emergentmind.com/topics/conditional-negative-association type: topic --- # Conditional Negative Association Conditional negative association (CNA) is a strengthening of negative association for measures on finite product spaces: after conditioning on any specified subset of coordinates, the remaining coordinates still satisfy the negative dependence inequality for increasing functions on disjoint coordinate blocks. In the material considered here, the clearest classical realization is Kahn and Neiman’s analysis of competing urns, where threshold urn measures are proved to be CNA and, in the i.i.d. placement case, the result extends to interval-valued occupancy variables [1001.0610]. ## 1. Formal definition and basic variants Let \(\mu\) be a probability measure on a finite product space \[ \Omega=\prod_{i=1}^n \Omega_i, \] where each \(\Omega_i\) is a chain. Two events \(A,B\) are negatively correlated, written \(A\downarrow B\), if \[ \Pr(A\cap B)\le \Pr(A)\Pr(B). \] For real-valued random variables \(X,Y\), the notation \(X\downarrow Y\) means \[ \{X\ge s\}\downarrow \{Y\ge t\}\qquad \forall s,t\in\mathbb R, \] equivalently, \[ \mathbb E[f(X)g(Y)]\le \mathbb E[f(X)]\,\mathbb E[g(Y)] \] for all increasing \(f,g:\mathbb R\to\mathbb R\) [1001.0610]. Negative association (NA) requires this inequality for increasing observables on disjoint coordinate sets. If \(A\) and \(B\) are increasing events depending on disjoint coordinate sets, then NA means \(A\downarrow B\). In the \(\{0,1\}^n\) setting, the weaker pairwise property is negative correlation (NC), namely \(\eta_i\downarrow \eta_j\) for all \(i\neq j\). Conditional negative association strengthens NA by requiring that every law obtained by conditioning on some coordinates remains NA. If \(X=(X_1,\dots,X_n)\), then CNA means that after conditioning on any event of the form \[ \{X_i=\xi_i \text{ for } i\in S\}, \] with positive probability, the remaining coordinates satisfy \[ \mathbb E[f(X)g(X)\mid X_S=\xi_S] \le \mathbb E[f(X)\mid X_S=\xi_S]\, \mathbb E[g(X)\mid X_S=\xi_S] \] for all increasing \(f,g\) depending on disjoint subsets of coordinates outside \(S\) [1001.0610]. Two nearby notions are standard. Conditional negative correlation (CNC) is the pairwise analogue of CNA. In the binary strong-Rayleigh literature, one also encounters a stronger closure notion denoted \(CNA+\): a measure is \(CNA\) if every measure obtained by conditioning on some coordinates is NA, and \(CNA+\) if every measure obtained by imposing external fields and projections is \(CNA\) [1803.09663]. ## 2. Competing urns as the canonical classical model The competing-urns model starts from a random map \[ \sigma:[m]=\{1,\dots,m\}\to[n]=\{1,\dots,n\}, \] where the variables \(\sigma(1),\dots,\sigma(m)\) are independent. In the ordinary model they are i.i.d.; in the generalized model they may have different laws. The occupancy count of urn \(j\) is \[ B_j = |\sigma^{-1}(j)|. \] Given thresholds \(t_1,\dots,t_n\), the threshold indicators are \[ x_j=\mathbf 1_{\{B_j\ge t_j\}}. \] More generally, for each \(j\), choose \[ 0=a_j(0) **Theorem 1.** Threshold urn measures are CNA. A stronger structural result yields it: > **Theorem 2.** If the \(\sigma(i)\)’s are i.i.d. then the \(x_j\)’s in the interval-valued construction above are CNA. Accordingly, the final CNA conclusion is not restricted to exceedance indicators \(x_j=\mathbf 1_{\{B_j\ge t_j\}}\); in the i.i.d. case it holds for interval-valued occupancy discretizations as well. At the same time, the generalized independent-but-nonidentical model is handled only partially: several monotonicity and log-concavity statements are established there, implying CNC and NA in various forms, but not full CNA. Whether generalized urn, threshold urn, or interval urn measures are CNA is left open as Question 13 [1001.0610]. This model isolates the central difficulty of CNA. The hard identity \(\sum_j B_j=m\) makes global competition obvious, but CNA asks whether that antagonism survives coarse thresholding and arbitrary coordinate conditioning. The urn theorems show that, in the i.i.d. setting, it does. ## 3. Reduction to two-block antitonicity The proof of CNA in competing urns is organized around a two-block conditional negative correlation statement. Partition the urn set as \(I\cup J\cup K\), fix interval values \(t_j\) for \(j\in K\), and condition on \[ Q:=\{x_j(\sigma)=t_j \ \forall j\in K\} = \{a_j(t_j)\le B_j0\}. \] These two facts imply that \(Y\) is stochastically decreasing in \(X\), hence \(X\downarrow Y\) given \(Q\) [1001.0610]. A second aggregate variable, \[ Z=|\sigma^{-1}(I\cup J)|, \] becomes decisive in the i.i.d. case. Conditional on \(Z\), \[ X\sim \mathrm{Bin}(Z,\alpha),\qquad Y=Z-X, \] where \(\alpha\) is the total probability of landing in \(I\) relative to \(I\cup J\). Thus sufficient log-concavity of the law of \(Z\) forces antagonism between \(X\) and \(Y\). The paper proves that the law of \(Z\) is strongly log-concave and strengthens this further to ultra-log-concavity, which in the i.i.d. case closes the argument from two-block antitonicity to full CNA [1001.0610]. ## 4. Structural inequalities, support convexity, and graph orientations The inductive engine behind the urn results is Theorem 4. Singling out \(B_n\), define \[ p(k,a,b)=\Pr(B_n=k\mid B_j\in[a_j,b_j]\ \forall j\in[n-1]). \] Then the theorem states: - \(\displaystyle \frac{p(k+1,a,b)}{p(k,a,b)}\) is nonincreasing in \((a,b)\); - \(\displaystyle \frac{p(k+1,a,b)}{p(k,a,b)}\le \frac{k}{k+1}\frac{p(k,a,b)}{p(k-1,a,b)}.\) Part (b) says precisely that \(k\mapsto p(k,a,b)\) is strongly log-concave. Part (a) is the occupancy-ratio monotonicity from which the two-block comparison is derived. The proof uses induction on the number of balls, together with the decomposition \[ \Pr(B_i=k+1,Q)=\frac1{k+1}\sum_{l\in[m]}\gamma_{li}\Pr^{[m]\setminus\{l\}}(B_i=k,Q), \] for any event \(Q\) determined by the occupancies of urns other than \(i\), and the elementary ratio bound \[ \min_i \frac{\alpha_i}{\beta_i} \le \frac{\alpha_1+\cdots+\alpha_k}{\beta_1+\cdots+\beta_k} \le \max_i \frac{\alpha_i}{\beta_i}. \] A support-convexity proposition then removes the possibility of internal gaps [1001.0610]. That support-convexity proposition is itself graph-theoretic. If two realizations \(\sigma,\tau\) have positive probability and one urn receives more balls under \(\sigma\) than under \(\tau\), an alternating-path rerouting in the bipartite incidence graph of balls and urns moves one ball while staying inside the support. The consequence is convexity of the support of occupancy vectors under interval constraints [1001.0610]. A separate combinatorial pillar is Lemma 8 on graph orientations. For a multigraph \(G\) on vertex set \(V\), let \(\mathcal O(a,b)\) be the set of orientations satisfying \[ d^+(x)\ge a_x,\qquad d^-(x)\ge b_x\qquad \forall x\in V, \] and let \(N(a,b)=|\mathcal O(a,b)|\). If \(a,b,r,s\in\mathbb N^V\) satisfy \[ a\ge r,s \quad\text{and}\quad a+b\ge r+s, \] then \[ N(a,b)\le N(r,s). \] The lemma is used in three ways: to give another proof of the ratio inequalities; to upgrade strong log-concavity to ultra-log-concavity for the law of \(Z\); and to yield a negative lattice condition \[ f(A\cup B)f(A\cap B)\le f(A)f(B) \] for certain occupancy-derived set functions. The same orientation argument also gives \[ N(a,b)N(r,s)\ge N(a\vee r,b\wedge s)\,N(a\wedge r,b\vee s) \] when \(a+b=r+s\), and Theorem 12 proves ultra-log-concavity for the number of valid partial \(G\)-maps under lower and upper degree constraints [1001.0610]. These results show that CNA in competing urns is not derived from a single covariance estimate. It rests on a combination of interval-conditioned occupancy ratios, convex support geometry, and a graph-orientation monotonicity principle. ## 5. Relation to adjacent negative-dependence frameworks The urn results sit within a broader hierarchy of negative dependence notions. In the same competing-urns setting, Dubhashi and Ranjan had already shown that the finer placement indicators \[ \xi_{ij}=\mathbf 1_{\{\sigma(i)=j\}} \] are NA even for nonidentical balls. That implies NA for generalized threshold urn measures, since threshold events are increasing functions of disjoint blocks of the \(\xi_{ij}\)’s. What it does not give is CNA after fixing some threshold coordinates, because conditioning destroys the block-product structure. The contribution of Kahn and Neiman is precisely to control that conditional behavior [1001.0610]. Other negative-dependence frameworks give comparison points rather than direct CNA theorems. Pairwise counter-monotonicity is an extremal dependence structure under which every pair of coordinates is counter-monotonic; it implies NA because increasing functions of disjoint coordinate blocks remain pairwise counter-monotonic, after which the Fréchet–Hoeffding inequality yields the covariance bound. That work does not define or study CNA, but it clarifies one route by which strong sample-path antagonism can imply ordinary NA [2302.11701]. In sequential Monte Carlo, a closely related but different pattern appears. The resampling analysis of offspring counts is carried out conditionally on the current particle system, and the main consistency theorem assumes that for every fixed input \(z\), the count vector \((\#^n(U,z))_{n=1}^N\) is NA. This is a fiberwise, conditional-on-the-input NA hypothesis rather than an abstract closure theorem saying that NA is preserved under conditioning [1707.01845]. Algorithmic dependent rounding exhibits yet another variant. For the dependent-rounding output \(Y=(Y_1,\dots,Y_m)\), the appendix of the harmonic \(k\)-median / minimization-PAV paper defines CNA explicitly by requiring that \[ (Y_{[m]\setminus S}\mid Y_S=a) \] be NA for every subset \(S\) and assignment \(a\). It further explains that carefully implemented dependent rounding on a fixed tournament tree yields NA/CNA, while the paper’s own analysis uses a weaker binary negative association property to obtain concentration for conditional random variables [1704.02183]. For random measures and point processes, finite-dimensional NA of disjoint count vectors implies NA of the full random measure, and NA is preserved under weak convergence. That framework is technically important for extending NA beyond finite coordinate systems, but it does not itself develop a point-process theory of CNA; the only explicit CNA terminology there comes from cited binary-measure results in the strong-Rayleigh setting [1903.06004]. ## 6. Scope, limitations, conjectures, and terminological ambiguities The principal scope limitation in the competing-urns theory is the nonidentical-ball case. Full CNA is proved only when the placements are i.i.d. The ratio inequalities, support convexity, and strong log-concavity statements survive for independent nonidentically distributed balls, and they imply several conditional negative dependence properties, including CNC and interval-conditioned monotonicity, but the final step to CNA relies on the i.i.d. binomial splitting of \((X,Y)\) given \(Z\) [1001.0610]. This gap is tied to several open conjectural relations. The paper asks whether generalized urn, generalized threshold urn, or generalized interval urn measures are CNA. It also notes that a negative answer would disprove a conjecture of Pemantle that CNC implies CNA. Conversely, Theorem 1 provides a natural counterexample to the conjecture “CNA implies ULC,” because ordinary urn measures are not always ULC even though threshold urn measures are CNA [1001.0610]. The same paper also situates CNA among older conjectures of Farr and Welsh. For a decreasing family \(I\subseteq 2^{[m]}\), with \[ A_j=\{\sigma^{-1}(j)\in I\}, \] Farr conjectured conditional negative correlation for a graph-independent-set family \(I\), and Welsh conjectured the same for arbitrary decreasing \(I\). Kahn and Neiman give a counterexample to Welsh’s stronger claim. This does not conflict with the urn CNA theorem because the events \(A_j\) in that counterexample are far more general than threshold occupancy events [1001.0610]. A separate source of confusion is terminological. In association-rule mining, “conditional negative association” can refer informally to rules such as \[ A\rightarrow \neg B \] with large \[ \operatorname{conf}(A\rightarrow \neg B)=\frac{\operatorname{supp}(A\cup \neg B)}{\operatorname{supp}(A)}, \] together with support and interest thresholds. That usage concerns infrequent itemsets and dependence from transactional data; it is not the probabilistic CNA property on product measures [1806.07084]. Likewise, work on quantum channels that destroy negative conditional entropy studies the quantum-information-theoretic condition \[ S(A|B)_\rho<0, \] which is unrelated to classical negative association despite the similar phrase “negative conditional” [2311.15705]. In its classical probabilistic meaning, CNA is therefore best understood as a conditioning-stable form of NA. The competing-urns results show that this stability can be proved in a nontrivial occupancy model by combining interval-conditioned stochastic antitonicity, strong log-concavity, and graph-theoretic monotonicity, while the surrounding literature makes clear that neither unconditional NA nor other adjacent negative-dependence notions automatically provide such a conditioning-stable theory [1001.0610]. Source: https://www.emergentmind.com/topics/conditional-negative-association