An algorithm generating random graphs with power law degree distributions

D. Volchenkov, Ph Blanchard

Research output: Contribution to journalArticle

15 Scopus citations

Abstract

We propose a simple random process generating various types of random graphs and the scale-free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature before. The degree statistics of a random graph in our model is governed by the control parameter η stirring the pure exponential statistics for the degree distribution (at η=0, when the threshold value is changed each time a new edge is added to the graph) to a power law (at η=1, when the threshold is frozen). The exponent γ characterizing the power law can vary in the wide range γ(1,∞) and can be tuned in different values γin and γout for in-degrees and out-degrees probability distributions independently. For η(0,1), the decay rate is mixed. Taking different statistics for the threshold changes, one obtains dissimilar asymptotic profiles for the degree distribution having, in general, nothing to do with power laws at η=1, but still uniformly exponential at η=0.

Original languageEnglish
Pages (from-to)677-690
Number of pages14
JournalPhysica A: Statistical Mechanics and its Applications
Volume315
Issue number3-4
DOIs
StatePublished - Dec 10 2002

    Fingerprint

Keywords

  • Power laws
  • Real-world networks
  • Scale-free random graphs

Cite this