Please use this identifier to cite or link to this item: https://doi.org/10.1162/0899766052530820
Title: Analysis of cyclic dynamics for networks of linear threshold neurons
Authors: Tang, H.J.
Tan, K.C. 
Zhang, W.
Issue Date: Jan-2005
Source: Tang, H.J., Tan, K.C., Zhang, W. (2005-01). Analysis of cyclic dynamics for networks of linear threshold neurons. Neural Computation 17 (1) : 97-114. ScholarBank@NUS Repository. https://doi.org/10.1162/0899766052530820
Abstract: The network of neurons with linear threshold (LT) transfer functions is a prominent model to emulate the behavior of cortical neurons. The analysis of dynamic properties for LT networks has attracted growing interest, such as multistability and boundedness. However, not much is known about how the connection strength and external inputs are related to oscillatory behaviors. Periodic oscillation is an important characteristic that relates to nondivergence, which shows that the network is still bounded although unstable modes exist. By concentrating on a general parameterized two-cell network, theoretical results for geometrical properties and existence of periodic orbits are presented. Although it is restricted to two-dimensional systems, the analysis can provide a useful contribution to analyze cyclic dynamics of some specific LT networks of high dimension. As an application, it is extended to an important class of biologically motivated networks of large scale: the winner-take-all model using local excitation and global inhibition. © 2004 Massachusetts Institute of Technology.
Source Title: Neural Computation
URI: http://scholarbank.nus.edu.sg/handle/10635/55071
ISSN: 08997667
DOI: 10.1162/0899766052530820
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

18
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

15
checked on Nov 17, 2017

Page view(s)

13
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.