A stochastic algorithm to detect graph community (clusters).

Time complexity 𝑂(𝑘2𝑛) where 𝑘 is the number of resources allocated per node.