Free association transitions in models of cortical latching dynamics

Details Free association transitions in models of cortical latching dynamics Free association transitions in models of cortical latching dynamics

Jan 2008

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2008njph...10a5008r&link_type=abstract

New Journal of Physics, Volume 10, Issue 1, pp. 015008 (2008).

Physics

1

Scientific paper

Potts networks, in certain conditions, hop spontaneously from one discrete attractor state to another, a process we have called latching dynamics. When continuing indefinitely, latching can serve as a model of infinite recursion, which is nontrivial if the matrix of transition probabilities presents a structure, i.e. a rudimentary grammar. We show here, with computer simulations, that latching transitions cluster in a number of distinct classes: effectively random transitions between weakly correlated attractors; structured, history-dependent transitions between attractors with intermediate correlations; and oscillations between pairs of closely overlapping attractors. Each type can be described by a reduced set of equations of motion, which, once numerically integrated, matches simulations results. We propose that the analysis of such equations may offer clues on how to embed meaningful grammatical structures into more realistic models of specific recursive processes.

Affiliated with

Also associated with

No associations

Rating

Free association transitions in models of cortical latching dynamics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Free association transitions in models of cortical latching dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Free association transitions in models of cortical latching dynamics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1252667