Detection of community overlap according to belief propagation and conflict

► The PCB algorithm uses belief propagation and conflict to occupy communities. ► PCB can yield remarkable results with a linear time complexity of O(2nM+ndt). ► PCB can quickly identify overlapping communities for large and densely overlapping networks. ► PCB can yield quick and adaptive results for various types of graph.