相关论文: Somewhat stochastic matrices
We introduce a class of real algebraic varieties characterised by a simple rationality condition, which exhibit strong properties regarding approximation of continuous and smooth mappings by regular ones. They form a natural counterpart to…
Random matrices tend to be well conditioned, and we employ this well known property to advance matrix computations. We prove that our algorithms employing Gaussian random matrices are efficient, but in our tests the algorithms have…
We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…
Green and Tao's arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the `flag condition'. We give an arithmetic regularity lemma and counting lemma…
The Nystr\"om method is a popular choice for finding a low-rank approximation to a symmetric positive semi-definite matrix. The method can fail when applied to symmetric indefinite matrices, for which the error can be unboundedly large. In…
A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…
The regularity lemma is a stringent condition of the possible ranks of tensor blow-ups of linear subspaces of matrices. It was proved by Ivanyos, Qiao and Subrahmanyam when the underlying field is sufficiently large. We show that if the…
This paper integrates two strands of the literature on stability of general state Markov chains: conventional, total variation based results and more recent order-theoretic results. First we introduce a complete metric over Borel…
If $E=\{e_i\}$ and $F=\{f_i\}$ are two 1-unconditional basic sequences in $L_1$ with $E$ $r$-concave and $F$ $p$-convex, for some $1\le r<p\le 2$, then the space of matrices $\{a_{i,j}\}$ with norm $\|\{a_{i,j}\}\|_{E(F)}=\big\|\sum_k…
We say that a matrix $P$ with non-negative entries majorizes another such matrix $Q$ if there is a stochastic matrix $T$ such that $Q=TP$. We study matrix majorization in large samples and in the catalytic regime in the case where the…
An $r$-matrix is a matrix with symbols in $\{0,1,\dots,r-1\}$. A matrix is simple if it has no repeated columns. Let the support of a matrix $F$, $\text{supp}(F)$ be the largest simple matrix such that every column in $\text{supp}(F)$ is in…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…
For 2 by 2 matrices over commutative rings, we prove a characterization theorem for left stable range 1 elements, we show that the stable range 1 property is left-right symmetric (also) at element level, we show that all matrices with one…
Random matrix theory allows for the deduction of stability criteria for complex systems using only a summary knowledge of the statistics of the interactions between components. As such, results like the well-known elliptical law are…
Given a normal matrix $A$ and an arbitrary square matrix $B$ (not necessarily of the same size), what relationships between $A$ and $B$, if any, guarantee that $B$ is also a normal matrix? We provide an answer to this question in terms of…
Matrix theory, foundational in diverse fields such as mathematics, physics, and computational sciences, typically categorizes matrices based strictly on their invertibility-determined by a sharply defined singular or nonsingular…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…