Sums of two dependent uniform random variables: a characterization by joint tail bounds

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Sums of two dependent uniform random variables".

Emmy: Here's the gist of the paper. Which laws can the sum of two uniform random variables have when nothing is known about how they depend on each other?

Ada: The attainable laws are exactly those that satisfy a family of explicit joint bounds on sums of tail probabilities, one bound for each finite set of thresholds For laws with a density at most one, convex order alone decides The number of thresholds a law needs is set by the spacing of its atoms, not by how many atoms it has.

Emmy: Characterization via Joint Tail Bounds The paper characterizes the set of attainable laws for the sum of two uniform random variables, showing that while convex order is necessary, it is not sufficient, and a family of explicit joint bounds on tail probabilities is required.

Ada: For thresholds 0 < η1 ≤ · · · ≤ ηr < 1, the attainability condition involves a sum over all pairs of thresholds where the sum of their indices equals l + 1, specifically ∑2rl=1 P(S ≥ ξl) ≤ 2∑rq=1 (1 − ηq).

Title and authors: Ada: So, to go over the title and authors again, we have "Sums of two dependent uniform random variables: a characterization by joint tail bounds," written by Prashant Chaudhary and Kapil Khandelwal >

Emmy: I see the title suggests they are looking for a concrete way to characterize exactly which laws on this sum are possible, beyond just the general convex order idea >

Kolya: And what they do is replace that general idea with these joint bounds on tail probabilities, which they show completely describe the set of attainable laws >

Ada: It’s a shift from a global condition to a local one; instead of checking if one distribution is less than another everywhere, you check specific pairs of tail probabilities simultaneously >

Emmy: This feels like taking the structure of the problem and finding an algebraic way to state it using these inequalities, which is what Kantorovich duality helps with >

Kolya: And Kolya on the numbers—they show that for thresholds eta one through eta r, they need a sum over all pairs where the sum of their indices equals l plus one, specifically sum 2r =one P(S at least xi) at most two sum rq=one (one - eta q) > <ref:2610.24197#pg2>

Ada: That specific bound is sharp for every threshold choice they pick, and that’s a pretty strong statement about the attainability condition >

The paper's summary: Emmy: So, looking at the summary of "Sums of two dependent uniform random variables: a characterization by joint tail bounds," the main point is that while convex order isn't sufficient for two variables, there’s a set of explicit joint bounds that *is* sufficient >

Kolya: They are characterizing exactly which laws belong to D U two by these bounds, and they show that for densities bounded below near one, convex order implies the simplest of these joint bounds > <ref:2610.24197#pg2,for densities bounded below near>

Ada: But for densities at most two, convex order only implies the simplest bound, and you need those more complex family of explicit bounds to really characterize the set >

Emmy: The paper is focused on showing that distinct thresholds are enough to decide attainability, which is a big structural simplification compared to needing an infinite number of constraints >

Kolya: And they connect this structure to lattice laws on (one/k)Z, showing that these laws are dense in D U two at a sharp rate in the infinity-Wasserstein metric > <ref:2610.24197#pg2>

The paper's improvements: Ada: Now, when we look at the improvements suggested by this work, they really focus on how to make these bounds more useful for actual applications >

Emmy: They use Kantorovich duality with one potential to reformulate the membership condition into a family of inequalities, which is crucial for deriving that tail-sum characterization >

Kolya: That duality is key because it lets them get that tail-sum characterization of D U two which is what really gives you the explicit conditions > <ref:2610.24197#pg2>

Ada: They also have this grid picture on (one/k)Z where lattice laws are dense in D U two at a sharp rate, and the facet structure of the X-ray polytope P b k dictates the minimal list of tail bounds needed for those lattice laws > <ref:2610.24197#pg2>

Emmy: For mean-one laws on (a, b)Z, they show that this structure is determined by specific potentials and hinges, which gives a very concrete way to look at these complex constraints >

Conclusion: Ada: So to wrap up the paper "Sums of two dependent uniform random variables: a characterization by joint tail bounds," it shows that we need explicit joint bounds on tail probabilities rather than just convex order for two variables >

Emmy: And that these bounds are sharp, and they are necessary because convex order alone isn't enough when the density is two or less >

Kolya: From a probabilistic viewpoint, it tells us that the number of thresholds needed to exclude a law outside D U two is governed by the spacing between atoms, not just how many atoms there are > <ref:2610.24197#pg2>

Ada: It’s important to remember that even though convex order decides things for density one laws, it fails above density two because of those specific joint bounds >

Emmy: And the most interesting open question they leave hanging is whether a density at most two and the constraint S less than or equal to c times two U together imply that the law of S is attainable > <ref:2610.24197#pg2>

Kolya: I agree, that’s the sticking point, and this characterization by joint tail bounds gives us the tools we need to actually test those remaining questions >