The characteristics of cycle-nodes-ratio and its application to network classification

Cycles, which can be found in many different kinds of networks, make the problems more intractable, especially when dealing with dynamical processes on networks. On the contrary, tree networks in which no cycle exists, are simplifications and usually allow for analyticity. There lacks a quantity, however, to tell the ratio of cycles which determines the extent of network being close to tree networks. Therefore we introduce the term Cycle Nodes Ratio (CNR) to describe the ratio of number of nodes belonging to cycles to the number of total nodes, and provide an algorithm to calculate CNR. CNR is studied in both network models and real networks. The CNR remains unchanged in different sized Erdős-Rényi (ER) networks with the same average degree, and increases with the average degree, which yields a critical turning point. The approximate analytical solutions of CNR in ER networks are given, which fits the simulations well. Furthermore, the difference between CNR and two-core ratio (TCR) is analyzed. The critical phenomenon is explored by analysing the giant component of networks. We compare the CNR in network models and real networks, and find the latter is generally smaller. Combining the coarse-graining method can Email address: liw@mail.ccnu.edu.cn, wdeng@mail.ccnu.edu.cn (Wenjun Zhang1,3, Wei Li1,2∗ and Weibing Deng1∗ ) Preprint submitted to Journal of LTEX Templates March 11, 2021 ar X iv :2 10 3. 05 91 1v 1 [ ph ys ic s. so cph ] 1 0 M ar 2 02 1 distinguish the CNR structure of networks with high average degree. The CNR is also applied to four different kinds of transportation networks and fungal networks, which give rise to different zones of effect. It is interesting to see that CNR is very useful in network recognition of machine learning.

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

[2]  David Gfeller,et al.  Spectral coarse graining of complex networks. , 2007, Physical review letters.

[3]  Wei Li,et al.  Statistical Properties of Links of Network: A Survey on the Shipping Lines of Worldwide Marine Transport Network , 2018, Physica A: Statistical Mechanics and its Applications.

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

[5]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Liang Tian,et al.  Bridges in Complex Networks , 2016, Physical review. E.

[7]  Gorjan Alagic,et al.  #p , 2019, Quantum information & computation.

[8]  G. Bianconi,et al.  Number of loops of size h in growing scale-free networks. , 2002, Physical review letters.

[9]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[11]  Vincent Labatut,et al.  Classification of Complex Networks Based on Topological Properties , 2014, 2013 International Conference on Cloud and Green Computing.

[12]  H. Fleischner Eulerian graphs and related topics , 1990 .

[13]  Dennis Cates Wylie,et al.  Linked by loops: Network structure and switch integration in complex dynamical systems , 2007, 0704.3640.

[14]  F. Harary,et al.  On the Tree Graph of a Matroid , 1972 .

[15]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[16]  Jitao Sun,et al.  A tree-like complex network model , 2010 .

[17]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[18]  Hai-Jun Zhou,et al.  Optimal Segmentation of Directed Graph and the Minimum Number of Feedback Arcs , 2017, ArXiv.

[19]  Adrian Bejan,et al.  Tree-shaped networks with loops , 2005 .

[20]  P. Erdos,et al.  On the strength of connectedness of a random graph , 1964 .

[21]  Zhou Jian,et al.  Improved algorithm of spectral coarse graining method of complex network , 2017 .

[22]  Sucharita Gopal,et al.  The evolving social geography of blogs , 2007 .

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

[24]  Yang-Yu Liu,et al.  Inducing effect on the percolation transition in complex networks , 2013, Nature Communications.

[25]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[26]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

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

[28]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[29]  Graph theoretical criteria for stability and boundedness of predator-prey systems , 1982 .

[30]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[31]  David Lusseau,et al.  The emergent properties of a dolphin social network , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[32]  James M. Keller,et al.  A fuzzy K-nearest neighbor algorithm , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[33]  George T. Cantwell,et al.  Message passing on networks with loops , 2019, Proceedings of the National Academy of Sciences.

[34]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  J. Noh Loop statistics in complex networks , 2007, 0707.0560.

[36]  Linyuan Lu,et al.  Towards the cycle structures in complex network: A new perspective , 2019, 1903.01397.

[37]  Guanrong Chen,et al.  Totally homogeneous networks , 2019, National science review.

[38]  Hai-Jun Zhou,et al.  Spin glass approach to the feedback vertex set problem , 2013, 1307.6948.

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

[40]  Réka Albert,et al.  Identifying (un)controllable dynamical behavior in complex networks , 2017, bioRxiv.

[41]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[42]  Sadegh Aliakbary,et al.  Classification of complex networks based on similarity of topological network features. , 2017, Chaos.