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. The theorem generalises existing theorems for specific cases such as acyclic networks, fully and strongly connected networks, and theorems addressing only linear functions.
Keywords
- Acyclic Network
- Condensation Graph
- Temporal-causal Network
- Combination Function
- Emergent Network Behavior
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
At http://www.few.vu.nl/~treur/linearsolvingv04.pdf further analysis of the example network illustrates Theorem 8, and also for another example network model.
References
Bloem, R., Gabow, H.N., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. Form. Meth. Syst. Des. 28, 37–56 (2006)
Bosse, T., Duell, R., Memon, Z.A., Treur, J., van der Wal, C.N.: Agent-based modelling of emotion contagion in groups. Cogn. Comput. 7(1), 111–136 (2015)
Chen, Y.: General spanning trees and reachability query evaluation. In: Desai, B.C. (ed.) Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering, C3S2E’09, pp. 243–252. ACM Press (2009)
Fleischer, L.K., Hendrickson, B., Pınar, A.: On identifying strongly connected components in parallel. In: Rolim J. (ed) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol. 1800, pp. 505–511. Springer (2000)
Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proceedings of the SODA’03, pp. 573–582 (2003)
Harary, F., Norman, R.Z., Cartwright, D.: Structural models: an introduction to the theory of directed graphs. Wiley, New York (1965)
Kuich, W.: On the entropy of context-free languages. Inf. Control 16, 173–200 (1970)
Li, G., Zhu, Z., Cong, Z., Yang, F.: Efficient decomposition of strongly connected components on GPUs. J. Syst. Architect. 60(1), 1–10 (2014)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)
Treur, J.: Network-Oriented Modeling: Addressing the Complexity of Cognitive, Affective and Social Interactions. Springer Publishers (2016)
Treur, J.: The Ins and Outs of Network-Oriented Modeling: from Biological Networks and Mental Networks to Social Networks and Beyond. Paper for Keynote Lecture at ICCCI’18. Springer Publishers (2018)
Treur, J.: Relating emerging network behaviour to network structure. In: Proceedings of the 7th International Conference on Complex Networks and their Applications, ComplexNetworks’18. Studies in Computational Intelligence, Springer (2018)
Wijs, A., Katoen, J.P., Bošnacki, D.: Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components. Form. Methods Syst. Des. 48, 274–300 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Treur, J. (2019). Mathematical Analysis of a Network’s Asymptotic Behaviour Based on Its Strongly Connected Components. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812. Springer, Cham. https://doi.org/10.1007/978-3-030-05411-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-030-05411-3_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05410-6
Online ISBN: 978-3-030-05411-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)