Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.15441

Asymptotic behavior of the Manhattan distance in $n$-dimensions: Estimating multidimensional scenarios in empirical experiments

Ergon Cugler de Moraes Silva
View original source ↗Read source document ↗Export metadata ↓

Abstract

Understanding distance metrics in high-dimensional spaces is crucial for various fields such as data analysis, machine learning, and optimization. The Manhattan distance, a fundamental metric in multi-dimensional settings, measures the distance between two points by summing the absolute differences along each dimension. This study investigates the behavior of Manhattan distance as the dimensionality of the space increases, addressing the question: how does the Manhattan distance between two points change as the number of dimensions n increases?. We analyze the theoretical properties and statistical behavior of Manhattan distance through mathematical derivations and computational simulations using Python. By examining random points uniformly distributed in fixed intervals across dimensions, we explore the asymptotic behavior of Manhattan distance and validate theoretical expectations empirically. Our findings reveal that the mean and variance of Manhattan distance exhibit predictable trends as dimensionality increases, aligning closely with theoretical predictions. Visualizations of Manhattan distance distributions across varying dimensionalities offer intuitive insights into its behavior. This study contributes to the understanding of distance metrics in high-dimensional spaces, providing insights for applications requiring efficient navigation and analysis in multi-dimensional domains.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Ergon Cugler de Moraes Silva. 2024-05-30. Asymptotic behavior of the Manhattan distance in $n$-dimensions: Estimating multidimensional scenarios in empirical experiments. https://arxiv.org/abs/2406.15441

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗