arXiv subjects

Stephan Bialonski

Publications and source records attributed to Stephan Bialonski.

23 records · Page 2Linked to original sources

arXiv2013

Evolving networks in the human epileptic brain

Network theory provides novel concepts that promise an improved characterization of interacting dynamical systems. Within this framework, evolving networks can be considered as being composed of nodes, representing systems, and of time-varying edges, representing interactions between these systems. This approach is highly attractive to further our understanding of the physiological and pathophysiological dynamics in human brain networks. Indeed, there is growing evidence that the epileptic process can be regarded as a large-scale network phenomenon. We here review methodologies for inferring networks from empirical time series and for a characterization of these evolving networks. We summarize recent findings derived from studies that investigate human epileptic brain networks evolving on timescales ranging from few seconds to weeks. We point to possible pitfalls and open issues, and discuss future perspectives.

q-bio.NC↗

arXiv2012

Unraveling Spurious Properties of Interaction Networks with Tailored Random Networks

We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdős-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures - known for their complex spatial and temporal dynamics - we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.

physics.data-an↗

arXiv2011

From brain to earth and climate systems: Small-world interaction networks or not?

We consider recent reports on small-world topologies of interaction networks derived from the dynamics of spatially extended systems that are investigated in diverse scientific fields such as neurosciences, geophysics, or meteorology. With numerical simulations that mimic typical experimental situations we have identified an important constraint when characterizing such networks: indications of a small-world topology can be expected solely due to the spatial sampling of the system along with commonly used time series analysis based approaches to network characterization.

physics.data-an↗

arXiv2010

Identifying phase synchronization clusters in spatially extended dynamical systems

We investigate two recently proposed multivariate time series analysis techniques that aim at detecting phase synchronization clusters in spatially extended, nonstationary systems with regard to field applications. The starting point of both techniques is a matrix whose entries are the mean phase coherence values measured between pairs of time series. The first method is a mean field approach which allows to define the strength of participation of a subsystem in a single synchronization cluster. The second method is based on an eigenvalue decomposition from which a participation index is derived that characterizes the degree of involvement of a subsystem within multiple synchronization clusters. Simulating multiple clusters within a lattice of coupled Lorenz oscillators we explore the limitations and pitfalls of both methods and demonstrate (a) that the mean field approach is relatively robust even in configurations where the single cluster assumption is not entirely fulfilled, and (b) that the eigenvalue decomposition approach correctly identifies the simulated clusters even for low coupling strengths. Using the eigenvalue decomposition approach we studied spatiotemporal synchronization clusters in long-lasting multichannel EEG recordings from epilepsy patients and obtained results that fully confirm findings from well established neurophysiological examination techniques. Multivariate time series analysis methods such as synchronization cluster analysis that account for nonlinearities in the data are expected to provide complementary information which allows to gain deeper insights into the collective dynamics of spatially extended complex systems.

physics.data-an↗

arXiv2007

Detecting synchronization clusters in multivariate time series via coarse-graining of Markov chains

Synchronization cluster analysis is an approach to the detection of underlying structures in data sets of multivariate time series, starting from a matrix R of bivariate synchronization indices. A previous method utilized the eigenvectors of R for cluster identification, analogous to several recent attempts at group identification using eigenvectors of the correlation matrix. All of these approaches assumed a one-to-one correspondence of dominant eigenvectors and clusters, which has however been shown to be wrong in important cases. We clarify the usefulness of eigenvalue decomposition for synchronization cluster analysis by translating the problem into the language of stochastic processes, and derive an enhanced clustering method harnessing recent insights from the coarse-graining of finite-state Markov processes. We illustrate the operation of our method using a simulated system of coupled Lorenz oscillators, and we demonstrate its superior performance over the previous approach. Finally we investigate the question of robustness of the algorithm against small sample size, which is important with regard to field applications.

physics.data-an↗