We propose a framework for designing fixed point algorithms relying on a notion of stochastic quasi-Fejér monotonicity. These methods rely on a sweep of blocks of variables activated at each iteration according to a random rule, and they allow stochastic errors in the evaluation of the involved operators. Using the proposed approach, we develop novel asynchronous distributed primal-dual methods in a multi-agent context. Then, we derive a class of proximal algorithms for solving composite convex variational problems.