Skip to main content

Saddle-Node on a Limit Cycle

  • Chapter
Weakly Connected Neural Networks

Part of the book series: Applied Mathematical Sciences ((AMS,volume 126))

  • 1102 Accesses

Abstract

In this chapter we study a weakly connected network

$$ \dot X_i = F_i \left( {X_i ,\lambda } \right) + \varepsilon G_i \left( {X,\lambda ,\rho ,\varepsilon } \right),{\text{ X}}_i \in \mathbb{R}^m {\text{,i = 1,}} \ldots {\text{,n,}} $$

of neurons each having a saddle-node bifurcation on a limit cycle. Such neurons are said to have Class 1 neural excitability. This bifurcation provides an important example of when local analysis at an equilibrium renders global information about the system behavior.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Hoppensteadt, F.C., Izhikevich, E.M. (1997). Saddle-Node on a Limit Cycle. In: Weakly Connected Neural Networks. Applied Mathematical Sciences, vol 126. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1828-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1828-9_8

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7302-8

  • Online ISBN: 978-1-4612-1828-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics