Random Walk on Graph — Spectral Density

A lazy random walk on various graph topologies. The occupation time series has a power spectrum S(f) determined by the graph's eigenvalues. Mixing time and return probability reflect the spectral gap λ₂.

N nodes: 16

Topology:

Laziness p: 0.50

Step: 0 | Node: — | Return prob: — | Spectral gap λ₂: —