The Mathematics

Definition

A finite set of maps T1, ... Td from a finite set V onto itself defines a finite simple graph G=(V,E), where E={ (x,y) | x ≠ y, exists k such that Tk x=y }.

Why look at them?

Examples:

Deterministic Small world

Deterministic rewiring:
n=20, k=2 n=20, k=4 n=200, k=4