A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers

TL;DR

This paper proves a strong upper bound on expectation thresholds in integer linear programs, confirming Talagrand's conjecture for small fractional solutions, and introduces a sharp version of Talagrand's selector process conjecture for rounding fractional solutions.

Contribution

It establishes a sharp version of Talagrand's selector process conjecture and applies it to prove a bound on expectation thresholds for small fractional solutions.

Findings

Proves Talagrand's conjecture for fractional solutions with bounded support.

Introduces a sharp version of Talagrand's selector process conjecture.

Provides a method for rounding fractional solutions in integer LPs.

Abstract

Expectation thresholds arise from a class of integer linear programs (LPs) that are fundamental to the study of thresholds in large random systems. An avenue towards estimating expectation thresholds comes from the fractional relaxation of these integer LPs, which yield the fractional expectation thresholds. Regarding the gap between the integer LPs and their fractional relaxations, Talagrand made a bold conjecture, that the integral and fractional expectation thresholds are within a constant factor of each other. In other words, any small fractional solution can be ``rounded''. In this paper, we prove a strong upper bound on the expectation threshold starting from a fractional solution supported on sets with small size. In particular, this resolves Talagrand's conjecture for fractional solutions supported on sets with bounded size. Our key input for rounding the fractional solutions is a sharp version of Talagrand's selector process conjecture that is of independent interest.