Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-half players: Despot, Tribune and the non-deterministic People. Despo...
The sufficiently scattered condition (SSC) is a key condition in the study of identifiability of various matrix factorization problems, including nonnegative, minimum-volume, symmetric, simplex-structured, and polytopic matrix factorizations. The SSC...
are called similar if there exists an invertible n-by-n matrix P such that B = P − 1 A P . {\displaystyle B=P^{-1}AP.} Two matrices are similar if and only
Let A be an n by n matrix with entries in an arbitrary field, and c_1,...,c_n be scalars. We prove that if A is not a scalar multiple of the identity matrix, then the condition c_1+...+c_n=tr(A) is necessary and sufficient for A to be similar to a ma...
Time-delay embedding is an increasingly popular starting point for data-driven reduced-order modeling efforts. In particular, the singular value decomposition (SVD) of a block Hankel matrix formed from successive delay embeddings of the state of a dy...
✨ Outlook Account Generator Written in Python ✨ (⭐ 389)
We study the query complexity of finding the set of all Nash equilibria $\mathcal X_\star \times \mathcal Y_\star$ in two-player zero-sum matrix games. Fearnley and Savani (2016) showed that for any randomized algorithm, there exists an $n \times n$...
We investigate the probability distribution of Chern numbers (quantum Hall effect integers) for a parametric version of the GUE random matrix ensemble, which is a model for a chaotic or disordered system. The numerically-calculated single-band Chern...
Can I create matrix-grid-type questions? Google Surveys does not support matrix questions, or grids with response categories along the top and a list of questions down the side, which often prompt …
We consider the decomposition of a data matrix assumed to be a superposition of a low-rank matrix and a component which is sparse in a known dictionary, using a convex demixing method. We consider two sparsity structures for the sparse factor of the...
We discuss a generalization of the Cohn-Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn-Umans method may be...
Similarity transformation may refer to: Similarity (geometry), for shape-preserving transformations Matrix similarity, for matrix transformations of the
We propose a non-lattice simulation for studying supersymmetric matrix quantum mechanics in a non-perturbative manner. In particular, our method enables us to put M theory on a computer based on its matrix formulation proposed by Banks, Fischler, S...
Jan 27, 2006 · Matrix Explained, Real-Life Superheroes, and SongMeanings Friday, Jan 27, 2006 by Johnny "Doc Evil" Titanium (@fart)
We analyzed cross-correlations between price fluctuations of global financial indices (20 daily stock indices over the world) and local indices (daily indices of 200 companies in the Korean stock market) by using random matrix theory (RMT). We compar...
We investigate a parallelization strategy for dense matrix factorization (DMF) algorithms, using OpenMP, that departs from the legacy (or conventional) solution, which simply extracts concurrency from a multithreaded version of BLAS. This approach is...
Current architectures are now equipped with matrix computation units designed to enhance AI and high-performance computing applications. Within these architectures, two fundamental instruction types are matrix multiplication and vector outer product,...
We study the eigenvectors of Laplacian matrices of trees. The Laplacian matrix is reduced to a tridiagonal matrix using the Schur complement. This preserves the eigenvectors and allows us to provide fomulas for the ratio of eigenvector entries. We al...
Let $S=XX^T$ be the (unscaled) sample covariance matrix where $X$ is a real $p \times n$ matrix with independent entries. It is well known that if the entries of $X$ are independent and identically distributed (i.i.d.) with enough moments and $p/n \t...
In this note, we extend the results about the fluctuations of the matrix entries of regular functions of Wigner random matrices obtained in arXiv:1103.3731 [math.PR] to Wigner matrices with non-i.i.d. entries provided certain Lindeberg type condition...