English
Related papers

Related papers: Distances between Poisson k-flats

200 papers

Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…

Probability · Mathematics 2024-11-04 Holger Sambale , Christoph Thäle , Tara Trauthwein

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

A $U$-statistic of a Poisson point process is defined as the sum $\sum f(x_1,\ldots,x_k)$ over all (possibly infinitely many) $k$-tuples of distinct points of the point process. Using the Malliavin calculus, the Wiener-It\^{o} chaos…

Probability · Mathematics 2013-12-13 Matthias Reitzner , Matthias Schulte

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich , Misha Rudnev

A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…

Probability · Mathematics 2019-08-27 Daniel Hug , Rolf Schneider

This work considers the problem of estimating the distance between two covariance matrices directly from the data. Particularly, we are interested in the family of distances that can be expressed as sums of traces of functions that are…

Machine Learning · Computer Science 2024-09-19 Roberto Pereira , Xavier Mestre , Davig Gregoratti

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

Probability · Mathematics 2025-02-06 Stefan Gerdjikov , Martin Minchev , Mladen Savov

We introduce a reduction from the distinct distances problem in ${\mathbb R}^d$ to an incidence problem with $(d-1)$-flats in ${\mathbb R}^{2d-1}$. Deriving the conjectured bound for this incidence problem (the bound predicted by the…

Combinatorics · Mathematics 2019-04-09 Sam Bardwell-Evans , Adam Sheffer

We study the $k$-th nearest neighbor distance function from a finite point-set in $\mathbb{R}^d$. We provide a Morse theoretic framework to analyze the sub-level set topology. In particular, we present a simple combinatorial-geometric…

Computational Geometry · Computer Science 2024-03-20 Yohai Reani , Omer Bobrowski

A Poisson or a binomial process on an abstract state space and a symmetric function $f$ acting on $k$-tuples of its points are considered. They induce a point process on the target space of $f$. The main result is a functional limit theorem…

Probability · Mathematics 2016-06-07 Laurent Decreusefond , Matthias Schulte , Christoph Thäle

A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…

Combinatorics · Mathematics 2013-12-17 J. Solymosi , Cs. D. Toth

We investigate contraction of the Wasserstein distances on $\mathbb{R}^d$ under Gaussian smoothing. It is well known that the heat semigroup is exponentially contractive with respect to the Wasserstein distances on manifolds of positive…

Probability · Mathematics 2020-12-15 Hong-Bin Chen , Jonathan Niles-Weed

The aim of the present article is to introduce a concept which allows to generalise the notion of Poissonian pair correlation, a second-order equidistribution property, to higher dimensions. Roughly speaking, in the one-dimensional setting,…

Number Theory · Mathematics 2018-09-18 Aicke Hinrichs , Lisa Kaltenböck , Gerhard Larcher , Wolfgang Stockinger , Mario Ullrich

We consider the Poisson cylinder model in ${\mathbb R}^d$, $d\ge 3$. We show that given any two cylinders ${\mathfrak c}_1$ and ${\mathfrak c}_2$ in the process, there is a sequence of at most $d-2$ other cylinders creating a connection…

Probability · Mathematics 2013-04-24 Erik I. Broman , Johan Tykesson

A novel algorithm is proposed for quantitative comparisons between compact surfaces embedded in the three-dimensional Euclidian space. The key idea is to identify those objects with the associated surface measures and compute a weak…

Numerical Analysis · Mathematics 2024-01-17 Kazuki Koga

In this paper, we present a linear-time approximation scheme for $k$-means clustering of \emph{incomplete} data points in $d$-dimensional Euclidean space. An \emph{incomplete} data point with $\Delta>0$ unspecified entries is represented as…

Computational Geometry · Computer Science 2021-06-29 Kyungjin Cho , Eunjin Oh

Pick $n$ independent and uniform random points $U_1,\ldots,U_n$ in a compact convex set $K$ of $\mathbb{R}^d$ with volume 1, and let $P^{(d)}_K(n)$ be the probability that these points are in convex position. The Sylvester conjecture in…

Combinatorics · Mathematics 2024-11-14 Jean-François Marckert , Ludovic Morin

In [Schuhmacher, Electron. J. Probab. 10 (2005), 165--201] estimates of the Barbour-Brown distance d_2 between the distribution of a thinned point process and the distribution of a Poisson process were derived by combining discretization…

Probability · Mathematics 2007-05-23 Dominic Schuhmacher

We consider the incompressible two-dimensional Euler equation in the plane in the case when its initial vorticity is the characteristic function of a bounded open set. We show that the travel distance grows linearly for most of fluid…

Analysis of PDEs · Mathematics 2019-03-15 Kyudong Choi

When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…

Networking and Internet Architecture · Computer Science 2009-06-10 Rodrigo S. C. Leao , Valmir C. Barbosa