Stationary straight-line representations of stationary random graphs (Q1904408)

The authors introduce a new concept of a planar random graph. It is called stationary if its finite-dimensional distributions are invariant under translation. With this terminology they prove that there exists a stationary planar graph which does not have a stationary straight-line representation. Thus the theorem on straight-line representations of planar graphs proved by K. Wagner and I. Fary in the finite case and by the reviewer in the infinite case does not extend to this probabilistic framework.