Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Digital Twin-Oriented Complex Networked Systems based on Heterogeneous Node Features and Interaction Rules (2308.11034v2)

Published 18 Aug 2023 in cs.SI and cs.AI

Abstract: This study proposes an extendable modelling framework for Digital Twin-Oriented Complex Networked Systems (DT-CNSs) with a goal of generating networks that faithfully represent real systems. Modelling process focuses on (i) features of nodes and (ii) interaction rules for creating connections that are built based on individual node's preferences. We conduct experiments on simulation-based DT-CNSs that incorporate various features and rules about network growth and different transmissibilities related to an epidemic spread on these networks. We present a case study on disaster resilience of social networks given an epidemic outbreak by investigating the infection occurrence within specific time and social distance. The experimental results show how different levels of the structural and dynamics complexities, concerned with feature diversity and flexibility of interaction rules respectively, influence network growth and epidemic spread. The analysis revealed that, to achieve maximum disaster resilience, mitigation policies should be targeted at nodes with preferred features as they have higher infection risks and should be the focus of the epidemic control.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (74)
  1. Betweenness centrality as a driver of preferential attachment in the evolution of research collaboration networks. Journal of Informetrics, 6(3):403–412.
  2. N-gcn: Multi-scale graph convolution for semi-supervised node classification. In uncertainty in artificial intelligence, pages 841–851. PMLR.
  3. Structural, dynamical and symbolic observability: From dynamical systems to networks. PLoS One, 13(10):e0206180.
  4. A guide to the application of hill numbers to dna-based diversity analyses. Molecular Ecology Resources, 19(4):804–817.
  5. Simulation and augmentation of social networks for building deep learning models. arXiv preprint arXiv:1905.09087.
  6. Emergence of scaling in random networks. science, 286(5439):509–512.
  7. Boucher, V. (2015). Structural homophily. International Economic Review, 56(1):235–264.
  8. Interacting spreading processes in multilayer networks: a systematic review. IEEE Access, 8:10316–10341.
  9. Link prediction in temporal networks: Integrating survival analysis and game theory. Information Sciences, 498:41–61.
  10. Molecular model of dynamic social network based on e-mail communication. Social Network Analysis and Mining, 3(3):543–563.
  11. Mutual influence of users credibility and news spreading in online social networks. Future Internet, 13(5):107.
  12. Unifying species diversity, phylogenetic diversity, functional diversity, and related similarity and differentiation measures through hill numbers. Annual review of ecology, evolution, and systematics, 45:297–324.
  13. Rarefaction and extrapolation with hill numbers: a framework for sampling and estimation in species diversity studies. Ecological monographs, 84(1):45–67.
  14. Multi-level graph convolutional networks for cross-platform anchor link prediction. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 1503–1511.
  15. Gc-lstm: graph convolution embedded lstm for dynamic network link prediction. Applied Intelligence, pages 1–16.
  16. Identifying the starting point of a spreading process in complex networks. Physical Review E, 84(5):056105.
  17. Mathematics and morphogenesis of cities: A geometrical approach. Physical Review E, 83(3):036106.
  18. Inducing features of random fields. IEEE transactions on pattern analysis and machine intelligence, 19(4):380–393.
  19. Coupledlp: Link prediction in coupled networks. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 199–208.
  20. What does homophily do? a review of the consequences of homophily. Academy of Management Annals, 16(1):38–69.
  21. Comparative analysis of inter-centroid k-means performance using euclidean distance, canberra distance and manhattan distance. In Journal of Physics: Conference Series, volume 1566, page 012112. IOP Publishing.
  22. Scale-free network growth by ranking. Physical review letters, 96(21):218701.
  23. The effect of network topology on the spread of epidemics. In Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., volume 2, pages 1455–1466. IEEE.
  24. A community bridge boosting social network link prediction model. In Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pages 683–689.
  25. Hybrid structure-based link prediction model. In 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pages 1221–1228. IEEE.
  26. Deep attributed network embedding by preserving structure and attribute information. IEEE Transactions on Systems, Man, and Cybernetics: Systems.
  27. Reproducibility in scientific computing. ACM Computing Surveys (CSUR), 51(3):1–36.
  28. Measuring preferential attachment in evolving networks. EPL (Europhysics Letters), 61(4):567.
  29. Directed closure coefficient and its patterns. Plos one, 16(6):e0253822.
  30. Measuring quadrangle formation in complex networks. IEEE Transactions on Network Science and Engineering.
  31. Robust detection of communities with multi-semantics in large attributed networks. In International Conference on Knowledge Science, Engineering and Management, pages 362–376. Springer.
  32. Modmrf: A modularity-based markov random field method for community detection. Neurocomputing, 405:218–228.
  33. Modeling the spread of multiple contagions on multilayer networks. Physica A: Statistical Mechanics and its Applications, 563:125410.
  34. Evaluating link prediction accuracy in dynamic networks with added and removed edges. In 2016 IEEE international conferences on big data and cloud computing (BDCloud), social computing and networking (SocialCom), sustainable computing and communications (SustainCom)(BDCloud-SocialCom-SustainCom), pages 377–384. IEEE.
  35. Influencing information spreading processes in complex networks with probability spraying. In 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pages 1038–1046. IEEE.
  36. Change point detection in social networks—critical review with experiments. Computer Science Review, 29:1–13.
  37. Advancing simulation experimentation capabilities with runtime interventions. In 2019 Spring Simulation Conference (SpringSim), pages 1–11. IEEE.
  38. Origins of homophily in an evolving social network. American journal of sociology, 115(2):405–450.
  39. Deltacon: A principled massive-graph similarity function. In Proceedings of the 2013 SIAM international conference on data mining, pages 162–170. SIAM.
  40. Propagation phenomena in real world networks. Springer.
  41. A deep learning approach to link prediction in dynamic networks. In Proceedings of the 2014 SIAM International Conference on Data Mining, pages 289–297. SIAM.
  42. Attributed social network embedding. IEEE Transactions on Knowledge and Data Engineering, 30(12):2257–2270.
  43. Using the contact network model and metropolis-hastings sampling to reconstruct the covid-19 spread on the “diamond princess”. Science bulletin, 65(15):1297–1305.
  44. Semi-supervised stochastic blockmodel for structure analysis of signed networks. Knowledge-Based Systems, 195:105714.
  45. A block-based generative model for attributed network embedding. World Wide Web, 24(5):1439–1464.
  46. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications, 390(6):1150–1170.
  47. Birds of a feather: Homophily in social networks. Annual review of sociology, 27(1):415–444.
  48. Competing contagion processes: Complex contagion triggered by simple contagion. Scientific reports, 8(1):1–8.
  49. Creation and growth of online social network. World Wide Web, 16(4):421–447.
  50. What kind of network are you? using local and global characteristics in network categorisation tasks. In Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pages 1366–1373.
  51. Triad transition probabilities characterize complex networks. Awareness Magazine.
  52. Matching node embeddings for graph similarity. In Thirty-first AAAI conference on artificial intelligence.
  53. Epidemic spreading in scale-free networks. Physical review letters, 86(14):3200.
  54. Graph based link prediction between human phenotypes and genes. arXiv preprint arXiv:2105.11989.
  55. Adaptive community detection incorporating topology and content in social networks. Knowledge-based systems, 161:342–356.
  56. Effects of time-dependent diffusion behaviors on the rumor spreading in social networks. Physics Letters A, 380(24):2054–2063.
  57. Estimating the infection and case fatality ratio for coronavirus disease (covid-19) using age-adjusted data from the outbreak on the diamond princess cruise ship, february 2020. Eurosurveillance, 25(12):2000256.
  58. Maximising influence spread in complex networks by utilising community-based driver nodes as seeds. In Annual International Conference on Information Management and Big Data, pages 126–141. Springer.
  59. Foundations and modelling of dynamic networks using dynamic graph neural networks: A survey. IEEE Access.
  60. Sohn, I. (2017). Small-world and scale-free network models for iot systems. Mobile Information Systems, 2017.
  61. The ubiquity of small-world networks. Brain connectivity, 1(5):367–375.
  62. Tsiotas, D. (2020). Preferential attachment: a multi-attribute growth process generating scale-free networks of different topologies. arXiv preprint arXiv:2001.05167.
  63. How to predict social relationships—physics-inspired approach to link prediction. Physica A: Statistical Mechanics and its Applications, 523:1110–1129.
  64. Graph-based change detection for condition monitoring of rotating machines: Techniques for graph similarity. IEEE Transactions on Reliability, 68(3):1034–1049.
  65. Autonomous overlapping community detection in temporal networks: A dynamic bayesian nonnegative matrix factorization approach. Knowledge-Based Systems, 110:121–134.
  66. Simulation of asset pricing in information networks. Physica A: Statistical Mechanics and its Applications, 513:620–634.
  67. Multi-asset pricing modeling using holding-based networks in energy markets. Finance Research Letters, page 102483.
  68. Community detection in social networks considering topic correlations. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 321–328.
  69. Real-time delay minimization for data processing in wirelessly networked disaster areas. IEEE Access, 7:2928–2937.
  70. Toward digital twin oriented modeling of complex networked systems and their dynamics: A comprehensive survey. IEEE Access, 10:66886–66923.
  71. Zhang, J. (2018). Influence of individual rationality on continuous double auction markets with networked traders. Physica A: Statistical Mechanics and its Applications, 495:353–392.
  72. Convergence of trading strategies in continuous double auction markets with boundedly-rational networked traders. Review of Quantitative Finance and Accounting, 50(1):301–352.
  73. Vulnerability of scale-free cryptocurrency networks to double-spending attacks. The European Journal of Finance, pages 1–15.
  74. Dynamic network embedding by modeling triadic closure process. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 32.
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now