Abstract
The study of robustness and connectivity properties are important in the analysis of complex networks. This paper reports on an effort to compare different network topologies according to their algebraic connectivity, network criticality, average node degree, and average node betweenness. We consider different network types and study the behavior of these various metrics as scale is increased. Based on extensive simulations, we suggest some guidelines for the design and simplification of networks. The main finding is that, algebraic connectivity, network criticality, average degree, and average node betweenness capture different properties of a graph. Depending on the nature of the problem at hand, one needs to select which one is appropriate to use as the main metric for network analysis.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
