THE APPLICATION OF SEMIDEFINITE INTEGER PROGRAMMING MODEL FOR THE SIMULATION OF COMPLEX NETWORKS
Abstract
Semidefinite integer programming model is an accurate tool for the structural design of networks. In this paper, we propose a semidefinite integer programming model with the constraints of spectral distributions and node degree distributions for the simulation of complex networks. Also, the feasible solutions and branch-and-bound solving algorithms of the model are designed. Based on eight metrics (e.g., spectral distribution, node degree distribution, clustering coefficients, etc.), the validity and practicability of the proposed method are illustrated.