Search arXivSearch

arXiv · 1409.4551

Networks of coupled circuits: From a versatile toggle switch to collective coherent behavior

Abstract

We study the versatile performance of networks of coupled circuits. Each of these circuits is composed of a positive and a negative feedback loop in a motif that is frequently found in genetic and neural networks. When two of these circuits are coupled with mutual repression, the system can function as a toggle switch. The variety of its states can be controlled by two parameters as we demonstrate by a detailed bifurcation analysis. In the bistable regimes switches between the coexisting attractors can be induced by noise. When we couple larger sets of these units, we numerically observe collective coherent modes of individual fixed-point and limit-cycle behavior. It is there the monotonic change of a single bifurcation parameter that allows to control the onset and arrest of the synchronized oscillations. This mechanism may play a role in biological applications, in particular in connection with the segmentation clock. While tuning the bifurcation parameter, also a variety of transient patterns emerges upon approaching the stationary states, in particular a self-organized pacemaker in a completely uniformly equipped ensemble, so that the symmetry breaking happens dynamically.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Darka Labavić, Hildegard Meyer-Ortmanns. 2014-09-16. Networks of coupled circuits: From a versatile toggle switch to collective coherent behavior. https://doi.org/10.1063/1.4898795

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Self-Organization to the Edge of Ergodicity Breaking in a Complex Adaptive System

Self-organized criticality is widely invoked for collective behavior, yet its role in objective-driven, heterogeneous adaptive systems is unclear. We introduce {\tt EvoSK}: agents learn on a Sherrington--Kirkpatrick landscape while the least fit are replaced. It self-organizes to the edge of ergodicity breaking, with scale-free avalanches ($τ\approx -1.5$) and rewards beating any tuned non-evolutionary regime. Its cascade's branching ratio is the spectral radius of the learning dynamics' Jacobian, making critical branching and ergodicity breaking one marginal-stability condition fixing the exponent. The attraction to criticality follows from the selection--mutation balance: subcritical cascades decay too fast to dislodge frozen agents, supercritical cascades shield them from selection; only the critical power-law tail supplies the polynomial rate the balance requires.

nlin.AO

When higher-order interactions enhance synchronization: the case of the Kuramoto model

Synchronization is a fundamental phenomenon in complex systems, observed across a wide range of natural and engineered contexts. The Kuramoto model provides a foundational framework for understanding synchronization among coupled oscillators, traditionally assuming pairwise interactions. However, many real-world systems exhibit group and many-body interactions, which can be effectively modeled through hypergraphs. Here we show that the effect of such higher-order interactions on synchronization is non-monotonic. Through a numerical study of higher-order Kuramoto models on random hypergraphs and on globally coupled systems, we find that the degree of synchronization reached from incoherent initial conditions is maximized at a small but nonzero higher-order coupling strength: weak higher-order interactions enhance synchronization when added to pairwise ones, whereas strong ones work against it, in line with earlier reports of reduced basins and of cluster states. We further show, through a cost-constrained allocation analysis, that under a constrained budget for interactions a mixed allocation of pairwise and higher-order couplings consistently achieves higher synchronization than relying on either type alone. These findings clarify the role of higher-order interactions in shaping collective dynamics and point to design principles for optimizing synchronization in complex systems.

nlin.AO

Dynamics-preserving network reductions for ride-pooling paths

Reducing the complexity of ride-pooling paths is a central challenge in systems with distributed demand. Here we show that such dynamics admit an exact coarse-grained representation: for a broad class of routing algorithms whose decisions depend only on path lengths, the full network can be reduced to an effective network of active nodes weighted by shortest-path distances without altering the resulting trajectories, up to stochastic degeneracy breaking. The reduction therefore defines an equivalence class of network representations generating identical path dynamics. We further demonstrate that for globally optimizing dispatchers this equivalence is systematically violated through degeneracy amplification, yet remains quantitatively accurate beyond the exactly solvable regime. Our results identify when spatial structure can be integrated out without loss of dynamical fidelity, providing a general framework for the analysis of interacting path processes.

nlin.AO