Related papers: Borel version of the Local Lemma

This paper proves a representation theorem regarding sequences of random elements that take values in a Borel space and are measurable with respect to the sigma algebra generated by an arbitrary union of sigma algebras. This, together with…

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

Borell's formula is a stochastic variational formula for the log-Laplace transform of a function of a Gaussian vector. We establish an extension of this to the Riemannian setting and give a couple of applications, including a new proof of a…

We show that if $\mathcal{F}$ is any "well-behaved" subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on $\pow(\mathbb{R})$ induced by $\mathcal{F}$ turns out to look like the Wadge hierarchy…

We propose a method for incorporating variable selection into local polynomial regression. This can improve the accuracy of the regression by extending the bandwidth in directions corresponding to those variables judged to be are…

Let (A,m_A) -> (B,m_B) be a local morphism of local noetherian rings and M a finitely generated B-module. Then it follows from Tor^A_1(M,A/m_A) = 0 that M is a flat A-module. This is usually called the "local criterion of flatness". We give…

We provide an alternative constructive proof of the Asymmetric Lov\'asz Local Lemma. Our proof uses the classic algorithmic framework of Moser and the analysis introduced by Giotis, Kirousis, Psaromiligkos, and Thilikos in "On the…

In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…

We show that given a monadically stable theory $T$, a sufficiently saturated $\mathbf M \models T$, and a coherent system of probability measures on the $\sigma$-algebras generated by parameter-definable sets of $\mathbf M$ in each…

In this article, we characterize both Lusin's theorem and the existence of Borel representatives via the regularity properties of the measure in general topological measure spaces. As a corollary, we prove that Borel regularity of the…

We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

The Borel map takes a smooth function to its infinite jet of derivatives (at zero). We study the restriction of this map to ultradifferentiable classes of Beurling type in a very general setting which encompasses the classical…

Identifying dependency between two random variables is a fundamental problem. The clear interpretability and ability of a procedure to provide information on the form of possible dependence is particularly important when exploring…

The Lov\'{a}sz Local Lemma (LLL) is a cornerstone principle in the probabilistic method of combinatorics, and a seminal algorithm of Moser & Tardos (2010) provides an efficient randomized algorithm to implement it. This can be parallelized…

The lefthanded Lov\'asz local lemma (LLLL) is a generalization of the Lov\'asz local lemma (LLL), a powerful technique from the probabilistic method. We prove a computable version of the LLLL and use it to effectivize a collection of…

We introduce a novel parsing concept called local lexing. It integrates the classically separated stages of lexing and parsing by allowing lexing to be dependent upon the parsing progress and by providing a simple mechanism for constraining…

Linear regression is a fundamental modeling tool in statistics and related fields. In this paper, we study an important variant of linear regression in which the predictor-response pairs are partially mismatched. We use an optimization…

For input $x$, let $F(x)$ denote the set of outputs that are the "legal" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of…

We are going to analyze local algorithms over sparse random graphs. These algorithms are based on local information where local regards to a decision made by the exploration of a small neighbourhood of a certain vertex plus a believe of the…