We study the discrete-time threshold- contact process on random graphs of general degrees. For random graphs with a given degree distribution , we show that if is lower bounded by and has finite th moments for all , then the discrete-time threshold- contact process on the random graph exhibits a discontinuous phase transition in the emergence of metastability, thus answering a question of Chatterjee and Durrett \cite{cd13}. To be specific, we establish that (i) for any large enough infection probability , the process started from the all-infected state w.h.p. survives for -time, maintaining a large density of infection; (ii) for any , if the initial density is smaller than , then it dies out in -time w.h.p… We also explain some extensions to more general random graphs, including the Erd\H{o}s-R'enyi graphs. Moreover, we prove that the threshold- contact process on a random -regular graph dies out in time w.h.p…

生成讲解博客的中文版本

生成AI智能校验的中文版本