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. Also characteristics of the combination functions used to aggregate the effects of multiple incoming connections are shown to play a role. The theorem generalises existing theorems for specific cases such as acyclic networks, fully and strongly connected networks, and theorems addressing only linear or scaled sum combination functions as one fixed type of combination function.
|Name||Studies in Computational Intelligence|
|Conference||7th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2018|
|Period||11/12/18 → 13/12/18|