Related papers: A simple proof for monotone CLT

The purpose of this paper is to provide a first class of explicit sufficient conditions for the central limit theorem and related results in the setup of non-uniformly (partially) expanding non iid random transformations, considered as…

We present a sequent calculus system for a modal reformulation of a system of nonmonotonic logic due to McCain and Turner: we prove cut elimination for our system. The proof system is in general infinitary: because we can prove cut…

It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate…

We prove the Central Limit Theorem (CLT), the first order Edgeworth Expansion and a Mixing Local Central Limit Theorem (MLCLT) for Birkhoff sums of a class of unbounded heavily oscillating observables over a family of full-branch piecewise…

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Top monotonicity is a relaxation of various well-known domain restrictions such as single-peaked and single-crossing for which negative impossibility results are circumvented and for which the median-voter theorem still holds. We examine…

We discuss CLT for the global and local linear statistics of random matrices from classical compact groups. The main part of our proofs are certain combinatorial identities much in the spirit of works by Kac and Spohn.

We define the concept of a monotonic theory and show how to build efficient SMT (SAT Modulo Theory) solvers, including effective theory propagation and clause learning, for such theories. We present examples showing that monotonic theories…

Given a suitable collection of partitions of sets, there exists a connection to easy quantum groups via intertwiner maps. A sufficient condition for this correspondence to be one-to-one are particular linear independences on the level of…

We construct bases of the simple modules for partition algebras which are indexed by paths in an alcove geometry. This allows us to give a concrete interpretation (and new proof) of the monotone convergence property for Kronecker…

The non-commutative Central Limit Theorem (CLT) introduced by Speicher in 1992 states that given almost any sequence of non-commutative random variables that commute or anti-commute pair-wise, the *-moments of the normalized partial sum…

Proving complexity lower bounds remains a challenging task: we only know how to prove conditional uniform lower bounds and nonuniform lower bounds in restricted circuit models. Williams (STOC 2010) showed how to derive nonuniform lower…

We interpret the Central Limit Theorem as a fixed point theorem for a certain operator, and consider the problem of linearizing this operator. In classical as well as in free probability theory, we consider two methods giving such a…

For probability measures on a complete separable metric space, we present sufficient conditions for the existence of a solution to the Kantorovich transportation problem. We also obtain sufficient conditions (which sometimes also become…

We study the fluctuations of the eigenvalues of real valued large centrosymmetric random matrices via its linear eigenvalue statistic. This is essentially a central limit theorem (CLT) for sums of dependent random variables. The dependence…

A variant of coupled-cluster theory is described here, wherein the degrees of freedom are fluctuations of fragments between internally correlated states. The effects of intra-fragment correlation on the inter-fragment interaction are…

We prove a Central Limit Theorem (CLT) in the non-commutative setting of random matrix products where the underlying process is driven by a subshift of finite type (SFT) with Markov measure. We use the martingale method introduced by Y.…

In this paper, we derive a central limit theorem for collections of weakly correlated random variables indexed by discrete metric spaces, where the correlation decays in the distance of the indices. The correlation structure we study…

We prove the Central Limit Theorem (CLT) from the definition of weak convergence using the Haar wavelet basis, calculus, and elementary probability. The use of the Haar basis pinpoints the role of $L^{2}([0,1])$ in the CLT as well as the…

The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…