Switching for a Small World

Abstract

Agents in small world networks are separated from others by short chains of edges, and they also have the ability to find these paths. Kleinberg (2000) relates a decentralized ability, finding short paths using greedy routing between nodes in a lattice, to a unique distribution on shortcut edges. Sandberg (2005) presents a method that can take a graph from… (More)

15 Figures and Tables

Topics

  • Presentations referencing similar topics