Abstract
The large scale of toady’s real-world networks makes development of distributed algorithms for network science applications of great importance. These algorithms require a node to only have local interactions with its immediate neighbors. This is due to the fact that the whole network topology is usually unknown to each individual node. Detecting key actors within a network with respect to different notions of influence, has recently received a lot of attention among researchers. Closeness centrality is a prominent measure for evaluating a node’s importance and influence within a given network, based on its accessibility in the network. In this paper, we first introduce an ego-centric metric with very low computational complexity, that correlates well with the global closeness centrality. Then, we propose CS-HiClose, a compressive sensing (CS) framework that can accurately and efficiently recover top-k closeness centrality nodes in the network using the proposed local metric. Computations of our ego-centric metric and the aggregation procedure are both carried out effectively in a distributed manner, using only local interactions between neighboring nodes. The performance of the proposed method is evaluated by extensive simulations under several configurations on various types of synthetic and real-world networks. The experimental results demonstrate that the proposed local metric correlates with the global closeness centrality, better than the existing local metrics. Moreover, the results show that CS-HiClose outperforms the state-of-the-art CS-based methods with notable improvements.
H. Mahyar and R. Hasheminezhad—Equal Contributions
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barabasi, A.L., Albert, R.: Emregence of scaling in random networks. Science 286(5439), 509–512 (1999)
Erdos, P., Renyi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Science, pp. 17–61 (1960)
Ghalebi K., E., Mahyar, H., Grosu, R., Rabiee, H.R.: Compressive sampling for sparse recovery in networks. In: ACM KDD, MLG Workshop, Canada (2017)
Kim, H., Yoneki, E.: Influential neighbours selection for information diffusion in online social networks. In: ICCCN, pp. 1–7 (2012)
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: WWW, pp. 641–650 (2010)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM TKDD 1(1), 2 (2007)
Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29–123 (2009)
Mahyar, H.: Detection of top-k central nodes in social networks: a compressive sensing approach. In: IEEE/ACM ASONAM, Paris, France, pp. 902–909 (2015)
Mahyar, H., Ghalebi, K., E., Rabiee, H.R., Grosu, R.: The bottlenecks in biological networks. In: ICML, Computational Biology Workshop, Australia, Sydney (2017)
Mahyar, H., et al.: Compressive sensing of high betweenness centrality nodes in networks. Phys. A 497, 166–184 (2018)
Mahyar, H., et al.: Identifying central nodes for information flow in social networks using compressive sensing. Soc. Netw. Anal. Mining 8(1), 33 (2018)
Mahyar, H., Rabiee, H.R., Hashemifar, Z.S.: UCS-NT: an unbiased compressive sensing framework for network tomography. In: IEEE ICASSP, Canada, pp. 4534–4538 (2013)
Mahyar, H., Rabiee, H.R., Hashemifar, Z.S., Siyari, P.: UCS-WN: an unbiased compressive sensing framework for weighted networks. In: CISS, USA (2013)
Mahyar, H., Rabiee, H.R., Movaghar, A., Ghalebi, E., Nazemian, A.: CS-ComDet: A compressive sensing approach for inter-community detection in social networks. In: IEEE, ACM ASONAM, France, pp. 89–96(2015)
Mahyar, H., Rabiee, H.R., Movaghar, A., Hasheminezhad, R., Ghalebi, E., Nazemian, A.: A low-cost sparse recovery framework for weighted networks under compressive sensing. In: IEEE SocialCom, Chengdu, China, pp. 183–190 (2015)
Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Soc. Netw. 31(2), 155–163 (2009)
Saxena, A., Gera, R., Iyengar, S.: Fast estimation of closeness centrality ranking. In: Proceedings of the 2017 IEEE/ACM ASONAM, pp. 80–85 (2017)
Taheri, S.M., Mahyar, H., Firouzi, M., Ghalebi, E., Grosu, R., Movaghar, A.: Hellrank: a hellinger-based centrality measure for bipartite social networks. Soc. Netw. Anal. Mining 7(1), 22 (2017)
Twitter: Gephi platform (2018). http://rankinfo.pkqs.net/twittercrawl.dot.gz
Wang, W., Tang, C.Y.: Distributed estimation of closeness centrality. In: 2015 IEEE 54th Annual Conference on Decision and Control (CDC), pp. 4860–4865 (2015)
Wehmuth, K., Ziviani, A.: Distributed assessment of the closeness centrality ranking in complex networks. In: Simplifying Complex Networks for Practitioners (2012)
Xu, W., Mallada, E., Tang, A.: Compressive sensing over graphs. In: IEEE INFOCOM, pp. 2087–2095 (2011)
Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181–213 (2015)
You, K., Tempo, R., Qiu, L.: Distributed algorithms for computation of centrality measures in complex networks. IEEE TAC 62(5), 2080–2094 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Mahyar, H., Hasheminezhad, R., Ghalebi, E., Grosu, R., Stanley, H.E. (2019). A Compressive Sensing Framework for Distributed Detection of High Closeness Centrality Nodes in Networks. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 813. Springer, Cham. https://doi.org/10.1007/978-3-030-05414-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-05414-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05413-7
Online ISBN: 978-3-030-05414-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)