{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:21:57Z","timestamp":1743124917979,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031239281"},{"type":"electronic","value":"9783031239298"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T00:00:00Z","timestamp":1674345600000},"content-version":"vor","delay-in-days":386,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The relevance of nodes with respect to the position they have in a network is often investigated with centrality measures. In particular, in cases where it is specifically meaningful to consider nodes\u2019 ability to cumulate and convey information, like in economic systems, betweenness centrality is one of the most pertinent options because of its underlying concept. However, this statistic presents two limitations. First, as it relies on the computation of shortest paths, it is grounded on a binary topological evaluation: every time a node is not located in the shortest path between two other nodes, it gains no score at all in its centrality (even if it is located on a path just one step longer). Second, betweenness centrality does not allow the direct analysis of multi-dimensional and dynamic networks: it has to be computed one dimension and one instant at a time, and this causes problems of comparability in case of weighted connections. The scope and the originality of this work is to design a network model that makes it possible to solve these issues. The proposed Dynamic Multi-Layer Network (DMLN) allows the structural representation of the multi-dimensional and dynamic properties of nodes\u2019 interactions. Then, this allows the computation of a metric that, based on Infomap random walks, assesses the level of information cumulated and conveyed by nodes in any moment and in any dimension of interaction. Importantly, this is performed without relying on a binary evaluation, and by jointly taking into account what occurred in all the dimensions and during the entire period, in which the system is observed. We present and discuss an implementation based on ICT worldwide trade of goods and services in the period 2004\u20132014.<\/jats:p>","DOI":"10.1007\/978-3-031-23929-8_22","type":"book-chapter","created":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T19:02:39Z","timestamp":1674327759000},"page":"233-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Information Flow Simulations in\u00a0Multi-dimensional and\u00a0Dynamic Systems"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Righi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,22]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1038\/s42254-020-00273-3","volume":"3","author":"WB Arthur","year":"2021","unstructured":"Arthur, W.B.: Foundations of complexity economics. Nat. Rev. Phys. 3(2), 136\u2013145 (2021)","journal-title":"Nat. Rev. Phys."},{"issue":"11","key":"22_CR2","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"Barrat, A., Barthelemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. Proc. Natl. Acad. Sci. 101(11), 3747\u20133752 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4\u20135","key":"22_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: structure and dynamics. Phys. Rep. 424(4\u20135), 175\u2013308 (2006)","journal-title":"Phys. Rep."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"1","key":"22_CR5","volume":"5","author":"M De Domenico","year":"2015","unstructured":"De Domenico, M., Lancichinetti, A., Arenas, A., Rosvall, M.: Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Phys. Rev. X 5(1), 011027 (2015)","journal-title":"Phys. Rev. X"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1978)","journal-title":"Soc. Netw."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Lane, D.: Complexity and innovation dynamics. Handb. Econ. Complex. Technol. Change 63 (2011)","DOI":"10.4337\/9780857930378.00008"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Lane, D., Maxfield, R.: Building a new market system: effective action, redirection and generative relationships. Complex. Perspect. Innov. Soc. Change, 263\u2013288 (2009)","DOI":"10.1007\/978-1-4020-9663-1_10"},{"issue":"1690","key":"22_CR9","doi-asserted-by":"publisher","first-page":"20150194","DOI":"10.1098\/rstb.2015.0194","volume":"371","author":"DA Lane","year":"2016","unstructured":"Lane, D.A.: Innovation cascades: artefacts, organization and attributions. Philos. Trans. Roy. Soc. B 371(1690), 20150194 (2016)","journal-title":"Philos. Trans. Roy. Soc. B"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118\u20131123 (2008)","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Communications in Computer and Information Science","Artificial Life and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23929-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T10:04:37Z","timestamp":1699005877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23929-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031239281","9783031239298"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23929-8_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WIVACE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italian Workshop on Artificial Life and Evolutionary Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Winterthur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wivace2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wivace2021.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}