Randomizing growing networks with a time-respecting null model

03/22/2017
by   Zhuo-Ming Ren, et al.
0

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.

READ FULL TEXT
research
09/19/2021

Approximate Conditional Sampling for Pattern Detection in Weighted Networks

Assessing the statistical significance of network patterns is crucial fo...
research
06/29/2009

Explicit probabilistic models for databases and networks

Recent work in data mining and related areas has highlighted the importa...
research
06/11/2018

Randomized reference models for temporal networks

Many real-world dynamical systems can successfully be analyzed using the...
research
12/09/2020

Extracting the signed backbone of intrinsically dense weighted networks

Networks provide useful tools for analyzing diverse complex systems from...
research
02/24/2021

Random Graphs with Prescribed K-Core Sequences: A New Null Model for Network Analysis

In the analysis of large-scale network data, a fundamental operation is ...
research
09/24/2020

EPNE: Evolutionary Pattern Preserving Network Embedding

Information networks are ubiquitous and are ideal for modeling relationa...
research
02/16/2018

Diversity from the Topology of Citation Networks

We study transitivity in directed acyclic graphs and its usefulness in c...

Please sign up or login with your details

Forgot password? Click here to reset