One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights

Combinatorics Probability and Computing

Volumn 8, Issue 4, 1999, Pages 347-361

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033439042     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399003892     Document Type: Article

References (6)

1. Bollobás, B. (1985) Random Graphs, Academic Press, London.
2. Leadbetter, M. R., Lindgren, G. and Rootzén, H. (1983) Extremes and Related Properties of Random Sequences and Processes, Springer, New York.
3. Lebedev, N. N. (1972) Special Functions and their Applications, Dover, New York. (Translated from Russian.)
4. Moon, J. (1974) The distance between nodes in recursive trees. In Combinatorics (British Combinatorial Conference, Aberystwyth, 1973), Vol. 13 of London Math. Soc. Lecture Notes, Cambridge University Press, pp. 125-132.
5. Pittel, B. (1994) Note on the heights of random recursive trees and random m-ary search trees. Random Struct. Alg. 5 337-347.
6. Smythe, R. T. and Mahmoud, H. (1995) A survey of recursive trees. Theory Probab. Math. Statist. 51 1-27.