A FAST ALGORITHM FOR SIMULATING SCALEFREE NETWORKS

【Author】

Wei Ren,Jianping Li School of Computer Science & Engineering, University of Electronic Science and Technology of China,Chengdu

【Abstract】

<正>With the continuous expansion of the network size, some networks gradually present the characteristics of social networks,especially,scale-free networks. At present,some theoretical studies of scale-free networks are mainly based on simulated platforms. Based on this,the question that how we fast simulate a network model possessing scale-free effects and presenting related characteristics of realistic networks in unbiased manner becomes a crucial problem.In the paper,we propose an algorithm,named RX,which can fast locate nodes to simulate a network.Then,we will analysis the characteristics of the network by experiments and compare RX's modeling time with BA's.(BA has become a popular algorithm in simulating scalefree networks.) The characteristics and the comparison can effectively prove that the algorithm we design can fast simulate scale-free networks to provide a good reference in building network models.

【Keywords】

Social networks;;Scale-free networks;;Simulation;;RX;;BA

References

To explore the background and basis of the node document

Springer Journals Database

Total: 21 articles

  • [1] Andrei Broder;;Ravi Kumar;;Farzin Maghoul;;Prabhakar Raghavan;;Sridhar Rajagopalan;;Raymie Stata;;Andrew Tomkins;;Janet Wiener, Graph structure in the Web, Computer Networks,
  • [2] M. E. J. Newman, The Structure and Function of Complex Networks, SIAM Review,
  • [3] Faloutsos M, Faloutsos P, Faloutsos C, On power-law relationships of the Internet topology, ACM SIGCOMM Computer Communication Review, ACM SIGCOMM Computer Communication Review (ACM SIGCOMM Computer Communication Review)
  • [4] Price D J de S, Networks of Scientific Papers, Science, Science (Science)

More>>

Similar documents

Documents that have the similar content to the node document

More>>