Finding Dominant Nodes Using Graphlets
Finding important nodes is a classic task in network science. Nodes are important depending on the context; e.g., they can be (i) nodes that, when removed, cause the network to collapse or (ii) influential spreaders (e.g., of information, or of diseases). Typically, central nodes are assumed to be important, and numerous network centrality measures have been proposed such as the degree centrality, the betweenness centrality, and the subgraph centrality. However, centrality measures are not tailored to capture one particular kind of important nodes: dominant nodes. We define dominant nodes as nodes that dominate many others and are not dominated by many others. We then propose a general graphlet-based measure of node dominance called graphlet-dominance (GD). We analyze how GD differs from traditional network centrality measures. We also study how certain parameters (namely the importance of dominating versus not being dominated and indirect versus direct dominances) influence GD. Finally, we apply GD to author ranking and verify that GD is superior to PageRank in four of the five citation networks tested.
KeywordsGraphlets Node centrality Node dominance PageRank
This work is financed by National Funds through the Portuguese funding agency, FCT - Fundação para a Ciência e a Tecnologia within project: UID/EEA/50014/2019. Jorge Silva is supported by a FCT/MAP-i PhD grant (PD/BD/128157/2016).
- 6.Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)Google Scholar
- 7.Aparício, D., Ribeiro, P., Silva, F.: A subgraph-based ranking system for professional tennis players. In: Complex Networks VII, pp. 159–171. Springer (2016)Google Scholar
- 13.Oldham, S., Fulcher, B., Parkes, L., Arnatkeviciute, A., Suo, C., Fornito, A.: Consistency and differences between centrality metrics across distinct classes of networks. arXiv preprint arXiv:1805.02375 (2018)
- 14.Newman, M.: Mark Newman’s network data (2013). http://www-personal.umich.edu/~mejn/netdata. Accessed 25 Aug 2019
- 19.Silva, J., Aparício, D., Silva, F.: OTARIOS: OpTimizing author ranking with insiders/outsiders subnetworks. In: International Conference on Complex Networks and their Applications, pp. 143–154. Springer (2018)Google Scholar
- 20.Hwang, W.-S., Chae, S.-M., Kim, S.-W., Woo, G.: Yet another paper ranking algorithm advocating recent publications. In: Proceedings of the 19th International Conference on World Wide Web, pp. 1117–1118. ACM (2010)Google Scholar
- 21.Dunaiski, M., Visser, W.: Comparing paper ranking algorithms. In: Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference, pp. 21–30. ACM (2012)Google Scholar
- 22.Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Citation network dataset (2017). https://aminer.org/citation. Accessed 25 Aug 2019
- 23.Page, L., Brin, S., Motwani, R., Winograd, T., et al.: The PageRank citation ranking: bringing order to the web (1998)Google Scholar