Related papers: Row products of random matrices
In prior work, Gupta et al. (SPAA 2022) presented a distributed algorithm for multiplying sparse $n \times n$ matrices, using $n$ computers. They assumed that the input matrices are uniformly sparse--there are at most $d$ non-zeros in each…
We derive analytic expressions for infinite products of random 2x2 matrices. The determinant of the target matrix is log-normally distributed, whereas the remainder is a surprisingly complicated function of a parameter characterizing the…
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…
This paper investigates the strong limiting behavior of the eigenvalues of the class of matrices $\frac1N(D_n\circ X_n)(D_n\circ X_n)^*$, studied in Girko 2001. Here, $X_n=(x_{ij})$ is an $n\times N$ random matrix consisting of independent…
Diffusion models trained on different, non-overlapping subsets of a dataset often produce strikingly similar outputs when given the same noise seed. We trace this consistency to a simple linear effect: the shared Gaussian statistics across…
We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…
Let $G$ be a connected graph. For an ordered set $S=\{v_1,\ldots, v_\ell\}\subseteq V(G)$, the vector $r_G(v|S) = (d_G(v_1,v), \ldots, d_G(v_\ell,v))$ is called the metric $S$-representation of $v$. If for any pair of different vertices…
Creation of a synthetic dataset that faithfully represents the data distribution and simultaneously preserves privacy is a major research challenge. Many space partitioning based approaches have emerged in recent years for answering…
A lonesum matrix is a $(0,1)$-matrix that is uniquely determined by its row and column sum vectors. In this paper, we introduce lonesum decomposable matrices and study their properties. We provide a necessary and sufficient condition for a…
We show the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of $k$ independent $n\times n$ matrices with i.i.d. complex Gaussian entries with a few…
We consider the algebra M_k(C) of k-by-k matrices over the complex numbers and view it as a crossed product with a group G of order k by embedding G in the symmetric group S_k via the regular representation and embedding S_k in M_k(C) in…
The aim of this note is to announce some results about the probabilistic and deterministic asymptotic properties of linear groups. The first one is the analogue, for norms of random matrix products, of the classical theorem of Cramer on…
We compute analytically the probability distribution and moments of the sum and product of the non-zero eigenvalues and singular values of random matrices with (i) non-negative entries, (ii) fixed rank, and (iii) prescribed sums of the…
Random matrices formed from i.i.d. standard real Gaussian entries have the feature that the expected number of real eigenvalues is non-zero. This property persists for products of such matrices, independently chosen, and moreover it is…
We consider a product of an arbitrary number of independent rectangular Gaussian random matrices. We derive the mean densities of its eigenvalues and singular values in the thermodynamic limit, eventually verified numerically. These…
The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$. In this article, we give estimates on…
Let $\rho_k(N)$ denote the maximum size of a set $A\subseteq \{1,2,\dots,N\}$ such that no product of $k$ distinct elements of $A$ is a perfect $d$-th power. In this short note, we prove that $\rho _d(N)=\sum\limits_{k=1}^{d-1}\pi\left(…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of…
We consider the products of $m\ge 2$ independent large real random matrices with independent vectors $(X_{jk}^{(q)},X_{kj}^{(q)})$ of entries. The entries $X_{jk}^{(q)},X_{kj}^{(q)}$ are correlated with $\rho=\mathbb E…