Degree asymptotics with rates for preferential attachment random graphs (Q1950267): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1108.5236 / rank | |||
Normal rank |
Revision as of 00:05, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree asymptotics with rates for preferential attachment random graphs |
scientific article |
Statements
Degree asymptotics with rates for preferential attachment random graphs (English)
0 references
10 May 2013
0 references
The authors study the distribution of the degree of a fixed vertex in two preferential attachment models \(G_n\). Let \(W_{n,i}\) be the degree of vertex \(i\) in \(G_n\). They show the optimal rates of convergence in the Kolmogrov metric of \(W_{n,i}/(\operatorname{E}W^2_{n,i})^{1/2}\) to the asymptotic distribution of its distribution limit \(K_s\) as \(n\) goes to infinity. The distribution function \(K_s\) is defined by its density as \[ k_s(x)=\Gamma(s)\sqrt{\frac{2}{s\pi}}\exp\left(\frac{-x^2}{2s}\right)U\left(s-1,0.5,\frac{x^2}{2s}\right) \] for \(x>0\) and \(s\geq1/2\). Here, \(\Gamma\) and \(U\) represent the gamma function and the confluent hypergeometric function of the second kind, respectively. The main approach is a development of Stein's method for the distribution \(K_s\) using fixed points of distributional transformations.
0 references
preferential attachment
0 references
Stein's method
0 references