Random nearest neighbor graphs: the translation invariant case

Abstract

If (ω(e)) is a family of random variables (weights) assigned to the edges of Z d , the nearest neighbor graph is the directed graph induced by all edges x, y such that ω({x, y}) is minimal among all neighbors y of x. That is, each vertex points to its closest neighbor, if the weights are viewed as edge-lengths. Nanda-Newman introduced nearest neighbor graphs when the weights are i.i.d. and continuously distributed and proved that a.s., all components of the undirected version of the graph are finite. We study the case of translation invariant, distinct weights, and prove that nearest neighbor graphs do not contain doubly-infinite directed paths. In contrast to the i.i.d. case, we show that in this stationary case, the graphs can contain either one or two infinite components (but not more) in dimension two, and k infinite components for any k ∈ [1, ∞] in dimension ≥ 3. The latter constructions use a general procedure to exhibit a certain class of directed graphs as nearest neighbor graphs with distinct weights, and thereby characterize all translation invariant nearest neighbor graphs. We also discuss relations to geodesic graphs from first-passage percolation and implications for the coalescing walk model of Chaika-Krishnan.