Phase Transition on The Degree Sequence of a Mixed Random Graph Process

Abstract

This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and non-uniformly bounded. By developing a comparing argument, phase transition on the degree distributions of the mixed model is revealed: while the {\it pure} classical model possesses a {\it exponential} degree sequence, the {\it pure} BA model and the mixed model possess {\it power law} degree sequences. As an application of the methodology, phase transition on the degree sequence of {\it another} mixed model with {\it hard copying} is also studied, especially, in the power law region, the inverse power can take any value greater than 1.

24 pages

References in corpus (11)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The diameter of the world wide web
• Classes of behavior of small-world networks
• Scaling properties of scale-free evolving networks: Continuous approach
• Accurately modeling the Internet topology
• Citation Networks in High Energy Physics
• Small-world networks and the conformation space of a lattice polymer chain
• Nonlocal evolution of weighted scale-free networks
• On the Degree Sequence and its Critical Phenomenon of an Evolving Random Graph Process
• The Degree Sequence of a Scale-Free Random Graph Process with Hard Copying

Cited by in corpus (1)

• The Degree Sequence of a Scale-Free Random Graph Process with Hard Copying