Jordan, Denis

Profilbild
E-Mail-Adresse
Geburtsdatum
Projekt
Organisationseinheiten
Berufsbeschreibung
Nachname
Jordan
Vorname
Denis
Name
Denis Jordan

Filter

20192
Filter zurücksetzen

Einstellungen

Autor:in: Berger, Sebastian × Hochschule: Hochschule für Architektur, Bau und Geomatik ×

Suchergebnisse

Gerade angezeigt 1 - 2 von 2
  • Vorschaubild
    Publikation
    Relationship of critical dynamics, functional connectivity, and states of consciousness in large-scale human brain networks
    (Elsevier, 2019) Lee, Heonsoo; Golkowski, Daniel; Jordan, Denis; Berger, Sebastian; Ilg, Rüdiger; Lee, Joseph; Mashour, George A.; Lee, UnCheol; Avidan, Michael S.; Blain-Moraes, Stefanie; Golmirzaie, Goodarz; Hardie, Randall; Hogg, Rosemary; Janke, Ellen; Kelz, Max B.; Maier, Kaitlyn; Mashour, George A.; Maybrier, Hannah; McKinstry-Wu, Andrew; Muench, Maxwell; Ochroch, Andrew; Palanca, Ben J.A.; Picton, Paul; Schwarz, E. Marlon; Tarnal, Vijay; Vanini, Giancarlo; Vlisides, Phillip E. [in: NeuroImage]
    Recent modeling and empirical studies support the hypothesis that large-scale brain networks function near a critical state. Similar functional connectivity patterns derived from resting state empirical data and brain network models at criticality provide further support. However, despite the strong implication of a relationship, there has been no principled explanation of how criticality shapes the characteristic functional connectivity in large-scale brain networks. Here, we hypothesized that the network science concept of partial phase locking is the underlying mechanism of optimal functional connectivity in the resting state. We further hypothesized that the characteristic connectivity of the critical state provides a theoretical boundary to quantify how far pharmacologically or pathologically perturbed brain connectivity deviates from its critical state, which could enable the differentiation of various states of consciousness with a theory-based metric. To test the hypothesis, we used a neuroanatomically informed brain network model with the resulting source signals projected to electroencephalogram (EEG)-like sensor signals with a forward model. Phase lag entropy (PLE), a measure of phase relation diversity, was estimated and the topography of PLE was analyzed. To measure the distance from criticality, the PLE topography at a critical state was compared with those of the EEG data from baseline consciousness, isoflurane anesthesia, ketamine anesthesia, vegetative state/unresponsive wakefulness syndrome, and minimally conscious state. We demonstrate that the partial phase locking at criticality shapes the functional connectivity and asymmetric anterior-posterior PLE topography, with low (high) PLE for high (low) degree nodes. The topographical similarity and the strength of PLE differentiates various pharmacologic and pathologic states of consciousness. Moreover, this model-based EEG network analysis provides a novel metric to quantify how far a pharmacologically or pathologically perturbed brain network is away from critical state, rather than merely determining whether it is in a critical or non-critical state.
    01A - Beitrag in wissenschaftlicher Zeitschrift
  • Vorschaubild
    Publikation
    Teaching ordinal patterns to a computer. Efficient encoding algorithms based on the Lehmer code
    (MDPI, 2019) Berger, Sebastian; Kravtsiv, Andrii; Schneider, Gerhard; Jordan, Denis [in: Entropy]
    Ordinal patterns are the common basis of various techniques used in the study of dynamical systems and nonlinear time series analysis. The present article focusses on the computational problem of turning time series into sequences of ordinal patterns. In a first step, a numerical encoding scheme for ordinal patterns is proposed. Utilising the classical Lehmer code, it enumerates ordinal patterns by consecutive non-negative integers, starting from zero. This compact representation considerably simplifies working with ordinal patterns in the digital domain. Subsequently, three algorithms for the efficient extraction of ordinal patterns from time series are discussed, including previously published approaches that can be adapted to the Lehmer code. The respective strengths and weaknesses of those algorithms are discussed, and further substantiated by benchmark results. One of the algorithms stands out in terms of scalability: its run-time increases linearly with both the pattern order and the sequence length, while its memory footprint is practically negligible. These properties enable the study of high-dimensional pattern spaces at low computational cost. In summary, the tools described herein may improve the efficiency of virtually any ordinal pattern-based analysis method, among them quantitative measures like permutation entropy and symbolic transfer entropy, but also techniques like forbidden pattern identification. Moreover, the concepts presented may allow for putting ideas into practice that up to now had been hindered by computational burden. To enable smooth evaluation, a function library written in the C programming language, as well as language bindings and native implementations for various numerical computation environments are provided in the supplements.
    01A - Beitrag in wissenschaftlicher Zeitschrift