Skip to main content

Multistability Analysis: High-Order Networks Do Not Imply Greater Storage Capacity Than First-Order Ones

  • Conference paper
  • 1784 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6063))

Abstract

This paper presents new multistability of the networks with high-order interconnection. We construct invariant regions and establish new criteria of coexistence of equilibria which are exponentially stable. Our results show that high-order interactions of neurons may have lower storage capacity than first-order ones. Numerical simulations will illustrate our new and interesting results.

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

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohen, M.A., Grossberg, S.: Absolute Stability of Global Pattern Formation and Parallel Memory Storage by Competitive Neural Networks. IEEE Trans. Syst. Man Cybern. SMC 13, 815–826 (1983)

    MATH  MathSciNet  Google Scholar 

  2. Dembo, A., Farotimi, O., Kailath, T.: High-Order Absolutely Stable Neural Networks. IEEE Trans. Circuits Syst. 38, 57–65 (1991)

    Article  MATH  Google Scholar 

  3. Xu, B., Liu, X., Liao, X.: Global Asymptotic Stability of High-Order Hopfield Type Neural Networks with Time Delays. Comput. Math. Appl. 45, 1729–1737 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Yu, Y., Cai, M.: Existence and Exponential Stability of Almost-Periodic Solutions for High-Order Hopfield Neural Networks. Math. Comput. Model. 47, 943–951 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cheng, C., Lin, K., Shih, C.: Multistability in Recurrent Neural Networks. SIAM J. Appl. Math. 66, 1301–1320 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cheng, C., Lin, K., Shih, C.: Multistability and Convergence in Delayed Neural Networks. Physica D 225, 61–74 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Huang, Z.K., Mohamad, S., Wang, W., Feng, C.: Convergence Analysis of General Neural Networks under Almost Periodic Stimuli. Int. J. Circ. Theor. Appl. 37, 723–750 (2009)

    Article  Google Scholar 

  8. Huang, Z.K., Mohamad, S., Bin, H.: Multistability of HNNs with Almost Periodic Stimuli and Continuously Distributed Delays. Int. J. Syst. Sci. 40, 615–625 (2009)

    Article  MathSciNet  Google Scholar 

  9. Zeng, Z.G., Wang, J.: Multiperiodicity of Discrete-Time Delayed Neural Networks Evoked by Periodic External Inputs. IEEE Trans. Neural Netw. 17, 1141–1151 (2006)

    Article  Google Scholar 

  10. Shih, C., Tseng, J.: Convergent Dynamics for Multistable Delayed Neural Networks. Nonlinearity 21, 2361–2389 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, Z. (2010). Multistability Analysis: High-Order Networks Do Not Imply Greater Storage Capacity Than First-Order Ones. In: Zhang, L., Lu, BL., Kwok, J. (eds) Advances in Neural Networks - ISNN 2010. ISNN 2010. Lecture Notes in Computer Science, vol 6063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13278-0_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13278-0_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13277-3

  • Online ISBN: 978-3-642-13278-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics