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

  • 833 Accesses

Abstract

In this chapter, the notion of network reification is introduced: a construction by which a given (base) network is extended by adding explicit states representing the characteristics defining the base network’s structure. This is explained for temporal-causal networks where connection weights, combination functions, and speed factors represent the characteristics for Connectivity, Aggregation, and Timing describing the network structure. Having the network structure represented in an explicit manner within the extended network enables to model the adaptation of the base network by dynamics within the reified network: an adaptive network is represented by a non-adaptive network. It is shown how the approach provides a unified modeling perspective on representing network adaptation principles across different domains. This is illustrated for a number of well-known network adaptation principles such as for Hebbian learning in Mental Networks and for network evolution based on homophily in Social Networks.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Banks, D.L., Carley, K.M.: Models for network evolution. J. Math. Sociol. 21, 173–196 (1996)

    Article  Google Scholar 

  • Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  • Bi, G., Poo, M.: Synaptic modification by correlated activity: Hebb’s postulate revisited. Annu. Rev. Neurosci. 24, 139–166 (2001)

    Google Scholar 

  • Blankendaal, R., Parinussa, S., Treur, J.: A temporal-causal modelling approach to integrated contagion and network change in social networks. In: Proceedings of the 22nd European Conference on Artificial Intelligence, ECAI’16, pp. 1388–1396. IOS Press (2016)

    Google Scholar 

  • Bowen, K.A., Kowalski, R.: Amalgamating language and meta-language in logic programming. In: Clark, K., Tarnlund, S. (eds.) Logic Programming, pp. 153–172. Academic Press, New York (1982)

    Google Scholar 

  • Bowen, K.A.: Meta-level programming and knowledge representation. New Gener. Comput. 3, 359–383 (1985)

    Article  Google Scholar 

  • Chandra, N., Barkai, E.: A non-synaptic mechanism of complex learning: Modulation of intrinsic neuronal excitability. Neurobiol. Learn. Mem. 154(2018), 30–36 (2018)

    Article  Google Scholar 

  • Demers, F.N., Malenfant, J.: Reflection in logic, functional and objectoriented programming: a short comparative study. In: IJCAI’95Workshop on Reflection and Meta-Level Architecture and their Application in AI, pp. 29–38 (1995)

    Google Scholar 

  • Galton, A.: Operators vs. arguments: the ins and outs of reification. Synthese 150, 415–441 (2006)

    Article  MathSciNet  Google Scholar 

  • Gerstner, W., Kistler, W.M.: Mathematical formulations of Hebbian learning. Biol. Cybern. 87, 404–415 (2002)

    Google Scholar 

  • Granovetter, M.S.: The strength of weak ties. Amer. J. Sociol. 78(6), 1360–1380 (1973)

    Article  Google Scholar 

  • Hebb, D.: The organisation of behavior. Wiley (1949)

    Google Scholar 

  • Hofstadter, D.R.: Gödel, Escher, Bach. Basic Books, New York (1979)

    MATH  Google Scholar 

  • McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Annu. Rev. Sociol. 27, 415–444 (2001)

    Article  Google Scholar 

  • Pearl, J.: Causality. Cambridge University Press (2000)

    Google Scholar 

  • Rapoport, A.: Spread of Information through a population with socio-structural bias: i. Assumption of transitivity. Bull. Math. Biophys. 15, 523–533 (1953)

    Article  MathSciNet  Google Scholar 

  • Smorynski, C.: The incompleteness theorems. In: Barwise, J. (ed.) Handbook of Mathematical Logic, vol. 4, pp. 821–865. North-Holland, Amsterdam (1977)

    Google Scholar 

  • Sousa, N., Almeida, O.F.X.: Disconnection and reconnection: the morphological basis of (mal)adaptation to stress. Trends Neurosci. 35(12), 742–751 (2012)

    Article  Google Scholar 

  • Sterling, L., Shapiro, E.: The Art of Prolog. MIT Press, (1986) (Ch 17, pp. 319–356)

    Google Scholar 

  • Sterling, L., Beer, R.: Metainterpreters for expert system construction. J. Logic Program. 6, 163–178 (1989)

    Article  Google Scholar 

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

    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.: Network reification as a unified approach to represent network adaptation principles within a network. In: Proceedings of the 7th International Conference on Theory and Practice of Natural Computing, TPNC’18. Lecture Notes in Computer Science, vol 11324, pp. 344–358. Springer, Berlin (2018a)

    Google Scholar 

  • Treur, J.: Multilevel network reification: representing higher order adaptivity in a network. In: Proceedings of the 7th International Conference on Complex Networks and their Applications, ComplexNetworks’18, vol. 1. Studies in Computational Intelligence, vol. 812, 635–651, Springer, 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. In: LNCS Transactions on Computational Collective Intelligence. Paper on Keynote lecture at the 10th International Conference on Computational Collective Intelligence, ICCCI’18 vol. 32, pp. 120–139 (2019)

    Google Scholar 

  • Treur, J., Mohammadi Ziabari, S.S.: An adaptive temporal-causal network model for decision making under acute stress. In: Proceedings of the 10th International Conference on Computational Collective Intelligence, ICCCI’18. Lecture Notes in Computer Science, Springer, Berlin (2018)

    Google Scholar 

  • Weyhrauch, R.W.: Prolegomena to a theory of mechanized formal reasoning. Artif. Intell. 13, 133–170 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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). A Unified Approach to Represent Network Adaptation Principles by Network Reification. 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_3

Download citation

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

  • 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

Navigation