Weighted network motifs as random walk patterns

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.authorPicciolo, Francescoen_US
dc.contributor.authorRuzzenenti, Francoen_US
dc.contributor.authorHolme, Petteren_US
dc.contributor.authorMastrandrea, Rossanaen_US
dc.contributor.departmentDepartment of Computer Scienceen
dc.contributor.groupauthorProfessorship Holme Petteren
dc.contributor.groupauthorComputer Science Professorsen
dc.contributor.groupauthorComputer Science - Complex Systems (Cxsys)en
dc.contributor.organizationUniversity of Sienaen_US
dc.contributor.organizationUniversity of Groningenen_US
dc.contributor.organizationIMT School for Advanced Studies Luccaen_US
dc.date.accessioned2022-08-10T08:19:54Z
dc.date.available2022-08-10T08:19:54Z
dc.date.issued2022-05-01en_US
dc.descriptionFunding Information: RM acknowledges support from the Italian ‘Programma di Attività Integrata’ (PAI) project ‘PROsociality COgnition and Peer Effects’ (PRO.CO.P.E.), funded by IMT School for Advanced Studies Lucca. PH acknowledges support from JSPS KAKENHI (Grant No. JP 18H01655). Publisher Copyright: © 2022 The Author(s). Published by IOP Publishing Ltd on behalf of the Institute of Physics and Deutsche Physikalische Gesellschaft.
dc.description.abstractOver the last two decades, network theory has shown to be a fruitful paradigm in understanding the organization and functioning of real-world complex systems. One technique helpful to this endeavor is identifying functionally influential subgraphs, shedding light on underlying evolutionary processes. Such overrepresented subgraphs, motifs, have received much attention in simple networks, where edges are either on or off. However, for weighted networks, motif analysis is still undeveloped. Here, we proposed a novel methodology - based on a random walker taking a fixed maximum number of steps - to study weighted motifs of limited size. We introduce a sink node to balance the network and allow the detection of configurations within an a priori fixed number of steps for the random walker. We applied this approach to different real networks and selected a specific null model based on maximum-entropy to test the significance of weighted motifs occurrence. We found that identified similarities enable the classifications of systems according to functioning mechanisms associated with specific configurations: economic networks exhibit close patterns while differentiating from ecological systems without any a priori assumption.en
dc.description.versionPeer revieweden
dc.format.extent17
dc.format.extent1-17
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationPicciolo, F, Ruzzenenti, F, Holme, P & Mastrandrea, R 2022, ' Weighted network motifs as random walk patterns ', New Journal of Physics, vol. 24, no. 5, 053056, pp. 1-17 . https://doi.org/10.1088/1367-2630/ac6f75en
dc.identifier.doi10.1088/1367-2630/ac6f75en_US
dc.identifier.issn1367-2630
dc.identifier.otherPURE UUID: 6801eb9d-d5af-4132-b121-a88cfefe5877en_US
dc.identifier.otherPURE ITEMURL: https://research.aalto.fi/en/publications/6801eb9d-d5af-4132-b121-a88cfefe5877en_US
dc.identifier.otherPURE LINK: http://www.scopus.com/inward/record.url?scp=85132792162&partnerID=8YFLogxKen_US
dc.identifier.otherPURE FILEURL: https://research.aalto.fi/files/85348855/Weighted_network_motifs_as_random_walk_patterns.pdfen_US
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/115792
dc.identifier.urnURN:NBN:fi:aalto-202208104614
dc.language.isoenen
dc.publisherIOP Publishing Ltd.
dc.relation.ispartofseriesNew Journal of Physicsen
dc.relation.ispartofseriesVolume 24, issue 5en
dc.rightsopenAccessen
dc.subject.keywordcomplex networksen_US
dc.subject.keywordnull modelsen_US
dc.subject.keywordrandom walken_US
dc.subject.keywordweighted motifsen_US
dc.subject.keywordweighted networksen_US
dc.titleWeighted network motifs as random walk patternsen
dc.typeA1 Alkuperäisartikkeli tieteellisessä aikakauslehdessäfi
dc.type.versionpublishedVersion
Files