The complexity of latching transitions in large scale cortical networks

We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an infinitely recursive process in large scale cortical networks, perhaps associated with higher cortical functions, such as language. We...

Full description

Saved in:
Bibliographic Details
Published in:Natural computing 2007-06, Vol.6 (2), p.169-185
Main Authors: Kropff, Emilio, Treves, Alessandro
Format: Article
Language:English
Subjects:
Complexity
Dynamic tests
Eigenvalues
Neural networks
Recursive functions
Transition probabilities
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an infinitely recursive process in large scale cortical networks, perhaps associated with higher cortical functions, such as language. We show that latching dynamics can span the range from deterministic to random under the control of a threshold parameter U. In particular, the interesting intermediate case is characterized by an asymmetric and complex set of transitions. We also indicate how finite latching sequences can become infinite, depending on the properties of the transition probability matrix and of its eigenvalues.
ISSN:1567-7818
1572-9796
DOI:10.1007/s11047-006-9019-3