Spreading and shortest paths in systems with sparse long-range connections
Spreading and shortest paths in systems with sparse long-range connections
Spreading according to simple rules (e.g., of fire or diseases) and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections ("small-world" lattices). The volume V(t) covered by the spreading quantity on an infinite system is exactly calculated in all dimensions as a …