Algorithm 1.

Scheme for generating distance-dependent networks.

for node index i ∈ {1,…,N} do
Take number of in-neighbors ni ∼ Bin(N − 1, p).
for in-neighbor index j ∈ {1,…,ni} do
Give weights wk to all nodes k ≠ i that are not yet connected to i s.t. $w_k=D_{ik}^{-W},$ where Dik is the spatial distance between nodes i and k. Normalize by $P(k)=\frac{w_k}{{\sum }_k{w}_k},$ where P(k) represents the probability to draw node k. Randomly pick k from the probability mass distribution P and create a connection from k to i.
end for
end for