Deutsch
 
Benutzerhandbuch Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Cycle flows and multistability in oscillatory networks

MPG-Autoren
/persons/resource/persons202901

Manik,  Debsankha
Max Planck Research Group Network Dynamics, Max Planck Institute for Dynamics and Self-Organization, Max Planck Society;

/persons/resource/persons173689

Timme,  Marc
Max Planck Research Group Network Dynamics, Max Planck Institute for Dynamics and Self-Organization, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Manik, D., Timme, M., & Witthaut, D. (2017). Cycle flows and multistability in oscillatory networks. Chaos, 27(8): 083123. doi:10.1063/1.4994177.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-002D-E095-0
Zusammenfassung
We study multistability in phase locked states in networks of phase oscillators under both Kuramoto dynamics and swing equation dynamics—a popular model for studying coarse-scale dynamics of an electrical AC power grid. We first establish the existence of geometrically frustrated states in such systems—where although a steady state flow pattern exists, no fixed point exists in the dynamical variables of phases due to geometrical constraints. We then describe the stable fixed points of the system with phase differences along each edge not exceeding π/2 in terms of cycle flows—constant flows along each simple cycle—as opposed to phase angles or flows. The cycle flow formalism allows us to compute tight upper and lower bounds to the number of fixed points in ring networks. We show that long elementary cycles, strong edge weights, and spatially homogeneous distribution of natural frequencies (for the Kuramoto model) or power injections (for the oscillator model for power grids) cause such networks to have more fixed points. We generalize some of these bounds to arbitrary planar topologies and derive scaling relations in the limit of large capacity and large cycle lengths, which we show to be quite accurate by numerical computation. Finally, we present an algorithm to compute all phase locked states—both stable and unstable—for planar networks. The functions of many networked systems in physics, biology, or engineering rely on a coordinated or synchronized dynamics of their constituents. In power grids for example, all generators must run at the same frequency and their phases need to lock to guarantee a steady power flow. Here, we analyze the existence and multitude of states exhibiting this phase locking behaviour. Focusing on edge and cycle flows instead of the nodal phases, we derive rigorous results on the existence and number of such states. Generally, multiple phase-locked states coexist in networks with edges capable of carrying high flows, long elementary cycles, and a homogeneous spatial distribution of natural frequencies or power injections. Utilizing concepts from the graph theory, we derive scaling relations for the number of such states in plane embedded networks. We also offer an algorithm to systematically compute all phase-locked states, both stable and unstable.