Compact convex sets of the plane and probability theory
Jean-Fran\c{c}ois Marckert, David Renault

TL;DR
This paper explores the relationship between probability measures and convex sets in the plane, providing explicit formulas, operations translation, convergence results, and models for random convex sets.
Contribution
It introduces explicit formulas linking convex set borders to probability measures and translates operations like Minkowski sum into measure operations.
Findings
Minkowski sum corresponds to a natural measure operation.
Sampled polygonal curves converge to a convex set at rate √n.
Models and simulations of smooth random convex sets are developed.
Abstract
The Gauss-Minkowski correspondence in states the existence of a homeomorphism between the probability measures on such that and the compact convex sets (CCS) of the plane with perimeter~1. In this article, we bring out explicit formulas relating the border of a CCS to its probability measure. As a consequence, we show that some natural operations on CCS -- for example, the Minkowski sum -- have natural translations in terms of probability measure operations, and reciprocally, the convolution of measures translates into a new notion of convolution of CCS. Additionally, we give a proof that a polygonal curve associated with a sample of random variables (satisfying ) converges to a CCS associated with at speed , a result much similar to the convergence of the empirical process…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
