Filters

2014 - 20172

More filters

20202
Reset filters

Settings

Author: Kurths, J. × Author: Peng, H. × Type: Text × Publisher: London : Nature Publishing Group ×

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Reconstruction of Complex Network based on the Noise via QR Decomposition and Compressed Sensing
    (London : Nature Publishing Group, 2017) Li, L.; Xu, D.; Peng, H.; Kurths, J.; Yang, Y.
    It is generally known that the states of network nodes are stable and have strong correlations in a linear network system. We find that without the control input, the method of compressed sensing can not succeed in reconstructing complex networks in which the states of nodes are generated through the linear network system. However, noise can drive the dynamics between nodes to break the stability of the system state. Therefore, a new method integrating QR decomposition and compressed sensing is proposed to solve the reconstruction problem of complex networks under the assistance of the input noise. The state matrix of the system is decomposed by QR decomposition. We construct the measurement matrix with the aid of Gaussian noise so that the sparse input matrix can be reconstructed by compressed sensing. We also discover that noise can build a bridge between the dynamics and the topological structure. Experiments are presented to show that the proposed method is more accurate and more efficient to reconstruct four model networks and six real networks by the comparisons between the proposed method and only compressed sensing. In addition, the proposed method can reconstruct not only the sparse complex networks, but also the dense complex networks.
  • Thumbnail Image
    Item
    Robustness of interrelated traffic networks to cascading failures
    (London : Nature Publishing Group, 2014) Su, Z.; Li, L.; Peng, H.; Kurths, J.; Xiao, J.; Yang, Y.
    The vulnerability to real-life networks against small initial attacks has been one of outstanding challenges in the study of interrelated networks. We study cascading failures in two interrelated networks S and B composed from dependency chains and connectivity links respectively. This work proposes a realistic model for cascading failures based on the redistribution of traffic flow. We study the Barabási-Albert networks (BA) and Erd's-Rényi graphs (ER) with such structure, and found that the efficiency sharply decreases with increasing percentages of the dependency nodes for removing a node randomly. Furthermore, we study the robustness of interrelated traffic networks, especially the subway and bus network in Beijing. By analyzing different attacking strategies, we uncover that the efficiency of the city traffic system has a non-equilibrium phase transition at low capacity of the networks. This explains why the pressure of the traffic overload is relaxed by singly increasing the number of small buses during rush hours. We also found that the increment of some buses may release traffic jam caused by removing a node of the bus network randomly if the damage is limited. However, the efficiencies to transfer people flow will sharper increase when the capacity of the subway network αS > α0.