Worst-case bias of the independence assumption for functions of two ordinal variables

Let ordinal grades $X$ and $Y$ be obtained by cutting a pair of random variables with copula $C$ at arbitrary thresholds, and let $g$ be a function of the grades. We study the largest error $S_C(g)$, over all thresholds, that is, over all marginal laws, made when the mean of $g(X,Y)$ is computed as if the grades were independent. This is the counterpart of the classical dependence-uncertainty problem: the copula is fixed and the discretisation is free. The error is caused entirely by the interaction of the inputs, measured by an index $ρ(g)$, the largest absolute $g$-volume of a rectangle of grades, which vanishes if and only if $g$ is additive. For every copula, $S_C(g)$ lies between $ρ(g)$ times the largest deviation of $C$ from the independence copula and $ρ(g)$ times half the total variation of their difference, and the factor one half cannot be improved. For the Gaussian copula with correlation $λ$ we prove that $S_C(g)$ equals $|λ|ρ(g)/(2π)$ to first order, with a sharp constant and an explicit remainder. The same first-order law holds for copula families whose first-order departure from independence is a product of unimodal factors, including the Farlie-Gumbel-Morgenstern, Ali-Mikhail-Haq, Frank, Clayton and Plackett families, and we characterise the Archimedean families with this property. An application to the TNM staging of colon cancer, with data from a clinical trial, compares the bounds with the actual error of the independence computation.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24439
Primary Topic
Financial Risk and Volatility Modeling
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Worst-case bias of the independence assumption for functions of two ordinal variables

Константин Викторович Логинов
arXiv (Cornell University)
Financial Risk and Volatility Modeling
preprint

Worst-case bias of the independence assumption for functions of two ordinal variables

Константин Викторович Логинов
preprint en

Abstract

Let ordinal grades $X$ and $Y$ be obtained by cutting a pair of random variables with copula $C$ at arbitrary thresholds, and let $g$ be a function of the grades. We study the largest error $S_C(g)$, over all thresholds, that is, over all marginal laws, made when the mean of $g(X,Y)$ is computed as if the grades were independent. This is the counterpart of the classical dependence-uncertainty problem: the copula is fixed and the discretisation is free. The error is caused entirely by the interaction of the inputs, measured by an index $ρ(g)$, the largest absolute $g$-volume of a rectangle of grades, which vanishes if and only if $g$ is additive. For every copula, $S_C(g)$ lies between $ρ(g)$ times the largest deviation of $C$ from the independence copula and $ρ(g)$ times half the total variation of their difference, and the factor one half cannot be improved. For the Gaussian copula with correlation $λ$ we prove that $S_C(g)$ equals $|λ|ρ(g)/(2π)$ to first order, with a sharp constant and an explicit remainder. The same first-order law holds for copula families whose first-order departure from independence is a product of unimodal factors, including the Farlie-Gumbel-Morgenstern, Ali-Mikhail-Haq, Frank, Clayton and Plackett families, and we characterise the Archimedean families with this property. An application to the TNM staging of colon cancer, with data from a clinical trial, compares the bounds with the actual error of the independence computation.

arXiv (Cornell University)
Financial Risk and Volatility Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon