Our setting of interest is slightly different, as we will work in discrete time, but it is an interesting open problem to extend our results to the continuous time setting, so…
Statement
Our setting of interest is slightly different, as we will work in discrete time, but it is an interesting open problem to extend our results to the continuous time setting, so as to include Theorem 1. 1. A classical example Let us start by recalling a classical result on the contact process. The latter is d a continuous time Markov process on {0, 1}Z defined by the following graphical construction (see [8, 9] for background). Each site x \in Zd goes from 1 to 0 at rate 1 and from 0 to 1 at rate \lambda times the current number of nearest neighbours of x in state 1, where \lambda \in [0, \infty] is the parameter of the model. We denote by ηx (t) the state of the process at site x at time t and by P1\lambda its law, starting from the all-1 configuration 1. The following was proved by Bezuidenhout and Grimmett in 1991 [2]. Theorem 1. There exists \lambdac \in [0, \infty] such that \forall\lambda > \lambdac , lim P1\lambda (η0 (t) = 1) > 0, t\to\infty \forall\lambda < \lambdac ,\existsC, c > 0, \forallt \geq 0, P1\lambda (η0 (t) = 1) \leq Ce−ct .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.