An Algorithm Generating Scale Free Graphs
D. Volchenkov, Ph. Blanchard
Abstract
We propose a simple random process inducing 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 a threshold is changed each time a new edge 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 the intermediate values of η, 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.
Create a lesson
Related papers
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.
A Clifford-index approach connecting boundary Dirac fermions to sigma-model topological terms in the periodic table of topological insulators and superconductors
Y. X. Zhao
Exact solution of the dynamic pseudogap model: Fock-space formalism for Gaussian fluctuations
Michael V. Sadovskii
Covariance-dependent participation scaling of Comtet disorder on open hyperbolic lattices
Wei Li, Yong Cheng