Related papers: The truncated matrix trigonometric moment problem …
This paper is concerned with approximations of the Boltzmann equation based on the method of moments. We propose a generalization of the setting of the moment-closure problem from relative entropy to {\phi}-divergences and a corresponding…
We consider the problem of approximating the moment generating function (MGF) of a truncated random variable in terms of the MGF of the underlying (i.e., untruncated) random variable. The purpose of approximating the MGF is to enable the…
The four major asymptotic level density laws of random matrix theory may all be showcased though their Jacobi parameter representation as having a bordered Toeplitz form. We compare and contrast these laws, completing and exploring their…
The classical result of Vandermonde decomposition of positive semidefinite Toeplitz matrices, which dates back to the early twentieth century, forms the basis of modern subspace and recent atomic norm methods for frequency estimation. In…
Matryoshka dolls, the traditional Russian nesting figurines, are known world-wide for each doll's encapsulation of a sequence of smaller dolls. In this paper, we identify a large class of Markov process whose moments are easy to compute by…
In this paper we obtain a Nevanlinna-type parametrization for the operator Hamburger moment problem. The moment problem is not supposed to be necessarily completely indeterminate. No assumptions besides the solvability of the moment problem…
This paper proposes an algorithm to generate random numbers from any member of the truncated multivariate elliptical family of distributions with a strictly decreasing density generating function. Based on Neal (2003) and Ho et al. (2012),…
In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…
We compute the deterministic approximation for mixed fluctuation moments of products of deterministic matrices and general Sobolev functions of Wigner matrices. Restricting to polynomials, our formulas reproduce recent results of [Male,…
Min-plus product of two $n\times n$ matrices is a fundamental problem in algorithm research. It is known to be equivalent to APSP, and in general it has no truly subcubic algorithms. In this paper, we focus on the min-plus product on a…
Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However,…
Matrix regularity is a key to various problems in applied mathematics. The sufficient conditions, used for checking regularity of interval parametric matrices, usually fail in case of large parameter intervals. We present necessary and…
Non-commutative polynomial optimization is a powerful technique with numerous applications in quantum nonlocality, quantum key distribution, causal inference, many-body physics, amongst others. The standard approach is to reduce such…
This paper deals with the moment problem on a (not necessarily finitely generated) commutative unital real algebra $A$. We define moment functionals on $A$ as linear functionals which can be written as integrals over characters of $A$ with…
This is the abstract of the revised paper. The integrable XXZ model with a special open boundary condition is considered. We study Sklyanin transfer matrices after quantum group reduction in roots of unity. In this case Sklyanin transfer…
The first part of this paper is devoted to an analysis of moment problems in R^n with supports contained in a closed set defined by finitely many polynomial inequalities. The second part of the paper uses the representation results of…
This paper is focuses on the computation of the positive moments of one-side correlated random Gram matrices. Closed-form expressions for the moments can be obtained easily, but numerical evaluation thereof is prone to numerical stability,…
We present a deterministic polynomial-time algorithm for estimating the volume of a hypercube intersected by a fixed number of constraints of the type $f(x) \leq b$, where $f$ is the sum of univariate functions that are each nonnegative,…
We obtain the explicit rate of convergence $N^{-1/2 + \epsilon}$ for the gaps of generalized Wigner matrices in the bulk of the spectrum, for distributions of matrix entries possibly atomic and supported on enough points. The proof proceeds…
We solve the Dry Ten Martini Problem in the non-critical case, i.e., all possible spectral gaps are open for almost Mathieu operators with $\lambda\ne \pm 1$.