复杂网络中的社团划分算法研究-控制理论与控制工程专业论文.docx

万方数据 万方数据 Abstract Social network analysis started in the 1930s and has become one of the most important topics in sociology. The study of the systems by complex netw ork analysis has brought signif icant advances to our understanding of complex systems. The community structure, or cluster, is proved to be one of the most famous feasures of the complex network. The cluster is the organization of vertices, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. The community structure of a network are usually related to the the type of the network, playing a similar role like the tissues or the organs in the human body. Detecting communities is of great importance in sociology, economy, biology and even the engineering. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. Based on the algorithm of the community detecting, the main research of this thesis is as follows: The method to detecting the important vertices in the network has been studied in this thesis, which includes clustering coefficient, loop coefficient and betweenness. With the c omparison of the simulation results, a method which can detect the important vertices effectively has been found, and the best applied environment also been defined. Based on the object oriented methodology, a concept of the “Virtual Force” has been proposed in the thesis. In which the relation between the adjacent vertices is considered as attraction while the relation between the non-adjacent vertices is repulsion. The community structure is formed by the self-organization of vertices which are influenced by the virtual force of their neighbors. A new algorithm which based on the “Virtual Force” also been proposed. By the multiple simulations on the computer-generated networks and the natural networks, the result proved a fact that, the a