Related papers: $\lambda$-shaped random matrices, $\lambda$-plane …

We prove and generalize a conjecture in arXiv:1610.0474(4) about the asymptotics of $\frac{1}{\sqrt{n!}} f^{\lambda/\mu}$, where $f^{\lambda/\mu}$ is the number of standard Young tableaux of skew shape $\lambda/\mu$ which have stable limit…

We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…

The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…

We present combinatorial bijections and identities between certain skew Young tableaux, Dyck paths, triangulations, and dissections.

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…

Given a collection $\{\lambda_1, \dots, \lambda_n\} $ of real numbers, there is a canonical probability distribution on the set of real symmetric or complex Hermitian matrices with eigenvalues $\lambda_1,\ldots,\lambda_n$. In this paper, we…

We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…

Tree-child networks are an important class of phylogenetic network used to model reticulate evolutionary processes. These networks have attracted increasing attention from researchers with interests in both combinatorics and algorithms. A…

For two large matrices ${\mathbf X}$ and ${\mathbf Y}$ with Gaussian i.i.d.\ entries and dimensions $T\times N_X$ and $T\times N_Y$, respectively, we derive the probability distribution of the singular values of $\mathbf{X}^T \mathbf{Y}$ in…

We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…

We study the convergence of distributions on finite paths of weighted digraphs, namely the family of Boltzmann distributions and the sequence of uniform distributions. Targeting applications to the convergence of distributions on paths, we…

Our work deals with symmetric rational functions and probabilistic models based on the fully inhomogeneous six vertex (ice type) model satisfying the free fermion condition. Two families of symmetric rational functions $F_\lambda,G_\lambda$…

We extend results of Y. Benoist and J.-F. Quint concerning random walks on homogeneous spaces of simple Lie groups to the case where the measure defining the random walk generates a semigroup which is not necessarily Zariski dense, but…

In this paper, we study random matrix models which are obtained as a non-commutative polynomial in random matrix variables of two kinds: (a) a first kind which have a discrete spectrum in the limit, (b) a second kind which have a joint…

For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…

The celebrated Marchenko-Pastur theorem gives the asymptotic spectral distribution of sums of random, independent, rank-one projections. Its main hypothesis is that these projections are more or less uniformly distributed on the first…

In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…