Random Geometric Graphs in Reflexive Banach Spaces
J\'ozsef Balogh, Mark Walters, Andr\'as Zs\'ak

TL;DR
This paper explores the properties of random geometric graphs in Banach spaces, identifying conditions under which dense sets produce unique graphs and demonstrating the rarity of Rado sets in certain spaces.
Contribution
It characterizes when step-isometries are true isometries in Banach spaces and shows most dense sets in strictly convex reflexive spaces are non-Rado, with specific exceptions.
Findings
Almost all dense sets in strictly convex reflexive spaces are non-Rado.
Existence of Rado sets in ll_2.
Construction of Banach spaces where all dense sets are non-Rado.
Abstract
We investigate a random geometric graph model introduced by Bonato and Janssen. The vertices are the points of a countable dense set in a (necessarily separable) normed vector space , and each pair of points are joined independently with some fixed probability (with ) if they are less than distance apart. A countable dense set in a normed space is Rado, if the resulting graph is almost surely unique up to isomorphism: that is any two such graphs are, almost surely, isomorphic. Not surprisingly, understanding which sets are Rado is closely related to the geometry of the underlying normed space. It turns out that a key question is in which spaces must step-isometries (maps that preserve the integer parts of distances) on dense subsets necessarily be isometries. We answer this question for a large class of Banach spaces including all strictly convex reflexive…
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.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Topological and Geometric Data Analysis · Data Management and Algorithms
