Stability Analysis of a Random Growing Network Model
Liu Xin-ru
Abstract
Liu Xin-ru
Abstract
The degree sequence of a random graph with both random and preferential attachment is studied.Based on the Stolz theorem,a rigorous and simple method for studying degree sequence of network models is proposed.It is found that the degree distribution follows power-law with degree exponent changing from 3 to.Moreover,we generalize the model to add variable number of edges at each time step,also get similar results.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The degree sequence of a random graph with both random and preferential attachment is studied.Based on the Stolz theorem,a rigorous and simple method for studying degree sequence of network models is proposed.It is found that the degree distribution follows power-law with degree exponent changing from 3 to.Moreover,we generalize the model to add variable number of edges at each time step,also get similar results.
Key concepts: Degree distribution, Degree (music), Exponent, Random graph, Mathematics, Sequence (biology), Preferential attachment, Simple (philosophy)