Advertisement

Data Mining and Knowledge Discovery

, Volume 32, Issue 5, pp 1368–1396 | Cite as

Using core-periphery structure to predict high centrality nodes in time-varying networks

  • Soumya Sarkar
  • Sandipan Sikdar
  • Sanjukta Bhowmick
  • Animesh Mukherjee
Article
  • 230 Downloads
Part of the following topical collections:
  1. Journal Track of ECML PKDD 2018

Abstract

Vertices with high betweenness and closeness centrality represent influential entities in a network. An important problem for time varying networks is to know a-priori, using minimal computation, whether the influential vertices of the current time step will retain their high centrality, in the future time steps, as the network evolves. In this paper, based on empirical evidences from several large real world time varying networks, we discover a certain class of networks where the highly central vertices are part of the innermost core of the network and this property is maintained over time. As a key contribution of this work, we propose novel heuristics to identify these networks in an optimal fashion and also develop a two-step algorithm for predicting high centrality vertices. Consequently, we show for the first time that for such networks, expensive shortest path computations in each time step as the network changes can be completely avoided; instead we can use time series models (e.g., ARIMA as used here) to predict the overlap between the high centrality vertices in the current time step to the ones in the future time steps. Moreover, once the new network is available in time, we can find the high centrality vertices in the top core simply based on their high degree. To measure the effectiveness of our framework, we perform prediction task on a large set of diverse time-varying networks. We obtain F1-scores as high as 0.81 and 0.72 in predicting the top m closeness and betweenness centrality vertices respectively for real networks where the highly central vertices mostly reside in the innermost core. For synthetic networks that conform to this property we achieve F1-scores of 0.94 and 0.92 for closeness and betweenness respectively. We validate our results by showing that the practical effects of our predicted vertices match the effects of the actual high centrality vertices. Finally, we also provide a formal sketch demonstrating why our method works.

Keywords

Network analysis Prediction Centrality Temporal and time series data Core periphery 

Notes

References

  1. Agneessens F, Borgatti SP, Everett MG (2017) Geodesic based centrality: unifying the local and the global. Soc Netw 49:12–26CrossRefGoogle Scholar
  2. Alvarez-Hamelin JI, Dall’Asta L, Barrat A, Vespignani A (2006) Large scale networks fingerprinting and visualization using the k-core decomposition. In: Advances in neural information processing systems (NIPS), pp 41–50Google Scholar
  3. Baeza-Yates R, Ribeiro-Neto B et al (1999) Modern information retrieval, vol 463. ACM Press, New YorkGoogle Scholar
  4. Barucca P, Tantari D, Lillo F (2016) Centrality metrics and localization in core-periphery networks. J Stat Mech Theory Exp 2016(2):023401MathSciNetCrossRefGoogle Scholar
  5. Batagelj V, Zaversnik M (2003) An o(m) algorithm for cores decomposition of networks. arXiv preprint arXiv:cs.DS/0310049
  6. Benyahia O, Largeron C, Jeudy B, Zaïane OR (2016) Dancer: dynamic attributed network with community structure generator. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 41–44Google Scholar
  7. Borgatti SP, Carley KM, Krackhardt D (2006) On the robustness of centrality measures under conditions of imperfect data. Soc Netw 28(2):124–136CrossRefGoogle Scholar
  8. Box GE, Jenkins GM, Reinsel GC, Ljung GM (2015) Time series analysis: forecasting and control. Wiley, HobokenzbMATHGoogle Scholar
  9. Braha D, Bar-Yam Y (2006) From centrality to temporary fame: dynamic centrality in complex networks. Complexity 12(2):59–63CrossRefGoogle Scholar
  10. Braha D, Bar-Yam Y (2009) Time-dependent complex networks: dynamic centrality, dynamic motifs, and cycles of social interactions. In: Gross T, Sayama H (eds) Adaptive networks: theory, models and applications. Springer studies on complexity. Springer, Berlin, pp 39–50CrossRefGoogle Scholar
  11. Carnes T, Nagarajan C, Wild SM, Van Zuylen A (2007) Maximizing influence in a competitive social network: a follower’s perspective. In: Proceedings of the 9th international conference on electronic commerce. ACM, pp 351–360Google Scholar
  12. Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215–239CrossRefGoogle Scholar
  13. Govindan P, Soundarajan S, Eliassi-Rad T, Faloutsos C (2016) Nimblecore: a space-efficient external memory algorithm for estimating core numbers. In: IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM), 2016. IEEE, pp 207–214Google Scholar
  14. Gutfraind A, Safro I, Meyers LA (2015) Multiscale network generation. In: 18th international conference on information fusion (FUSION), 2015. IEEE, pp 158–165Google Scholar
  15. Hamilton JD (1989) A new approach to the economic analysis of nonstationary time series and the business cycle. Econometrica 57:357–384MathSciNetCrossRefzbMATHGoogle Scholar
  16. Hempel S, Koseska A, Kurths J, Nikoloski Z (2011) Inner composition alignment for inferring directed networks from short time series. Phys Rev Lett 107(5):054101CrossRefGoogle Scholar
  17. Hill SA, Braha D (2010) Dynamic model of time-dependent complex networks. Phys Rev E 82(4):046105CrossRefGoogle Scholar
  18. Holme P (2015) Modern temporal network theory: a colloquium. Euro Phys J B 88(9):1–30CrossRefGoogle Scholar
  19. Holme P, Saramäki J (2012) Temporal networks. Phys Rep 519(3):97–125CrossRefGoogle Scholar
  20. Khaouid W, Barsky M, Srinivasan V, Thomo A (2015) K-core decomposition of large networks on a single PC. Proc VLDB Endow 9(1):13–23CrossRefGoogle Scholar
  21. Kim H, Anderson R (2012) Temporal node centrality in complex networks. Phys Rev E 85(2):026107CrossRefGoogle Scholar
  22. Kim H, Tang J, Anderson R, Mascolo C (2012) Centrality prediction in dynamic human contact networks. Comput Netw 56(3):983–996CrossRefGoogle Scholar
  23. Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888–893CrossRefGoogle Scholar
  24. Kunegis J (2013) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on world wide web (WWW). ACM, pp 1343–1350Google Scholar
  25. Lerman K, Ghosh R, Kang JH (2010) Centrality metric for dynamic networks. In: Proceedings of the 8th workshop on mining and learning with graphs. ACM, pp 70–77Google Scholar
  26. Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http://snap.stanford.edu/data. Accessed Jan 2016
  27. Liu HL, Ma C, Xiang BB, Tang M, Zhang HF (2018) Identifying multiple influential spreaders based on generalized closeness centrality. Phys A 492:2237–2248CrossRefGoogle Scholar
  28. Morselli C, Masias VH, Crespo F, Laengle S (2013) Predicting sentencing outcomes with centrality measures. Secur Inf 2(1):4CrossRefGoogle Scholar
  29. Nicosia V, Tang J, Mascolo C, Musolesi M, Russo G, Latora V (2013) Graph metrics for temporal networks. In: Holme P, Saramäki J (eds) Temporal networks, understanding complex systems. Springer, Berlin, pp 15–40Google Scholar
  30. OBrien MP, Sullivan BD (2014) Locally estimating core numbers. In: IEEE international conference on data mining (ICDM), 2014. IEEE, pp 460–469Google Scholar
  31. Peng C, Kolda TG, Pinar A (2014) Accelerating community detection by using k-core subgraphs. arXiv preprint arXiv:1403.2226
  32. Rozenshtein P, Gionis A (2016) Temporal pagerank. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 674–689Google Scholar
  33. Scherrer A, Borgnat P, Fleury E, Guillaume JL, Robardet C (2008) Description and simulation of dynamic mobility networks. Comput Netw 52(15):2842–2858CrossRefzbMATHGoogle Scholar
  34. Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269–287MathSciNetCrossRefGoogle Scholar
  35. Sikdar S, Ganguly N, Mukherjee A (2016) Time series analysis of temporal networks. Euro Phys J B 89(1):1–11CrossRefGoogle Scholar
  36. Taylor D, Myers SA, Clauset A, Porter MA, Mucha PJ (2015) Eigenvector-based centrality measures for temporal networks. arXiv preprint arXiv:1507.01266
  37. Ufimtsev V, Sarkar S, Mukherjee A, Bhowmick S (2016) Understanding stability of noisy networks through centrality measures and local connections. In: Proceedings of the 25th ACM international on conference on information and knowledge management (CIKM). ACM, pp 2347–2352Google Scholar
  38. Yang Y, Dong Y, Chawla NV (2014) Predicting node degree centrality with the node prominence profile. Sci Rep 4:7236CrossRefGoogle Scholar
  39. Zhou H, Xu S, Huang C (2015) Temporal centrality prediction in opportunistic mobile social networks. In: International conference on internet of vehicles. Springer, pp 68–77Google Scholar
  40. Zhou H, Leung VC, Zhu C, Xu S, Fan J (2017) Predicting temporal social contact patterns for data forwarding in opportunistic mobile networks. IEEE Trans Veh Technol 66(11):10372–10383CrossRefGoogle Scholar

Copyright information

© The Author(s) 2018

Authors and Affiliations

  1. 1.Indian Institute of Technology KharagpurKharagpurIndia
  2. 2.University of NebraskaOmahaUSA

Personalised recommendations