First-passage percolation on the random graph

Probability in the Engineering and Informational Sciences

Volumn 15, Issue 2, 2001, Pages 225-237

  Van Der Hofstad, Remco ^a   Hooghiemstra, Gerard ^a   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; MARKOV CHAINS; SOLVENTS;

ASYMPTOTIC RESULTS; COMPLETE GRAPHS; CONTINUOUS TIME MARKOV CHAIN; FIRST PASSAGE PERCOLATION; INTERESTING POINTS; LIMITING DISTRIBUTIONS; NUMBER OF HOPS; SHORTEST PATH;

TREES (MATHEMATICS);

EID: 0035633701     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S026996480115206X     Document Type: Article

References (8)

1. Abramowitz, M. & Stegun, I.A. (1968). Handbook of mathematical functions. New York: Dover.
2. Bollobas, B. (1985). Random graphs. New York: Academic Press.
3. Dembo, A. & Zeitouni, O. (1992). Large deviations: techniques and applications. London: Jones and Barlett.
4. Leadbetter, M.R., Lindgren, G., & Rootzén, H. (1983). Extremes and related properties of random sequences and processes. New York: Springer-Verlag.
5. Smythe, R.T. & Mahmoud, H.M. (1995). A survey of recursive trees. Theoretical Probability and Mathematical Statistics 51: 1-27.
6. Vanhastel, S., Duysburg, B., & Demeester, P. (1999). Performance measurements on the current internet. In 7th IFIP ATM&IP Workshop.
7. Van Mieghem, P., Hooghiemstra, G., & van der Hofstad, R. (2000). A scaling law for the hopcount, Report No. 2000125, Delft University of Technology. (http://wwwtvs.et.tudelft.nl/people/piet/ teleconference.html)
8. Watts, D.J. (1999). Small worlds: The dynamics of networks between order and randomness. Princeton, NJ: Princeton University Press.