On rich clubs of path-based centralities in networks

Soumya Sarkar, Sanjukta Bhowmick, Animesh Mukherjee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Many scale-free networks exhibit a rich club structure, where high degree vertices form tightly interconnected subgraphs. In this paper, we explore the emergence of rich clubs in the context of shortest path based centrality metrics. We term these subgraphs of connected high closeness or high betweeness vertices as rich centrality clubs (RCC). Our experiments on real world and synthetic networks highlight the inter-relations between RCCs, expander graphs, and the core-periphery structure of the network. We show empirically and theoretically that RCCs exist, if the core-periphery structure of the network is such that each shell is an expander graph, and their density decreases from inner to outer shells. We further demonstrate that in addition to being an interesting topological feature, the presence of RCCs is useful in several applications. The vertices in the subgraph forming the RCC are eective seed nodes for spreading information. Moreover, networks with RCCs are robust under perturbations to their structure. Given these useful properties of RCCs, we present a network modication model that can eciently create a RCC within networks where they are not present, while retaining other structural properties of the original network. The main contributions of our paper are: (i) we demonstrate that the formation of RCC is related to the core-periphery structure and particularly the expander like properties of each shell, (ii) we show that the RCC property can be used to nd eective seed nodes for spreading information and for improving the resilience of the network under perturbation and, nally, (iii) we present a modication algorithm that can insert RCC within networks, while not aecting their other structural properties. Taken together, these contributions present one of the rst comprehensive studies of the properties and applications of rich clubs for path based centralities.

Original languageEnglish (US)
Title of host publicationCIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management
EditorsNorman Paton, Selcuk Candan, Haixun Wang, James Allan, Rakesh Agrawal, Alexandros Labrinidis, Alfredo Cuzzocrea, Mohammed Zaki, Divesh Srivastava, Andrei Broder, Assaf Schuster
PublisherAssociation for Computing Machinery
Pages567-576
Number of pages10
ISBN (Electronic)9781450360142
DOIs
StatePublished - Oct 17 2018
Event27th ACM International Conference on Information and Knowledge Management, CIKM 2018 - Torino, Italy
Duration: Oct 22 2018Oct 26 2018

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Other

Other27th ACM International Conference on Information and Knowledge Management, CIKM 2018
CountryItaly
CityTorino
Period10/22/1810/26/18

Fingerprint

Centrality
Clubs
Shell
Core-periphery
Node
Perturbation
Structural properties
Graph
Closeness
Network model
Shortest path
Resilience
Scale-free networks
Experiment

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Sarkar, S., Bhowmick, S., & Mukherjee, A. (2018). On rich clubs of path-based centralities in networks. In N. Paton, S. Candan, H. Wang, J. Allan, R. Agrawal, A. Labrinidis, A. Cuzzocrea, M. Zaki, D. Srivastava, A. Broder, ... A. Schuster (Eds.), CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management (pp. 567-576). (International Conference on Information and Knowledge Management, Proceedings). Association for Computing Machinery. https://doi.org/10.1145/3269206.3271763

On rich clubs of path-based centralities in networks. / Sarkar, Soumya; Bhowmick, Sanjukta; Mukherjee, Animesh.

CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ed. / Norman Paton; Selcuk Candan; Haixun Wang; James Allan; Rakesh Agrawal; Alexandros Labrinidis; Alfredo Cuzzocrea; Mohammed Zaki; Divesh Srivastava; Andrei Broder; Assaf Schuster. Association for Computing Machinery, 2018. p. 567-576 (International Conference on Information and Knowledge Management, Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sarkar, S, Bhowmick, S & Mukherjee, A 2018, On rich clubs of path-based centralities in networks. in N Paton, S Candan, H Wang, J Allan, R Agrawal, A Labrinidis, A Cuzzocrea, M Zaki, D Srivastava, A Broder & A Schuster (eds), CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. International Conference on Information and Knowledge Management, Proceedings, Association for Computing Machinery, pp. 567-576, 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, 10/22/18. https://doi.org/10.1145/3269206.3271763
Sarkar S, Bhowmick S, Mukherjee A. On rich clubs of path-based centralities in networks. In Paton N, Candan S, Wang H, Allan J, Agrawal R, Labrinidis A, Cuzzocrea A, Zaki M, Srivastava D, Broder A, Schuster A, editors, CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery. 2018. p. 567-576. (International Conference on Information and Knowledge Management, Proceedings). https://doi.org/10.1145/3269206.3271763
Sarkar, Soumya ; Bhowmick, Sanjukta ; Mukherjee, Animesh. / On rich clubs of path-based centralities in networks. CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. editor / Norman Paton ; Selcuk Candan ; Haixun Wang ; James Allan ; Rakesh Agrawal ; Alexandros Labrinidis ; Alfredo Cuzzocrea ; Mohammed Zaki ; Divesh Srivastava ; Andrei Broder ; Assaf Schuster. Association for Computing Machinery, 2018. pp. 567-576 (International Conference on Information and Knowledge Management, Proceedings).
@inproceedings{9fe5739a9db14485a8c1303caf20755f,
title = "On rich clubs of path-based centralities in networks",
abstract = "Many scale-free networks exhibit a rich club structure, where high degree vertices form tightly interconnected subgraphs. In this paper, we explore the emergence of rich clubs in the context of shortest path based centrality metrics. We term these subgraphs of connected high closeness or high betweeness vertices as rich centrality clubs (RCC). Our experiments on real world and synthetic networks highlight the inter-relations between RCCs, expander graphs, and the core-periphery structure of the network. We show empirically and theoretically that RCCs exist, if the core-periphery structure of the network is such that each shell is an expander graph, and their density decreases from inner to outer shells. We further demonstrate that in addition to being an interesting topological feature, the presence of RCCs is useful in several applications. The vertices in the subgraph forming the RCC are eective seed nodes for spreading information. Moreover, networks with RCCs are robust under perturbations to their structure. Given these useful properties of RCCs, we present a network modication model that can eciently create a RCC within networks where they are not present, while retaining other structural properties of the original network. The main contributions of our paper are: (i) we demonstrate that the formation of RCC is related to the core-periphery structure and particularly the expander like properties of each shell, (ii) we show that the RCC property can be used to nd eective seed nodes for spreading information and for improving the resilience of the network under perturbation and, nally, (iii) we present a modication algorithm that can insert RCC within networks, while not aecting their other structural properties. Taken together, these contributions present one of the rst comprehensive studies of the properties and applications of rich clubs for path based centralities.",
author = "Soumya Sarkar and Sanjukta Bhowmick and Animesh Mukherjee",
year = "2018",
month = "10",
day = "17",
doi = "10.1145/3269206.3271763",
language = "English (US)",
series = "International Conference on Information and Knowledge Management, Proceedings",
publisher = "Association for Computing Machinery",
pages = "567--576",
editor = "Norman Paton and Selcuk Candan and Haixun Wang and James Allan and Rakesh Agrawal and Alexandros Labrinidis and Alfredo Cuzzocrea and Mohammed Zaki and Divesh Srivastava and Andrei Broder and Assaf Schuster",
booktitle = "CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management",

}

TY - GEN

T1 - On rich clubs of path-based centralities in networks

AU - Sarkar, Soumya

AU - Bhowmick, Sanjukta

AU - Mukherjee, Animesh

PY - 2018/10/17

Y1 - 2018/10/17

N2 - Many scale-free networks exhibit a rich club structure, where high degree vertices form tightly interconnected subgraphs. In this paper, we explore the emergence of rich clubs in the context of shortest path based centrality metrics. We term these subgraphs of connected high closeness or high betweeness vertices as rich centrality clubs (RCC). Our experiments on real world and synthetic networks highlight the inter-relations between RCCs, expander graphs, and the core-periphery structure of the network. We show empirically and theoretically that RCCs exist, if the core-periphery structure of the network is such that each shell is an expander graph, and their density decreases from inner to outer shells. We further demonstrate that in addition to being an interesting topological feature, the presence of RCCs is useful in several applications. The vertices in the subgraph forming the RCC are eective seed nodes for spreading information. Moreover, networks with RCCs are robust under perturbations to their structure. Given these useful properties of RCCs, we present a network modication model that can eciently create a RCC within networks where they are not present, while retaining other structural properties of the original network. The main contributions of our paper are: (i) we demonstrate that the formation of RCC is related to the core-periphery structure and particularly the expander like properties of each shell, (ii) we show that the RCC property can be used to nd eective seed nodes for spreading information and for improving the resilience of the network under perturbation and, nally, (iii) we present a modication algorithm that can insert RCC within networks, while not aecting their other structural properties. Taken together, these contributions present one of the rst comprehensive studies of the properties and applications of rich clubs for path based centralities.

AB - Many scale-free networks exhibit a rich club structure, where high degree vertices form tightly interconnected subgraphs. In this paper, we explore the emergence of rich clubs in the context of shortest path based centrality metrics. We term these subgraphs of connected high closeness or high betweeness vertices as rich centrality clubs (RCC). Our experiments on real world and synthetic networks highlight the inter-relations between RCCs, expander graphs, and the core-periphery structure of the network. We show empirically and theoretically that RCCs exist, if the core-periphery structure of the network is such that each shell is an expander graph, and their density decreases from inner to outer shells. We further demonstrate that in addition to being an interesting topological feature, the presence of RCCs is useful in several applications. The vertices in the subgraph forming the RCC are eective seed nodes for spreading information. Moreover, networks with RCCs are robust under perturbations to their structure. Given these useful properties of RCCs, we present a network modication model that can eciently create a RCC within networks where they are not present, while retaining other structural properties of the original network. The main contributions of our paper are: (i) we demonstrate that the formation of RCC is related to the core-periphery structure and particularly the expander like properties of each shell, (ii) we show that the RCC property can be used to nd eective seed nodes for spreading information and for improving the resilience of the network under perturbation and, nally, (iii) we present a modication algorithm that can insert RCC within networks, while not aecting their other structural properties. Taken together, these contributions present one of the rst comprehensive studies of the properties and applications of rich clubs for path based centralities.

UR - http://www.scopus.com/inward/record.url?scp=85058064409&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85058064409&partnerID=8YFLogxK

U2 - 10.1145/3269206.3271763

DO - 10.1145/3269206.3271763

M3 - Conference contribution

AN - SCOPUS:85058064409

T3 - International Conference on Information and Knowledge Management, Proceedings

SP - 567

EP - 576

BT - CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management

A2 - Paton, Norman

A2 - Candan, Selcuk

A2 - Wang, Haixun

A2 - Allan, James

A2 - Agrawal, Rakesh

A2 - Labrinidis, Alexandros

A2 - Cuzzocrea, Alfredo

A2 - Zaki, Mohammed

A2 - Srivastava, Divesh

A2 - Broder, Andrei

A2 - Schuster, Assaf

PB - Association for Computing Machinery

ER -