Randomizing growing networks with a time-respecting null model.

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 data sets 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.

[1]  K. Sneppen,et al.  Specificity and Stability in Topology of Protein Networks , 2002, Science.

[2]  Jacob G Foster,et al.  Edge direction and the structure of networks , 2009, Proceedings of the National Academy of Sciences.

[3]  Albert-László Barabási,et al.  Quantifying Long-Term Scientific Impact , 2013, Science.

[4]  M. Newman,et al.  Statistical mechanics of networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[6]  Eli Upfal,et al.  Using PageRank to Characterize Web Structure , 2002, Internet Math..

[7]  Samuel Johnson,et al.  Factors Determining Nestedness in Complex Networks , 2013, PloS one.

[8]  K. N. Dollman,et al.  - 1 , 1743 .

[9]  A. Levine,et al.  New estimates of the storage permanence and ocean co-benefits of enhanced rock weathering , 2023, PNAS nexus.

[10]  Yi-Cheng Zhang,et al.  Identification of milestone papers through time-balanced network centrality , 2016, J. Informetrics.

[11]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[12]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[13]  Sergei Maslov,et al.  Ranking scientific publications using a model of network traffic , 2006, ArXiv.

[14]  M. Newman,et al.  Origin of degree correlations in the Internet and other networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  D. Helbing,et al.  The Hidden Geometry of Complex, Network-Driven Contagion Phenomena , 2013, Science.

[16]  Alessandro Vespignani,et al.  Detecting rich-club ordering in complex networks , 2006, physics/0602134.

[17]  Alexandre Vidmer,et al.  The essential role of time in network-based recommendation , 2016, ArXiv.

[18]  Luís A Nunes Amaral,et al.  Cross-evaluation of metrics to estimate the significance of creative works , 2015, Proceedings of the National Academy of Sciences.

[19]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[20]  Yannis Manolopoulos,et al.  Generalized comparison of graph-based ranking algorithms for publications and authors , 2006, J. Syst. Softw..

[21]  Martin Rosvall,et al.  Memory in network flows and its effects on spreading dynamics and community detection , 2013, Nature Communications.

[22]  Yi-Cheng Zhang,et al.  Ranking nodes in growing networks: When PageRank fails , 2015, Scientific Reports.

[23]  Andrea Gabrielli,et al.  Randomizing bipartite networks: the case of the World Trade Web , 2015, Scientific Reports.

[24]  Nitesh V. Chawla,et al.  Representing higher-order dependencies in networks , 2015, Science Advances.

[25]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[26]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[27]  E. A. Leicht,et al.  Large-scale structure of time evolving citation networks , 2007, 0706.0015.

[28]  Giulio Cimini,et al.  Model-based evaluation of scientific impact indicators , 2016, Physical review. E.

[29]  Alexandre Vidmer,et al.  Unbiased metrics of friends’ influence in multi-level networks , 2015, EPJ Data Science.

[30]  Diego Garlaschelli,et al.  Analytical maximum-likelihood method to detect patterns in real networks , 2011, 1103.0701.

[31]  Zoⅇ Lawson,et al.  管理 Interact 数据源 , 2017 .

[32]  Petter Holme,et al.  Modern temporal network theory: a colloquium , 2015, The European Physical Journal B.

[33]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[34]  Mark E. J. Newman,et al.  Prediction of highly cited papers , 2013, ArXiv.

[35]  Giorgio Fagiolo,et al.  Randomizing world trade. I. A binary network analysis. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Sergei Maslov,et al.  Finding scientific gems with Google's PageRank algorithm , 2006, J. Informetrics.

[37]  P. Kam,et al.  : 4 , 1898, You Can Cross the Massacre on Foot.

[38]  Sidney Redner,et al.  Community structure of the physical review citation network , 2009, J. Informetrics.

[39]  R. Pastor-Satorras,et al.  Activity driven modeling of time varying networks , 2012, Scientific Reports.

[40]  Giulio Cimini,et al.  Temporal effects in the growth of networks , 2011, Physical review letters.

[41]  Yoshiyuki Takeda,et al.  Tracking modularity in citation networks , 2010, Scientometrics.

[42]  Carlo Ratti,et al.  A General Optimization Technique for High Quality Community Detection in Complex Networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[43]  Torsten Suel,et al.  Local methods for estimating pagerank values , 2004, CIKM '04.

[44]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[45]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[46]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  Giorgio Fagiolo,et al.  Null models of economic networks: the case of the world trade web , 2011, 1112.2895.

[48]  Ludo Waltman,et al.  A new methodology for constructing a publication-level classification system of science , 2012, J. Assoc. Inf. Sci. Technol..

[49]  Ingo Scholtes,et al.  Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks , 2013, Nature Communications.

[50]  D. Brockmann,et al.  Effective distances for epidemics spreading on complex networks , 2016, Physical review. E.

[51]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

[52]  Nima Sarshar,et al.  Experience versus talent shapes the structure of the Web , 2008, Proceedings of the National Academy of Sciences.

[53]  Marcel Dunaiski,et al.  Evaluating paper and author ranking algorithms using impact and contribution awards , 2016, J. Informetrics.

[54]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[55]  Ludo Waltman,et al.  Clustering Scientific Publications Based on Citation Relations: A Systematic Comparison of Different Methods , 2015, PloS one.

[56]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[57]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

[58]  An Zeng,et al.  Iterative resource allocation for ranking spreaders in complex networks , 2014 .

[59]  Chiara Orsini,et al.  Quantifying randomness in real networks , 2015, Nature Communications.

[60]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[61]  Ludo Waltman,et al.  A smart local moving algorithm for large-scale modularity-based community detection , 2013, The European Physical Journal B.

[62]  Tao Zhou,et al.  The H-index of a network node and its relation to degree and coreness , 2016, Nature Communications.

[63]  Marián Boguñá,et al.  Approximating PageRank from In-Degree , 2007, WAW.

[64]  Romualdo Pastor-Satorras,et al.  Topological structure and the H index in complex networks. , 2017, Physical review. E.

[65]  Xiao Zhang,et al.  Random graph models for dynamic networks , 2016, The European Physical Journal B.

[66]  David Hawking,et al.  Predicting Fame and Fortune: PageRank or Indegree? , 2003 .