Related papers: Matrices with prescribed row and column sums
Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…
We consider two ensembles of nxn matrices. The first is the set of all nxn matrices with entries zeroes and ones such that all column sums and all row sums equal r, uniformly weighted. The second is the set of nxn matrices with zero and one…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…
In this survey, we discuss some basic problems concerning random matrices with discrete distributions. Several new results, tools and conjectures will be presented.
We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…
This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…
Gale and Ryser found a criterion for existence of a binary matrix with given row and column sums. Mirsky extended the theorem of Gale and Ryser to $q$-ary matrices. In this paper, we are interested in higher dimensional extension of these…
In the context of generating uniform random contingency tables with pre-specified marginals, the number of (binary) matrices with given row- and column-sums is a well-studied object in the literature. We will denote this number by $N(p,q)$,…
Some tools and ideas are interchanged between random matrix theory and multivariate statistics. In the context of the random matrix theory, classes of spherical and generalised Wishart random matrix ensemble, containing as particular cases…
This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead of assuming that the nonzero and arbitrary entries of the system…
We consider possible reconstructions of a binary image of which the row and column sums are given. For any reconstruction we can define the length of the boundary of the image. In this paper we prove a new lower bound on the length of this…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
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 analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices…
A chessboard has the property that every row and every column has as many white squares as black squares. In this mostly methodological note, we address the problem of counting such rectangular arrays with a fixed (numeric) number of rows,…
We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a…
This paper investigates the issue of determining the dimensions of row and column factor spaces in matrix-valued data. Exploiting the eigen-gap in the spectrum of sample second moment matrices of the data, we propose a family of randomised…
The matrix-variate normal distribution is a popular model for high-dimensional transposable data because it decomposes the dependence structure of the random matrix into the Kronecker product of two covariance matrices: one for each of the…
This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…