The characteristics of cycle-nodes-ratio and its application to network classification
Wenjun Zhang, Wei Li, Weibing Deng

TL;DR
This paper introduces the Cycle Nodes Ratio (CNR), a new metric to quantify the extent of cycles in networks, and explores its applications in network classification, analysis of real networks, and machine learning.
Contribution
The paper proposes CNR as a novel measure for cycle prevalence in networks, provides algorithms and analytical solutions, and demonstrates its utility in network classification and recognition tasks.
Findings
CNR remains stable in ER networks with fixed average degree
CNR increases with average degree, showing a critical transition
CNR is generally smaller in real networks compared to models
Abstract
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\"os R\'enyi (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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
