Pathak, NishithBanerjee, ArindamSrivastava, Jaideep2020-09-022020-09-022010-04-30https://hdl.handle.net/11299/215829Graph partitioning is a classical problem in computer science. Most algorithms consist of heuristic, spectral and stochastic flow based methods. In this paper a novel technique for graph partitioning is presented. The proposed algorithm, called StochColor extracts partitions from the most likely state of a stochastic graph coloring process. Empirical results show that StochColor is comparable to or significantly better than state of the art spectral clustering and stochastic flow based methods, across a variety of applications.en-USReport