Mathematical Analysis of a Network’s Asymptotic Behaviour Based on its Strongly Connected Components

Jan Treur*

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationComplex Networks and Their Applications VII
Subtitle of host publicationVolume 1 Proceedings The 7th International Conference on Complex Networks and their Applications COMPLEX NETWORKS 2018
EditorsLuca Maria Ailello, Chantal Cherifi, Hocine Cherifi, Renaud Lambiotte, Pietro Lió, Luis M. Rocha
PublisherSpringer - Verlag
Pages663-679
Number of pages17
Volume1
ISBN (Electronic)9783030054113
ISBN (Print)9783030054106
DOIs
Publication statusPublished - 11 Dec 2018
Event7th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2018 - Cambridge, United Kingdom
Duration: 11 Dec 201813 Dec 2018

Publication series

NameStudies in Computational Intelligence
PublisherSpringer
Volume812
ISSN (Print)1860-949X

Conference

Conference7th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2018
CountryUnited Kingdom
CityCambridge
Period11/12/1813/12/18

Cite this