Strong law of large numbers on graphs and groups

We consider (graph-)group-valued random element $ξ$, discuss the properties of a mean-set (ξ), and prove the generalization of the strong law of large numbers for graphs and groups. Furthermore, we prove an analogue of the classical Chebyshev's inequality for $ξ$ and Chernoff-like asymptotic bounds. In addition, we prove several results about configurations of mean-sets in graphs and discuss computational problems together with methods of computing mean-sets in practice and propose an algorithm for such computation.