Polymers and random graphs
✍ Scribed by E. Buffet; J. V. Pulé
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 769 KB
- Volume
- 64
- Category
- Article
- ISSN
- 0022-4715
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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 Ž .
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
We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number N of vertices in a connected component thus corresponds to the number o