Related papers: $\lambda$-shaped random matrices, $\lambda$-plane …
We investigate the probability distribution of the length of the second row of a Young diagram of size $N$ equipped with Plancherel measure. We obtain an expression for the generating function of the distribution in terms of a derivative of…
We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an…
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…
We investigate the weight distribution of random binary linear codes. For $0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in $\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement of their…
In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety of combinatorial formulas, which suggest that these new…
We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is $\mathrm{SO}(2,1)$ or $\mathrm{SO}(3,1)$ and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense…
We consider random $n\times n$ matrices of the form $Y_n=\frac1{\sqrt{d}}A_n\circ X_n$, where $A_n$ is the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices, with $d=\lfloor p n\rfloor$ for some fixed $p \in…
We study the shape of the Young diagram \lambda associated via the Robinson-Schensted-Knuth algorithm to a random permutation in S_n such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other…
We introduce weighted succession rules and parametric production matrices - simple extensions of the standard ECO method succession rules and production matrices. The purpose is to enumerate combinatorial objects with respect to several…
We consider powers of random matrices with independent entries. Let $X_{ij}, i,j\ge 1$, be independent complex random variables with $\E X_{ij}=0$ and $\E |X_{ij}|^2=1$ and let $\mathbf X$ denote an $n\times n$ matrix with $[\mathbf…
We investigate first passage percolation on inhomogeneous random graphs. The random graph model G(n,kappa) we study is the model introduced by Bollob\'as, Janson and Riordan, where each vertex has a type from a type space S and edge…
We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…
We consider products of independent random matrices with independent entries. The limit distribution of the expected empirical distribution of eigenvalues of such products is computed. Let $X^{(\nu)}_{jk},{}1\le j,r\le n$, $\nu=1,...,m$ be…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
Let $U_1,\ldots,U_n$ be independent random vectors uniformly distributed on the unit sphere $\mathbb S^{d-1}\subseteq\mathbb R^d$, where $n\ge d$, and consider the random polyhedral cone \[ \mathcal W_{n,d}:=\mathop{\mathrm{pos}}…
An elliptic random matrix $X$ is a square matrix whose $(i,j)$-entry $X_{ij}$ is independent of the rest of the entries except possibly $X_{ji}$. Elliptic random matrices generalize Wigner matrices and non-Hermitian random matrices with…
In a previous paper (called "Rectangular random matrices. Related covolution"), we defined, for $\lambda \in [0,1]$, the rectangular free convolution with ratio $\lambda$. Here, we investigate the related notion of infinite divisiblity,…
We study the asymptotic distribution, as the volume parameter goes to 1, of the peak (largest part) of finite- or slowly-growing-width cylindric plane partitions weighted by their trace, seam, and volume. There are two natural asymptotic…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
Starting from the model of continuous time random walk, we focus our interest on random walks in which the probability distributions of the waiting times and jumps have fat tails characterized by power laws with exponent between 0 and 1 for…