Abstract
In this paper, we develop a stochastic process rules (SPR) based Markov chain method to calculate the degree distributions of evolving networks. This new approach overcomes two shortcomings of Shi, Chen and Liu’s use of the Markov chain method (Shi et al. 2005 [21]). In addition we show how an SPR-based Markov chain method can be effectively used to calculate degree distributions of random birth-and-death networks, which we believe to be novel. First SPR are introduced to replace traditional evolving rules (TR), making it possible to compute degree distributions in one sample space. Then the SPR-based Markov chain method is introduced and tested by using it to calculate two kinds of evolving network. Finally and most importantly, the SPR-based method is applied to the problem of calculating the degree distributions of random birth-and-death networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
