Abstract
Considering the real-world scenarios that there are interactions between edges in different networks and each network has different topological structure and size, we introduce a model of interdependent networks with arbitrary edge-coupling strength, in which q A and q B are used to represent the edge-coupling strength of network A and network B respectively. A mathematical framework using generating functions is developed based on self-consistent probabilities approach, which is verified by computer simulations. In particular, we carry out this mathematical framework on the Erdös–Rényi edge-coupled interdependent networks to calculate the values of phase transition thresholds and the critical coupling strengths which distinguish different types of transitions. Moreover, as contrast to the corresponding node-coupled interdependent networks, we find that for edge-coupled interdependent networks the critical coupling strengths are smaller, and the critical thresholds as well, which means the robustness of partially edge-coupled interdependent networks is better than that of partially node-coupled interdependent networks. Furthermore, we find that network A will have hybrid percolation behaviors as long as the coupling strength q A belongs to a certain range, and the range does not affected by average degree of network A. Our findings may fill the gap of understanding the robustness of edge-coupled interdependent networks with arbitrary coupling strength, and have significant meaning for network security design and optimization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.