Randomizing growing networks with a time-respecting null model
arXiv:1703.07656 · doi:10.1103/PhysRevE.97.052311
Abstract
Complex networks are often used to represent systems that are not static but grow with time: people make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of measurements made on such networks, we propose a randomization methodology---a time-respecting null model---that preserves both the network's degree sequence and the time evolution of individual nodes' degree values. By preserving the temporal linking patterns of the analyzed system, the proposed model is able to factor out the effect of the system's temporal patterns on its structure. We apply the model to the citation network of Physical Review scholarly papers and the citation network of US movies. The model reveals that the two datasets are strikingly different with respect to their degree-degree correlations, and we discuss the important implications of this finding on the information provided by paradigmatic node centrality metrics such as indegree and Google's PageRank. The randomization methodology proposed here can be used to assess the significance of any structural property in growing networks, which could bring new insights into the problems where null models play a critical role, such as the detection of communities and network motifs.
arXiv comment13 pages, 10 figures
References in corpus (42)
- Fast unfolding of communities in large networks
- Random graphs with arbitrary degree distributions and their applications
- Identification of influential spreaders in complex networks
- Specificity and stability in topology of protein networks
- Temporal Networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Community detection in networks: A user guide
- Dynamical and correlation properties of the Internet
- A smart local moving algorithm for large-scale modularity-based community detection
- Vital nodes identification in complex networks
- Detecting rich-club ordering in complex networks
- Quantifying Long-Term Scientific Impact
- Activity driven modeling of time varying networks
- The statistical mechanics of networks
- Modern temporal network theory: A colloquium
- Finding Scientific Gems with Google
- Memory in network flows and its effects on spreading dynamics and community detection
- Causality-Driven Slow-Down and Speed-Up of Diffusion in Non-Markovian Temporal Networks
- Edge direction and the structure of networks
- Ranking Scientific Publications Using a Simple Model of Network Traffic
- The origin of degree correlations in the Internet and other networks
- Representing higher-order dependencies in networks
- Analytical maximum-likelihood method to detect patterns in real networks
- A General Optimization Technique for High Quality Community Detection in Complex Networks
- Quantifying randomness in real networks
- Community Structure of the Physical Review Citation Network
- Randomizing bipartite networks: the case of the World Trade Web
- Temporal effects in the growth of networks
- Random graph models for dynamic networks
- Large-scale structure of time evolving citation networks
- Clustering scientific publications based on citation relations: A systematic comparison of different methods
- Randomizing world trade. I. A binary network analysis
- Effective Distances for Epidemics Spreading on Complex Networks
- Factors determining nestedness in complex networks
- Experience versus Talent Shapes the Structure of the Web
- Prediction of highly cited papers
- Null Models of Economic Networks: The Case of the World Trade Web
- Identification of milestone papers through time-balanced network centrality
- Ranking nodes in growing networks: When PageRank fails
- Model-based evaluation of scientific impact indicators
- Topological structure and the H-index in complex networks
- The essential role of time in network-based recommendation