Please use this identifier to cite or link to this item: https://doi.org/epjb/e2012-21019-2
Title: Uncovering evolutionary ages of nodes in complex networks
Authors: Zhu, G.-M. 
Yang, H.J. 
Yang, R.
Ren, J.
Li, B. 
Lai, Y.-C. 
Issue Date: Mar-2012
Source: Zhu, G.-M., Yang, H.J., Yang, R., Ren, J., Li, B., Lai, Y.-C. (2012-03). Uncovering evolutionary ages of nodes in complex networks. European Physical Journal B 85 (3) : -. ScholarBank@NUS Repository. https://doi.org/epjb/e2012-21019-2
Abstract: In a complex network, different groups of nodes may have existed for different amounts of time. To detect the evolutionary history of a network is of great importance. We present a spectral-analysis based method to address this fundamental question in network science. In particular, we find that there are complex networks in the real-world for which there is a positive correlation between the eigenvalue magnitude and node age. In situations where the network topology is unknown but short time series measured from nodes are available, we suggest to uncover the network topology at the present (or any given time of interest) by using compressive sensing and then perform the spectral analysis. Knowledge of ages of various groups of nodes can provide significant insights into the evolutionary process underpinning the network. It should be noted, however, that at the present the applicability of our method is limited to the networks for which information about the node age has been encoded gradually in the eigen-properties through evolution. © 2012 EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg.
Source Title: European Physical Journal B
URI: http://scholarbank.nus.edu.sg/handle/10635/98511
ISSN: 14346028
DOI: epjb/e2012-21019-2
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

WEB OF SCIENCETM
Citations

2
checked on Jan 16, 2018

Page view(s)

28
checked on Jan 13, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.