Welcome to the InfoSci Platform
An Analytically Tractable Model of Large Network: Dynamics and Reliability

An Analytically Tractable Model of Large Network: Dynamics and Reliability

S. Vakulenko, M. Zimin
Copyright: © 2010 |Volume: 2 |Issue: 1 |Pages: 12
ISSN: 1941-6318|EISSN: 1941-6326|ISSN: 1941-6318|EISBN13: 9781616929541|EISSN: 1941-6326|DOI: 10.4018/jnmc.2010010101
Cite Article Cite Article

MLA

Vakulenko, S., and M. Zimin. "An Analytically Tractable Model of Large Network: Dynamics and Reliability." IJNMC vol.2, no.1 2010: pp.1-12. http://doi.org/10.4018/jnmc.2010010101

APA

Vakulenko, S. & Zimin, M. (2010). An Analytically Tractable Model of Large Network: Dynamics and Reliability. International Journal of Nanotechnology and Molecular Computation (IJNMC), 2(1), 1-12. http://doi.org/10.4018/jnmc.2010010101

Chicago

Vakulenko, S., and M. Zimin. "An Analytically Tractable Model of Large Network: Dynamics and Reliability," International Journal of Nanotechnology and Molecular Computation (IJNMC) 2, no.1: 1-12. http://doi.org/10.4018/jnmc.2010010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper considers specially organized networks of large size. They can serve as models of computer communication systems, economical systems, neural and genetic networks. The topology of this network is simple and the analysis of the network behaviour is an analytically tractable task, while computer simulations are difficult. The authors show that such networks generate any structurally stable attractors in particular chaotic and periodic. They can simulate all Turing machines, that is, perform any computations. In noisy cases, the reliability of such network is exponentially high as a function of network size and has a maximum for an optimal network size.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.