Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
We consider the contact process on a random graph with a fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett [2], who showed that for arbitrarily small infection parameter lambda, the survival time of the process is larger than a stretched exponential function of the number of vertices. For lambda close to 0 (that is, "near criticality"), we obtain sharp bounds for the typical density of infected sites in the graph, as the number of vertices tends to infinity. We exhibit three different regimes for this density, depending on the tail of the degree law.
Jian Wang, Matthias Finger, Qian Wang, Yiming Li, João Miguel das Neves Duarte, Matthias Wolf, Varun Sharma, Yi Zhang, Tian Cheng, Yixing Chen, Alexis Kalogeropoulos, Ioannis Papadopoulos, Hua Zhang, Siyuan Wang, Xin Chen, Michele Bianco, Sebastiana Gianì, Sun Hee Kim, Davide Di Croce, Jian Zhao, Rakesh Chawla, Jan Steggemann, Konstantin Androsov, Anna Mascellani, Federica Legger, Matteo Galli, Gabriele Grosso