Related papers: A simple proof for monotone CLT
We introduce the notion of BMT independence, allowing us to take arbitrary mixtures of boolean, monotone, and tensor independence and generalizing the notion of BM independence of Wysoczanski. Pair-wise independence relations are encoded…
We study Boolean models on Riemannian symmetric spaces driven by homogeneous insertion- or deletion-tolerant point processes. We prove that in both the set covered by the balls (the occupied set) and its complement (the vacant set), one…
We study dynamical systems arising as time-dependent compositions of Pomeau-Manneville-type intermittent maps. We establish central limit theorems for appropriately scaled and centered Birkhoff-like partial sums, with estimates on the rate…
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…
We present a simple proof of monotonicity for cooperative systems of linear ordinary differential equations, without having recourse to approximation by strongly cooperative systems.
The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…
We introduce and study a new notion of non-commutative independence, called V-monotone independence, which can be viewed as an extension of the monotone independence of Muraki. We investigate the combinatorics of mixed moments of V-monotone…
We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.
We investigate operator-valued monotone independence, a noncommutative version of independence for conditional expectation. First we introduce operator-valued monotone cumulants to clarify the whole theory and show the moment-cumulant…
Recent work in dynamic causal inference introduced a class of discrete-time stochastic processes that generalize martingale difference sequences and arrays as follows: the random variates in each sequence have expectation zero given certain…
The multivariate central limit theorems (CLT) for the volumes of excursion sets of stationary quasi-associated random fields on $\mathbb{R}^d$ are proved. Special attention is paid to Gaussian and shot noise fields. Formulae for the…
This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…
We present analogues of the Poisson limit distribution for the noncommutative bm-independence, which is associated with several positive symmetric cones. We construct related discrete Fock spaces with creation, annihilation and conservation…
Satisfiability checking for monotone modal logic is known to be (only) NP-complete. We show that this remains true when the logic is extended with aconjunctive and alternation-free fixpoint operators as well as the universal modality; the…
We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, due to the unrestricted…
This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…
We explore an asymptotic behavior of entropies for sums of independent random variables that are convolved with a small continuous noise.
This paper is concerned with the limiting spectral behaviors of large dimensional Kendall's rank correlation matrices generated by samples with independent and continuous components. We do not require the components to be identically…
Building consistent distributed systems has largely depended on complex coordination strategies that are not only tricky to implement, but also take a toll on performance as they require nodes to wait for coordination messages. In this…
We study the fluctuations of certain biorthogonal ensembles for which the underlying family \{P,Q\} satisfies a finite-term recurrence relation of the form $x P(x) = \mathbf{J}P(x)$. For polynomial linear statistics of such ensembles, we…