Related papers: Law of Large Numbers for Infinite Random Matrices …

Let $H$ be the space of all Hermitian matrices of infinite order and $U(\infty)$ be the inductive limit of the chain $U(1)\subset U(2)\subset...$ of compact unitary groups. The group $U(\infty)$ operates on the space $H$ by conjugations,…

Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…

Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

Let $G$ be a finite group with $k$ conjugacy classes, and $S(\infty)$ be the infinite symmetric group, i.e. the group of finite permutations of $\left\{1,2,3,\ldots\right\}$. Then the wreath product $G_{\infty}=G\sim S(\infty)$ of $G$ with…

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…

We show that the order on probability measures, inherited from the dominance order on the Young diagrams, is preserved under natural maps reducing the number of boxes in a diagram by $1$. As a corollary we give a new proof of the Thoma…

We study asymptotics of reducible representations of the symmetric groups S_q for large q. We decompose such a representation as a sum of irreducible components (or, alternatively, Young diagrams) and we ask what is the character of a…

Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…

We establish an abstract local ergodic theorem, under suitable space-time scaling, for the (boundary-driven) symmetric exclusion process on an increasing sequence of balls covering an infinite weighted graph. The proofs are based on 1-block…

We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…

In this paper, we review the representation theory of the infinite symmetric group, and we extend the works of Kerov and Vershik by proving that the irreducible characters of the infinite symmetric group always satisfy a central limit…

The aim of this note is to prove a law of large numbers for local patterns in discrete point processes. We investigate two different situations: a class of point processes on the one dimensional lattice including certain Schur measures, and…

The z-measures on partitions originated from the problem of harmonic analysis of linear representations of the infinite symmetric group in the works of Kerov, Olshanski and Vershik (1993, 2004). A similar family corresponding to projective…

We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…

The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…

The asymptotic study of tuples of random non-increasing integers is crucial for probabilistic models coming from asymptotic representation theory and statistical physics. We study the global behavior of such tuples, introducing a new family…

If a partition $\lambda$ of size n is chosen randomly according to the Plancherel measure $P_n[\lambda] = (\dim \lambda)^2/n!$, then as n goes to infinity, the rescaled shape of $\lambda$ is with high probability very close to a non-random…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

We show that the class of inductive limits of the representations of finite symmetric groups with simple spectrum coinsides with the class of Markov representations of the infinite symmetric group associated with Markov measures on the…