Random spread on the family of small-world networks

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 63, Issue 4, 2001, Pages

  Pandit, Sagar A ^a   Amritkar, R E ^a  

^a PHYSICAL RESEARCH LABORATORY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; GRAPH THEORY; INFORMATION ANALYSIS; INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PACKET NETWORKS;

SMALL-WORD NETWORKS;

COMPUTER NETWORKS;

EID: 0035305237     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.63.041104     Document Type: Article

References (22)

1. D. J. Watts and S. H. Strogatz, Nature (London) 393, 440 (1998).
2. S. A. Pandit and R. E. Amritkar, Phys. Rev. E 60, R1119 (1999).
3. M. E. J. Newman and D. J. Watts, Phys. Rev. E 60, 7332 (1999).
4. C. F. Moukarzel, Phys. Rev. E 60, 6263 (1999).
5. C. Moore and M. E. J. Newman (unpublished).
6. M. Barthélémy and L. A. N. Amaral, Phys. Rev. Lett. 82, 3180 (1999).
7. M. A. de Menezes, C. F. Moukarzel, and T. J. P. Penna, e-print cond-mat/9903426.
8. D. Helbing and T. Vicsek, e-print cond-mat/9904327.
9. R. V. Kulkarni, E. Almaas, and D. Stroud, Phys. Rev. E 61, 4268 (2000);
10. R. V. KulkarniE. AlmaasD. Stroude-print cond-mat/9905066.
11. L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, e-print cond-mat/0001458.
12. A. Barrat and M. Weigt, Eur. Phys. J. B 13, 547 (2000).
13. S. N. Dorogovtsev and J. F. F. Mendes, e-print cond-mat/9907445.
14. M. E. J. Newman and D. J. Watts, Phys. Rev. E 60, 7332 (1999).
15. R. Monasson, e-print cond-mat/9903347.
16. S. Milgram, Psychol. Today 2, 60 (1967).
17. W. R. Stevens, Unix Network Programming (Prentice-Hall, New Delhi, 1993).
18. L. Lovász, Combinatorics: Paul Erodös is Eighty (Bolyai Society Mathematical Studies, Keszthely, 1993), Vol. 2, pp. 1–46.
19. W. Feller, An Introduction to Probability Theory and Its Applications, 3rd ed. (Wiley, New York, 1968).
20. The maximum number of steps a packet can take is determined by the size of the “Time To Live” field in the packet header, which is 1 byte long, i.e., the maximum time to live is 255 steps.
21. In the rewiring algorithm of Watts and Strogatz the random graph defined by (Formula presented) is not truly random. However, as far as spread is concerned the small-world network (Formula presented) itself is a good enough approximation to the random network. Hence, the (Formula presented) case is adequate to describe the random behavior.
22. We have also tried other types of scaling relations, in particular, a scaling relation of the form (Formula presented) However, we find that the relation (5) gives a better fit to the numerical data.