Figure 2
From: Limits on Anti-Phase Synchronization in Oscillator Networks
Connectivity reduction in small graphs. We start with a fully connected graph of size \({\boldsymbol{N}}\) and equal edge strength across the network \({{\boldsymbol{A}}}_{{\boldsymbol{ij}}{\boldsymbol{,}}{\boldsymbol{i}}{\boldsymbol{\ne }}{\boldsymbol{j}}}{\boldsymbol{=}}{\boldsymbol{1}}\). Picking each edge at random, the edge is removed with probability \({\boldsymbol{1}}{\boldsymbol{-}}{\boldsymbol{p}}\). If removing the edge makes the graph disconnected, the action is reversed. We repeat the process of selection for removal for \({\boldsymbol{N}}\) cycles.
