The degree distribution of generalized collaboration network with group preferential attachment
Y Zhang
Abstract
Y Zhang
Abstract
Inspired by the idea of team competition,ageneralized collaboration network with group preferential attachment is proposed,in which the new vertex will join a complete graph with T-1 vertices chosen from the existing network preferentially.Based on the techniques of Markov chain theory,the existence of the steady degree distribution is proved,and the expressions for the degree distribution are obtained.Theoretical results show that this generalized collaboration network is a scale free network with degree exponent γ=T+1.
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.
Inspired by the idea of team competition,ageneralized collaboration network with group preferential attachment is proposed,in which the new vertex will join a complete graph with T-1 vertices chosen from the existing network preferentially.Based on the techniques of Markov chain theory,the existence of the steady degree distribution is proved,and the expressions for the degree distribution are obtained.Theoretical results show that this generalized collaboration network is a scale free network with degree exponent γ=T+1.
Key concepts: Preferential attachment, Degree distribution, Degree (music), Exponent, Vertex (graph theory), Scale-free network, Markov chain, Group (periodic table)