Science China Information Sciences

, Volume 57, Issue 7, pp 1–20 | Cite as

Global core, and galaxy structure of networks

  • Wei Zhang
  • YiCheng Pan
  • Pan Peng
  • JianKou Li
  • XueChen Li
  • AngSheng Li
Research Paper

Abstract

We propose a novel approach, namely local reduction of networks, to extract the global core (GC, for short) from a complex network. The algorithm is built based on the small community phenomenon of networks. The global cores found by our local reduction from some classical graphs and benchmarks convince us that the global core of a network is intuitively the supporting graph of the network, which is “similar to” the original graph, that the global core is small and essential to the global properties of the network, and that the global core, together with the small communities gives rise to a clear picture of the structure of the network, that is, the galaxy structure of networks. We implement the local reduction to extract the global cores for a series of real networks, and execute a number of experiments to analyze the roles of the global cores for various real networks. For each of the real networks, our experiments show that the found global core is small, that the global core is similar to the original network in the sense that it follows the power law degree distribution with power exponent close to that of the original network, that the global core is sensitive to errors for both cascading failure and physical attack models, in the sense that a small number of random errors in the global core may cause a major failure of the whole network, and that the global core is a good approximate solution to the r-radius center problem, leading to a galaxy structure of the network.

Keywords

complex networks local reduction global core small community phenomenon social network 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Seidman S. Network structure and minimum degree. Soc Netw, 1983, 5: 269–287CrossRefMathSciNetGoogle Scholar
  2. 2.
    Borgatti S, Everett M. Models of core/periphery structures. Soc Netw, 2000, 21: 375–395CrossRefGoogle Scholar
  3. 3.
    Alvarez-Hamelin J, Dall Asta L, Barrat A, et al. Large scale networks fingerprinting and visualization using the k-core decomposition. Adv Neural Inf Process Syst, 2006, 18: 41Google Scholar
  4. 4.
    Goltsev A, Dorogovtsev S, Mendes J. k-core (bootstrap) percolation on complex networks: critical phenomena and nonlocal effects. Phys Rev E, 2006, 73: 056101CrossRefMathSciNetGoogle Scholar
  5. 5.
    Holme P. Core-periphery organization of complex networks. Phys Rev E, 2005, 72: 046111CrossRefGoogle Scholar
  6. 6.
    Hojman D, Szeidl A. Core and periphery in networks. J Econ Theory, 2008, 139: 295–309CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Mislove A, Marcon M, Gummadi K, et al. Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement. New York: ACM, 2007. 29–42CrossRefGoogle Scholar
  8. 8.
    Hochbaum D, Shmoys D. Using dual approximation algorithms for scheduling problems theoretical and practical results. J ACM, 1987, 34: 144–162CrossRefMathSciNetGoogle Scholar
  9. 9.
    Hsu W, Nemhauser G. Easy and hard bottleneck location problems. Discrete Appl Math, 1979, 1: 209–215CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Andersen R, Chung F, Lang K. Local graph partitioning using pagerank vectors. In: 47th Annual IEEE Symposium on Foundations of Computer Science. Washington D. C.: IEEE, 2006. 475–486Google Scholar
  11. 11.
    Andersen R, Peres Y. Finding sparse cuts locally using evolving sets. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York: ACM, 2009. 235–244Google Scholar
  12. 12.
    Clauset A, Newman M, Moore C. Finding community structure in very large networks. Phys Rev E, 2004, 70: 066111CrossRefGoogle Scholar
  13. 13.
    Fortunato S. Community detection in graphs. Phys Rep, 2010, 486: 75–174CrossRefMathSciNetGoogle Scholar
  14. 14.
    Girvan M, Newman M. Community structure in social and biological networks. Proc Nat Acad Sci, 2002, 99: 7821CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Kannan R, Vempala S, Vetta A. On clusterings: good, bad and spectral. J ACM, 2004, 51: 497–515CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Leskovec J, Lang K, Dasgupta A, et al. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math, 2009, 6: 29–123CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    Leskovec J, Lang K, Mahoney M. Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th International Conference on World Wide Web, Raleigh, 2010. 631–640CrossRefGoogle Scholar
  18. 18.
    Hopcroft J, Khan O, Kulis B, et al. Natural communities in large linked networks. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2003. 541–546CrossRefGoogle Scholar
  19. 19.
    von Luxburg U. A tutorial on spectral clustering. Stat Comput, 2007, 17: 395–416CrossRefMathSciNetGoogle Scholar
  20. 20.
    Newman M, Girvan M. Finding and evaluating community structure in networks. Phys Rev E, 2004, 69: 026113CrossRefGoogle Scholar
  21. 21.
    Danon L, Diaz-Guilera A, Duch J, et al. Comparing community structure identification. J Stat Mech-Theory Exp, 2005, 2005: P09008CrossRefGoogle Scholar
  22. 22.
    Palla G, Derényi I, Farkas I, et al. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 2005, 435: 814–818CrossRefGoogle Scholar
  23. 23.
    Lancichinetti A, Fortunato S, Radicchi F. Benchmark graphs for testing community detection algorithms. Phys Rev E, 2008, 78: 046110CrossRefGoogle Scholar
  24. 24.
    Lancichinetti A, Fortunato S. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E, 2009, 80: 016118CrossRefGoogle Scholar
  25. 25.
    Li A S, Peng P. The small-community phenomenon in networks. Math Struct Comput Sci, 2012, 22: 373–407CrossRefMATHMathSciNetGoogle Scholar
  26. 26.
    Condon A, Karp R. Algorithms for graph partitioning on the planted partition model. Random Struct Algorithms, 2001, 18: 116–140CrossRefMATHMathSciNetGoogle Scholar
  27. 27.
    Domingos P, Richardson M. Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2001. 57–66Google Scholar
  28. 28.
    Kempe D, Kleinberg J, Tardos É. Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2003. 137–146CrossRefGoogle Scholar
  29. 29.
    Freeman L. A set of measures of centrality based on betweenness. Sociometry, 40, 1977: 35–41CrossRefGoogle Scholar
  30. 30.
    Albert R, Jeong H, Barabási A. Error and attack tolerance of complex networks. Nature, 2000, 406: 378–382CrossRefGoogle Scholar
  31. 31.
    Broder A E A. Graph structure in the web. Comput Netw, 2000, 33: 309–320CrossRefGoogle Scholar
  32. 32.
    Cohen R, Erez K, ben Avraham D, et al. Resilience of the internet to random breakdowns. Phys Rev Lett, 2000, 85: 4626–4628CrossRefGoogle Scholar
  33. 33.
    Cohen R, Erez K, ben Avraham D, et al. Network robustness and fragility: percolation on random graphs. Phys Rev Lett, 2000, 85: 5468–5471CrossRefGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Wei Zhang
    • 1
    • 2
  • YiCheng Pan
    • 1
    • 4
  • Pan Peng
    • 1
    • 2
  • JianKou Li
    • 1
    • 2
  • XueChen Li
    • 3
  • AngSheng Li
    • 1
  1. 1.State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.School of Information Science and EngineeringUniversity of Chinese Academy of SciencesBeijingChina
  3. 3.Beijing No. 4 High SchoolBeijingChina
  4. 4.State Key Laboratory of Information Security, Institute of Information EngineeringChinese Academy of SciencesBeijingChina

Personalised recommendations