Research On Modeling Online/Offline Network And Information Sperading

Recently, Internet application was disseminated and deepened in modern society, especially with the development of communication tools based on Internet, such as QQ, WeChat, et al. Online communication has become one of the main means to communicate with each other between peoples. This change has caused many problems that have never seen before, at first, the source of information on the Internet is complex, it is difficult to distinguish the authenticity, in addition, the low cost of release information and difficult to trace also caused the spread of rumors in the network. Therefore, rumor dissemination has attracted the attention of peoples and the government. The complex network theory has become more and more mature, such as the construction of the network model, coupling mechanism between multi-layer networks and dynamic propagation analysis. All these problems have been studied and achieved a lot of results. Based on the complex network theory, series of researches about the network structure, and the process and regulation of the rumor propagation have been studied. The main achievements are as follows:1. We proposed a network model based on online / offline pattern. The reason why we proposed this model was the fact that rumor was spread through both the online network and the network of acquaintances at the same time, this paper has proposed a network model based on multi-layer structure of “offline network” and “offline network”, with the analysis of real network data of micro-blogging, we can guarantee that the network model was close to the real. Among them, “online network” simulation online social networking, “offline network” simulation the real acquaintance.2. Put forward a propagation model of information based on “online / offline network”. It was obviously that, the nodes represent the same person in the online network and offline network should have the same states, and their propagation state should also be the same. Therefore, this paper put forward an information dissemination model refer the idea that the transfer of information between the two layers of the network were realized through the node corresponds to a state, and the concept of mass media was introduced.3. For the regulation of information dissemination in the network, the main measure was to immune the nodes, therefore, how to choose the key nodes had become the major problem. Most of the existing node sorting algorithms needs to acquire the global information of the network as the premise, which greatly limited the application of the algorithm, and also increased the difficult of computation. In view of the above-described questions this paper use the idea of random walk and diffusion of label, proposed a node importance ranking algorithm based on local information of the network, and through a lot of experiments, the algorithm was proved to have obvious advantages, compared with the existing similar algorithms.