Detecting community structure using biased random merging

► We propose a random searching algorithm for community detection. ► Deterministic algorithm may get trapped in local maxima but our method can jump out. ► A new data structure is proposed to facilitate the random search. ► Different biased random searching strategies are proposed and evaluated. ► The random searching algorithms outperform the deterministic one on average.