A factor matching of optimal tail between Poisson processes

DOI10.1007/S00493-023-00051-6MaRDI QIDQ6081374zbMATH OpenOpenAlexFDO

Authors Ádám Timár

Publication date 4 October 2023

Published in Combinatorica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2106.04524

zbMATH Keywords

allocation rulefactor matchingland divisionPoisson point process

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Geometric probability and stochastic geometry (60D05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Abstract: 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 the point configurations), and with the property that the distance between a configuration point and its pair has a tail distribution that decays as fast as possible, namely, as $bexp(-c{r}^d)$ with suitable constants $b,c>0$. Our proof relies on two earlier results: an allocation rule of similar tail for a Poisson point process, and a recent theorem that enables one to obtain perfect matchings from fractional perfect matchings in our setup.

Recommendations

• Poisson matching
• Geometric properties of Poisson matchings
• Multicolour Poisson matching
• Minimal matchings of point processes
• A Poisson allocation of optimal tail

Cited in

(3)

• There is no stationary cyclically monotone Poisson matching in 2d
• There is no stationary p-cyclically monotone Poisson matching in 2d
• One-ended spanning trees and definable combinatorics

This page was built for publication: A factor matching of optimal tail between Poisson processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081374)