相关论文: Optimal matchings of randomly perturbed lattices

We examine optimal matchings or transport between two stationary random measures. It covers allocation from the Lebesgue measure to a point process and matching a point process to a regular (shifted) lattice. The main focus of the article…

Consider two independent Poisson point processes of unit intensity in the Euclidean space of dimension $d$ at least 3. We construct a perfect matching between the two point sets that is a factor (i.e., an equivariant measurable function of…

As an application of perfect lattice perturbation theory, we construct an O(\lambda) perfect lattice action for the anharmonic oscillator analytically in momentum space. In coordinate space we obtain a set of 2-spin and 4-spin couplings…

Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…

We consider a one-dimensional mono-atomic lattice with random perturbations of masses spread over a finite number of particles. Assuming Newtonian dynamics and linear nearest-neighbour interactions and allowing for a provision of pinning…

We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost…

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector ${\bf X}\in\mathbb{R}^n$ in a given lattice. We show that the protocol is optimal in the sense that it…

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…

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…

The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching…

The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…

We develop a theory of insertion and deletion tolerance for point processes. A process is insertion-tolerant if adding a suitably chosen random point results in a point process that is absolutely continuous in law with respect to the…

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

Given a $d$-dimensional Euclidean lattice we consider the random set obtained by adding an independent Gaussian vector to each of the lattice points. In this note we provide a simple procedure that recovers the lattice from a single…

Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…

We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…

This paper addresses the classical problem of determining the sets of possible states of a linear discrete-time system subject to bounded disturbances from measurements corrupted by bounded noise. These so-called uncertainty sets evolve…

A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…