Before revision:  On the other hand, if p < p_k^\star, we look at random initial configurations in which every node is in state \sigma with probability 1-q independently of the others. We prove that there exists a constant q_{p,k^\star such that if q < q\SUBSCRIPT} p , k ^\star then a \sigma-almost-consensus is still reached in O(1) rounds, while, if q > q _{p,k^\star, the process spends n^{\omega(1)} rounds in a metastable phase where the fraction of volume in state \sigma is around a constant value depending only on p and k}  .
After revision:  On the other hand, if p < ^\star such that if q < q\SUBSCRIPT} p , k ^\star then a \sigma-almost-consensus is still reached in O(1) rounds, while, if q > q _{p,k^\star, the process spends n^{\omega(1)} rounds in a metastable phase where the fraction of volume in state \sigma is around a constant value depending only on p and k} .