Related papers: On distance in total variation between image measu…
In many robotics applications, it is necessary to compute not only the distance between the robot and the environment, but also its derivative - for example, when using control barrier functions. However, since the traditional Euclidean…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…
This study investigates the extension of distance variance, a validated spread metric for continuous and binary variables [Edelmann et al., 2020, Ann. Stat., 48(6)], to quantify the spread of general categorical variables. We provide both…
A bound for functional $\Delta(F)=\sup_{x\in\mathbb R}|F(x)-\Phi(x)|$ is obtained, which is uniform for all distribution functions $F$ of random variables with zero mean-value and unity variance. Moreover, a two-point distribution is found,…
We study a family of distance functions on rankings that allow for asymmetric treatments of alternatives and consider the distinct relevance of the top and bottom positions for ordered lists. We provide a full axiomatic characterization of…
The $f$-divergence is a fundamental notion that measures the difference between two distributions. In this paper, we study the problem of approximating the $f$-divergence between two Ising models, which is a generalization of recent work on…
We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…
Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the…
Consider a sequence of polynomials of bounded degree evaluated in independent Gaussian, Gamma or Beta random variables. We show that, if this sequence converges in law to a nonconstant distribution, then (i) the limit distribution is…
This paper proposes a geometric estimator of dependency between a pair of multivariate samples. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate…
Let $\{X, X_{n}; n \geq 1\}$ be a sequence of i.i.d. non-degenerate real-valued random variables with $\mathbb{E}X^{2} < \infty$. Let $S_{n} = \sum_{i=1}^{n} X_{i}$, $n \geq 1$. Let $g(\cdot): ~[0, \infty) \rightarrow [0, \infty)$ be a…
Distance distributions are a key building block in stochastic geometry modelling of wireless networks and in many other fields in mathematics and science. In this paper, we propose a novel framework for analytically computing the closed…
We first introduce a class of divergence measures between power spectral density matrices. These are derived by comparing the suitability of different models in the context of optimal prediction. Distances between "infinitesimally close"…
Given two sets $x_1^{(1)},\ldots,x_{n_1}^{(1)}$ and $x_1^{(2)},\ldots,x_{n_2}^{(2)}\in\mathbb{R}^p$ (or $\mathbb{C}^p$) of random vectors with zero mean and positive definite covariance matrices $C_1$ and $C_2\in\mathbb{R}^{p\times p}$ (or…
We explore the question asking for graphs $G$ for which the total distance decreases, possibly by a fixed constant $k$, upon the removal of any of its vertices. We obtain results leading to intuition and doubts for the \v{S}olt\'es' problem…
Given two distributions $\mathcal{P}$ and $\mathcal{Q}$ over a high-dimensional domain $\{0,1\}^n$, and a parameter $\varepsilon$, the goal of distance estimation is to determine the statistical distance between $\mathcal{P}$ and…
Let $X$ be a $d$-dimensional random vector and $X_\theta$ its projection onto the span of a set of orthonormal vectors $\{\theta_1,...,\theta_k\}$. Conditions on the distribution of $X$ are given such that if $\theta$ is chosen according to…
Let $G$ be a connected graph of order $n$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the mean of all eccentricities in $G$. We give upper bounds on the…