Connectivity of growing networks with link constraints

Abstract

We propose a growing network model with link constraint, in which new nodes are continuously introduced into the system and immediately connected to preexisting nodes, and any arbitrary node cannot receive new links when it reaches a maximum number of links k_m. The connectivity of the network model is then investigated by means of the rate equation approach. For the connection kernel A(k)=k^γ, the degree distribution n_k takes a power law if γ≥1 and decays stretched exponentially if 0≤γ< 1. We also consider a network system with the connection kernel A(k)=k^α(k_m-k)^β. It is found that n_k approaches a power law in the α> 1 case and has a stretched exponential decay in the 0≤α< 1 case, while it can take a power law with exponential truncation in the special α=β=1 case. Moreover, n_k may have a U-type structure if α> β.