Search arXivSearch

arXiv · 2109.06019

Combinatorics of NC-Probability Spaces with Independent Constants

Abstract

Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F. Oravecz. We characterize the property of independent constants from a combinatorial point of view, based on cumulants and set partitions. This characterization also holds for the operator-valued extension. Our considerations lead rather directly to very mild variations of boolean and monotone cumulants, where constants are now independent. These alternative probability theories are closely related to the usual notions. Hence, an important part of the boolean/monotone probability theories can be imported directly. We describe some standard combinatorial aspects of these variations (and their cyclic versions), such as their Mobius functions, which feature well-known combinatorial integer sequences. The new notions with independent constants seem also more strongly related to the operator-valued extension of c-free probability.

Explore related subjects

Keep this discovery

BibTeXRIS

Carlos Dias-Aguilera, Tulio Gaxiola, Jorge Santos, Carlos Vargas. 2021-09-13. Combinatorics of NC-Probability Spaces with Independent Constants. https://arxiv.org/abs/2109.06019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR