The Detection Method of Network Topological Property Based on Multiple Sampling

Abstract:

Recent studies have shown that subnets of scale-free networks are not scale-free, which make it difficult to extrapolate from subnet data to properties of the global networks. Here, we discuss sampling properties of Erdö–Rényi and scale-free networks, then figure out how average degree varies with sampling probability. This finding is developed to be a practical detection method based on multiple sampling. In practice, the method could not only prove global networks and randomly sampled subnets belong to the same family of probability, but also detect unknown networks by least sampling frequency.

• Periodical: Applied Mechanics and Materials (Volumes 256-259)
• Pages: 2396-2400
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.256-259.2396
• Online since: December 2012
• Authors: Cong Huang, D G Zhang, T J Yang, H Yang
• Keywords: Complex Network, Detection Method, Multiple Sampling, Topological Property

References

[1] Barabási A L and Albert R 1999 Science 286 507.

[2] Newman M J E, Moore C and Watts D J 2000 Phys. Rev. Lett 84 3201.

[3] Albert R, Jeong H and Barabási A L 2000 London. Nature 406 378.

[4] Newman M J E 2003 Soc. Industrial Appl. Math. Rev 45 167-256.

[5] Caldarelli G 2007 Scale-Free Networks: Complex webs in nature and technology (New York: Oxford Press).

[6] Newman M J E and Park J 2003 Phys. Rev. E 10. 1103 / PhysRevE. 68. 036122.

[7] Wang Y L, Zhou T, Shi J J, Wang J and He D R 2009 J. Phys. A 388 2949.

[8] Maslov S and Sneppen H 2002 Science 296 910-13.

[9] Qin H, Lu H S, Wu W B and Li W H 2003 Proc. Natl. Acad. Sci 83 826.

[10] Stumpf M P H, Wiuf C and May R M 2005 PNAS 102 4221-24.

[11] Bollobás B 1998 Random Graphs (Cambridge: Cambridge University Press).