On the scale-freeness of random colored substitution networks
Probability
2023-11-16 v2 Combinatorics
Abstract
Extending previous results in the literature, random colored substitution networks and degree dimension are defined in this paper. The scale-freeness of these networks is proved by introducing a new definition for degree dimension that is associated with Lyapunov exponents. The random colored substitution network hence turns out to be a simple, powerful and promising model to generate random scale-free networks.
Keywords
Cite
@article{arxiv.2109.14463,
title = {On the scale-freeness of random colored substitution networks},
author = {Nero Ziyu Li and Thomas Britz},
journal= {arXiv preprint arXiv:2109.14463},
year = {2023}
}