Related papers: A simple proof for monotone CLT
Short and transparent proofs of central limit theorems for intrinsic volumes of random polytopes in smooth convex bodies are presented. They combine different tools such as estimates for floating bodies with Stein's method from probability…
In this paper, we investigate the topological structure of solution sets of monotone vector variational inequalities. We show that if the weak Pareto solution set of a monotone vector variational inequality is disconnected, then each…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
In this paper, we prove a conditional limit theorem for independent not necessarily identically distributed random variables. Namely, we obtain the asymptotic distribution of a large number of them given the sum.
It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone unsolvability thereof, and eventually implies P $\neq$ NP as…
A sharp version of the Central Limit Theorem for linear combinations of iterates of an inner function is proved. The authors previously showed this result assuming a suboptimal condition on the coefficients of the linear combination. Here…
In this paper we study the functional central limit theorem for stationary Markov chains with self-adjoint operator and general state space. We investigate the case when the variance of the partial sum is not asymptotically linear in n; and…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We consider a linear algebra approach to establishing a discrete comparison principle for a nonmonotone class of quasilinear elliptic partial differential equations. In the absence of a lower order term, we require local conditions on the…
In recent years, there has been increasing interest in explanation methods for neural model predictions that offer precise formal guarantees. These include abductive (respectively, contrastive) methods, which aim to compute minimal subsets…
We present important use cases and limitations when considering results obtained from Cluster Perturbation Theory (CPT). CPT combines the solutions of small individual clusters of an infinite lattice system with the Bloch theory of…
The \textit{Central Limit Theorem (CLT)} is at the heart of a great deal of applied problem-solving in statistics and data science, but the theorem is silent on an important implementation issue: \textit{how much data do you need for the…
Two proofs of the Central Limit Theorem using a renormalization group approach are presented. The first proof is conducted under a third moment assumption and shows that a suitable renormalization group map is a contraction over the space…
Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias normal or conventional) situations in which a given sentence…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
The Alt-Caffarelli-Friedman monotonicity formula is a cornerstone in the theory of free boundary problems. In this note we provide a self-contained proof of this result. To prove the main stepping stone, namely the Friedland-Hayman…
We introduce the notion of operator-valued infinitesimal (OVI) independence for the Boolean and monotone cases. Then show that OVI Boolean (resp. monotone) independence is equivalent to the operator-valued Boolean (resp. monotone)…
We present a new approach, inspired by Stein's method, to prove a central limit theorem (CLT) for linear statistics of $\beta$-ensembles in the one-cut regime. Compared with the previous proofs, our result requires less regularity on the…
Until recently, First-Order Temporal Logic (FOTL) has been little understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not previously available. However,…
This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…