Related papers: On operator-valued infinitesimal Boolean and monot…
It is well known that an extreme order statistic and a central order statistic (os) as well as an intermediate os and a central os from a sample of iid univariate random variables get asymptotically independent as the sample size increases.…
We address the question of the asymptotic description of random tensors that are local-unitary invariant, that is, invariant by conjugation by tensor products of independent unitary matrices. We consider both the mixed case of a tensor with…
In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…
We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…
In the present paper we define the notion of generalized cumulants which gives a universal framework for commutative, free, Boolean, and especially, monotone probability theories. The uniqueness of generalized cumulants holds for each…
An operadic framework is developed to explain the inversion formula relating moments and cumulants in operator-valued free probability theory.
We show that the stochastic independence of real-valued random variables is equivalent to the conditional uncorrelation, where the conditioning takes place over the Cartesian products of intervals. Next, we express the mutual independence…
In this paper we establish a multivariable non-commutative generalization of L\"owner's classical theorem from 1934 characterizing operator monotone functions as real functions admitting analytic continuation mapping the upper complex…
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections…
We introduce a family of quantum semigroups and their natural coactions on noncommutative polynomials. We present three invariance conditions, associated with these coactions, for the joint distribution of sequences of selfadjoint…
Given a function $f: (a,b) \rightarrow \mathbb{R},$ L\"owner's theorem states $f$ is monotone when extended to self-adjoint matrices via the functional calculus, if and only if $f$ extends to a self-map of the complex upper half plane. In…
We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…
Variable independence and decomposability are algorithmic techniques for simplifying logical formulas by tearing apart connections between free variables. These techniques were originally proposed to speed up query evaluation in constraint…
It has been shown by Voiculescu and Biane that the analytic subordination property holds for free additive and multiplicative convolutions. In this paper, we present an operatorial approach to subordination for free multiplicative…
We study monotone and convex stochastic orders for processes with independent increments. Our contributions are twofold: First, we relate stochastic orders of the Poisson component to orders of their (generalized) L\'evy measures. The…
We extend two methods of independent component analysis, fourth order blind identification and joint approximate diagonalization of eigen-matrices, to vector-valued functional data. Multivariate functional data occur naturally and…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of boundedness and zero isolation ask whether there is a…
We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements…