Skip to main content
SpringerLink
Log in

A Categorical Approach to Threshold Agent Networks

  • Published:
Applied Categorical Structures Aims and scope Submit manuscript

Abstract

Threshold agent networks (TANs) constitute a discretized modification of threshold (also known as neural) networks that are appropriate for modeling computer simulations. In this paper morphisms are introduced between TANs, thus forming a category TAN. Several of the properties of this category are explored. A generalization of TANs to allow more flexible interactions between the agents is then introduced. The new objects are also endowed with appropriate morphisms and the properties of the newly obtained category are compared with the properties of its older subcategory.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barr, M. and Wells, C.: Category Theory for Computing Science, 3rd edn, Les Publications CRM, Montréal, 1999.

    Google Scholar 

  2. Barrett, C. L. and Reidys, C. M.: Elements of a theory of simulation I: Sequential CA over random graphs, Appl. Math. Comput. 98(1999), 241–259.

    Google Scholar 

  3. Barrett, C. L., Mortveit, H. S. and Reidys, C. M.: Elements of a theory of simulation II: Sequential dynamical systems, Appl. Math. Comput. 107 (1999), 121–136.

    Google Scholar 

  4. Borceux, F.: Handbook of Categorical Algebra, Encyclopedia Math. Appl. 50, Cambridge University Press, Cambridge, U.K., 1994.

    Google Scholar 

  5. Goles, E. and Martínez, S.: Neural and Automata Networks, Dynamical Behavior and Applications, Kluwer Academic Publishers, Dordrecht, 1990.

    Google Scholar 

  6. Gumm, H. P.: Elements of the general theory of coalgebras, Preprint, 2000.

  7. Laubenbacher, R. and Pareigis, B.: Update schedules of sequential dynamical systems, Preprint, 2001.

  8. Laubenbacher, R. and Pareigis, B.: Decomposition and simulation of sequential dynamical systems, Adv. Appl. Math. 30 (2003) 655–678.

    Google Scholar 

  9. Mac Lane, S.: Categories for the Working Mathematician, Springer-Verlag, 1971.

  10. McCulloch, W. S. and Pitts, W.: A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophys. 5 (1943), 115–133.

    Google Scholar 

  11. Rutten, J. J. M. M.: A calculus of transition systems (towards universal coalgebra), CSLI Lecture Notes 53, CSLI Publications, Stanford, CA, 1995, pp. 231–256.

    Google Scholar 

  12. Rutten, J. J. M. M.: Universal coalgebra: A theory of systems, Theoret. Comput. Sci. 249 (2000), 3–80.

    Google Scholar 

  13. Voutsadakis, G.: Threshold agent networks: An approach to modeling and simulation, Appl. Math. Comput., 142 (2003), 521–543.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Computer Science, Lake Superior State University, 650 W. Easterday Avenue, Sault Sainte Marie, MI, 49783, U.S.A.

    George Voutsadakis

Authors
  1. George Voutsadakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Voutsadakis, G. A Categorical Approach to Threshold Agent Networks. Applied Categorical Structures 12, 203–223 (2004). https://doi.org/10.1023/B:APCS.0000018251.81665.4f

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:APCS.0000018251.81665.4f

Search

Navigation