Related papers: k-Divisible random variables in free probability
In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…
We express generalized Cauchy-Stieltjes transforms of some particular Beta distributions (of ultraspherical type generating functions for orthogonal polynomials) as a powered Cauchy-Stieltjes transform of some measure. For suitable values…
For a set of dependent random variables, without stationary or the strong mixing assumptions, we derive the asymptotic independence between their sums and maxima. Then we apply this result to high-dimensional testing problems, where we…
Given a positive integer $n$ the $k$-fold divisor function $d_k(n)$ equals the number of ordered $k$-tuples of positive integers whose product equals $n$. In this article we study the variance of sums of $d_k(n)$ in short intervals and…
The aim of this thesis is to find a solution to the non-parametric independence problem in separable metric spaces. Suppose we are given finite collection of samples from an i.i.d. sequence of paired random elements, where each marginal has…
Let $\mu$ be a probability measure on $\mathbb C$, and let $P_n$ be the random polynomial whose zeros are sampled independently from $\mu$. We study the asymptotic distribution of zeros of high-order derivatives of $P_n$. We show that, for…
Let $k$ be a commutative ring and $A$ a commutative $k$-algebra. Given a positive integer $m$, or $m=\infty$, we say that a $k$-linear derivation $\delta$ of $A$ is $m$-integrable if it extends up to a Hasse--Schmidt derivation…
A composite likelihood is an inference function derived by multiplying a set of likelihood components. This approach provides a flexible framework for drawing inference when the likelihood function of a statistical model is computationally…
We define higher order infinitesimal noncommutative probability space and infinitesimal non-crossing cumulant functionals. In this framework, we generalize to higher order the notion of infinitesimal freeness, via a vanishing of mixed…
We derive a combinatorial criterion for detecting k-separability of N-partite Dicke states. The criterion is efficiently computable and implementable without full state tomography. We give examples in which the criterion succeeds, where…
The spatial distribution of persistent (unvisited) sites in one dimensional $A+A\to\emptyset$ model is studied. The `empty interval distribution' $n(k,t)$, which is the probability that two consecutive persistent sites are separated by…
Let $X$ and $Y$ be two real-valued random variables. Let $(X_{1},Y_{1}),(X_{2},Y_{2}),\ldots$ be independent identically distributed copies of $(X,Y)$. Suppose there are two players A and B. Player A has access to $X_{1},X_{2},\ldots$ and…
In an infinitesimal probability space we consider operators which are infinitesimally free and one of which is infinitesimal, in that all its moments vanish. Many previously analysed random matrix models are captured by this framework. We…
We consider a class of probability measures $\mu_{s,r}^{\alpha}$ which have explicit Cauchy-Stieltjes transforms. This class includes a symmetric beta distribution, a free Poisson law and some beta distributions as special cases. Also, we…
In this paper we give an analytic interpretation of free convolution of type B, introduced by Biane, Goodman and Nica, and provide a new formula for its computation. This formula allows us to show that free additive convolution of type B is…
We associate an $(n_1+\dots+n_t-k(t-1))$-fold Pfister form to any $t$-tuple of $k$-linked Pfister forms of dimensions $2^{n_1},\dots,2^{n_t}$, and prove its invariance under the different symbol presentations of the forms with a common…
A random composition of $n$ appears when the points of a random closed set $\widetilde{\mathcal{R}}\subset[0,1]$ are used to separate into blocks $n$ points sampled from the uniform distribution. We study the number of parts $K_n$ of this…
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…
We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive…
In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…