{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:46:05Z","timestamp":1770965165699,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T00:00:00Z","timestamp":1686700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T00:00:00Z","timestamp":1686700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Interactive programming environments are powerful tools for promoting innovative network thinking, teaching science of complexity, and exploring emergent phenomena. This paper reports on our recent development of the deterministic random walk model in NetLogo, a leading platform for computational thinking, eco-system thinking, and multi-agent cross-platform programming environment. The deterministic random walk is foundational to modeling dynamical processes on complex networks. Inspired by the temporal visualizations offered in NetLogo, we investigated the relationship between network topology and diffusion saturation time for the deterministic random walk model. Our analysis uncovers that in Erd\u0151s\u2013R\u00e9nyi graphs, the saturation time exhibits an asymmetric pattern with a considerable probability of occurrence. This behavior occurs when the hubs, defined as nodes with relatively higher number of connections, emerge in Erd\u0151s\u2013R\u00e9nyi graphs. Yet, our analysis yields that the hubs in Barab\u00e1si\u2013Albert model stabilize the the convergence time of the deterministic random walk model. These findings strongly suggest that depending on the dynamical process running on complex networks, complementing characteristics other than the degree need to be taken into account for considering a node as a hub. We have made our development open-source, available to the public at no cost at<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/bravandi\/NetLogo-Dynamical-Processes\">https:\/\/github.com\/bravandi\/NetLogo-Dynamical-Processes<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s41109-023-00559-2","type":"journal-article","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T08:02:14Z","timestamp":1686729734000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Deterministic random walk model in NetLogo and the identification of asymmetric saturation time in random graph"],"prefix":"10.1007","volume":"8","author":[{"given":"Ayan","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Qingtao","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Amirhossein","family":"Sajadi","sequence":"additional","affiliation":[]},{"given":"Babak","family":"Ravandi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,14]]},"reference":[{"issue":"5439","key":"559_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"559_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical processes on complex networks","author":"A Barrat","year":"2008","unstructured":"Barrat A, Barthelemy M, Vespignani A (2008) Dynamical processes on complex networks. Cambridge University Press, Cambridge"},{"issue":"8","key":"559_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1088\/0305-4470\/38\/8\/R01","volume":"38","author":"R Burioni","year":"2005","unstructured":"Burioni R, Cassi D (2005) Random walks on graphs: ideas, techniques and results. J Phys A: Math Gen 38(8):45","journal-title":"J Phys A: Math Gen"},{"issue":"7","key":"559_CR4","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.cnsns.2006.12.003","volume":"13","author":"F Chen","year":"2008","unstructured":"Chen F, Chen Z, Wang X, Yuan Z (2008) The average path length of scale free networks. Commun Nonlinear Sci Numer Simul 13(7):1405\u20131410. https:\/\/doi.org\/10.1016\/j.cnsns.2006.12.003","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"3","key":"559_CR5","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1137\/110851584","volume":"50","author":"F Dorfler","year":"2012","unstructured":"Dorfler F, Bullo F (2012) Synchronization and transient stability in power networks and nonuniform Kuramoto oscillators. SIAM J Control Optim 50(3):1616\u20131642","journal-title":"SIAM J Control Optim"},{"key":"559_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2020.106939","volume":"146","author":"A Eberl","year":"2020","unstructured":"Eberl A, Klar B (2020) Asymptotic distributions and performance of empirical skewness measures. Comput Stat Data Anal 146:106939","journal-title":"Comput Stat Data Anal"},{"key":"559_CR7","doi-asserted-by":"publisher","unstructured":"Elmaghraby SE, Aggerwal MK (1997) On the expected completion time of diffusion activity networks (DiAN). In: NATO ASI series, pp 47\u201367. Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-94-009-0061-5_5","DOI":"10.1007\/978-94-009-0061-5_5"},{"key":"559_CR8","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On random graphs i. Publicationes Mathematicae Debrecen 6:290","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"559_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.70.056110","author":"A Fronczak","year":"2004","unstructured":"Fronczak A, Fronczak P, Ho\u0142yst JA (2004) Average path length in random networks. Phys Rev E. https:\/\/doi.org\/10.1103\/physreve.70.056110","journal-title":"Phys Rev E"},{"key":"559_CR10","doi-asserted-by":"crossref","unstructured":"Heydari B, Szajnfarber Z, Panchal J, Cardin M-A, Holtta-Otto K, Kremer GE, Chen W (2019) Analysis and design of sociotechnical systems. American Society of Mechanical Engineers","DOI":"10.1115\/1.4029150"},{"key":"559_CR11","doi-asserted-by":"crossref","unstructured":"Jia N, Yu J, Wang Y (2010) A method to determine the saturation of information diffusion under network environment. In: 2010 Fifth international conference on internet computing for science and engineering, pp 194\u2013197. IEEE","DOI":"10.1109\/ICICSE.2010.35"},{"issue":"4","key":"559_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1098\/rsif.2005.0051","volume":"2","author":"MJ Keeling","year":"2005","unstructured":"Keeling MJ, Eames KT (2005) Networks and epidemic models. J R Soc Interface 2(4):295\u2013307","journal-title":"J R Soc Interface"},{"issue":"7346","key":"559_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1038\/nature10011","volume":"473","author":"Y-Y Liu","year":"2011","unstructured":"Liu Y-Y, Slotine J-J, Barab\u00e1si A-L (2011) Controllability of complex networks. Nature 473(7346):167\u2013173","journal-title":"Nature"},{"key":"559_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2017.07.007","volume":"716","author":"N Masuda","year":"2017","unstructured":"Masuda N, Porter MA, Lambiotte R (2017) Random walks and diffusion on networks. Phys Rep 716:1\u201358","journal-title":"Phys Rep"},{"key":"559_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-018-0100-5","author":"L Milli","year":"2018","unstructured":"Milli L, Rossetti G, Pedreschi D, Giannotti F (2018) Active and passive diffusion processes in complex networks. Appl Netw Sci. https:\/\/doi.org\/10.1007\/s41109-018-0100-5","journal-title":"Appl Netw Sci"},{"key":"559_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195124415.001.0001","volume-title":"Complexity: a guided tour","author":"M Mitchell","year":"2009","unstructured":"Mitchell M (2009) Complexity: a guided tour. Oxford University Press, Oxford"},{"issue":"3","key":"559_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1038\/nphys2535","volume":"9","author":"AE Motter","year":"2013","unstructured":"Motter AE, Myers SA, Anghel M, Nishikawa T (2013) Spontaneous synchrony in power-grid networks. Nat Phys 9(3):191\u2013197","journal-title":"Nat Phys"},{"issue":"1","key":"559_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.016128","volume":"66","author":"ME Newman","year":"2002","unstructured":"Newman ME (2002) Spread of epidemic disease on networks. Phys Rev E 66(1):016128","journal-title":"Phys Rev E"},{"key":"559_CR19","doi-asserted-by":"crossref","unstructured":"Newton I (1687) Philosophiae naturalis principia mathematica, vol 1","DOI":"10.5479\/sil.52126.39088015628399"},{"key":"559_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.118701","volume":"92","author":"JD Noh","year":"2004","unstructured":"Noh JD, Rieger H (2004) Random walks on complex networks. Phys Rev Lett 92:118701. https:\/\/doi.org\/10.1103\/PhysRevLett.92.118701","journal-title":"Phys Rev Lett"},{"issue":"9","key":"559_CR21","first-page":"2416","volume":"83","author":"JM Olesen","year":"2002","unstructured":"Olesen JM, Jordano P (2002) Geographic patterns in plant-pollinator mutualistic networks. Ecology 83(9):2416\u20132424","journal-title":"Ecology"},{"issue":"50","key":"559_CR22","doi-asserted-by":"publisher","first-page":"19891","DOI":"10.1073\/pnas.0706375104","volume":"104","author":"JM Olesen","year":"2007","unstructured":"Olesen JM, Bascompte J, Dupont YL, Jordano P (2007) The modularity of pollination networks. Proc Natl Acad Sci 104(50):19891\u201319896","journal-title":"Proc Natl Acad Sci"},{"issue":"3","key":"559_CR23","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1103\/RevModPhys.87.925","volume":"87","author":"R Pastor-Satorras","year":"2015","unstructured":"Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87(3):925","journal-title":"Rev Mod Phys"},{"issue":"4","key":"559_CR24","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118\u20131123. https:\/\/doi.org\/10.1073\/pnas.0706851105","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"559_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-022-30164-3","volume":"13","author":"A Sajadi","year":"2022","unstructured":"Sajadi A, Kenyon RW, Hodge B-M (2022) Synchronization in electric power networks with inherent heterogeneity up to 100% inverter-based renewable generation. Nat Commun 13(1):1\u201312","journal-title":"Nat Commun"},{"issue":"6825","key":"559_CR26","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz SH (2001) Exploring complex networks. Nature 410(6825):268\u2013276","journal-title":"Nature"},{"key":"559_CR27","first-page":"16","volume":"21","author":"S Tisue","year":"2004","unstructured":"Tisue S, Wilensky U (2004) NetLogo: a simple environment for modeling complexity. Int Conf Complex Syst 21:16\u201321","journal-title":"Int Conf Complex Syst"},{"key":"559_CR28","doi-asserted-by":"publisher","unstructured":"Zhao J, Liu Z, Yu J (2011) Saturation model of network information diffusion. In: Proceedings of the 13th international conference on enterprise information systems (ICEIS 2011), NMI, vol 2, pp 412\u2013417. SciTePress, Beijing. https:\/\/doi.org\/10.5220\/0003569604120417 . INSTICC","DOI":"10.5220\/0003569604120417"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00559-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-023-00559-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00559-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T02:15:25Z","timestamp":1702606525000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-023-00559-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,14]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s41109-023-00559-2","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,14]]},"assertion":[{"value":"10 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"33"}}