Related papers: Universality properties of Gelfand-Tsetlin pattern…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
We impose the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of depth $n$ with the particles on row $n$ in deterministic positions. These systems equivalently describe a broad class of random tilings models,…
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…
A Gelfand-Tsetlin function is a real-valued function $\phi:C \to \mathbb{R}$ defined on a finite subset $C$ of the lattice $\mathbb{Z}^2$ with the property that $\phi(x) \leq \phi(y)$ for every edge $\langle x,y \rangle$ directed north or…
In this paper, we consider a sequence of selfadjoint matrices $A_n$ having a limiting spectral distribution as $n\to \infty$, and we consider a sequence of full flags $\{0\le p_1^n\le\ldots\le p_i^n\le\ldots\le 1_n\}$ chosen at random…
We consider the fluctuations of the number of eigenvalues of $n\times n$ random normal matrices depending on a potential $Q$ in a given set $A$. These eigenvalues are known to form a determinantal point process, and are known to accumulate…
As recently proved in generality by Hedenmalm and Wennman, it is a universal behavior of complex random normal matrix models that one finds a complementary error function behavior at the boundary (also called edge) of the droplet as the…
We consider the product of n complex non-Hermitian, independent random matrices, each of size NxN with independent identically distributed Gaussian entries (Ginibre matrices). The joint probability distribution of the complex eigenvalues of…
In an earlier work we had considered a Gaussian ensemble of random matrices in the presence of a given external matrix source. The measure is no longer unitary invariant and the usual techniques based on orthogonal polynomials, or on the…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
It is a result of Ginibre that the normalized bulk $k$-point correlation functions of a complex $n\times n$ Gaussian matrix with independent entries of mean zero and unit variance are asymptotically given by the determinantal point process…
This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…
The ground state properties of $N$ spinless free fermions in a $d$-dimensional confining potential are studied. We find that any $n$-point correlation function has a simple determinantal structure that allows us to compute several…
The classical Gelfand-Tsetlin formulas provide a basis in terms of tableaux and an explicit action of the generators of $\mathfrak{gl} (n)$ for every irreducible finite-dimensional $\mathfrak{gl} (n)$-module. These formulas can be used to…
The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…
We develop a unified approach to universality of local scaling limits for eigenvalues of random normal matrices, or equivalently for planar Coulomb gases at inverse temperature $\beta=2$. The approach is direct in that it does not rely on…
In this article, we study microscopic properties of a two-dimensional eigenvalue ensemble near a conical singularity arising from insertion of a point charge in the bulk of the support of eigenvalues. In particular, we characterize all…
Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…
We consider $n$ particles $0\leq x_1<x_2< \cdots < x_n < +\infty$, distributed according to a probability measure of the form $$ \frac{1}{Z_n}\prod_{1\leq i <j \leq n}(x_j-x_i)\prod_{1\leq i <j \leq…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…