Google+ (G+ in short) is a directed online social network where nodes have either reciprocal (bidirectional) edges or parasocial (one-way) edges. As reciprocal edges represent strong social ties, we study the core structure of the subgraph formed by them, referred to as the reciprocal network of G+. We develop an effective three-step procedure to hierarchically extract and unfold the core structure of this reciprocal network. This procedure builds up and generalizes ideas from the existing k-shell decomposition and clique percolation approaches, and produces higher-level representations of the core structure of the G+ reciprocal network. Our analysis shows that there are seven subgraphs (“communities”) comprising of dense clusters of cliques lying at the center of the core structure of the G+ reciprocal network, through which other communities of cliques are richly connected. Together they form the core to which “peripheral” sparse subgraphs are attached.
|Original language||English (US)|
|Title of host publication||Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings|
|Editors||Minming Li, Lusheng Wang, T-H. Hubert Chan|
|Number of pages||9|
|State||Published - 2016|
|Event||10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016 - Hong Kong, China|
Duration: Dec 16 2016 → Dec 18 2016
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016|
|Period||12/16/16 → 12/18/16|
Bibliographical noteFunding Information:
This research was supported in part by DoD ARO MURI Award W911NF-12-1-0385, DTRA grant HDTRA1- 14-1-0040 and NSF grant CNS-1411636. We thank the authors of  for the datasets.
© Springer International Publishing AG 2016.
- Network core
- Reciprocal network