English
Related papers

Related papers: Projective distance and $g$-measures

200 papers

In this paper, we propose a generalized notion of a distance function, called a $g$-metric. The $g$-metric with degree $n$ is a distance of $n+1$ points, generalizing the ordinary distance between two points and $G$-metric between three…

General Topology · Mathematics 2024-11-12 Hayoung Choi , Sejong Kim , Seung Yeop Yang

In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…

Computational Geometry · Computer Science 2019-01-28 Michael Kerber , Arnur Nigmetov

We consider a sequence of identically independently distributed random samples from an absolutely continuous probability measure in one dimension with unbounded density. We establish a new rate of convergence of the $\infty-$Wasserstein…

Probability · Mathematics 2018-08-03 Anning Liu , Jian-Guo Liu , Yulong Lu

The Gromov-Hausdorff distance measures the similarity between two metric spaces by isometrically embedding them into an ambient metric space. We introduce an analogue of this distance for metric spaces endowed with directed structures. The…

We consider Sobolev-type distances on probability measures over separable Hilbert spaces involving the Schatten-$p$ norms, which include as special cases a distance first introduced by Bourguin and Campese (2020) when $p=2$, and a distance…

Probability · Mathematics 2026-02-03 Federico Bassetti , Solesne Bourguin , Simon Campese , Giovanni Peccati

A method of induction the distances with Hilbert structure is proposed. Some properties of the method are studied. Typical examples of corresponding metric spaces are discussed. Key words: Hilbert spaces; metric spaces; isometric embedding…

Functional Analysis · Mathematics 2018-04-27 Vesna Gotovac , Katerina Helisova , Lev B. Klebanov , Irina V. Volchenkova

Information entropy and its extension, which are important generalization of entropy, have been applied in many research domains today. In this paper, a novel generalized relative entropy is constructed to avoid some defects of traditional…

Information Theory · Computer Science 2017-04-24 Shuai Liu , Mengye Lu , Gaocheng Liu , Zheng Pan

We study the pointwise dimension for a new class of projection measures on arbitrary fractal limit sets without separation conditions. We prove that the pointwise dimension exists a.e. for this class of measures associated to equilibrium…

Dynamical Systems · Mathematics 2019-08-28 Eugen Mihailescu

For self-similar sets on $\mathbb{R}$ satisfying the exponential separation condition we show that the natural projections of shift invariant ergodic measures is equal to $\min\{1,\frac{h}{-\chi}\}$, where $h$ and $\chi$ are the entropy and…

Dynamical Systems · Mathematics 2020-05-06 Thomas Jordan , Ariel Rapaport

Distance function to a compact set plays a central role in several areas of computational geometry. Methods that rely on it are robust to the perturbations of the data by the Hausdorff noise, but fail in the presence of outliers. The…

Computational Geometry · Computer Science 2011-02-25 Leonidas J. Guibas , Quentin Mérigot , Dmitriy Morozov

This paper is about similarity between objects that can be represented as points in metric measure spaces. A metric measure space is a metric space that is also equipped with a measure. For example, a network with distances between its…

Discrete Mathematics · Computer Science 2020-11-03 Evgeny Dantsin , Alexander Wolpert

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…

Computational Complexity · Computer Science 2011-11-09 Ming Li , Xin Chen , Xin Li , Bin Ma , Paul Vitanyi

We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization…

Statistics Theory · Mathematics 2020-01-29 Jing Lei

A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…

Computational Geometry · Computer Science 2022-09-27 Sushovan Majhi , Carola Wenk

Quantifying the distance between datasets is a fundamental question in mathematics and machine learning. We propose \textit{magnitude distance}, a novel distance metric defined on finite datasets using the notion of the \emph{magnitude} of…

Machine Learning · Computer Science 2026-02-10 Sahel Torkamani , Henry Gouk , Rik Sarkar

Applications in data science, shape analysis and object classification frequently require comparison of probability distributions defined on different ambient spaces. To accomplish this, one requires a notion of distance on a given class of…

Metric Geometry · Mathematics 2022-07-19 Facundo Mémoli , Tom Needham

We set up a model for reasoning about metric spaces with belief theoretic measures. The uncertainty in these spaces stems from both probability and metric. To represent both aspect of uncertainty, we choose an expected distance function as…

Artificial Intelligence · Computer Science 2012-07-02 Seunghwan Lee

We show the existence of the local dimension of an invariant probability measure on an infinitely generated self-affine set, for almost all translations. This implies that an ergodic probability measure is exactly dimensional. Furthermore…

Metric Geometry · Mathematics 2014-05-22 Eino Rossi

This paper gives a self-contained introduction to the Hilbert projective metric $\mathcal{H}$ and its fundamental properties, with a particular focus on the space of probability measures. We start by defining the Hilbert pseudo-metric on…

Probability · Mathematics 2024-11-13 Samuel N. Cohen , Eliana Fausti

We consider random i.i.d. samples of absolutely continuous measures on bounded connected domains. We prove an upper bound on the $\infty$-transportation distance between the measure and the empirical measure of the sample. The bound is…

Probability · Mathematics 2014-07-07 Nicolás García Trillos , Dejan Slepčev