Mathematical Analysis of a Network's Asymptotic Behaviour Based on Its Strongly Connected Components

摘要

In this paper a general theorem is presented that relates asymptotic behaviour of a network to the network's characteristics concerning the network's strongly connected components and their mutual connections. The theorem generalises existing theorems for specific cases such as acyclic networks, fully and strongly connected networks, and theorems addressing only linear functions.