most citedAsymptotic confidence sets for random linear programs

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.STShow all

2 papers · 1 filter

math.ST2023

Sharp thresholds in inference of planted subgraphs

Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn +2

A major question in the study of the Erdős--Rényi random graph is to understand the probability that it contains a given subgraph. This study originated in classical work of Erdős…

math.ST2023★ 1 cited

Asymptotic confidence sets for random linear programs

Shuyu Liu, Florentina Bunea, Jonathan Niles-Weed

Motivated by the statistical analysis of the discrete optimal transport problem, we prove distributional limits for the solutions of linear programs with random constraints. Such l…