Distance between two random <i>k</i>-out digraphs, with and without preferential attachment (Q3450513)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance between two random <i>k</i>-out digraphs, with and without preferential attachment |
scientific article |
Statements
Distance between two random <i>k</i>-out digraphs, with and without preferential attachment (English)
0 references
6 November 2015
0 references
random graphs
0 references
random digraphs
0 references
preferential attachment
0 references
uniform
0 references
\(k\)-out digraphs
0 references
total variation distance
0 references
local limit theorem
0 references
