activity
20112023
most citedDetecting recurrence domains of dynamical systems by symbolic dynamics

52 citations · 118 across the 5 of their papers we have counts for

collaborators

7 papers

cs.NE2023

Invariants for neural automata

Jone Uria-Albizuri, Giovanni Sirio Carmantini, Peter beim Graben +1

Computational modeling of neurodynamical systems often deploys neural networks and symbolic dynamics. A particular way for combining these approaches within a framework called vect…

q-bio.NC2017

Quantum approaches to music cognition

Peter beim Graben, Reinhard Blutner

Quantum cognition emerged as an important discipline of mathematical psychology during the last two decades. Using abstract analogies between mental phenomena and the formal framew…

physics.data-an2015★ 18 cited

Optimal Estimation of Recurrence Structures from Time Series

Peter beim Graben, Kristin K. Sellers, Flavio Fröhlich +1

Recurrent temporal dynamics is a phenomenon observed frequently in high-dimensional complex systems and its detection is a challenging task. Recurrence quantification analysis util…

nlin.CD2014★ 26 cited

Detecting event-related recurrences by symbolic analysis: Applications to human language processing

Peter beim Graben, Axel Hutt

Quasistationarity is ubiquitous in complex dynamical systems. In brain dynamics there is ample evidence that event-related potentials reflect such quasistationary states. In order…

nlin.PS2012★ 52 cited

Detecting recurrence domains of dynamical systems by symbolic dynamics

Peter beim Graben, Axel Hutt

We propose an algorithm for the detection of recurrence domains of complex dynamical systems from time series. Our approach exploits the characteristic checkerboard texture of recu…

nlin.CD2012★ 22 cited

Epistemic Entanglement due to Non-Generating Partitions of Classical Dynamical Systems

Peter beim Graben, Thomas Filk, Harald Atmanspacher

Quantum entanglement relies on the fact that pure quantum states are dispersive and often inseparable. Since pure classical states are dispersion-free they are always separable and…