Related papers: A permutation model for free random variables and …
Let $a_{1},...,a_{n}, b_{1},...,b_{n}$ be random variables in some (non-commutative) probability space, such that $\{a_{1}, ..., a_{n} \}$ is free from $\{b_{1}, ..., b_{n} \}$. We show how the joint distribution of the $n$-tuple $(a_{1}…
Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by…
We present a non-commutative version of the cycle lemma of Dvoretsky and Motzkin that applies to free groups and use this result to solve a number of problems involving cyclic reduction in the free group. We also describe an application to…
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…
We formulate the planar `large N limit' of matrix models with a continuously infinite number of matrices directly in terms of U(N) invariant variables. Non-commutative probability theory, is found to be a good language to describe this…
We show that an independent family of uniformly distributed random permutation matrices is asymptotically *-free from an independent family of square complex Gaussian matrices and from an independent family of complex Wishart matrices, and…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…
The concept of freeness was introduced by Voiculescu in the context of operator algebras. Later it was observed that it is also relevant for large random matrices. We will show how the combination of various free probability results with a…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
In this article, we study a non-uniform distribution on permutations biased by their number of records that we call \emph{record-biased permutations}. We give several generative processes for record-biased permutations, explaining also how…
We study random band matrices within the framework of traffic probability, an operadic non-commutative probability theory introduced by Male based on graph operations. As a starting point, we revisit the familiar case of the permutation…
We consider random non-normal matrices constructed by removing one row and column from samples from Dyson's circular ensembles or samples from the classical compact groups. We develop sparse matrix models whose spectral measures match these…
We show that the number of cycles in a random permutation chosen according to generalized Ewens measure is normally distributed and compute asymptotic estimates for the mean and variance.
We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…
The paper presents conditions on entry permutations that induce asymptotic freeness when acting on Gaussian random matrices. The class of permutations described includes the matrix transpose, as well as entry permutations relevant in…
Classical two-sample permutation tests for equality of distributions have exact size in finite samples, but they fail to control size for testing equality of parameters that summarize each distribution. This paper proposes permutation tests…
Free probability theory was created by Dan Voiculescu around 1985, motivated by his efforts to understand special classes of von Neumann algebras. His discovery in 1991 that also random matrices satisfy asymptotically the freeness relation…
We introduce a general Bayesian framework for graph matching grounded in a new theory of exchangeable random permutations. Leveraging the cycle representation of permutations and the literature on exchangeable random partitions, we define,…
We introduce a new model for sums of exchangeable binary random variables. The proposed distribution is an approximation to the exact distributional form, and relies on the theory of completely monotone functions and the Laplace transform…