The ongoing transition to renewable energy supply comes with a restructuring of power grids, changing their effective interaction topologies, more and more strongly decentralizing them and substantially modifying their input, output, and response characteristics. All of these changes imply that power grids become increasingly affected by collective, nonlinear dynamic phenomena, structurally and dynamically more distributed and less predictable in space and time, more heterogeneous in its building blocks, and as a consequence less centrally controllable. Here cornerstone aspects of data-driven and mathematical modeling of collective dynamical phenomena emerging in real and model power grid networks by combining theories from nonlinear dynamics, stochastic processes and statistical physics, anomalous statistics, optimization, and graph theory are reviewed. The mathematical background required for adequate modeling and analysis approaches is introduced, an overview of power system models is given, and a range of collective dynamical phenomena are focused on, including synchronization and phase locking, flow (re)routing, Braess’s paradox, geometric frustration, and spreading and localization of perturbations and cascading failures, as well as the nonequilibrium dynamics of power grids, where fluctuations play a pivotal role.

The probability density function of stochastic differential equations is governed by the Fokker-Planck (FP) equation. A novel machine learning method is developed to solve the general FP equations based on deep neural networks. The proposed algorithm does not require any interpolation and coordinate transformation, which is different from the traditional numerical methods. The main novelty of this paper is that penalty factors are introduced to overcome the local optimization for the deep learning approach, and the corresponding setting rules are given. Meanwhile, we consider a normalization condition as a supervision condition to effectively avoid that the trial solution is zero. Several numerical examples are presented to illustrate performances of the proposed algorithm, including one-, two-, and three-dimensional systems. All the results suggest that the deep learning is quite feasible and effective to calculate the FP equation. Furthermore, influences of the number of hidden layers, the penalty factors, and the optimization algorithm are discussed in detail. These results indicate that the performances of the machine learning technique can be improved through constructing the neural networks appropriately.

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology.

We study the consensus problem in directed static networks with arbitrary finite communication delays and consider both linear and nonlinear coupling. For the considered networked system, only locally delayed information is available for each node and also the information flow is directed. We find that consensus can be realized whatever the communications delays are. In fact, we do not even need to know the explicit values of the communication delays. One well-informed leader is proved to be enough for the regulation of all nodes’ final states, even when the external signal is very weak. Numerical simulations for opinion formation in small-world and scale-free networks are given to demonstrate the potentials of our analytic results.

The neural-approximation-based adaptive nonlinear containment control issue for multiagent systems with full-state constraints is studied by invoking the backstepping approach. First, the barrier Lyapunov functions are established to deal with the state constraining issue in the multiple leaders/followers control scenarios. Then, by introducing the first-order filter, the system communication burden is substantially reduced. Moreover, the event-triggered controller is constructed by utilizing the switching-based mechanism so that the system security, control accuracy, resource consumption, and imposed state constraints are neatly balanced. We prove the output of each follower can converge to the desired hull formulated by leaders under the premise that the imposed state constraints are never violated. Besides, the considered closed-loop signals are uniformly bounded. We finally present a simulation example to show the validity of the developed approach.