In the new century, the study of networks is being developed rapidly. Traditional algorithms based on the classical graph theory have not been able to cope with large scaled networks due to their inefficiency. In this paper, we review the research on the question why a huge network such as the www-network is efficiently computable, and investigate the principles of network computing.

Networks cannot be fully and exactly computed due to both their nature and their scales. The best possibility of network computing could be just locally testable graph properties, in sparse graph models. We review the progress of the study of graph property test, in particular, local test of conductance of graphs, which is closely related to the basic network structural cells – small communities.

In the past decade, an avalanche of research has shown that many real networks, independent of their age, function, and scope, converge to similar architectures, which is probably the most surprising discovery of modern network theory. In many ways, there is a need to understand the dynamics of the processes that take place in networks. We propose a new local mechanism by introducing one more dimension for each node in a network and define a new model of networks, the homophily model, from which we are able to prove the homophily theorem that implies the homophily law of networks. The homophily law ensures that real world networks satisfies the small community phenomenon, and that nodes within a small community share some remarkable common features.


Real Network Citation Network Query Complexity Graph Property Network Computing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert, R., Jeong, H., BalaBási, A.-L.: Diameter of World-Wide Web. Nature (401), 130 (1999)CrossRefGoogle Scholar
  2. 2.
    Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle freeness in general graphs. In: Proc. ACM-SIAM 17th Symposium on Discrete Algorithms, pp. 279–288 (2006)Google Scholar
  3. 3.
    Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof Verification and Intractability of Approximation Problems. Journal of the ACM 45, 501–555 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1), 70–122 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    BalaBási, A.-L.: Scale-free networks: a decade and beyond. Science 325 (July 24, 2009)Google Scholar
  6. 6.
    BalaBási, A.-L., Albert, R.: Emergence of scaling in random networks. Science (286), 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Chung, F., Lu, L.: Complex graphs and networks. American Mathematical Society (2006)Google Scholar
  8. 8.
    Czumaj, A., Sohler, C.: Testing expansion in bounded degree graphs. In: Proc. 48th Annual Symposium on Foundations of Computer Science, pp. 570–578 (2007)Google Scholar
  9. 9.
    Fortunato, S.: Community detection in graphs. Physics Reports, 486 (2010)Google Scholar
  10. 10.
    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS 99(12), 7821–7826 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM, 653–750 (July 1998); Preliminary version in FOCS 1996Google Scholar
  12. 12.
    Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity, TR00-020 (2000)Google Scholar
  13. 13.
    Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica, 302–343 (2002); Preliminary version in 29th STOC (1997)Google Scholar
  14. 14.
    Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2002); Conference version in STOC 1997 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Jonsson, P.F., Cavanna, T., Zicha, D., Bates, P.A.: Cluster analysis of networks generated through homology: automatic identification of important protein communities involved in cancer metastasis. BMC Bioinformatics 7(2) (2006)Google Scholar
  16. 16.
    Kale, S., Seshadhri, C.: Testing expansion in bounded degree graphs. SIAM Journal on Comput. 40(3), 709–720 (2011); Technical Report: ECCC TR07-076 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SIAM Journal of Computing 33(6), 1441–1483 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Kleinberg, J.: The small world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symp. on Theory of Computing, pp. 163–170 (2000)Google Scholar
  19. 19.
    Li, A., Li, J., Peng, P.: Small community phenomena in social networks: Local dimension (to appear)Google Scholar
  20. 20.
    Li, A., Li, J., Pan, Y., Peng, P.: Homophily law of networks: Principles, methods and experiments (to appear)Google Scholar
  21. 21.
    Li, A., Pan, Y., Peng, P.: Testing conductance in general graphs. Electronic Colloquium on Computational Complexity (ECCC) 18, 101 (2011)Google Scholar
  22. 22.
    Li, A., Peng, P.: Community Structures in Classical Network Models. Internet Math. 7(2), 81–106 (2011)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Li, A., Peng, P.: The small-community phenomenon in networks. To appear in Mathematical Structures in Computer Science (2011)Google Scholar
  24. 24.
    Li, A., Zhang, P.: Algorithmic aspects of the homophily phenomenon of networks (to appear)Google Scholar
  25. 25.
    Lotka, A.J.: The frequency distribution of scientific productivity. The Journal of Washington Academy of the Sciences 16, 317 (1926)Google Scholar
  26. 26.
    Milgram, S.: The small world problem. Psychology Today (2), 60–67 (1967)Google Scholar
  27. 27.
    Nachmias, A., Shapira, A.: Testing the expansion of a graph. Electronic Colloquium on Computational Complexity, TR07-118 (2007)Google Scholar
  28. 28.
    Parnas, M., Ron, D.: Testing the diameter of graphs. Random Structures and Algorithms 20(2), 165–183 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  29. 29.
    Simon, H.A.: On a class of skew distribution functions. Biometrika 42, 425–440 (1955)MathSciNetzbMATHGoogle Scholar
  30. 30.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small world’ networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  31. 31.
    Zipf, G.K.: Selective Studies and the Principle of Relative Frequency in Languages. Harvard Univ. Press, Cambridge (1932)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yicheng Pan
    • 1
  1. 1.State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesChina

Personalised recommendations