Related papers: Is the Chen-Sbert Divergence a Metric?
Let $\lambda$ be a probability measure on $\mathbb T^{n-1}$ where $n=2$ or 3. Suppose $\lambda$ is invariant, ergodic and has positive entropy with respect to the linear transformation defined by a hyperbolic matrix. We get a measure $\mu $…
Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…
A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…
We propose the use of a simple intuitive principle for measuring algorithmic classification bias: the significance of the differences in a classifier's error rates across the various demographics is inversely commensurate with the sample…
A directed graph, called an M-graph, is attached to every melody. Our chief concern in this paper is to investigate (1) how the positivity of the slope of the M-graph is related to singability of the melody, (2) when the M-graph has a…
Sofic measures, also known as hidden Markov measures, have been extensively studied. In this paper, we survey some equivalent definitions of this notion and improve a bound for deciding whether a sofic measure is~$k$-step Markov. We prove…
Any three-dimensional Riemannian metric can be locally obtained by deforming a constant curvature metric along one direction. The general interest of this result, both in geometry and physics, and related open problems are stressed.
A (molecular) graph in which all vertices have the same degree is known as a regular graph. According to Gutman, Hansen, and M\'elot [J. Chem. Inf. Model. 45 (2005) 222-230], it is of interest to measure the irregularity of nonregular…
A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…
In this paper we study the quantum generalisation of the skew divergence, which is a dissimilarity measure between distributions introduced by L. Lee in the context of natural language processing. We provide an in-depth study of the quantum…
There are many information and divergence measures exist in the literature on information theory and statistics. The most famous among them are Kullback-Leiber relative information and Jeffreys J-divergence. The measures like, Bhattacharya…
In this paper, we mainly study metric subregularity for a convex constraint system defined by a convex set-valued mapping and a convex constraint subset. The main work is to provide several primal equivalent conditions for metric…
R\'enyi divergence is related to R\'enyi entropy much like information divergence (also called Kullback-Leibler divergence or relative entropy) is related to Shannon's entropy, and comes up in many settings. It was introduced by R\'enyi as…
Cone spherical metrics, defined on compact Riemann surfaces, are conformal metrics with constant curvature one and finitely many cone singularities. Such a metric is termed \textit{reducible} if a developing map of the metric has monodromy…
In this paper we introduce and study the notion of I-convergence of sequences in a metric-like space, where I is an ideal of subsets of the set N of all natural numbers. Further introducing the notion of I*-convergence of sequences in a…
In this paper we provide the asymptotic theory of the general of $\phi$-divergences measures, which includes the most common divergence measures : Renyi and Tsallis families and the Kullback-Leibler measure. Instead of using the Parzen…
Deep metric learning papers from the past four years have consistently claimed great advances in accuracy, often more than doubling the performance of decade-old methods. In this paper, we take a closer look at the field to see if this is…
In order to construct a measure of entanglement on the basis of a ``distance'' between two states, it is one of desirable properties that the ``distance'' is nonincreasing under every completely positive trace preserving map. Contrary to a…
A $k$-geodetic digraph with minimum out-degree $d$ has excess $\epsilon $ if it has order $M(d,k) + \epsilon $, where $M(d,k)$ represents the Moore bound for out-degree $d$ and diameter $k$. For given $\epsilon $, it is simple to show that…
Consider a random sample of $n$ independently and identically distributed $p$-dimensional normal random vectors. A test statistic for complete independence of high-dimensional normal distributions, proposed by Schott (2005), is defined as…