Skip to main content
SpringerLink
Log in

Analysis of a Network’s Emerging Behaviour via Its Structure Involving Its Strongly Connected Components

  • Chapter
  • First Online:
Network-Oriented Modeling for Adaptive Networks: Designing Higher-Order Adaptive Biological, Mental and Social Network Models

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 251))

  • 764 Accesses

Abstract

In this chapter, it is addressed how network structure can be related to network behaviour. If such a relation is studied, that usually concerns only strongly connected networks and only linear functions describing the aggregation of multiple impacts. In this chapter both conditions are generalised. General theorems are presented that relate emerging behaviour of a network to the network’s structure characteristics. The network structure characteristics on the one hand concern network connectivity in terms of the network’s strongly connected components and their mutual connections; this generalises the condition of being strongly connected (as addressed in Chap. 11) to a very general condition. On the other hand, the network structure characteristics considered concern aggregation by generalising from linear combination functions to any combination functions that are normalised, monotonic and scalar-free, so that many nonlinear functions are also covered (which also was done in Chap. 11). Thus the contributed theorems generalise existing theorems on the relation between network structure and network behaviour that only address specific cases (such as acyclic networks, fully and strongly connected networks, and theorems addressing only linear functions).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://wims.unice.fr/wims/wims.cgi?session=DH1DFC9A6E.3&+lang=en&+module=tool%2Flinear%2Flinsolver.en.

References

  • Ashby, W.R.: Design for a Brain: The Origin of Adaptive Behaviour. Chapman and Hall, London, second extended edition (first edition, 1952) (1960)

    Google Scholar 

  • 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)

    Article  Google Scholar 

  • Bosse, T., Duell, R., Memon, Z.A., Treur, J., van der Wal, C.N.: Agent-based modelling of emotion contagion in groups. Cogn. Comp. 7(1), 111–136 (2015)

    Article  Google Scholar 

  • 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, New York (2009)

    Google Scholar 

  • Drechsler, R.: Advanced Formal Verification. Kluwer Academic Publishers, Dordrecht (2004)

    Book  Google Scholar 

  • Fisher, M.S.: Software Verification and Validation: An Engineering and Scientific Approach. Springer Science + Business Media, New York, NY (2007)

    MATH  Google Scholar 

  • 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, Berlin (2000)

    Google Scholar 

  • Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proceedings of SODA’03, pp. 573–582 (2003)

    Google Scholar 

  • Haghighi, R., Namazi, H.: Algorithm for identifying minimum driver nodes based on structural controllability. In: Mathematical Problems in Engineering, vol. 2015, Article ID 192307. http://dx.doi.org/10.1155/2015/192307 (2015)

  • Harary, F., Norman, R.Z., Cartwright, D.: Structural Models: An Introduction to the Theory of Directed Graphs. Wiley, New York (1965)

    MATH  Google Scholar 

  • Kalman, R.E.: Mathematical description of linear dynamical systems. J. Soc. Indus. Appl. Math. Ser. A 1, 152 (1963)

    Article  MathSciNet  Google Scholar 

  • Karlsen, M., Moschoyiannis, S.: Evolution of control with learning classifier systems. Appl. Netw. Sci. 3, 30 (2018)

    Article  Google Scholar 

  • Kuich, W.: On the entropy of context-free languages. Inf. Contr. 16, 173–200 (1970)

    Article  MathSciNet  Google Scholar 

  • Łacki, J.: Improved deterministic algorithms for decremental reachability and strongly connected components. ACM Trans. Algorithms 9(3), Article 27 (2013)

    Google Scholar 

  • Li, G., Zhu, Z., Cong, Z., Yang, F.: Efficient decomposition of strongly connected components on GPUs. J. Syst. Architect. 60(1), 1–10 (2014)

    Article  Google Scholar 

  • Lin, C.-T.: Structural controllability. IEEE Trans. Automat. Contr. 19, 201–208 (1974)

    Article  MathSciNet  Google Scholar 

  • Liu, Y.Y., Slotine, J.J., Barabasi, A.L.: Controllability of complex networks. Nature 473, 167–173 (2011)

    Article  Google Scholar 

  • Liu, Y.Y., Slotine, J.J., Barabasi, A.L.: Control centrality and hierarchical structure in complex networks. PLOS One 7(9), e44459 (2012). https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0044459#s4

  • Moschoyiannis, S., Elia, N., Penn, A.S., Lloyd, D.J.B., Knight, C.: A web-based tool for identifying strategic intervention points in complex systems. In: Brihaye, T., Delahaye, B., Jezequel, L., Markey, N., Srba, J. (eds.) Casting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters (Cassting’16/SynCoP’16). EPTCS, vol. 220, pp. 39–52 (2016)

    Google Scholar 

  • Port, R.F., van Gelder, T.: Mind as Motion: Explorations in the Dynamics of Cognition. MIT Press, Cambridge, MA (1995)

    Google Scholar 

  • Schoenmaker, R., Treur, J., Vetter, B.: A temporal-causal network model for the effect of emotional charge on information sharing. Biol. Inspired Cogn. Arch. 26, 136–144 (2018)

    Google Scholar 

  • Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)

    Article  MathSciNet  Google Scholar 

  • Treur, J.: Verification of temporal-causal network models by mathematical analysis. Vietnam. J. Comput. Sci. 3, 207–221 (2016a)

    Article  Google Scholar 

  • Treur, J.: Network-Oriented Modeling: Addressing the Complexity of Cognitive, Affective and Social Interactions. Springer Publishers, Berlin (2016b)

    Book  Google Scholar 

  • Treur, J.: On the applicability of network-oriented modeling based on temporal-causal networks: why network models do not just model networks. J. Inf. Telecommun. 1(1), 23–40 (2017)

    Google Scholar 

  • Treur, J.: Relating emerging network behaviour to network structure. In: Proceedings of the 7th International Conference on Complex Networks and their Applications, ComplexNetworks’18, vol. 1. Studies in Computational Intelligence, vol. 812, pp. 619–634. Springer Publishers, Berlin (2018a)

    Google Scholar 

  • Treur, J.: Mathematical analysis of a network’s asymptotic behaviour based on its strongly connected components. In: Proceedings of the 7th International Conference on Complex Networks and their Applications, ComplexNetworks’18, vol. 1. Studies in Computational Intelligence, vol. 812, pp. 663–679. Springer Publishers, Berlin (2018b)

    Google Scholar 

  • Treur, J.: The ins and outs of network-oriented modeling: from biological networks and mental networks to social networks and beyond. Trans. Comput. Collect. Intell. 32, 120–139. Paper for Keynote Lecture at ICCCI’18 (2019)

    Google Scholar 

  • Watts, D.J.: A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. U. S. A. 99(9), 5766–5771 (2002)

    Article  MathSciNet  Google Scholar 

  • 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Social AI Group, Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, Noord-Holland, The Netherlands

    Jan Treur

Authors
  1. Jan Treur
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan Treur .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Treur, J. (2020). Analysis of a Network’s Emerging Behaviour via Its Structure Involving Its Strongly Connected Components. In: Network-Oriented Modeling for Adaptive Networks: Designing Higher-Order Adaptive Biological, Mental and Social Network Models. Studies in Systems, Decision and Control, vol 251. Springer, Cham. https://doi.org/10.1007/978-3-030-31445-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-31445-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-31444-6

  • Online ISBN: 978-3-030-31445-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation