Pair Independence Ratio Analysis

• Pair Independence Ratio is a metric quantifying the extent of independence between pairs in probability, graph theory, and data analysis using precise bounds and methods.
• It compares marginal probabilities, graph independence numbers, and attribute correlations to yield tighter performance guarantees in optimization and data profiling.
• Applications span robust probabilistic models, explicit combinatorial insights in graphs, and scalable algorithms for near-independence in large datasets.

The pair independence ratio refers, in rigorous combinatorics, probability, and data analysis, to diverse but related metrics quantifying the extent of independence—typically between pairs—within a given structure or data set. This article presents the principal definitions, known results, computational methods, and key applications surrounding pair independence ratios, both in combinatorial graph contexts and in probabilistic and database frameworks.

1. Definitions and Formal Settings

In Probability

For $n$ Bernoulli indicators $\{c_1, \ldots, c_n\}$, let the marginal probabilities be $p_i = \mathbb{P}(c_i=1)$. The pair independence ratio $R(p)$, for the union event $U(p) = \sum_{i=1}^n p_i$ and the optimal union bound $B^*(p)$ under pairwise independence, is

$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$

where $$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$ (Ramachandra et al., 2020).

In Graph Theory

For a graph $G=(V,E)$ and its pair graph $C(G)$ (vertices as all $\{c_1, \ldots, c_n\}$0-multisets of $\{c_1, \ldots, c_n\}$1), define the pair independence ratio as

$\{c_1, \ldots, c_n\}$2

where $\{c_1, \ldots, c_n\}$3 is the graph independence number and $\{c_1, \ldots, c_n\}$4 the independence number of the pair graph (Jiménez-Sepúlveda et al., 2018).

In Data Analysis

Let $\{c_1, \ldots, c_n\}$5 be a finite relation (table) over attribute set $\{c_1, \ldots, c_n\}$6. For $\{c_1, \ldots, c_n\}$7, the independence ratio is

$\{c_1, \ldots, c_n\}$8

quantifying approximate independence between attributes $\{c_1, \ldots, c_n\}$9 and $p_i = \mathbb{P}(c_i=1)$0 (Hannula et al., 2021).

2. Analytical Results and Extremal Behavior

Probability: Tight Bounds and Ratio Limit

The classical Boole (Fréchet) bound assumes full independence, while $p_i = \mathbb{P}(c_i=1)$1 leverages only pairwise independence. Ramachandra and Natarajan (Ramachandra et al., 2020) proved $p_i = \mathbb{P}(c_i=1)$2, and this bound is tight. Specifically, the extremal configuration

$p_i = \mathbb{P}(c_i=1)$3

achieves $p_i = \mathbb{P}(c_i=1)$4. The same bound propagates to intersections and further generalizations, with ordered moment-based refinements for events involving more than one occurrence ($p_i = \mathbb{P}(c_i=1)$5).

Graphs: Divergence in Pair Graphs

For classical families—paths, cycles, fans, and wheels—the ratio $p_i = \mathbb{P}(c_i=1)$6 grows linearly in $p_i = \mathbb{P}(c_i=1)$7:

• For $p_i = \mathbb{P}(c_i=1)$8 (even cycles), $p_i = \mathbb{P}(c_i=1)$9,
• For $R(p)$0, $R(p)$1,
• For wheel graphs $R(p)$2, $R(p)$3 for $R(p)$4 (Jiménez-Sepúlveda et al., 2018).

Thus, there is no universal constant upper bound on the pair independence ratio for these graph classes.

Databases: Approximate Independence

In data tables, $R(p)$5 attains $R(p)$6 iff $R(p)$7 holds exactly. Low $R(p)$8 implies many violations of tuple-level independence, whereas $R(p)$9 reveals near-independence. This ratio serves as a tunable parameter for data profiling, enabling discovery of "almost" independent attribute pairs (Hannula et al., 2021).

3. Algorithmic and Computational Aspects

Probabilistic Model Bounds

The optimal pair independence ratio computation for Boolean events involves explicit evaluation of $U(p) = \sum_{i=1}^n p_i$0, leveraging the ordering of marginals. For $U(p) = \sum_{i=1}^n p_i$1-out-of-$U(p) = \sum_{i=1}^n p_i$2 events, ordered Chebyshev and Boros–Prékopa bounds are available but require minimization over subsets via moment-based methods (Ramachandra et al., 2020).

Graphs: Pair Graph Construction

Pair graphs $U(p) = \sum_{i=1}^n p_i$3 are constructed by adding for each multiset $U(p) = \sum_{i=1}^n p_i$4 (allowing $U(p) = \sum_{i=1}^n p_i$5) a vertex and appropriate adjacencies. Independence number computation in $U(p) = \sum_{i=1}^n p_i$6 leverages decomposition and explicit recursion per base graph family (e.g., path, cycle) (Jiménez-Sepúlveda et al., 2018).

Data Profiling Algorithms

The bottom-up algorithm in (Hannula et al., 2021) checks all pairs $U(p) = \sum_{i=1}^n p_i$7 of attributes by:

1. Computing projections $U(p) = \sum_{i=1}^n p_i$8, $U(p) = \sum_{i=1}^n p_i$9, $B^*(p)$0
2. Comparing $B^*(p)$1 with $B^*(p)$2 for chosen $B^*(p)$3
3. Iteratively refining the candidate set with downward closure to avoid subsumed statements

The approach is exponential in the number of attributes $B^*(p)$4 but scales linearly in the number of tuples $B^*(p)$5 per validation.

4. Applications and Significance

Probability and Optimization

The pair independence ratio quantifies the sharpness gap between bounds under pairwise independence and full independence. The 4/3 bound provides stronger performance guarantees in submodular maximization and robust optimization with only pairwise independence—surpassing classical $B^*(p)$6 limits in specific settings (Ramachandra et al., 2020).

Graph Theory and Extremal Combinatorics

The unbounded growth of $B^*(p)$7 for pair graphs indicates that independence structures can be greatly amplified under pair or token constructions. Closed formulas for $B^*(p)$8 in several classical cases facilitate explicit combinatorial analysis for token-based systems (Jiménez-Sepúlveda et al., 2018).

Data Science and Profiling

$B^*(p)$9 is a tunable indicator of near-independence, critical for feature selection, normalization, and query planning. In large-scale benchmarks, decreasing $$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$0 (the minimal independence ratio accepted) exponentially increases computational cost and the number of discovered approximate independencies (Hannula et al., 2021).

5. Illustrative Calculations and Comparative Table

The following table summarizes closed formulas for the pair independence ratio for select graph families, as per (Jiménez-Sepúlveda et al., 2018):

Family	$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$1	$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$2	$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$3 formula
Path $$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$4	$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$5	$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$6	$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$7
Cycle $$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$8	$$R(p) := \frac{U(p)}{B^*(p)} = \frac{\sum_{i=1}^n p_i}{\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i}, \quad p_1 \leq \cdots \leq p_n$$9	$$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$0	$$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$1
Cycle $$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$2	$$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$3	$$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$4	$$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$5
Wheel $$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$6	$$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$7	$$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$8	see body for closed forms

6. Discussion and Open Problems

• The universal 4/3 bound for pairwise independence in probabilistic settings is sharp (Ramachandra et al., 2020).
• Combinatorially, the ratio $$B^*(p) = \min(\sum_{i=1}^n p_i - p_n \sum_{i=1}^{n-1} p_i,\, 1)$$9 is not bounded above for standard families, reflecting the "inflationary" nature of symmetric pair constructions (Jiménez-Sepúlveda et al., 2018).
• In database profiling, practical thresholds of $G=(V,E)$0 in $G=(V,E)$1 allow control over trade-offs between computational tractability and descriptive resolution (Hannula et al., 2021).

Further research directions include developing efficient algorithms for large $G=(V,E)$2 in data contexts, extending sharp probabilistic bounds to higher-order dependencies, and seeking families of graphs for which $G=(V,E)$3 admits bounded or controlled growth.