Supported by National Natural Science Foundation of China (Grant Nos. 10671212, 90820302)
In this paper, we consider the degree distribution of a general random graph with multiple edges and loops from the perspective of probability. Based on the first-passage probability of Markov chains, we give a new an...
Partly supported by National Natural Science Foundation of China (Grant Nos. 10625101 and 10531070);the 973 Program of the Ministry of Science and Technology (Grant No. 2006CB805900)
We investigate the contact process on random graphs generated from the configuration model for scale-free complex networks with the power law exponent β E (2, 3]. Using the neighborhood expansion method, we show tha...