Degree-penalized contact processes
Zsolt Bartha, J\'ulia Komj\'athy, Daniel Valesin

TL;DR
This paper investigates how degree-dependent infection rates in contact processes on random graphs lead to new phase transitions, revealing conditions for survival or extinction based on the degree distribution and the parameter 5.
Contribution
It introduces a degree-penalized contact process model, analyzing phase transitions on Galton-Watson trees and the configuration model, with new insights into survival/extinction regimes.
Findings
Phase transitions occur at 5=1/2 and 5=1.
Extinction for 55 5 1 when 5 5 1.
Survival with positive probability for 5<1/2 under certain degree distributions.
Abstract
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or healthy. When infected, each vertex heals at rate one. Also, when infected, a vertex with degree infects its neighboring vertex with degree with rate for some positive function . In the case for some , the infection is slowed down to and from high degree vertices. This is in line with arguments used in social network science: people with many contacts do not have the time to infect their neighbors at the same rate as people with fewer contacts. We show that new phase transitions occur in terms of the parameter (at ) and the degree distribution of the GW…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
