Skip to main content

Advertisement

Log in

Order structure analysis of node importance based on the temporal inter-layer neighborhood homogeneity rate of the dynamic network

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The analysis of node order structure in dynamic temporal networks is significant for network propagation control. To further accurately characterize the inter-layer coupling relationship of dynamic temporal networks, this paper firstly defines the node neighborhood structure homogeneity rate and node neighborhood location heterogeneity rate based on the node neighborhood structure evolution feature information and node neighborhood location evolution feature information, and integrates the influence of the change in both neighborhood structure and neighborhood location on the node importance in the process of node temporal evolution. Secondly, a Supra-Adjacency Matrix based on Neighborhood Structure (NSAM) temporal network node importance order structure modeling method is proposed by combining the local structure and overall structure evolution information of nodes during the temporal evolution process. Finally, the node importance order structure of the dynamic temporal network is obtained by combining the eigenvector centrality to represent the node importance attribute value. Simulations show that compared with the classical hierarchical temporal network model, the NSAM model can improve the identification accuracy by 38.2% and 7.8%, respectively, and can identify the important nodes in the dynamic temporal network more effectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Availability of data and materials

The data cannot be made publicly available upon publication because they contain sensitive personal information. The data that support the findings of this study are available upon reasonable request from the authors. No datasets were generated or analyzed during the current study.

References

  1. Tian L, Bashan A, Shi D, Liu Y (2017) Articulation points in complex networks. Nat Commun 8(1):14223. https://doi.org/10.1038/ncomms14223

    Article  Google Scholar 

  2. Saramaki J, Pan RK (2011) Path lengths, correlations, and centrality in temporal networks. Phys Rev E 84(1):16105. https://doi.org/10.1103/PhysRevE.84.016105

    Article  Google Scholar 

  3. Lv L, Chen D, Ren X, Zhang Q, Zhang Y, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650(13):1–63. https://doi.org/10.1016/j.physrep.2016.06.007

    Article  MathSciNet  Google Scholar 

  4. Koduru H, Murali KE, Satish A (2022) Efficient algorithm for finding the influential nodes using local relative change of average shortest path. Physica A 661:12011. https://doi.org/10.1016/j.ins.2024.120111

    Article  Google Scholar 

  5. Wang L, Ma L, Wang C, Xie GN, Koh JM, Cheong KH (2021) Identifying influential spreaders in social networks through discrete moth-flame optimization. IEEE Trans Evol Comput 25(6):1091–1102. https://doi.org/10.1109/TEVC.2021.3081478

    Article  Google Scholar 

  6. Mao Y, Zhou L, Xiong N (2021) Tps: a topological potential scheme to predict influential network nodes for intelligent communication in social networks. IEEE Trans Netw Sci Eng 8(1):529–540. https://doi.org/10.1109/TNSE.2020.3044299

    Article  MathSciNet  Google Scholar 

  7. Zhang HF, Wang Z (2019) Suppressing epidemic spreading by imitating hub nodes strategy. IEEE Trans Circuits Syst II Express Briefs 67(10):1979–1983. https://doi.org/10.1109/TCSII.2019.2938775

    Article  Google Scholar 

  8. Holme P, Saramaki J (2012) Temporal networks. Phys Rep 519(3):97–125. https://doi.org/10.1016/j.physrep.2012.03.001

    Article  Google Scholar 

  9. Xuan Q, Fu C, Yu L (2014) Ranking developer candidates by social links. Adv Complex Syst 17:1550005. https://doi.org/10.1142/S0219525915500058

    Article  MathSciNet  Google Scholar 

  10. Wang X, Gu H, Wang Q, Lv J (2019) Identifying topologies and system parameters of uncertain time-varying delayed complex networks. Sci China Technol Sci 62:94–105. https://doi.org/10.1007/s11431-018-9287-0

    Article  Google Scholar 

  11. Schaub MT, Delvenne J, Lambiotte R, Barahona M (2019) Multiscale dynamical embeddings of complex networks. Phys Rev E 99(6):62308. https://doi.org/10.1103/PhysRevE.99.062308

    Article  Google Scholar 

  12. Lv L, Zhang K, Zhang T, Bardou D, Zhang J, Cai Y (2019) Pagerank centrality for temporal networks. Phys Lett A 383(12):1215–1222. https://doi.org/10.1016/j.physleta.2019.01.041

    Article  Google Scholar 

  13. Zhao X, Yu H, Zhang J, Wu Z, Wu Y (2022) Important nodes mining based on a novel personalized temporal motif pagerank algorithm in temporal networks. Int J Mod Phys C 33(12):2250161. https://doi.org/10.1142/S0129183122501613

    Article  Google Scholar 

  14. Bi J, Jin J, Qu C, Zhan X, Wang G, Yan G (2021) Temporal gravity model for important node identification in temporal networks. Chaos Solitons Fractals 147:110934. https://doi.org/10.1016/j.chaos.2021.110934

    Article  MathSciNet  Google Scholar 

  15. Zhao X, Yu H, Zhang J, Wu Z, Wu Y (2022) Important nodes mining based on a novel personalized temporal motif pagerank algorithm in temporal networks. Int J Mod Phys C 33(12):2250161. https://doi.org/10.1142/S0129183122501613

    Article  Google Scholar 

  16. Jyothimon C, Viswanatham VM (2022) Dynamic node influence tracking based influence maximization on dynamic social networks. Microprocess Microsyst 95:104689. https://doi.org/10.1016/j.micpro.2022.104689

    Article  Google Scholar 

  17. Wu Z, He L, Tao L, Wang Y, Zhang Z (2022) Temporal neighborhood change centrality for important node identification in temporal networks. In: 29th International Conference on Neural Information Processing, pp 455–467. https://doi.org/10.1007/978-3-031-30105-6_38

  18. Yu EY, Yan F, Chen X, Xie M, Chen DB (2020) Identifying critical nodes in temporal networks by network embedding. Sci Rep 10:12494. https://doi.org/10.1038/s41598-020-69379-z

    Article  Google Scholar 

  19. Zhang J, Zhao L, Sun P, Liang W (2024) Dynamic identification of important nodes in complex networks based on the KPDN-INC method. Sci Rep 14:5814. https://doi.org/10.1038/s41598-024-56226-8

    Article  Google Scholar 

  20. Yang F, Zhang H, Tao S, Fan X (2024) Simple hierarchical Page Rank graph neural networks. J Supercomput 80:5509–5539. https://doi.org/10.1007/s11227-023-05666-6

    Article  Google Scholar 

  21. Lu Q, Guo-Yan H (2020) Risk transmission between banks based on time-varying state network. Acta Phys Sin 69(13):138901. https://doi.org/10.7498/aps.69.20200221

    Article  Google Scholar 

  22. Taylor D, Myers SA, Clauset A, Porter MA, Mucha PJ (2017) Eigenvector-based centrality measures for temporal networks. Multiscale Model Simul 15(1):537–574. https://doi.org/10.1137/16M1066142

    Article  MathSciNet  Google Scholar 

  23. Guo Q, Yin RR, Liu JG (2019) Node importance identification for temporal networks via the topsis method. J Univ Electron Sci Technol China 48(2):296–300. https://doi.org/10.3969/j.issn.1001-0548.2019.02.021

    Article  Google Scholar 

  24. Liu R, Zhang S, Zhang D, Zhang X, Bao X (2022) Node importance identification for temporal networks based on optimized supra-adjacency matrix. Entropy 24(10):1391. https://doi.org/10.3390/e24101391

    Article  MathSciNet  Google Scholar 

  25. Yang JN, Liu JG, Guo Q (2018) Node importance identification for temporal network based on inter-layer similarity. Acta Phys Sin 67(4):048901. https://doi.org/10.7498/aps.67.20172255

    Article  Google Scholar 

  26. Zhang T, Zhang K, Lv L, Li X, Cai Y (2022) Eigenvector centrality based on inter-layer similarity for link prediction in temporal network. J Phys Soc Jpn 91(2):24005. https://doi.org/10.7566/jpsj.91.024005

    Article  Google Scholar 

  27. Hu G, Xu LP, Xu X (2021) Identification of important nodes based on dynamic evolution of inter-layer isomorphism rate in temporal networks. Acta Phys Sin 70(10):108901. https://doi.org/10.7498/aps.70.20201804

    Article  Google Scholar 

  28. Jiang J, Fang H, Li S, Li W (2022) Identifying important nodes for temporal networks based on the ASAM model. Physica A: Stat Mech Appl 586:126455. https://doi.org/10.1016/j.physa.2021.126455

    Article  Google Scholar 

  29. Hu G, Lu ZY, Wang LM, Xu LP, Xu X, Ren YJ (2023) Identification of node importance order structure based on multi-order neighborhood contribution of complex network. Acta Electron Sin 51(7):1956–1963. https://doi.org/10.12263/DZXB.20221109

    Article  Google Scholar 

  30. Sluis A (1979) Gershgorin domains for partitioned matrices. Linear Algebra Appl 26:265–280. https://doi.org/10.1016/0024-3795(79)90181-2

    Article  MathSciNet  Google Scholar 

  31. Kendall MG (1945) The treatment of ties in ranking problems. Biometrika 33(3):239–251. https://doi.org/10.1093/biomet/33.3.239

    Article  MathSciNet  Google Scholar 

  32. Genois M, Barrat A (2018) Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci 7(1):1–18. https://doi.org/10.1140/epjds/s13688-018-0140-1

    Article  Google Scholar 

Download references

Funding

This research is supported by the Project supported by the National Natural Science Foundation of China (Grant No. 62072249), the Natural Science Foundation of Anhui Province, China (Grant No. 2108085MG236) and the Natural Science Foundation of the Higher Education Institutions of Anhui Province, China (Grant No. KJ2021A0385). The authors thank the reviewers and editors for their constructive comments on improving this paper.

Author information

Authors and Affiliations

Authors

Contributions

The authors’ contributions are summarized below. L.-Z.Y. and H.-G. were involved in conceptualization and writing original draft preparation; L.-Z.Y., H.-G. and W.-L.M. contributed to methodology; L.-Z.Y. were involved in data analysis and validation; L.-Z.Y., H.-G. and W.-L.M. were involved in writing review and editing; all authors have read and agreed to the published version of the manuscript.

Corresponding author

Correspondence to Gang Hu.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

Ethical approval

This study is only based on theoretical basic research. It is not involving humans.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lu, Z., Hu, G. & Wang, L. Order structure analysis of node importance based on the temporal inter-layer neighborhood homogeneity rate of the dynamic network. J Supercomput 80, 17314–17337 (2024). https://doi.org/10.1007/s11227-024-06135-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-024-06135-4

Keywords