Information Spread On Complex Networks

In recent years, the science of complex networks have developed quickly.Using the science of complex networks, we can analyse the influence factor and control the spread of information.This article fathoms the characteristic of information spread and how to control information flow effectively.The main research work is as follows:1. To research how to spread information by initial value sensitivity on complex networks. Information spread on equality networks and non-equality networks have been study separately. By Matlab simulation tool, information spread range and probability, spread range and average degree on equality networks and non-equality networks have been study.2. To research the cost of spreading information on complex networks. In this paper,we propose spreading information by minimum cost.To analyse the problem of information spread on complex networks by the knowledge of graph theory and complex networks.We give the algorithm of finding network distance:Dijkstra algorithm and Floyd algorithm.Minimum cost tree is introduced to research information spread.There are two algorithm to construct minimum cost tree:Prim algorithm and Kruskal algorithm.3. To research the manner of spreading on complex networks.The proposed strategy of information spread using hub-node means that we should target hub-node in adoption networks.Using the influence of these nodes to the other nodes to increase the effect of information spread. For the first time the separation degree is introduced to research spread behavior. A method about searching complete graph in networks is advanced.Using degree distribution exponents can estimate the problem of spread.The range of distribution exponents can be used for deciding the manner of controling information spread.4. To research stabilization, efficiency, cost and the relationship among them of spread information on complex networks. In this dissertation, we propose establishing the balance among stabilization,efficiency and cost.The effect of network structure on network performance have been considering and the network performance can be improved by changing the network structure. We study the problem of how to design the network spread effectively and what character the network should have when the network cost is minimum. The model of best of all has been constructed. Analysizing the characters of the model, the results indicate that the efficiency of the information spread have been improved in evidence.