2014•Unpublished venueRequires access

The degree distribution of generalized collaboration network with group preferential attachment

Y Zhang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Preferential attachment, Degree distribution, Degree (music), Exponent, Vertex (graph theory), Scale-free network, Markov chain, Group (periodic table)

Related papers

Back to paper searchBrowse research topicsOriginal source
The degree distribution of generalized collaboration network with group preferential attachment — Research Paper | ScholarLens