English
Related papers

Related papers: The distance problem via subadditivity

200 papers

In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…

General Mathematics · Mathematics 2013-07-04 Yanyan Zhuang , Jianping Pan

In this article we investigate the asymptotic behavior of a new class of multi-dimensional diffusions in random environment. We introduce cut times in the spirit of the work done by Bolthausen, Sznitman and Zeitouni, see [4], in the…

Probability · Mathematics 2009-12-12 Ivan del Tenno

Minimum divergence problems under integral constraints appear throughout statistics and probability, including sequential inference, bandit theory, and distributionally robust optimization. In many such settings, dual representations are…

Information Theory · Computer Science 2026-03-24 Shubhanshu Shekhar , Shubhada Agrawal

We study finitely additive extensions of the asymptotic density to all the subsets of natural numbers. Such measures are called density measures. We consider a class of density measures constructed from free ultrafilters on $\mathbb{N}$ and…

Number Theory · Mathematics 2016-01-26 Ryoichi Kunisada

We consider the numerical solution of the optimal transport problem between densities that are supported on sets of unequal dimension. Recent work by McCann and Pass reformulates this problem into a non-local Monge-Amp\`ere type equation.…

Numerical Analysis · Mathematics 2023-07-14 Matthew A. Cassini , Brittany Froese Hamfeldt

In this paper we propose and study a class of nonparametric, yet interpretable measures of association between two random vectors $X$ and $Y$ taking values in $\mathbb{R}^{d_1}$ and $\mathbb{R}^{d_2}$ respectively ($d_1, d_2\ge 1$). These…

Statistics Theory · Mathematics 2024-11-21 Nabarun Deb , Promit Ghosal , Bodhisattva Sen

We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…

Probability · Mathematics 2025-02-18 Martin Huesmann , Michael Goldman , Dario Trevisan

Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…

Metric Geometry · Mathematics 2020-09-18 Alex McDonald , Brian McDonald , Jonathan Passant , Anurag Sahay

We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…

Physics and Society · Physics 2021-08-19 Karel Devriendt , Samuel Martin-Gutierrez , Renaud Lambiotte

We consider a one dimensional transport model with nonlocal velocity given by the Hilbert transform and develop a global well-posedness theory of probability measure solutions. Both the viscous and non-viscous cases are analyzed. Both in…

Analysis of PDEs · Mathematics 2011-11-01 J. A. Carrillo , L. C. F. Ferreira , J. C. Precioso

We introduce the concept of boundariness capturing the most efficient way of expressing a given element of a convex set as a probability mixture of its boundary elements. In other words, this number measures (without the need of any…

Quantum Physics · Physics 2014-09-01 Erkka Haapasalo , Michal Sedlak , Mario Ziman

A central property of a classical geometry is that the geodesic distance between two events is \emph{additive}. When considering quantum fluctuations in the metric or a quantum or statistical superposition of different spacetimes,…

High Energy Physics - Theory · Physics 2023-09-06 Federico Piazza , Andrew J. Tolley

Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiple random variables. The problem of efficient representation of probability distributions is central in term of…

Artificial Intelligence · Computer Science 2016-08-16 David Bellot , Pierre Bessiere

We have defined almost separable space. We show that like separability, almost separability is $c$ productive and converse also true under some restrictions. We establish a Baire Category theorem like result in Hausdorff, Pseudocompacts…

General Topology · Mathematics 2020-02-13 Sagarmoy Bag , Ram Chandra Manna , Sourav Kanti Patra

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of Babai, Frankl, and Simon in the 1980s and culminating in the…

Computational Complexity · Computer Science 2026-03-23 Zach Hunter , Aleksa Milojević , Benny Sudakov , Istvan Tomon

A confidence distribution is a complete tool for making frequentist inference for a parameter of interest $\psi$ based on an assumed parametric model. Indeed, it allows to reach point estimates, to assess their precision, to set up tests…

Methodology · Statistics 2022-12-20 Elena Bortolato , Laura Ventura

I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…

General Relativity and Quantum Cosmology · Physics 2015-06-25 Luca Bombelli

We prove that the distribution of the product of two correlated normal random variables with arbitrary means and arbitrary variances is infinitely divisible. We also obtain exact formulas for the probability density function of the sum of…

Probability · Mathematics 2025-06-10 Robert E. Gaunt , Saralees Nadarajah , Tibor K. Pogány

Diversities are an extension of the concept of a metric space which assign a non-negative value to every finite set of points, rather than just pairs. A general theory of diversities has been developed which exhibits many deep analogies to…

Metric Geometry · Mathematics 2026-03-04 David Bryant , Paul Tupper

We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…

Probability · Mathematics 2007-05-23 Pratip Bhattacharyya , Bikas K. Chakrabarti