Stationary random graphs with prescribed iid degrees on a spatial Poisson process

Abstract

Let [P] be the points of a Poisson process on Rd and F a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant random graphs with vertex set [P] and iid vertex degrees with distribution F, and the length of the edges is analyzed. The main result is that finite mean for the total edge length per vertex is possible if and only if F has finite moment of order (d+1)/d.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…