Related papers: A simple proof for monotone CLT

For deterministic monotone cellular automata on the $d$-dimensional integer lattice, Toom has given necessary and sufficient conditions for the all-one fixed point to be stable against small random perturbations. The proof of sufficiency is…

We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\sum_{j=0}^{N}p_jz^j$…

This work is a contribution to the understanding of the question of stability of Perfectly Matched Layers (PMLs) in corners, at continuous and discrete levels. First, stability results are presented for the Cartesian PMLs associated to a…

Pick a formal system. Any formal system. Whatever your favourite formal system is, as long as it's capable of reasoning about elementary arithmetic. The First Spectral Gap Incompleteness Theorem of [CPGW15] proved that there exist…

We prove a central limit theorem (CLT) for the Frechet mean of independent and identically distributed observations in a compact Riemannian manifold assuming that the population Frechet mean is unique. Previous general CLT results in this…

A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible constants)…

We construct an exactly solvable PT-symmetric example of Sturmian bound states which exist in the absence of any confining potential. Their origin is purely topological -- these states live on certain nontrivial contours of complex…

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

We prove a central limit theorem (CLT) for the number of joint orbits of random tuples of commuting permutations. In the uniform sampling case this generalizes the classic CLT of Goncharov for the number of cycles of a single random…

We consider a random field, defined on an integer-valued d-dimensional lattice, with covariance function satisfying a condition more general than summability. Such condition appeared in the well-known Newman's conjecture concerning the…

Exact ground truth invariant polynomial systems can be written for arbitrarily correlated binary classifiers. Their solutions give estimates for sample statistics that require knowledge of the ground truth of the correct labels in the…

Recently, arXiv:2312.16035 showed that all logics based on Boolean Normal monotonic three-valued schemes coincide with classical logic when defined using a strict-tolerant standard ($\mathbf{st}$). Conversely, they proved that under a…

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

This paper re-examines the limit theorems of Abadie and Imbens for nearest-neighbor matching estimators of average treatment effects with a fixed number of matches. We establish, for the first time, a non-normalized central limit theorem…

We prove a central limit theorem with aassumptions which are many weak than classical conditions

The search for a logic capturing PTIME is a long standing open problem in finite model theory. One of the most promising candidate logics for this is Choiceless Polynomial Time with counting (CPT). Abstractly speaking, CPT is an…

We show that the convex hull of a monotone perturbation of a homogeneous background conductivity in the $p$-conductivity equation is determined by knowledge of the nonlinear Dirichlet-Neumann operator. We give two independent proofs, one of…

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

An important problem in the theory of finite dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems over the field with two elements. For systems that can…