Related papers: Preserving positivity for matrices with sparsity c…

We prove that the only entrywise transforms of rectangular matrices which preserve total positivity or total non-negativity are either constant or linear. This follows from an extended classification of preservers of these two properties…

This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…

The matrix convexity and the matrix monotony of a real $C^1$ function $f$ on $(0,\infty)$ are characterized in terms of the conditional negative or positive definiteness of the Loewner matrices associated with $f$, $tf(t)$, and $t^2f(t)$.…

Entrywise powers of matrices have been well-studied in the literature, and have recently received renewed attention in the regularization of high-dimensional correlation matrices. In this paper, we study powers of positive semidefinite…

We consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

We prove the complete monotonicity on $(0,\infty)^n$ for suitable inverse powers of the spanning-tree polynomials of graphs and, more generally, of the basis generating polynomials of certain classes of matroids. This generalizes a result…

We classify all functions which, when applied term by term, leave invariant the sequences of moments of positive measures on the real line. Rather unexpectedly, these functions are built of absolutely monotonic components, or reflections of…

In this paper, we study matrix valued positive definite functions on a unimodular group. We generalize two important results of Godement on square integrable positive definite functions to matrix valued square integrable positive definite…

Monadic stability generalizes many tameness notions from structural graph theory such as planarity, bounded degree, bounded tree-width, and nowhere density. The sparsification conjecture predicts that the (possibly dense) monadically stable…

We develop a theory of partially defined complete positivity preservers, extending Schoenberg's classical characterization to functions defined only on discrete subsets or constrained domains. We frame the extension problem through the…

According to a celebrated result by L\"owner, a real-valued function $f$ is operator monotone if and only if its L\"owner matrix, which is the matrix of divided differences $L_f=(\frac{f(x_i)-f(x_j)}{x_i-x_j})_{i,j=1}^N$, is positive…

Basic properties in Perron-Frobenius theory are strict positivity, primitivityand irreducibility. Whereas for nonnegative matrices, these properties are equivalent to elementary graph properties which can be checked in polynomial time, we…

An operator convex function on (0,\infty) which satisfies the symmetry condition k(1/x) = x k(x) can be used to define a type of non-commutative multiplication by a positive definite matrix (or its inverse) using the primitive concepts of…

The field of compressed sensing has become a major tool in high-dimensional analysis, with the realization that vectors can be recovered from relatively very few linear measurements as long as the vectors lie in a low-dimensional structure,…

We study Loewner chains in $\mathcal{H}_0(\mathbb{D})$ without assuming univalence of each element. We prove a decomposition: every chain admits a factorization $f_t=F\circ g_t$, where $F$ is analytic on $\mathbb{D}(0,r)$ with $r=\lim_{t…

Normal matrices, or matrices which commute with their adjoints, are of fundamental importance in pure and applied mathematics. In this paper, we study a natural functional on the space of square complex matrices whose global minimizers are…

For any simple graph $G$ on $n$ vertices, the (positive semi-definite) minimum rank of $G$ is defined to be the smallest possible rank among all (positive semi-definite) real symmetric $n\times n$ matrices whose entry in position $(i,j)$,…

Given a function $f$ on the positive half-line $\R_+$ and a sequence (finite or infinite) of points $X=\{x_k\}_{k=1}^\omega$ in $\R^n$, we define and study matrices $\kS_X(f)=\|f(|x_i-x_j|)\|_{i,j=1}^\omega$ called Schoenberg's matrices. We…

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…