Fig. 2: Communicability example.
From: A scalable synergy-first backbone decomposition of higher-order structures in complex systems
For a randomly generated Erdos-Renyi graph with ten nodes, and edge weights pulled from an exponential distribution with λ = 1, we compute the α-synergy spectrum for the communicability across all possible partitions of the edge set, and compute the α-synergy and ∂-synergy for each one. A Shows the weighted adjacency matrix, with the associated network in panel (B). C Shows the expected α-synergistic communicability against the number of failing edges, with the points coloured by the partial synergistic communicability.
