Robust evaluation method of communication network based on the combination of complex network and big data

Synchronization analyze of k-uniform hyper-networks

Hyper-networks tend to perform better in representing multivariate relationships among nodes. Yet, due to the complexity of the hyper-network structure, research in synchronization dynamics is rarely involved. In this paper, a Kuramoto model more suitable for k-uniform hyper-networks is proposed. And the generalized Laplacian matrix expression of the k-uniform hyper-network is present. We use the eigenvalue ratio of the generalized Laplacian matrix to quantify synchronization. And we studied the effects of some important structure parameters on the synchronization of three types of k-uniform hyper-networks. And obtained different relationships between synchronization and these parameters. The results show the synchronization of the k-uniform hyper-networks is related to both structure and parameters. And as the size of the nodes increases, the synchronization ability gradually increases for ER random hyper-network, while that gradually decreases for NW small-world hyper-network and BA scale-free hyper-network. As the uniformity increases, the synchronization ability of all three types of uniform hyper-networks increases. In addition, when the structure and node size are fixed, the synchronization ability increases with the increase of the hyper-clustering coefficient in BA scale-free hyper-network and ER random hyper-network, while it decreases with the increase of the hyper-clustering coefficient in NW small-world hyper-network.

Robustness Analysis of an Urban Public Traffic Network Based on a Multi-Subnet Composite Complex Network Model

An urban public traffic network is a typical high-order complex network. There are multiple types of transportation in an urban public traffic network, and each type has different impacts on urban transportation. Robustness analyses of urban public traffic networks contribute to the safe maintenance and operation of urban traffic systems. In this paper, a new cascading failure model for urban public traffic networks is constructed based on a multi-subnet composite complex network model. In order to better simulate the actual traffic flow in the composite network, the concept of traffic function is proposed in the model. Considering the different effects of various relationships on nodes in the composite network, the traditional cascading failure model has been improved and a deliberate attack strategy and a random attack strategy have been adopted to study the robustness of the composite network. In the experiment, the urban bus-subway composite network in Qingdao, China, was used as an example for simulation. The experimental results showed that under two attack strategies, the network robustness did not increase with the increase in capacity, and the proportion of multiple relationships had a significant impact on the network robustness.

Synchronizability of Multi-Layer-Coupled Star-Composed Networks

In this paper, several multi-layer-coupled star-composed networks with similar symmetrical structures are defined by using the theory of graph operation. The supra-Laplacian matrix of the corresponding multi-layer networks is obtained according to the master stability equation (MSF). Two important indexes that reflect the synchronizability of these kinds of networks are derived in the case of bounded and unbounded synchronized regions. The relationships among the synchronizability, the number of layers, the length of the paths, the branchings, and the interlayer and intralayer coupling strengths in the two cases are studied. At the same time, the simulation experiments are carried out with the MATLAB software, and the simulated images of the two symmetrical structure networks’ synchronizability are compared. Finally, the factors affecting the synchronizability of multi-layer-coupled star-composed networks are found. On this basis, optimization schemes are given to improve the synchronizability of multi-layer-coupled star-composed networks and the influences of the number of central nodes on the networks’ synchronizability are further studied.