On the Metropolis Algorithm for Urban Street Networks

Abstract

The complexity of urban street networks is well accepted to reside in the information space where roads map to nodes and junctions to links between nodes. Assuming that information networks preserve their amount of surprisal on average leads us to adapt the single-flip Metropolis algorithm to compute information networks with minimal amounts of surprisal.