High-Order Degree and Combined Degree in Complex Networks

We define several novel centrality metrics: the high-order degree and combined degree of undirected network, the high-order out-degree and in-degree and combined out out-degree and in-degree of directed network. Those are the measurement of node importance with respect to the number of the node neighbors. We also explore those centrality metrics in the context of several best-known networks. We prove that both the degree centrality and eigenvector centrality are the special cases of the high-order degree of undirected network, and both the in-degree and PageRank algorithm without damping factor are the special cases of the high-order in-degree of directed network. Finally, we also discuss the significance of high-order out-degree of directed network. Our centrality metrics work better in distinguishing nodes than degree and reduce the computation load compared with either eigenvector centrality or PageRank algorithm.

[1]  Piet Van Mieghem,et al.  Degree distribution and assortativity in line graphs of complex networks , 2016 .

[2]  Moshe Tennenholtz,et al.  Ranking systems: the PageRank axioms , 2005, EC '05.

[3]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[4]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[5]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[6]  P. Erdös.  On extremal problems of graphs and generalized graphs , 1964 .

[7]  Yuxian Liu,et al.  Q-measures and betweenness centrality in a collaboration network: a case study of the field of informetrics , 2011, Scientometrics.

[8]  Xiao Lu,et al.  Novel Model for Cascading Failure Based on Degree Strength and Its Application in Directed Gene Logic Networks , 2018, Comput. Math. Methods Medicine.

[9]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[10]  O. Bénichou,et al.  Global mean first-passage times of random walks on complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[12]  Charu C. Aggarwal,et al.  A Survey of Signed Network Mining in Social Media , 2015, ACM Comput. Surv..

[13]  K. Kaski,et al.  Scale-free networks generated by random walkers , 2004, cond-mat/0404088.

[14]  Hai Zhao,et al.  Neighbor vector centrality of complex networks based on neighbors degree distribution , 2013 .

[15]  Wei Wang,et al.  Caspase-1-Mediated Pyroptosis of the Predominance for Driving CD4$$^{+}$$+ T Cells Death: A Nonlocal Spatial Mathematical Model , 2018, Bulletin of mathematical biology.

[16]  Rishi Ranjan Singh,et al.  A Faster Algorithm to Update Betweenness Centrality After Node Alteration , 2013, Internet Math..

[17]  Sangwook Kim,et al.  Identifying and ranking influential spreaders in complex networks by neighborhood coreness , 2014 .

[18]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[19]  S. N. Dorogovtsev,et al.  Size-dependent degree distribution of a scale-free growing network. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[21]  Evimaria Terzi,et al.  A Spectral Algorithm for Computing Social Balance , 2011, WAW.

[22]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[23]  Taher H. Haveliwala.  Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[24]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[25]  Yan Chen,et al.  Analysis for gene networks based on logic relationships , 2010, J. Syst. Sci. Complex..

[26]  Jionglong Su,et al.  Modeling Gene Networks in Saccharomyces cerevisiae Based on Gene Expression Profiles , 2015, Comput. Math. Methods Medicine.

[27]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[28]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[29]  John Bohannon,et al.  Counterterrorism's new tool: 'metanetwork' analysis. , 2009, Science.

[30]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[31]  Richard F. Deckro,et al.  Parameter specification for the degree distribution of simulated Barabási–Albert graphs , 2017 .

[32]  Mikail Rubinov,et al.  Schizophrenia and abnormal brain network hubs , 2013, Dialogues in clinical neuroscience.

[33]  A. Rapoport.  Contribution to the theory of random and biased nets , 1957 .

[34]  Jon M. Kleinberg,et al.  Block models and personalized PageRank , 2016, Proceedings of the National Academy of Sciences.

[35]  Jie Zhang,et al.  Navigation by anomalous random walks on complex networks , 2016, Scientific Reports.

[36]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[37]  Albert-Laszlo Barabasi,et al.  Deterministic scale-free networks , 2001 .

[38]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[39]  Tonghua Zhang,et al.  Global Dynamics of a Virus Dynamical Model with Cell-to-Cell Transmission and Cure Rate , 2015, Comput. Math. Methods Medicine.

[40]  Sergey Brin,et al.  Reprint of: The anatomy of a large-scale hypertextual web search engine , 2012, Comput. Networks.

[41]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[42]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[43]  Slawomir T. Wierzchon,et al.  Traditional PageRank versus Network Capacity Bound , 2019, ADMA.

[44]  R. Monasson.  Diffusion, localization and dispersion relations on “small-world” lattices , 1999 .

[45]  P. Bonacich.  TECHNIQUE FOR ANALYZING OVERLAPPING MEMBERSHIPS , 1972 .

[46]  Zoubin Ghahramani,et al.  Bayesian inference on random simple graphs with power law degree distributions , 2017, ICML.

[47]  Stefano Battiston,et al.  The Network of Inter-Regional Direct Investment stocks across Europe , 2007, Adv. Complex Syst..

[48]  An Zeng,et al.  Ranking spreaders by decomposing complex networks , 2012, ArXiv.

[49]  Jason Noble,et al.  Extremism Propagation in Social Networks with Hubs , 2008, Adapt. Behav..

[50]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[51]  Thomas W. Valente,et al.  The stability of centrality measures when networks are sampled , 2003, Soc. Networks.

[52]  A RAPOPORT,et al.  A study of a large sociogram. , 2007 .

[53]  Enoch Peserico,et al.  The power of local information in PageRank , 2013, WWW.

[54]  Lucas Antiqueira,et al.  Analyzing and modeling real-world phenomena with complex networks: a survey of applications , 2007, 0711.3199.

[55]  Jaak Vilo,et al.  Building and analysing genome-wide gene disruption networks , 2002, ECCB.

[56]  Carl D. Meyer,et al.  Deeper Inside PageRank , 2004, Internet Math..

[57]  Víctor M Eguíluz,et al.  Epidemic threshold in structured scale-free networks. , 2002, Physical review letters.

[58]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .

[59]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[60]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[61]  Paul Taylor,et al.  Integrated Omic analysis of lung cancer reveals metabolism proteome signatures with prognostic impact , 2014, Nature Communications.

[62]  Slawomir T. Wierzchon,et al.  Network Capacity Bound for Personalized Bipartite PageRank , 2016, Challenges in Computational Statistics and Data Mining.