A first order phase transition in the threshold 2 contact process on random r-regular graphs and r-trees
From MaRDI portal
(Redirected from Publication:1933600)
A first order phase transition in the threshold \(\theta \geq 2\) contact process on random \(r\)-regular graphs and \(r\)-trees
A first order phase transition in the threshold \(\theta \geq 2\) contact process on random \(r\)-regular graphs and \(r\)-trees
Abstract: We consider the discrete-time threshold- contact process on a random r-regular graph on n vertices. In this process, a vertex with at least heta occupied neighbors at time t will be occupied at time t+1 with probability p, and vacant otherwise. We show that if and , is small and p is at least , then starting from all vertices occupied the fraction of occupied vertices stays above up to time with probability at least . In the other direction, we show that for there is an so that if and the number of occupied vertices in the initial configuration is at most , then with high probability all vertices are vacant at time . These two conclusions imply that on the random r-regular graph there cannot be a quasi-stationary distribution with density of occupied vertices between 0 and , and allow us to conclude that the process on the r-tree has a first order phase transition.
Recommendations
Cited in
(5)
This page was built for publication: A first order phase transition in the threshold \(\theta \geq 2\) contact process on random \(r\)-regular graphs and \(r\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1933600)