English
Related papers

Related papers: Expected dispersion of uniformly distributed point…

200 papers

In this article, we consider the $c$-dispersion problem in a metric space $(X,d)$. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in a metric space $(X,d)$. For each point $p \in P$ and $S \subseteq P$, we define…

Computational Geometry · Computer Science 2021-06-10 Pawan K. Mishra , Gautam K. Das

In the d dimensional Euclidean space, any set of n+1 independent random points, uniformly distributed in the interior of a unit ball of center O, determines almost surely a circumsphere of center C and of radius R, with n positive and less…

Metric Geometry · Mathematics 2018-03-23 Gérard Le Caër

This paper studies the asymptotic behaviors of the pairwise angles among n randomly and uniformly distributed unit vectors in R^p as the number of points n -> infinity, while the dimension p is either fixed or growing with n. For both…

Statistics Theory · Mathematics 2013-06-04 Tony Cai , Jianqing Fan , Tiefeng Jiang

Upper bounds for the $L_p$-discrepancies of point distributions in compact metric measure spaces for $0<p\le\infty$ have been established in the paper [6] by Brandolini, Chen, Colzani, Gigante and Travaglini. In the present paper we show…

Metric Geometry · Mathematics 2018-05-01 M. M. Skriganov

Consider a sequence of masses $m_0,m_1,...$ arriving uniformly at random at some points $u_0,u_1,...$ on the unit circle $\mathbb{R}/\mathbb{Z}$ (or on $\mathbb{Z}/n\mathbb{Z}$, in the discrete version). Upon arrival, each mass undergoes a…

Probability · Mathematics 2025-07-02 Jean-François Marckert , Zoé Varin

The ball-constrained weighted maximin dispersion problem $(\rm P_{ball})$ is to find a point in an $n$-dimensional Euclidean ball such that the minimum of the weighted Euclidean distance from given $m$ points is maximized. We propose a new…

Optimization and Control · Mathematics 2016-04-11 Shu Wang , Yong Xia

We consider a problem of dispersing points on disjoint intervals on a line. Given n pairwise disjoint intervals sorted on a line, we want to find a point in each interval such that the minimum pairwise distance of these points is maximized.…

Computational Geometry · Computer Science 2016-11-30 Shimin Li , Haitao Wang

Fix a subset $S \subset \mathbb{R}^n$ of volume at most $c n$ that satisfies $S \cap (-S) = \emptyset$. We consider two point processes in $S$: the first is the Poisson point process of intensity one, and the second is the restriction of a…

Probability · Mathematics 2026-05-12 Boaz Klartag

We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…

Probability · Mathematics 2015-11-11 Kristina Schubert , Martin Venker

The convergence of a sequence of point processes with dependent points, defined by a symmetric function of iid high-dimensional random vectors, to a Poisson random measure is proved. This also implies the convergence of the joint…

Probability · Mathematics 2024-02-14 Johannes Heiny , Carolin Kleemann

Many real objects are modeled as discrete sets of points, such as corners or other salient features. For our main applications in chemistry, points represent atomic centers in a molecule or a solid material. We study the problem of…

Computational Geometry · Computer Science 2026-01-01 Daniel Widdowson , Vitaliy Kurlin

The expected value for the weighted crossing number of a randomly weighted graph is studied. A variation of the Crossing Lemma for expectations is proved. We focus on the case where the edge-weights are independent random variables that are…

Combinatorics · Mathematics 2010-12-14 Bojan Mohar , Tamon Stephen

It is known that the number of points in the largest cluster of a percolating Poisson process restricted to a large finite box is asymptotically normal. In this note, we establish a rate of convergence for the statement. As each point in…

Probability · Mathematics 2023-09-08 Tiffany Y. Y. Lo , Aihua Xia

In linear regression we wish to estimate the optimum linear least squares predictor for a distribution over $d$-dimensional input points and real-valued responses, based on a small sample. Under standard random design analysis, where the…

Machine Learning · Statistics 2022-06-08 Michał Dereziński , Manfred K. Warmuth , Daniel Hsu

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

Metric Geometry · Mathematics 2008-02-03 János Pach , Joel Spencer

Say that we are given samples from a distribution $\psi$ over an $n$-dimensional space. We expect or desire $\psi$ to behave like a product distribution (or a $k$-wise independent distribution over its marginals for small $k$). We propose…

Data Structures and Algorithms · Computer Science 2020-11-16 Parikshit Gopalan , Roie Levin , Udi Wieder

In this paper, we derive formulas for the analytical calculation of the moments of the distance between two uniformly and independently distributed random points in an $n$-sided regular polygon. A number of closed form expressions is…

Probability · Mathematics 2021-01-12 Uwe Bäsel

We revisit the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

Consider linear regression where the examples are generated by an unknown distribution on $R^d\times R$. Without any assumptions on the noise, the linear least squares solution for any i.i.d. sample will typically be biased w.r.t. the least…

Machine Learning · Computer Science 2018-10-08 Michał Dereziński , Manfred K. Warmuth , Daniel Hsu

We study internal diffusion-limited aggregation with random starting points on Z^d. In this model, each new particle starts from a vertex chosen uniformly at random on the existing aggregate. We prove that the limiting shape of the…

Probability · Mathematics 2021-10-07 Itai Benjamini , Hugo Duminil-Copin , Gady Kozma , Cyrille Lucas
‹ Prev 1 4 5 6 7 8 10 Next ›