✦ LIBER ✦

Random graphs

✍ Scribed by A. Ruciński

Publisher: Springer
Year: 1989
Tongue: English
Weight: 60 KB
Volume: 33
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01415170

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

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 Ž .

Random interval graphs

✍ Nicholas Pippenger 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

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

Random interval graphs

✍ E. R. Scheinerman 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 663 KB

Quasi-random graphs

✍ F. R. K. Chung; R. L. Graham; R. M. Wilson 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 738 KB

Strongly balanced graphs and random grap

Strongly balanced graphs and random graphs

✍ 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 walks on random simple graphs

✍ Martin Hildebrand 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 676 KB

This paper looks at random regular simple graphs and considers nearest neighbor random walks on such graphs. This paper considers walks where the degree d of each vertex is around (logn)", where a is a constant which is at least 2 and where n is the number of vertices. By extending techniques of Dou