Related papers: Smallest and largest generalized eigenvalues of la…
The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…
We consider the problem of approximating numerically the moments and the supports of measures which are invariant with respect to the dynamics of continuous- and discrete-time polynomial systems, under semialgebraic set constraints. First,…
Quantization provides a very natural way to preserve the convex order when approximating two ordered probability measures by two finitely supported ones. Indeed, when the convex order dominating original probability measure is compactly…
We study optimal simple second-order cone representations (a particular subclass of second-order cone representations) for weighted geometric means, which turns out to be closely related to minimum mediated sets. Several lower and upper…
In this note we study a minimization problem for a vector of measures subject to a prescribed interaction matrix in the presence of external potentials. The conductors are allowed to have zero distance from each other but the external…
Under the formalism of annealed averaging of the partition function, a type of random multifractal measures with their multipliers satisfying exponentially distributed is investigated in detail. Branching emerges in the curve of generalized…
This paper presents a parallel algorithm for finding the smallest eigenvalue of a particular form of ill-conditioned Hankel matrix, which requires the use of extremely high precision arithmetic. Surprisingly, we find that commonly-used…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
In a variety of applications it is important to extract information from a probability measure $\mu$ on an infinite dimensional space. Examples include the Bayesian approach to inverse problems and possibly conditioned) continuous time…
We propose a novel parallel numerical algorithm for calculating the smallest eigenvalues of highly ill-conditioned matrices. It is based on the {\it LDLT} decomposition and involves finding a $k \times k$ sub-matrix of the inverse of the…
We study the isoperimetric problem for the radially symmetric measures. Applying the spherical symmetrization procedure and variational arguments we reduce this problem to a one-dimensional ODE of the second order. Solving numerically this…
In a metric space $(X,d)$ we reconstruct an approximation of a Borel measure $\mu$ starting from a premeasure $q$ defined on the collection of closed balls, and such that $q$ approximates the values of $\mu$ on these balls. More precisely,…
We give a complete characterization of the size of Borel sets that are mid-point convex but not (essentially) convex, in terms of their Hausdorff dimensions and Hausdorff measures.
Suppose that $K\subset\C$ is compact and that $z_0\in\C\backslash K$ is an external point. An optimal prediction measure for regression by polynomials of degree at most $n,$ is one for which the variance of the prediction at $z_0$ is as…
The power moments of a positive measure on the real line or the circle are characterized by the non-negativity of an infinite matrix, Hankel, respectively Toeplitz, attached to the data. Except some fortunate configurations, in higher…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
The nonzero eigenvalues of $AB$ are equal to those of $BA$: an identity that holds as long as the products are square, even when $A,B$ are rectangular. This fact naturally suggests an efficient algorithm for computing eigenvalues and…
This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…
We consider a set of probability measures on a finite event space $\Omega$. The mutual affinity is introduced in terms of the spectrum of the associated Gram matrix. We show that, for randomly chosen measures, the empirical eigenvalue…
We prove a moment majorization principle for matrix-valued functions with domain $\{-1,1\}^{m}$, $m\in\mathbb{N}$. The principle is an inequality between higher-order moments of a non-commutative multilinear polynomial with different random…