The degree sequence of a scale-free random graph process (Q2725033)
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: The degree sequence of a scale-free random graph process |
scientific article; zbMATH DE number 1618602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The degree sequence of a scale-free random graph process |
scientific article; zbMATH DE number 1618602 |
Statements
The degree sequence of a scale-free random graph process (English)
0 references
13 May 2002
0 references
random digraph process
0 references
degree distribution
0 references
A graph process is specified such that vertices are added to a graph one at a time and joined to a fixed number \(m\) of earlier vertices, selected with probabilities proportional to their degrees. It is shown that the proportion of vertices having degree \(d\) is asymptotically given by \(m(m+1)/3\) divided by \({d+m+2)\choose 3}\).
0 references
