

























The Lovász Local Lemma (the LLL for short) is a powerful tool in probabilistic combinatorics that is used to verify the existence of combinatorial objects with desirable properties. Recent years saw the development of various "constructive" versions of the LLL. A major success of this research direction is the Borel version of the LLL due to Csóka, Grabowski, Máthé, Pikhurko, and Tyros, which holds under a subexponential growth assumption. A drawback of their approach is that it only applies when the underlying random variables take values in a finite set. We present an alternative proof of a Borel version of the LLL that holds even if the underlying random variables are continuous and applies to dependency graphs of limited exponential growth.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。