Related papers: Matrix scaling and explicit doubly stochastic limi…
The theory part of this paper is sketched as follows. Based on column stochastic average matrix $T_n$ selected as a basic substitution matrix, the method of advanced successive difference substitution is established. Then, a set of…
For every $2n\times 2n$ real positive definite matrix $A,$ there exists a real symplectic matrix $M$ such that $M^TAM=\diag(D,D),$ where $D$ is the $n\times n$ positive diagonal matrix with diagonal entries $d_1(A)\le \cdots\le d_n(A).$ The…
We call a matrix blocky if, up to row and column permutations, it can be obtained from an identity matrix by repeatedly applying one of the following operations: duplicating a row, duplicating a column, or adding a zero row or column.…
Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary…
We show that in $\text{O}(D)$ invariant matrix theories containing a large number $D$ of complex or Hermitian matrices, one can define a $D\rightarrow\infty$ limit for which the sum over planar diagrams truncates to a tractable, yet…
The concept of conformal field theory provides a general classification of statistical systems on two-dimensional geometries at the point of a continuous phase transition. Considering the finite-size scaling of certain special observables,…
We consider constraints on the S-matrix of any gapped, Lorentz invariant quantum field theory in 1 + 1 dimensions due to crossing symmetry and unitarity. In this way we establish rigorous bounds on the cubic couplings of a given theory with…
The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix…
In the theory of linear switching systems with discrete time, as in other areas of mathematics, the problem of studying the growth rate of the norms of all possible matrix products $A_{\sigma_{n}}\cdots A_{\sigma_{0}}$ with factors from a…
For the eigenvalues of principal submatrices of stochastically evolving Wigner matrices, we construct and study the edge scaling limit: a random decreasing sequence of continuous functions of two variables, which at every point has the…
We study the optimal transport problem for $d>2$ discrete measures. This is a linear programming problem on $d$-tensors. It gives a way to compute a "distance" between two sets of discrete measures. We introduce an entropic regularization…
We consider the canonical Wiener-Hopf factorisation of $2 \times 2$ symmetric matrices $\mathcal M$ with respect to a contour $\Gamma$. For the case that the quotient $q$ of the two diagonal elements of $\mathcal M$ is a rational function,…
The resummation of soft gluon exchange for QCD hard scattering requires a matrix of anomalous dimensions. We compute this matrix directly for arbitrary 2 to n massless processes for the first time at two loops. Using color generator…
Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or completing to a larger dimensional matrix. Standard Birkhoff-von Neumann and Pauli decompositions represent such matrices as…
Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…
In covariance matrix estimation, one of the challenges lies in finding a suitable model and an efficient estimation method. Two commonly used modelling approaches in the literature involve imposing linear restrictions on the covariance…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
Entropic optimal transport problems are regularized versions of optimal transport problems. These models play an increasingly important role in machine learning and generative modelling. For finite spaces, these problems are commonly solved…
We introduce a new family $\mathcal{A}_{n,k}$ of Schur positive symmetric functions, which are defined as sums over totally symmetric plane partitions. In the first part, we show that, for $k=1$, this family is equal to a multivariate…
In this article, we consider two proper double splittings satisfying certain conditions, of a semi-monotone rectangular matrix A and derive new comparison results for the spectral radii of the correspond ing iteration matrices. These…