Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Complex Networks and Their Applications VII (COMPLEX NETWORKS 2018)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 812))

Included in the following conference series:

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.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.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.

    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

  1. 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)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Harary, F., Norman, R.Z., Cartwright, D.: Structural models: an introduction to the theory of directed graphs. Wiley, New York (1965)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Behavioural Informatics Group, Vrije Universiteit Amsterdam, Amsterdam, 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 .

Editor information

Editors and Affiliations

  1. Nokia Bell Labs, Cambridge, UK

    Luca Maria Aiello

  2. IUT Lumière, University of Lyon, Bron Cedex, France

    Chantal Cherifi

  3. LE2I UMR CNRS 6306 9, University of Burgundy, Dijon Cedex, France

    Hocine Cherifi

  4. Mathematical Institute, University of Oxford, Oxford, UK

    Renaud Lambiotte

  5. Department of Computer Science and Technology, The Computer Laboratory, University of Cambridge, Cambridge, UK

    Pietro Lió

  6. Center for Complex Networks and Systems Research, School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN, USA

    Luis M. Rocha

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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

Publish with us

Policies and ethics

Search

Navigation