We investigate the mixing structure of directed and evolutionary US flight network. It is shown that such a network is a hierarchical network, with average assortativity coefficient-0.37. Application of the informatio...We investigate the mixing structure of directed and evolutionary US flight network. It is shown that such a network is a hierarchical network, with average assortativity coefficient-0.37. Application of the informationbased method that can give the same result provides a way to explore the structure of complex networks.展开更多
With a simple model, we study the stability of random networks under the evolution of attack and repair. We introduce a new quantity, i.e. invulnerability I（s）, to describe the stability of the system. It is found t...With a simple model, we study the stability of random networks under the evolution of attack and repair. We introduce a new quantity, i.e. invulnerability I（s）, to describe the stability of the system. It is found that the network can evolve to a stationary state. The stationary value Ic has a power-law dependence on the initial average degree （κ）, with the slope about -1.5. In the stationary state, the degree distribution is a normal distribution, rather than a typical Poisson distribution for general random graphs. The clustering coefficient in the stationary state is much larger than that in the initial state. The stability of the network depends only on the initial average degree （κ）, which increases rapidly with the decrease of （κ）.展开更多
We study message spreading on a scale-free network, by introducing a novel forget-remember mechanism. Message, a general term which can refer to email, news, rumor or disease, etc, can be forgotten and remembered by i...We study message spreading on a scale-free network, by introducing a novel forget-remember mechanism. Message, a general term which can refer to email, news, rumor or disease, etc, can be forgotten and remembered by its holder. The way the message is forgotten and remembered is governed by the forget and remember function, F and R, respectively. Both F and R are functions of history time t concerrdng individual＇s previous states, namely being active （with message） or inactive （without message）. Our systematic simulations show at the low transmission rate whether or not the spreading can be efficient is primarily determined by the corresponding parameters for F and R.展开更多
Through empirical analysis of the global structure of the Worldwide Marine Transportation Network （WMTN）, we find that the WMTN, a small-world network, exhibits an exponential-like degree distribution. We hereby inv...Through empirical analysis of the global structure of the Worldwide Marine Transportation Network （WMTN）, we find that the WMTN, a small-world network, exhibits an exponential-like degree distribution. We hereby investigate the efficiency of the WMTN by employing a simple definition. Compared with many other transportation networks, the WMTN possesses relatively low efficiency. Furthermore, by exploring the relationship between the topological structure and the container throughput, we find that strong correlations exist among the container throughout the degree and the clustering coefficient. Also, considering the navigational process that a ship travels in a real shipping line, we obtain that the weight of a seaport is proportional to the total probability contributed by all the passing shipping lines.展开更多
The Ising or Potts models of ferromagnetism have been widely used to describe locally interacting social or economic systems. We consider a related model, introduced by Sznajd to describe the evolution of consensus in...The Ising or Potts models of ferromagnetism have been widely used to describe locally interacting social or economic systems. We consider a related model, introduced by Sznajd to describe the evolution of consensus in the scale-free networks with the tunable strength （noted by Q） of community structure. In the Sznajd model, the opinion or state of any spins can only be changed by the influence of neighbouring pairs of similar connection spins. Such pairs can polarize their neighbours. Using asynchronous updating, it is found that the smaller the community strength Q, the larger the slope of the exponential relaxation time distribution. Then the effect of the initial upspin concentration p as a function of the final all up probability E is investigated by taking different initialization strategies, the random node-chosen initialization strategy has no difference under different community strengths, while the strategies of community node-chosen initialization and hub node-chosen initialization are different in fina/probability under different Q, and the latter one is more effective in reaching final state.展开更多
基金Supported in part by the National Natural Science Foundations of China under Grant Nos 70271067 and 70401020.
文摘We investigate the mixing structure of directed and evolutionary US flight network. It is shown that such a network is a hierarchical network, with average assortativity coefficient-0.37. Application of the informationbased method that can give the same result provides a way to explore the structure of complex networks.
基金Supported in part by the National Natural Science Foundation of China under Grant Nos 70271067 and 70401020, and the Ministry of Education of China under Grant No 03113.
文摘With a simple model, we study the stability of random networks under the evolution of attack and repair. We introduce a new quantity, i.e. invulnerability I（s）, to describe the stability of the system. It is found that the network can evolve to a stationary state. The stationary value Ic has a power-law dependence on the initial average degree （κ）, with the slope about -1.5. In the stationary state, the degree distribution is a normal distribution, rather than a typical Poisson distribution for general random graphs. The clustering coefficient in the stationary state is much larger than that in the initial state. The stability of the network depends only on the initial average degree （κ）, which increases rapidly with the decrease of （κ）.
基金Supported in part by the National Natural Science Foundation of China under Grant Nos 70401020, 70571027, 10647125 and 10635020, and the Ministry of Education of China under Grant No 306022, and the 111 Project under Grant No B08033.
文摘We study message spreading on a scale-free network, by introducing a novel forget-remember mechanism. Message, a general term which can refer to email, news, rumor or disease, etc, can be forgotten and remembered by its holder. The way the message is forgotten and remembered is governed by the forget and remember function, F and R, respectively. Both F and R are functions of history time t concerrdng individual＇s previous states, namely being active （with message） or inactive （without message）. Our systematic simulations show at the low transmission rate whether or not the spreading can be efficient is primarily determined by the corresponding parameters for F and R.
基金Supported by the National Natural Science Foundation of China under Grant Nos 70571027, 10647125, 10635020 and 70401020, and the Program of Introducing Talents of Discipline to Universities under Grant No B08033.
文摘Through empirical analysis of the global structure of the Worldwide Marine Transportation Network （WMTN）, we find that the WMTN, a small-world network, exhibits an exponential-like degree distribution. We hereby investigate the efficiency of the WMTN by employing a simple definition. Compared with many other transportation networks, the WMTN possesses relatively low efficiency. Furthermore, by exploring the relationship between the topological structure and the container throughput, we find that strong correlations exist among the container throughout the degree and the clustering coefficient. Also, considering the navigational process that a ship travels in a real shipping line, we obtain that the weight of a seaport is proportional to the total probability contributed by all the passing shipping lines.
基金Supported by the National Natural Science Foundations of China under Grant Nos 70571027, 70401020,10647125 and 10635020, and the Ministry of Education of China under Grant No 306022.
文摘The Ising or Potts models of ferromagnetism have been widely used to describe locally interacting social or economic systems. We consider a related model, introduced by Sznajd to describe the evolution of consensus in the scale-free networks with the tunable strength （noted by Q） of community structure. In the Sznajd model, the opinion or state of any spins can only be changed by the influence of neighbouring pairs of similar connection spins. Such pairs can polarize their neighbours. Using asynchronous updating, it is found that the smaller the community strength Q, the larger the slope of the exponential relaxation time distribution. Then the effect of the initial upspin concentration p as a function of the final all up probability E is investigated by taking different initialization strategies, the random node-chosen initialization strategy has no difference under different community strengths, while the strategies of community node-chosen initialization and hub node-chosen initialization are different in fina/probability under different Q, and the latter one is more effective in reaching final state.
