Related papers: Embeddable Markov Matrices
Let ({\lambda}, v) be a known real eigenpair of a square real matrix A. In this paper it is shown how to locate the other eigenvalues of A in terms of the components of v. The obtained region is a union of Gershgorin discs of the second…
Due to \v{C}encov's theorem, there exists a unique family of invariant symmetric $(0,2)$-tensor fields on the space of positive probability measures on a set of $n$-points indexed by $n\in \mathbb{N}$ under Markov embeddings. We deform…
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…
We extend the proof of the local semicircle law for generalized Wigner matrices given in [4] to the case when the matrix of variances has an eigenvalue $ -1 $. In particular, this result provides a short proof of the optimal local…
We study countably infinite MDPs with parity objectives. Unlike in finite MDPs, optimal strategies need not exist, and may require infinite memory if they do. We provide a complete picture of the exact strategy complexity of…
A new approach to solving eigenvalue optimization problems for large structured matrices is proposed and studied. The class of optimization problems considered is related to computing structured pseudospectra and their extremal points, and…
Sobolev embeddings, of arbitrary order, are considered into function spaces on domains of $\mathbb R^n$ endowed with measures whose decay on balls is dominated by a power $d$ of their radius. Norms in arbitrary rearrangement-invariant…
In this paper, we study approximate Hadamard matrices, that is, well-conditioned $n\times n$ matrices with all entries in $\{\pm1\}$. We show that the smallest-possible condition number goes to $1$ as $n\to\infty$, and we identify some…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…
For finite-dimensional bipartite quantum systems, we find the exact size of the largest balls, in spectral $l_p$ norms for $1 \le p \le \infty$, of separable (unentangled) matrices around the identity matrix. This implies a simple and…
Markov matrices of equal-input type constitute a widely used model class. The corresponding equal-input generators span an interesting subalgebra of the real matrices with zero row sums. Here, we summarise some of their amazing properties…
Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…
Given a matrix of distribution functions and a quasi-stochastic matrix, i.e. an irreducible nonnegative matrix with maximal eigenvalue one and associated unique positive left and right eigenvectors, the article studies the properties of an…
For Markov processes with absorption, we provide general criteria ensuring the existence and the exponential non-uniform convergence in total variation norm to a quasi-stationary distribution. We also characterize a subset of its domain of…
We consider the problem of approximating the reachability probabilities in Markov decision processes (MDP) with uncountable (continuous) state and action spaces. While there are algorithms that, for special classes of such MDP, provide a…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…