Estimating network topology by the mean first-passage time

Order parameter dynamics in complex systems: From models to data

Collective ordering behaviors are typical macroscopic manifestations embedded in complex systems and can be ubiquitously observed across various physical backgrounds. Elements in complex systems may self-organize via mutual or external couplings to achieve diverse spatiotemporal coordinations. The order parameter, as a powerful quantity in describing the transition to collective states, may emerge spontaneously from large numbers of degrees of freedom through competitions. In this minireview, we extensively discussed the collective dynamics of complex systems from the viewpoint of order-parameter dynamics. A synergetic theory is adopted as the foundation of order-parameter dynamics, and it focuses on the self-organization and collective behaviors of complex systems. At the onset of macroscopic transitions, slow modes are distinguished from fast modes and act as order parameters, whose evolution can be established in terms of the slaving principle. We explore order-parameter dynamics in both model-based and data-based scenarios. For situations where microscopic dynamics modeling is available, as prototype examples, synchronization of coupled phase oscillators, chimera states, and neuron network dynamics are analytically studied, and the order-parameter dynamics is constructed in terms of reduction procedures such as the Ott-Antonsen ansatz, the Lorentz ansatz, and so on. For complicated systems highly challenging to be well modeled, we proposed the eigen-microstate approach (EMP) to reconstruct the macroscopic order-parameter dynamics, where the spatiotemporal evolution brought by big data can be well decomposed into eigenmodes, and the macroscopic collective behavior can be traced by Bose-Einstein condensation-like transitions and the emergence of dominant eigenmodes. The EMP is successfully applied to some typical examples, such as phase transitions in the Ising model, climate dynamics in earth systems, fluctuation patterns in stock markets, and collective motion in living systems.

Blind and myopic ants in heterogeneous networks

The diffusion processes on complex networks may be described by different Laplacian matrices due to heterogeneous connectivity. Here we investigate the random walks of blind ants and myopic ants on heterogeneous networks: While a myopic ant hops to a neighbor node every step, a blind ant may stay or hop with probabilities that depend on node connectivity. By analyzing the trajectories of blind ants, we show that the asymptotic behaviors of both random walks are related by rescaling time and probability with node connectivity. Using this result, we show how the small eigenvalues of the Laplacian matrices generating the two random walks are related. As an application, we show how the return-to-origin probability of a myopic ant can be used to compute the scaling behaviors of the Edwards-Wilkinson model, a representative model of load balancing on networks.

Repeated-drive adaptive feedback identification of network topologies

The identification of the topological structures of complex networks from dynamical information is a significant inverse problem. How to infer the information of network topology from short-time dynamical data is a challenging topic. The presence of synchronization among nodes makes the identification of network topology difficult. In this paper we present an efficient method called the repeated-drive adaptive feedback scheme to reveal the network connectivity from short-time dynamics. By applying the short asynchronous transient data as a repeated drive, the adjacency matrix can be successfully determined in terms of the modified adaptive feedback scheme. This improved scheme is valid for both synchronous and asynchronous cases of the network and is especially efficient in the presence of global or local synchronization, where the transient drive can be obtained by perturbing the system to get a very short asynchronous transient. The detection speed of our scheme exhibits the optimized effect by adjusting the time-series segment length and the coupling strength among nodes in the network.