Publications by authors named "Dingrong Tan"
Article Synopsis
- Complex networks, which consist of interconnected nodes and edges, are vital in understanding various systems in nature and society, with a focus on shortest path calculations in network science.
- The study extends the use of the adjacency matrix from counting walks to counting shortest paths, addressing the challenge of calculating both the number and length of these paths effectively.
- The proposed algorithm, tested on both synthetic and real-world networks, is significantly faster and more efficient than traditional methods, with potential applications in areas like traffic optimization and social network analysis.
It is essential to study the robustness and centrality of interdependent networks for building reliable interdependent systems. Here, we consider a nonlinear load-capacity cascading failure model on interdependent networks, where the initial load distribution is not random, as usually assumed, but determined by the influence of each node in the interdependent network. The node influence is measured by an automated entropy-weighted multi-attribute algorithm that takes into account both different centrality measures of nodes and the interdependence of node pairs, then averaging for not only the node itself but also its nearest neighbors and next-nearest neighbors.
View Article and Find Full Text PDF