dc.creatorECHTERMEYER, Christoph
dc.creatorCOSTA, Luciano da Fontoura
dc.creatorRODRIGUES, Francisco A.
dc.creatorKAISER, Marcus
dc.date.accessioned2012-04-19T15:34:39Z
dc.date.accessioned2018-07-04T14:42:04Z
dc.date.available2012-04-19T15:34:39Z
dc.date.available2018-07-04T14:42:04Z
dc.date.created2012-04-19T15:34:39Z
dc.date.issued2011
dc.identifierPLOS ONE, v.6, n.1, 2011
dc.identifier1932-6203
dc.identifierhttp://producao.usp.br/handle/BDPI/16421
dc.identifier10.1371/journal.pone.0015765
dc.identifierhttp://dx.doi.org/10.1371/journal.pone.0015765
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1613243
dc.description.abstractComplex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs-a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.
dc.languageeng
dc.publisherPUBLIC LIBRARY SCIENCE
dc.relationPlos One
dc.rightsCopyright PUBLIC LIBRARY SCIENCE
dc.rightsopenAccess
dc.titleAutomatic Network Fingerprinting through Single-Node Motifs
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución