The Study Of Ranking Algorithm Of The Important Node In Networks And Its Applications

Over the last decade, the tremendous development of the Complex Network Theory provides us with a new perspective on the whole world. Actually, almost all the complex systems, such as social, biology, informational, economic and financial, and electrical and transportation systems, can be expressed as network structures naturally. Furthermore, the theory of the network are usually employed to quantitative describe and solve problems that exist on these systems. The pivotal nodes in complex networks are the extraordinary nodes which play more significant role than other nodes on the structure and function of the networks. The ranking of nodes in networks are closely related with the robustness, spreading, synchronization, controllability of the networks. For the great theoretical significance and the broad practical value, the study of ranking nodes problem and its application has been a hot topic in the field of complex networks.The main contributions of this thesis are as follows:(1) introduced the basic concepts of networks(Chapter 1), systematically reviewed the representative node ranking algorithms in networks science(Chapter 2), summarized the evaluation criteria of node importance(Chapter 3);(2) proposed a fast algorithm framework for mining the most important nodes in large-scale networks(Chapter 4);(3) empirical investigated the behavior patterns of the relationships between the most influncial pairs in the online social networks(Chapter 5);(4) introduced two business examples that node ranking theorys was applied to them(Chapter 6). Finally, this thesis summarisized the existing problems and some main challenges in the near future(Chapter 7).