Related papers: Embeddable Markov Matrices
Hidden Markov models have successfully been applied as models of discrete time series in many fields. Often, when applied in practice, the parameters of these models have to be estimated. The currently predominating identification methods,…
An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about…
When applying eigenvalue decomposition on the quadratic term matrix in a type of linear equally constrained quadratic programming (EQP), there exists a linear mapping to project optimal solutions between the new EQP formulation where $Q$ is…
Matrix approximation is a common tool in machine learning for building accurate prediction models for recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
The unit distance embeddability of a graph, like planarity, involves a mix of constraints that are combinatorial and geometric. We construct a unit distance embedding for $H-e$ in the hope that it will lead to an embedding for $H$. We then…
In this paper we consider the problem of computing the stationary distribution of nearly completely decomposable Markov processes, a well-established area in the classical theory of Markov processes with broad applications in the design,…
We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…
By using the integration by parts formula of a Markov operator, the closability of quadratic forms associated to the corresponding invariant probability measure is proved. The general result is applied to the study of semilinear SPDEs,…
The classical embeddability problem asks whether a given stochastic matrix $T$, describing transition probabilities of a $d$-level system, can arise from the underlying homogeneous continuous-time Markov process. Here, we investigate the…
Markov's theorem classifies the worst irrational numbers with respect to rational approximation and the indefinite binary quadratic forms whose values for integer arguments stay farthest away from zero. The main purpose of this paper is to…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
In this paper, we study good semigroups of \mathbb{N}^n, a class of semigroups that contains the value semigroups of algebroid curves with n branches. We give the definition of embedding dimension of a good semigroup showing that, in the…
Consider the following optimization problem: Given $n \times n$ matrices $A$ and $\Lambda$, maximize $\langle A, U\Lambda U^*\rangle$ where $U$ varies over the unitary group $\mathrm{U}(n)$. This problem seeks to approximate $A$ by a matrix…
This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a finite set of parameters. Fixing values for all parameters…
We give an exact solution to the nonlinear optimization problem of approximating a Hermitian matrix by positive semi-definite matrices. Our algorithm was then used to judge whether a quantum state is entangled or not. We show that the exact…
We provide a framework for speeding up algorithms for time-bounded reachability analysis of continuous-time Markov decision processes. The principle is to find a small, but almost equivalent subsystem of the original system and only analyse…
This paper concerns the geometric structure of optimizers for frame potentials. We consider finite, real or complex frames and rotation or unitarily invariant potentials, and mostly specialize to Parseval frames, meaning the frame potential…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
This paper is concerned with achieving optimal coherence for highly redundant real unit-norm frames. As the redundancy grows, the number of vectors in the frame becomes too large to admit equiangular arrangements. In this case, other…