Identification of (overlapping) communities/clusters in a complex network is a general problem in data mining of network data sets. In this paper, we devise a novel algorithm to identify overlapping communities in complex networks by the combination of a new modularity function based on...

Limiting inspection to publicly correlated strategies linearizes the problem of finding subgame perfect equilibria for indefinitely repeated Prisoners' Dilemmas. Equilibrium strategies satisfy a matrix inequality; the matrix depends on the duration of the punishment mechanism. The existence of...