Related papers: Evaluating approximations of the semidefinite cone…
The Schatten quasi-norm was introduced to bridge the gap between the trace norm and rank function. However, existing algorithms are too slow or even impractical for large-scale problems. Motivated by the equivalence relation between the…
Building upon the Chatterjee correlation (2021: J. Am. Stat. Assoc. 116, p2009) for two real-valued variables, this study introduces a generalized measure of directed association between two vector variables, real or complex-valued, and of…
Positive semidefinite (PSD) matrices are indispensable in many fields of science. A similarity measurement for such matrices is usually an essential ingredient in the mathematical modelling of a scientific problem. This paper proposes a…
For an $n\times n$ diagonally dominant matrix $T=(t_{i,j})_{n\times n}$ with positive elements satisfying certain bounding conditions, we propose to use a diagonal matrix $S=(s_{i,j})_{n\times n}$ to approximate the inverse of $T$, where…
Normalized compression distance (NCD) is a parameter-free, feature-free, alignment-free, similarity measure between a pair of finite objects based on compression. However, it is not sufficient for all applications. We propose an NCD of…
This paper concerns a method of testing equality of distribution of random convex compact sets and the way how to use the test to distinguish between two realisations of general random sets. The family of metrics on the space of…
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…
The quantum relative entropy is frequently used as a distance measure between two quantum states, and inequalities relating it to other distance measures are important mathematical tools in many areas of quantum information theory. We have…
The distance standard deviation, which arises in distance correlation analysis of multivariate data, is studied as a measure of spread. The asymptotic distribution of the empirical distance standard deviation is derived under the assumption…
Applications of optimal transport have recently gained remarkable attention thanks to the computational advantages of entropic regularization. However, in most situations the Sinkhorn approximation of the Wasserstein distance is replaced by…
A new similarity measure for two sets of S-parameters is proposed. It is constructed with the modified Hausdorff distance applied to S-parameter points in 3D space with real, imaginary and normalized frequency axes. New S-parameters…
Over the past few years, trace regression models have received considerable attention in the context of matrix completion, quantum state tomography, and compressed sensing. Estimation of the underlying matrix from regularization-based…
Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…
Positive definite matrices abound in a dazzling variety of applications. This ubiquity can be in part attributed to their rich geometric structure: positive definite matrices form a self-dual convex cone whose strict interior is a…
Let $A$ be an $m\times m$ positive semidefinite block matrix with each block being $n$-square. We write $\mathrm{tr}_1$ and $\mathrm{tr}_2$ for the first and second partial trace, respectively. In this paper, we prove the following…
We investigate the relationship between partial traces and their dilations for general complex matrices, focusing on two main aspects: the existence of (joint) dilations and norm inequalities relating partial traces and their dilations.…
A measure of quantum non-Markovianity for an open system dynamics, based on revivals of the distinguishability between system states, has been introduced in the literature using the trace distance as quantifier for distinguishability.…
Common measures of neural representational (dis)similarity are designed to be insensitive to rotations and reflections of the neural activation space. Motivated by the premise that the tuning of individual units may be important, there has…
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…