Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models (Q4948019)
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 intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models |
scientific article; zbMATH DE number 1436002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models |
scientific article; zbMATH DE number 1436002 |
Statements
13 December 2000
0 references
random graph models
0 references
random intersection graph models
0 references
evolutions
0 references
total variation distance
0 references
Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models (English)
0 references
0.92990863
0 references
0.87601906
0 references
0.8715539
0 references
0 references
0 references
0.86706764
0 references
0.86471623
0 references
