On the scale-freeness of random colored substitution networks

TL;DR

This paper introduces a new model for generating random scale-free networks using colored substitution networks and degree dimension linked to Lyapunov exponents, extending prior work in network theory.

Contribution

It defines degree dimension in relation to Lyapunov exponents and proves the scale-freeness of the proposed network model.

Findings

The model produces scale-free networks.

Degree dimension is linked to Lyapunov exponents.

The approach extends existing network generation methods.

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.