Random graphs of binomial type with sparsely-edged initial graphs (Q1084417)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random graphs of binomial type with sparsely-edged initial graphs |
scientific article; zbMATH DE number 3979112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random graphs of binomial type with sparsely-edged initial graphs |
scientific article; zbMATH DE number 3979112 |
Statements
Random graphs of binomial type with sparsely-edged initial graphs (English)
0 references
1986
0 references
A random graph is obtained from an initial fixed graph of order n by deleting each edge with a common probability 1-p independently for all the edges. Problems are considered of random graph evolution as \(n\to \infty\), and various limiting distributions and thresholds for p are given.
0 references
random graph evolution
0 references
0.90063035
0 references
0.89699715
0 references
0 references
0 references
0.8918045
0 references
0.8880148
0 references
