Related papers: A Perron-Frobenius type result for integer maps an…
This paper considers homogeneous order preserving continuous maps on the normal cone of an ordered normed vector space. It is shown that certain operators of that kind which are not necessarily compact themselves but have a compact power…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
The region of entropic vectors is a convex cone that has been shown to be at the core of many fundamental limits for problems in multiterminal data compression, network coding, and multimedia transmission. This cone has been shown to be…
A survey of direct and inverse type results for row sequences of Pad\'e and Hermite-Pad\'e approximation is given. A conjecture is posed on an inverse type result for type II Hermite-Pad\'e approximation when it is known that the sequence…
Special bases of orthogonal polynomials are defined, that are suited to expansions of density and potential perturbations under strict particle number conservation. Particle-hole expansions of the density response to an arbitrary…
We revisit the definition of transverse frames and tetrad choices with regards to its application to numerically generated spacetimes, in particular those from the merger of binary black holes. We introduce the concept of local and…
We develop the Perron-Frobenius theory using a variational approach and extend it to a set of arbitrary matrices, including those that are neither irreducible nor essentially positive, and non-preserved cones. We introduce a new concept…
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
Consider a random regular graph of fixed degree $d$ with $n$ vertices. We study spectral properties of the adjacency matrix and of random Schr\"odinger operators on such a graph as $n$ tends to infinity. We prove that the integrated density…
Eigenvectors and eigenvalues of discrete graph Laplacians are often used for manifold learning and nonlinear dimensionality reduction. It was previously proved by Belkin and Niyogi that the eigenvectors and eigenvalues of the graph…
Let $E = L_p, \; 1<p\leq 2,$ and $A : E \to E^*$ be a bounded monotone map such that $0 \in R(A)$. In this paper, we introduce and study an algorithm for approximating zeros of $A$. Furthermore, we study the application of this algorithm to…
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…
Several problems in machine learning, statistics, and other fields rely on computing eigenvectors. For large scale problems, the computation of these eigenvectors is typically performed via iterative schemes such as subspace iteration or…
We investigate elementary topological properties of sets of completely positive (CP) maps that arise in quantum Perron-Frobenius theory. We prove that the set of primitive CP maps of fixed Kraus rank is path-connected and we provide a…
We obtain extensions of the Poincar\'e and Perron theorems for higher order recurrence relations and apply them to obtain an inverse type theorem for row sequences of (type II) Hermite-Pad\'e approximation of a vector of formal power…
A mapping M(t) is considered to obtain some preliminary results and a new trapezoidal form of Fejer inequality related to the h-convex functions. Furthermore the obtained results are applied to achieve some new inequalities in connection…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…
We prove that if an $n\times n$ matrix defined over ${\mathbb Q}_p$ (or more generally an arbitrary complete, discretely-valued, non-Archimedean field) satisfies a certain congruence property, then it has a strictly maximal eigenvalue in…