Dynamical stability of percolation for some interacting particle systems and \(\varepsilon\)-movability (Q2496958): Difference between revisions

Consider a percolation defined by a given graph \(G\). A problem of importance refers to the possible existence of infinite connected components in the random subgraph of \(G\) defined by all the sites and all open edges. Here one begins the study of dynamical percolation for interacting systems in which the edges flip at rates which depend on the neighbours. Some definitions and results on stochastic domination are borne in mind and one proves movability results for a class of monotone measures. Then one considers successively the \(\varepsilon\)-movability for the contact process and a 0-1 law, and the relationship between \(\varepsilon\)-movability and dynamics.