Topological properties of integer networks

Physica A: Statistical Mechanics and its Applications

Volumn 367, Issue , 2006, Pages 613-618

  Zhou, Tao ^a   Wang, Bing Hong ^a   Hui, P M ^b   Chan, K P ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Complex networks; Integer networks; Upper bound of average distance

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; NUMBER THEORY; STATISTICAL MECHANICS; TOPOLOGY;

COMPLEX NETWORKS; INTEGER NETWORKS; UPPER BOUND OF AVERAGE DISTANCE;

INTEGER PROGRAMMING;

EID: 33646372449     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2005.11.011     Document Type: Article

References (33)

1. Albert R., and Barabási A.-L. Rev. Mod. Phys. 74 (2002) 47
2. Dorogovtsev S.N., and Mendes J.F.F. Adv. Phys. 51 (2002) 1079
3. Newman M.E.J. SIAM Rev. 45 (2003) 167
4. Pastor-Satorras R., Vázquez A., and Vespignani A. Phys. Rev. Lett. 87 (2001) 258701
5. Albert R., Jeong H., and Barabási A.-L. Nature 401 (1999) 130
6. Liljeros F., Edling C.R., Amaral L.A.N., Stanley H.E., and Åberg Y. Nature 411 (2001) 907
7. Jeong H., Tombor B., Albert R., Oltvai Z.N., and Barabási A.-L. Nature 407 (2000) 651
8. Stelling J., Klamt S., Bettenbrock K., Schuster S., and Gilles E.D. Nature 420 (2002) 190
9. Camacho J., Guimerà R., and Amaral L.A.N. Phys. Rev. Lett. 88 (2002) 228102
10. Zhang P.-P., Chen K., He Y., et al. Physica A 360 (2006) 599
11. Watts D.J., and Strogatz S.H. Nature 393 (1998) 440
12. Barabási A.-L., and Albert R. Science 286 (1999) 509
13. Barabási A.-L., Albert R., and Jeong H. Physica A 272 (1999) 173
14. Bollobás B. Modern Graph Theory (2002), Springer, New York
15. Rozenfeld A.F., Cohen R., Ben-Avraham D., and Havlin S. Phys. Rev. Lett. 89 (2002) 218701
16. The diameter D of a network G ( V, E ) is the maximal distance: D = ce:monospace(max) { d ( x, y ) | x, y ∈ V }, where d ( x, y ) is the distance between two vertices x and y.
17. Ravasz E., and Barabási A.-L. Phys. Rev. E 67 (2003) 026112
18. Xu J.-M. Topological Structure and Analysis of Interconnection Networks (2001), Kluwer Academic Publishers, Dordrecht
19. Tanenbaum A.S. Computer Networks (1996), Prentice-Hall, Englewood Cliffs, NY
20. Efe K. IEEE Trans. Comput. 40 (1991) 1312
21. Kulasinghe P., and Bettayeb S. IEEE Trans. Comput. 44 (1995) 923
22. Barnes G.H., Brown R.M., Kato M., Kuck D.J., Slotnick D.L., and Stokes R.A. IEEE Trans. Comput. 17 (1968) 746
23. T. Zhou, M. Zhao, B.-H. Wang, arXiv: cond-mat/0508368.
24. Zhao L., Lai Y.-C., Park K., and Ye N. Phys. Rev. E 71 (2005) 026125
25. G. Yan, T. Zhou, B. Hu, Z.-Q. Fu, B.-H. Wang, arXiv: cond-mat/0505366.
26. Tadić B., Thurner S., and Rodgers G.J. Phys. Rev. E 69 (2004) 036102
27. Noh J.D., and Rieger H. Phys. Rev. Lett. 92 (2004) 118701
28. C.-Y. Yin, B.-H. Wang, W.-X. Wang, T. Zhou, H.-J. Yang, arXiv: physics/0506204.
29. For arbitrary pair of nodes, one can immediately know whether the two nodes are connected by checking the divisibility relation between them. Therefore, the global information in available without memory requirement.
30. Corso G. Phys. Rev. E 69 (2004) 036106
31. Andrade Jr. J.S., Herrmann H.J., Andrade R.F.S., and da Silva L.R. Phys. Rev. Lett. 94 (2005) 018702
32. Zhou T., Yan G., and Wang B.-H. Phys. Rev. E 71 (2005) 046141
33. Z.-M. Gu, T. Zhou, B.-H. Wang, et al., arXiv: cond-mat/0505175.