Critical value asymptotics for the contact process on random graphs

From MaRDI portal



Abstract: Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold lambda1 on a Galton-Watson tree is strictly positive if and only if the offspring distribution xi has an exponential tail. In this paper, we derive the first-order asymptotics of lambda1 for the contact process on Galton-Watson trees and its corresponding analog for random graphs. In particular, if xi is appropriately concentrated around its mean, we demonstrate that lambda1(xi)sim1/mathbbExi as mathbbExiightarrowinfty, which matches with the known asymptotics on the d-regular trees. The same result for the short-long survival threshold on the ErdH{o}s-R'enyi and other random graphs are shown as well.












This page was built for publication: Critical value asymptotics for the contact process on random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082394)