Degree distribution nearby the origin of a preferential attachment graph (Q2461034): Difference between revisions

The author considers the following variant of an evolving random graph introduced by \textit{A.-L. Barabasi} and \textit{R. Albert} [Science 286, 509--512 (1999)]. Start with two vertices connected by an edge. After \(n\) steps the set of vertices is \(\{0,1,\dots, n\}\). Let \(X[n, k]\) denote the number of vertices of degree \(k\) after \(n\) steps. Hence \(X[n, 0]+ X[n,1]+\cdots= n+1\). Let \(S_n= X[n,1]+ 2X[n, 2]+\cdots\) denote the sum of degrees (which equals twice the number of edges). At step \(n\), vertex \(n\) is connected to atmost \(n\) vertices in the set \(0,\dots,n-1\) of ``old'' vertices which are selected according to the following rule: An old vertex of degree \(k\) is chosen (independently of the others) with probability \((\lambda_1 k+\lambda_0)/S_{n-1}< 1\). Here, \(\lambda_1> 0\) and \(\lambda_0\geq 0\) are parameters such that \(\lambda_1+ \lambda_0< 2\). It was proved by the author [Acta Math. Hung. 114, No. 1--2, 37--48 (2007; Zbl 1121.05111)] that \[ P\Biggl(\lim_{n\to\infty} X[n,k]/(n+ 1)= x_k\Biggr)= 1,\quad k= 0,1,\dots, \] where \[ x_k= {1\over t_k+1} \sum^k_{i=0} p_i \prod^{k-1}_{j=i} {t_j\over t_j+ 1},\quad k= 0,1,\dots\;. \] Here, \(p_k= s^k/(k!)e^{-s}\) \((k\geq 0)\), \(t_k= (\lambda_1 k+ \lambda_0)/(2s)\) \((k\geq 1)\), \(s= 2^{-1}(\lambda_1+ (\lambda^2_1+ 2\lambda_0)^{1/2})\). This is a power law, i.e., \(x_k\sim\text{const}\cdot k^{-\beta}\) \((k\to \infty)\) with exponent \(\beta= 2+ (1+ \lambda_0/\lambda^2_1)^{1/2}\). In the present paper it is shown that in the neighboorhood of each vertex the same asymptotic degree distribution is found which stabilizes a.s. (as \(n\to\infty)\) around a power law with exponent 2.