Fast clustering for signed graphs based on random walk gap

•We first propose a mechanism, called random walk gap, which can extract more cluster structure information.•We then propose a fast clustering algorithm for signed graphs (FCSG) based on random walk gap.•The proposed FCSG algorithm can be scaled for handling large-scale signed networks.•Experimental and comparison results demonstrate the efficiency and usefulness of the proposed FCSG algorithm.