Gravitational allocation for uniform points on the sphere
From MaRDI portal
Publication:2227716
Recommendations
- Gravitational allocation on the sphere
- Distributing many points on a sphere
- A Poisson allocation of optimal tail
- A stable marriage of Poisson and Lebesgue
- scientific article; zbMATH DE number 5122018
- On the fluctuations of simple matching
- On the minimax spherical designs
- Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
- Asymptotic distributions of covering and separation measures on the hypersphere
- Uniformly distributed distances -- a geometric application of Janson's inequality
Cites work
- A course in combinatorics.
- A PDE approach to a 2-dimensional matching problem
- A stable marriage of Poisson and Lebesgue
- Almost sure convergence of the minimum bipartite matching functional in Euclidean space
- Asymptotics for transportation cost in high dimensions
- Combinatorial Optimization Over Two Random Point Sets
- Extra heads and invariant allocations
- Finer estimates on the 2-dimensional matching problem
- Gravitational allocation on the sphere
- Gravitational allocation to Poisson points
- How to find an extra head: Optimal random shifts of Bernoulli and Poisson random fields
- scientific article; zbMATH DE number 1867206 (Why is no real title available?)
- scientific article; zbMATH DE number 6132668 (Why is no real title available?)
- Matching Theorems and Empirical Discrepancy Computations using Majorizing Measures
- On a partial differential equation involving the Jacobian determinant
- On optimal matchings
- On the rate of convergence in Wasserstein distance of the empirical measure
- Optimal transport from Lebesgue to Poisson
- Phase transitions in gravitational allocation
- Poisson matching
- Stochastic and Integral Geometry
- Tail Bounds for the Stable Marriage of Poisson and Lebesgue
- The average-case analysis of some on-line algorithms for bin packing
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
- Transportation to random zeroes by the gradient flow
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
- Zeros of Gaussian analytic functions and determinantal point processes
Cited in
(4)
This page was built for publication: Gravitational allocation for uniform points on the sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227716)
