Intrinsic degree-correlations in the static model of scale-free networks
We calculate the mean neighboring degree function <InlineEquation ID="Equ1"> <EquationSource Format="TEX">$\bar k_{\rm{nn}}(k)$</EquationSource> </InlineEquation> and the mean clustering function C(k) of vertices with degree k as a function of k in finite scale-free random networks through the static model. While both are independent of k when the degree exponent γ≥3, they show the crossover behavior for 2 > γ> 3 from k-independent behavior for small k to k-dependent behavior for large k. The k-dependent behavior is analytically derived. Such a behavior arises from the prevention of self-loops and multiple edges between each pair of vertices. The analytic results are confirmed by numerical simulations. We also compare our results with those obtained from a growing network model, finding that they behave differently from each other. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2006
Year of publication: |
2006
|
---|---|
Authors: | Lee, J.-S. ; Goh, K.-I. ; Kahng, B. ; Kim, D. |
Published in: |
The European Physical Journal B - Condensed Matter and Complex Systems. - Springer. - Vol. 49.2006, 2, p. 231-238
|
Publisher: |
Springer |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Graph theoretic analysis of protein interaction networks of eukaryotes
Goh, K.-I., (2005)
-
Sandpile avalanche dynamics on scale-free networks
Lee, D.-S., (2004)
-
Cascading toppling dynamics on scale-free networks
Goh, K.-I., (2005)
- More ...