2012
DOI: 10.1103/physrevlett.109.018701
|View full text |Cite
|
Sign up to set email alerts
|

Computation by Switching in Complex Networks of States

Abstract: Complex networks of dynamically connected saddle states persistently emerge in a broad range of high-dimensional systems and may reliably encode inputs as specific switching trajectories. Their computational capabilities, however, are far from being understood. Here, we analyze how symmetry-breaking inhomogeneities naturally induce predictable persistent switching dynamics across such networks. We show that such systems are capable of computing arbitrary logic operations by entering into switching sequences in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
38
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 56 publications
(39 citation statements)
references
References 32 publications
0
38
0
Order By: Relevance
“…Dynamics involving switching transitions between transiently stable states has been addressed in the contexts of semantic learning in autonomously active networks [13,14], within reservoir computing [15] and in networks dominated by heteroclinic orbits [16]. In case of the latter, periodic orbits are formed when the dynamics follows heteroclinic connections between saddle points encoding information in the different states, which however exist only for symmetry-invariant networks.…”
Section: Introductionmentioning
confidence: 99%
“…Dynamics involving switching transitions between transiently stable states has been addressed in the contexts of semantic learning in autonomously active networks [13,14], within reservoir computing [15] and in networks dominated by heteroclinic orbits [16]. In case of the latter, periodic orbits are formed when the dynamics follows heteroclinic connections between saddle points encoding information in the different states, which however exist only for symmetry-invariant networks.…”
Section: Introductionmentioning
confidence: 99%
“…Mathematical analysis of interaction networks are valuable in understanding the dynamics of complex systems [1][2][3][4][5]. Concurrent antagonism, where every component of the system simultaneously represses each other, is one of the interaction systems that approximate many natural phenomena.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, points arbitrarily close to an unstable attractor can approach another unstable attractor, forming heteroclinic connections [46,47,48]. As a result, switching among the attractors can occur following the natural dynamical evolution, into which information reflecting the input signal can be encoded [49]. If the system possesses a large number of unstable attractors, they can form a complex network through heteroclinic connections in the phase space, which can be exploited for complex logical computation [50,49].…”
Section: Introductionmentioning
confidence: 99%