✦ LIBER ✦

Sandwiching random graphs: universality between random graph models

✍ Scribed by J.H. Kim; V.H. Vu

Book ID: 108051378
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 350 KB
Volume: 188
Category: Article
ISSN: 0001-8708
DOI: 10.1016/j.aim.2003.10.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random graphs

✍ A. Ruciński 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 60 KB

On Universal Representation of Random Gr

On Universal Representation of Random Graphs

✍ Andrzej Korzeniowski 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 259 KB

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

Randomness friendly graphs

✍ Alexander Sidorenko 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 500 KB

We consider the two problems from extremal graph theory: 1. Given integer N, real pE(0, 1) and a graph G, what is the minimum number of 2. Given an integer N and a graph G, what is the minimum number of copies of G an copies of G a graph H with N vertices and p N 2 / 2 edges can contain? N-vertex g

Random graph orders

✍ Michael H. Albert; Alan M. Frieze 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 590 KB