Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensu...

We study the stochastic $p$-Laplace system in a bounded domain. propose two new space-time discretizations based on approximation of time-averaged values. establish linear convergence space and $1/2$ time. Additionally, we provide sampling algorithm to construct necessary random input an efficient way. The theoretical error analysis is complemented by numerical experiments.