Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks

Abstract

The existence of a densely knit core surrounded by a loosely connected periphery is a common macro-structural feature of social networks. Formally, the CorePeriphery problem is to partition the nodes of an undirected graph G=(V,E) such that a subset X⊂V, the core, induces a dense subgraph, and its complement V∖X , the periphery, induces a sparse subgraph. Split graphs represent the ideal case in which the core induces a clique and the periphery forms an independent set. The number of missing and superfluous edges in the core and the periphery, respectively, can be minimized in linear time via edit distance to the closest split graph. We show that the CorePeriphery becomes intractable for standard notions of density other than the absolute number of misclassified pairs. Our main tool is a regularization procedure that transforms a given graph with maximum degree d into a d-regular graph with the same clique number by adding at most d⋅n new nodes. This is of independent interest because it implies that finding a maximum clique in a regular graph is NP-hard to approximate to within a factor of n^1/2−ε for all ε>0 . We gratefully acknowledge financial support from Deutsche Forschungsgemeinschaft (DFG) under grants Br 2158/6-1 and Ka 3042/3-1. This work is partially supported by the Zukunftskolleg of the University of Konstanz, and the Max Planck Center for Visual Computing and Communication (www.mpc-vcc.org).