Louis M. Pecora, Francesco Sorrentino, Aaron M. Hagerstrom, Thomas E. Murphy and Rajarshi Roy (2014), Nature Communications 5, 4079.

Key takeaways

From the reading, NOTE-775.

  • The wiring fixes which clusters can synchronize. For ẋᵢ = F(xᵢ) + σ Σⱼ Aᵢⱼ H(xⱼ), with identical units and a symmetric 0/1 adjacency matrix, each symmetry of the graph commutes with A. So the orbits of the symmetry group can move identically.
  • The dynamics fix which do. The IRR transformation makes TAT⁻¹ block-diagonal. Each cluster is stable where its own transverse block’s maximum Lyapunov exponent is negative, for any node dynamics.
  • Isolated desynchronization.
    • If the group splits into commuting factors, nodes outside a cluster see the same summed input from it whether or not it is synchronized.
    • So it can desynchronize alone.
    • Clusters moved by one non-decomposable factor are “intertwined” and desynchronize together.
  • Observed. In an 11-node, 32-symmetry electro-optic network, the four-node cluster split while the others held (β = 1.4π). Two intertwined clusters lost synchrony together. Simulated exponents matched both.
  • Common. Almost all of 10,000 random, Barabási–Albert and bipartite 100-node graphs of each kind had several nontrivial clusters and several factors. So did two power grids.
  • Limits stated in the paper. Symmetry is sufficient, not necessary: clusters also arise from matched input and output couplings without symmetry. Nonidentical units and weighted or directed coupling “can all be handled in much the same way”, but are not worked through.

Standing in the record

Filed on 2026-10-12 for QUESTION-063 and read on 2026-10-14 in NOTE-775. Its finding is filed as THEORY-276. The registration said its clusters are “a coupling signature that a shared external drive does not predict”. The paper never considers external drive. The inference is the record’s, and it is sound only within the paper’s class: identical units on a known graph. THEORY-276 states it in that form. It also bears on CLAIM-172 and CLAIM-157. A mutually coupled network yields several synchronized sub-collectives whose members need not be linked, and their invariance comes from equal input, not from weak coupling across a block’s edge.