<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05999801</id>
  <dt>j</dt>
  <an>05999801</an>
  <augroup>
    <au>Bonato, Anthony</au>
    <au>Janssen, Jeannette</au>
  </augroup>
  <ti>Infinite random geometric graphs.</ti>
  <so>Ann. Comb. 15, No. 4, 597-617 (2011).</so>
  <py>2011</py>
  <pu>Birkh\"auser Verlag (Springer), Basel</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>geometric graphs</ut>
    <ut>adjacency property</ut>
    <ut>random graphs</ut>
    <ut>metric spaces</ut>
    <ut>isometry</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s00026-011-0111-8</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We introduce a new class of countably infinite random geometric graphs, whose vertices $V$ are points in a metric space, and vertices are adjacent independently with probability $p \in (0,1)$ if the metric distance between the vertices is below a given threshold. For certain choices of $V$ as a countable dense set in ${\mathbb{R}}^n$ equipped with the metric derived from the $L_{\infty}$-norm, 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 ${\mathbb{R}}^{2}$ with the Euclidean metric are not necessarily isomorphic.</ab>
    <rv></rv>
  </abgroup>
</item>