Large deviations for the degree structure in preferential attachment schemes (Q1948702)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6157202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large deviations for the degree structure in preferential attachment schemes |
scientific article; zbMATH DE number 6157202 |
Statements
Large deviations for the degree structure in preferential attachment schemes (English)
0 references
24 April 2013
0 references
A preferential attachment scheme is specified with two functions of time: a probability \(p(t)\) and a non-negative weight component \(b(t)\). At each time step \(t\) a new node is attached to the current graph. With probability \(p(t)\) it is attached as an isolated node, and with probability \(1-p(t)\) it is attached by an edge to a node in the current graph that is selected with probability proportional to a weight \(w(t,d)=d+b(t)\) of its degree \(d\) and time \(t\). Using this scheme the convergence to power law distributions and other laws are investigated for the empirical degree distribution.
0 references
Preferential attachment
0 references
random graphs
0 references
degree distribution
0 references
large deviations
0 references
time-dependent
0 references
law of large numbers
0 references
power law
0 references
condensation
0 references
0 references
0 references
0.9320731
0 references
0 references
0.91105914
0 references
0.9110248
0 references
0 references
0.90473247
0 references
0.9041397
0 references
0.9022206
0 references
0.9010914
0 references
0.89941025
0 references
