In the paper we study the asymptotic behavior of the number of trees with n ลฝ . ลฝ . vertices and diameter k s k n , where n y k rnยช a as n ยช ฯฑ for some constant a-1. We use this result to determine the limit distribution of the diameter of the random graph ลฝ .
โฆ LIBER โฆ
Random matrices and graphs
โ Scribed by B. R. Heap
- Publisher
- Springer-Verlag
- Year
- 1966
- Tongue
- English
- Weight
- 507 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Random trees and random graphs
โ
Tomasz ลuczak
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 205 KB
๐ 2 views
Graphs and nonnegative matrices
โ
R.J. Plemmons
๐
Article
๐
1972
๐
Elsevier Science
๐
English
โ 464 KB
Strongly balanced graphs and random grap
โ
Andrzej Ruciลski; Andrew Vince
๐
Article
๐
1986
๐
John Wiley and Sons
๐
English
โ 455 KB
The concept of strongly balanced graph is introduced. It is shown that there exists a strongly balanced graph with u vertices and e edges if and only if I s u -1 s e s ( 2 " ) . This result is applied to a classic question of Erdos and Renyi: What is the probability that a random graph on n vertices
Random vicious walks and random matrices
โ
Jinho Baik
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 155 KB
๐ 2 views
Random graphs
โ
A. Ruciลski
๐
Article
๐
1989
๐
Springer
๐
English
โ 60 KB
Polymers and random graphs
โ
E. Buffet; J. V. Pulรฉ
๐
Article
๐
1991
๐
Springer
๐
English
โ 769 KB