Related papers: A simple proof for monotone CLT
In this paper we will prove a functional central limit theorems for "nonconventional" sums indexed by polynomial arrays.
This paper investigates the behavior of statistical ensembles under iteration map induced by discrete integrable Hamiltonian systems in deterministic case and stochastic case, addressing the problem from two perspectives: the Law of Large…
We propose a cut-free cyclic system for Transitive Closure Logic (TCL) based on a form of hypersequents, suitable for automated reasoning via proof search. We show that previously proposed sequent systems are cut-free incomplete for basic…
In this paper we explore the non-monotonic nature of entanglement of formation with respect to concurrence for pure bipartite states. For pure bipartite system, one of the basic physical reason of this non-monotonicity character is due to…
This note considers the finite linear independence of coherent systems associated to discrete subgroups. We show by simple arguments that such coherent systems of amenable groups are linearly independent whenever the associated twisted…
We deduce sufficient conditions for the Central Limit Theorem (CLT) in the Lebesgue-Riesz space L(p) defined on some measure space for the sequence of centered random variables satisfying the strong mixing (Rosenblatt) condition. We…
In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…
We extend the spectral method for proving limit theorems to random non-uniformly expanding dynamical systems. This yields the CLT and moderate deviations principles (MDP). We show that as the amount of non-uniformity decreases the CLT rates…
The theory of Monotone Comparative Statics (MCS) has traditionally required a lattice structure, excluding certain multidimensional environments such as mixed-strategy games where this property fails. We show that this structure is not…
We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories…
We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.
We produce a series of Central Limit Theorems (CLTs) associated to compact metric measure spaces $(K,d,\eta)$, with $\eta$ a reasonable probability measure. For the first CLT, we can ignore $\eta$ by isometrically embedding $K$ into…
We consider a Hamiltonian system of free boundary type, showing first uniform bounds and existence of solutions and of the free boundary. Then, for any smooth and bounded domain, we prove uniqueness of positive solutions in a suitable…
We prove existence of discrete solitons in infinite parity-time (PT-) symmetric lattices by means of analytical continuation from the anticontinuum limit. The energy balance between dissipation and gain implies that in the anticontinuum…
We leverage path differentiability and a recent result on nonsmooth implicit differentiation calculus to give sufficient conditions ensuring that the solution to a monotone inclusion problem will be path differentiable, with formulas for…
We present a short proof of the central limit theorem which is elementary in the sense that no knowledge of characteristic functions, linear operators, or other advanced results are needed. Our proof is based on Lindeberg's trick of…
We analyze the fluctuations of incomplete $U$-statistics over a triangular array of independent random variables. We give criteria for a Central Limit Theorem (CLT, for short) to hold in the sense that we prove that an appropriately scaled…
In this paper we find the asymptotic main term of the variance of the number of roots of Kostlan-Shub-Smale random polynomials and prove a central limit theorem for the number of roots as the degree goes to infinity.
We introduce the calculus of Classical Transitions (CT), which extends the research line on the relationship between linear logic and processes to labelled transitions. The key twist from previous work is registering parallelism in typing…
In the Nelson-Oppen combination method for satisfiability modulo theories, the combined theories must be stably infinite; in gentle combination, one theory has to be gentle, and the other has to satisfy a similar yet weaker property; in…