相关论文: Free probability and combinatorics

Since Voiculescu introduced his bi-free probability theory in 2013, the major development of the theory has been on its combinatorial side; in particular, on the combinatorics of bi-free cumulants and its application to the bi-free…

The traditional class of elliptical distributions is extended to allow for asymmetries. A completely robust dispersion matrix estimator (the `spectral estimator') for the new class of `generalized elliptical distributions' is presented. It…

We prove a large deviations principle for the empirical law of the block sizes of a uniformly distributed non-crossing partition. As an application we obtain a variational formula for the maximum of the support of a compactly supported…

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…

We provide a complete asymptotic distribution theory for clustered data with a large number of independent groups, generalizing the classic laws of large numbers, uniform laws, central limit theory, and clustered covariance matrix…

In this report we discuss some results of non--commutative (quantum) probability theory relating the various notions of statistical independence and the associated quantum central limit theorems to different aspects of mathematics and…

Using the standard concepts of free random variables, we show that for a large class of nonhermitean random matrix models, the support of the eigenvalue distribution follows from their hermitean analogs using a conformal transformation. We…

This in an introduction to free probability theory, covering the basic combinatorial and analytic theory, as well as the relations to random matrices and operator algebras. The material is mainly based on the two books of the lecturer, one…

The paper establishes a connection between two recent combinatorial developments in free probability: the non-crossing linked partitions introduced by Dykema in 2007 to study the S-transform, and the partial order << on NC(n) introduced by…

A formula expressing free cumulants in terms of the Jacobi parameters of the corresponding orthogonal polynomials is derived. It combines Flajolet's theory of continued fractions and Lagrange inversion. For the converse we discuss…

We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This parameter has first been studied by Schbath with the aim of counting the…

In arXiv:0907.3784, we introduced a variant of non-commutative Donaldson-Thomas theory in a combinatorial way, which is related with topological vertex by a wall-crossing phenomenon. In this paper, we (1) provide an alternative definition…

We introduce the notion of a conditionally free product and conditionally free convolution. We describe this convolution both from a combinatorial point of view, by showing its connection with the lattice of non-crossing partitions, and…

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices.…

To a planar algebra P in the sense of Jones we associate a natural non- commutative ring, which can be viewed as the ring of non-commutative polynomials in several indeterminates, invariant under a symmetry encoded by P. We show that this…

This is an introduction to some of the most probabilistic aspects of free probability theory.

This paper will be devoted to study weighted (deformed) free Poisson random variables from the viewpoint of orthogonal polynomials and statistics of non-crossing partitions. A family of weighted (deformed) free Poisson random variables will…

We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…

Poisson thinning is an elementary result in probability, which is of great importance in the theory of Poisson point processes. In this article, we record a couple of characterization results on Poisson thinning. We also consider several…

In this paper, we provide a combinatorial characterization of the elements of Schur ultrafilters on countable commutative groups. Using this characterization, we construct a free Schur ultrafilter on $\mathbb Z$ that is not infinitary…