Infinite random geometric graphs

From MaRDI portal
Publication:659653

DOI10.1007/S00026-011-0111-8zbMATH Open1235.05101arXiv0908.2590OpenAlexW2163232127MaRDI QIDQ659653FDOQ659653

Jeannette Janssen, Anthony Bonato

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given threshold. If the vertex set is a countable dense set in R^n equipped with the metric derived from the L_{infty}-norm, then it is shown that with probability 1 such infinite random geometric graphs have a unique isomorphism type. The isomorphism type, which we call GR_n, is characterized by a geometric analogue of the existentially closed adjacency property, and we give a deterministic construction of GR_n. In contrast, we show that infinite random geometric graphs in R^2 with the Euclidean metric are not necessarily isomorphic.


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




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Infinite random geometric graphs

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