Influence of the link weight structure on the shortest path

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 71, Issue 5, 2005, Pages

  Van Mieghem, Piet ^a   Van Langen, Stijn ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BROADBAND NETWORKS; GRAPH THEORY; INTERNET; MATHEMATICAL MODELS; POLYNOMIALS;

ASYMPTOTIC LIMIT; LINK WEIGHT STRUCTURE; POWER EXPONENT;

TREES (MATHEMATICS);

EID: 26944474732     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.71.056113     Document Type: Article

References (24)

1. F. A. Kuipers and P. Van Mieghem, IEEE/ACM Trans. Netw. IEANEP 1063-6692 (to be published).
2. R. van der Hofstad, G. Hooghiemstra, and P. Van Mieghem, Random Struct. Algorithms RSALFD 1042-9832 26, 598 (2005).
3. P. Van Mieghem, G. Hooghiemstra, and R. van der Hofstad, Delft University of Technology Report No. 2000125, 2000.
4. B. Bollobas, Random Graphs, 2nd ed. (Cambridge University Press, Cambridge, 2001).
5. R. van der Hofstad, G. Hooghiemstra, and P. Van Mieghem, Prob. Eng. Inf. Sci. (PEIS) 15, 225 (2001).
6. R. van der Hofstad, G. Hooghiemstra, and P. Van Mieghem, Combinatorics, Probab. Comput. CPCOFG 0963-5483 14, 795 (2005).
7. P. Van Mieghem, G. Hooghiemstra, and R. van der Hofstad, IEEE/ACM Trans. Netw. IEANEP 1063-6692 9, 719 (2001).
8. P. Van Mieghem, Int. J. Commun. Syst. 17, 269 (2004).
9. L. A. Braunstein, S. V. Buldyrev, R. Cohen, S. Havlin, and H. E. Stanley, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.91.168701 91, 168701 (2003).
10. R. Dobrin and P. M. Duxbury, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.86.5076 86, 5076 (2001).
11. P. Van Mieghem, Performance Analysis of Communications Systems and Networks (Cambridge University Press, Cambridge, 2005).
12. A. M. Frieze, Discrete Appl. Math. DAMADU 0166-218X 10.1016/0166-218X(85)90058-7 10, 47 (1985).
13. D. Aldous, Random Struct. Algorithms RSALFD 1042-9832 1, 383 (1990).
14. S. Janson, Random Struct. Algorithms RSALFD 1042-9832 7, 337 (1995).
15. M. D. Penrose, Ann. Prob. APBYAE 24, 1903 (1996).
16. A.-L. Barabasi, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.76.3750 76, 3750 (1996).
17. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, An Introduction to Algorithms (MIT Press, Boston, 1991).
18. L. Pietronero and W. Schneider, Physica A PHYADX 0378-4371 170, 81 (1990).
19. A. I. Markushevich, Theory of Functions of a Complex Variable (Chelsea Publishing Company, New York, 1985), Vols. Iâ€"III.
20. S. Janson, D. E. Knuth, T. Luczak, and B. Pittel, Random Struct. Algorithms RSALFD 1042-9832 4, 233 (1993).
21. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions (Dover Publications, New York, 1968).
22. P. Van Mieghem, G. Hooghiemstra, and R. W. van der Hofstad, Proceeding of Passive and Active Measurement (PAM 2001), April 23â€"24, RIPE NCC, Amsterdam (2001).
23. P. Van Mieghem (unpublished).
24. L. A. Braunstein, S. V. Buldyrev, S. Sreenivasan, R. Cohen, S. Havlin, and H. E. Stanley, The Optimal Path in an Erdos-Renyi Random Graph, Proceedings of the 23rd LANL-CALS Conference on Complex Networks (Springer Verlag, Berlin 2004).