Contact processes on scale-free networks

We investigate the contact process on random graphs generated from the configuration model for scale-free complex networks with the power law exponent beta a (2, 3]. Using the neighborhood expansion method, we show that, with positive probability, any disease with an infection rate lambda > 0 can survive for exponential time in the number of vertices of the graph. This strongly supports the view that stochastic scale-free networks are remarkably different from traditional regular graphs, such as Z (d) and classical ErdAs-R,nyi random graphs.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000278572600018&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701Mathematics, AppliedMathematicsSCI(E)中国科技核心期刊(ISTIC)中国科学引文数据库(CSCD)1ARTICLE71383-13922