相关论文: Products of Generalized Stochastic Sarymsakov Matr…
An SIA matrix is a stochastic matrix whose sequence of powers converges to a rank-one matrix. This convergence is desirable in various applications making use of stochastic matrices, such as consensus, distributed optimization and Markov…
The paper deals with the convergence properties of the products of random (row-)stochastic matrices. The limiting behavior of such products is studied from a dynamical system point of view. In particular, by appropriately defining a dynamic…
We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…
We establish the universality of the singular numbers in random matrix products over $\mathrm{GL}_n(\mathbb{Q}_p)$ as the number of products approaches infinity, with a fixed $n\ge 1$. We demonstrate that, under a broad class of…
In this review we summarise recent results for the complex eigenvalues and singular values of finite products of finite size random matrices, their correlation functions and asymptotic limits. The matrices in the product are taken from…
Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…
Specialized classifiers, namely those dedicated to a subset of classes, are often adopted in real-world recognition systems. However, integrating such classifiers is nontrivial. Existing methods, e.g. weighted average, usually implicitly…
The theory of generalized matric Massey products has been applied for some time to $A$-modules $M$, $A$ a $k$-algebra. The main application is to compute the local formal moduli $\hat{H}_M$, isomorphic to the local ring of the moduli of…
With the growth of magnitude of multi-agent networks, distributed optimization holds considerable significance within complex systems. Convergence, a pivotal goal in this domain, is contingent upon the analysis of infinite products of…
Finite metric spaces are characterized by a polyhedral cone defined in terms of the positivity of the distance functions and the triangle inequalities. Their classification is based on the decomposition of an associated polyhedral cone,…
Suppose $\{ X_k \}_{k \in \mathbb{Z}}$ is a sequence of bounded independent random matrices with common dimension $d\times d$ and common expectation $\mathbb{E}[ X_k ]= X$. Under these general assumptions, the normalized random matrix…
We prove that if $G$ is a finite simple group of Lie type and $S_1,\dots, S_k$ are subsets of $G$ satisfying $\prod_{i=1}^k|S_i|\geq|G|^c$ for some $c$ depending only on the rank of $G$, then there exist elements $g_1,\dots, g_k$ such that…
In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…
A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…
We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…
Consider a stochastic matrix $P$ and diagonal matrix $D.$ In this work, we introduce Tilted matrices. A Tilted matrix is the product $D'PD$, where $D'$ is a diagonal normalization that makes the product stochastic. We then provide several…
The notion of a generalized product, refining that of a (symmetric and smooth) simplicial space is introduced and shown to imply the existence of an algebra of pseudodifferential operators. This encompasses many constructions of such…
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…