Matrix representation of evolving networks
classification
❄️ cond-mat.stat-mech
keywords
networksdistancematrixclassicalcompareddatadegreedifferent
read the original abstract
We present the distance matrix evolution for different types of networks: exponential, scale-free and classical random ones. Statistical properties of these matrices are discussed as well as topological features of the networks. Numerical data on the degree and distance distributions are compared with theoretical predictions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.