1,172 research outputs found

    Recurrence networks - A novel paradigm for nonlinear time series analysis

    Get PDF
    This paper presents a new approach for analysing structural properties of time series from complex systems. Starting from the concept of recurrences in phase space, the recurrence matrix of a time series is interpreted as the adjacency matrix of an associated complex network which links different points in time if the evolution of the considered states is very similar. A critical comparison of these recurrence networks with similar existing techniques is presented, revealing strong conceptual benefits of the new approach which can be considered as a unifying framework for transforming time series into complex networks that also includes other methods as special cases. It is demonstrated that there are fundamental relationships between the topological properties of recurrence networks and the statistical properties of the phase space density of the underlying dynamical system. Hence, the network description yields new quantitative characteristics of the dynamical complexity of a time series, which substantially complement existing measures of recurrence quantification analysis

    Power-laws in recurrence networks from dynamical systems

    Full text link
    Recurrence networks are a novel tool of nonlinear time series analysis allowing the characterisation of higher-order geometric properties of complex dynamical systems based on recurrences in phase space, which are a fundamental concept in classical mechanics. In this Letter, we demonstrate that recurrence networks obtained from various deterministic model systems as well as experimental data naturally display power-law degree distributions with scaling exponents γ\gamma that can be derived exclusively from the systems' invariant densities. For one-dimensional maps, we show analytically that γ\gamma is not related to the fractal dimension. For continuous systems, we find two distinct types of behaviour: power-laws with an exponent γ\gamma depending on a suitable notion of local dimension, and such with fixed γ=1\gamma=1.Comment: 6 pages, 7 figure

    Removing Barriers, Integrating Research, Spreading Excellence: The European Satellite Communications Network of Excellence "SatNEx"

    Get PDF
    Within the recently launched 6th Research Framework Programme of the European Commission, 21 major players in satellite communications research have joined forces to implement the European Satellite Communications Network of Excellence (SatNEx). The primary goal of SatNEx is to achieve long-lasting integration of the European research in satellite communication and to develop a common base of knowledge, thus contributing to the realization of the European Research Area. This paper discusses the background and motivation for implementation of the network and highlights the SatNEx mission and key objectives. A top-level overview is then provided including a description of the consortium, the Joint Programme of Activities (JPA) and the time schedule with deliverables and milestones. Finally, an update of ongoing work is presented

    Recurrence-based time series analysis by means of complex network methods

    Full text link
    Complex networks are an important paradigm of modern complex systems sciences which allows quantitatively assessing the structural properties of systems composed of different interacting entities. During the last years, intensive efforts have been spent on applying network-based concepts also for the analysis of dynamically relevant higher-order statistical properties of time series. Notably, many corresponding approaches are closely related with the concept of recurrence in phase space. In this paper, we review recent methodological advances in time series analysis based on complex networks, with a special emphasis on methods founded on recurrence plots. The potentials and limitations of the individual methods are discussed and illustrated for paradigmatic examples of dynamical systems as well as for real-world time series. Complex network measures are shown to provide information about structural features of dynamical systems that are complementary to those characterized by other methods of time series analysis and, hence, substantially enrich the knowledge gathered from other existing (linear as well as nonlinear) approaches.Comment: To be published in International Journal of Bifurcation and Chaos (2011

    Feigenbaum graphs: a complex network perspective of chaos

    Get PDF
    The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a natural graph-theoretical description of nonlinear systems with qualities in the spirit of symbolic dynamics. We support our claim via the case study of the period-doubling and band-splitting attractor cascades that characterize unimodal maps. We provide a universal analytical description of this classic scenario in terms of the horizontal visibility graphs associated with the dynamics within the attractors, that we call Feigenbaum graphs, independent of map nonlinearity or other particulars. We derive exact results for their degree distribution and related quantities, recast them in the context of the renormalization group and find that its fixed points coincide with those of network entropy optimization. Furthermore, we show that the network entropy mimics the Lyapunov exponent of the map independently of its sign, hinting at a Pesin-like relation equally valid out of chaos.Comment: Published in PLoS ONE (Sep 2011

    Investigating the topology of interacting networks - Theory and application to coupled climate subnetworks

    Full text link
    Network theory provides various tools for investigating the structural or functional topology of many complex systems found in nature, technology and society. Nevertheless, it has recently been realised that a considerable number of systems of interest should be treated, more appropriately, as interacting networks or networks of networks. Here we introduce a novel graph-theoretical framework for studying the interaction structure between subnetworks embedded within a complex network of networks. This framework allows us to quantify the structural role of single vertices or whole subnetworks with respect to the interaction of a pair of subnetworks on local, mesoscopic and global topological scales. Climate networks have recently been shown to be a powerful tool for the analysis of climatological data. Applying the general framework for studying interacting networks, we introduce coupled climate subnetworks to represent and investigate the topology of statistical relationships between the fields of distinct climatological variables. Using coupled climate subnetworks to investigate the terrestrial atmosphere's three-dimensional geopotential height field uncovers known as well as interesting novel features of the atmosphere's vertical stratification and general circulation. Specifically, the new measure "cross-betweenness" identifies regions which are particularly important for mediating vertical wind field interactions. The promising results obtained by following the coupled climate subnetwork approach present a first step towards an improved understanding of the Earth system and its complex interacting components from a network perspective

    Node-weighted measures for complex networks with spatially embedded, sampled, or differently sized nodes

    Full text link
    When network and graph theory are used in the study of complex systems, a typically finite set of nodes of the network under consideration is frequently either explicitly or implicitly considered representative of a much larger finite or infinite region or set of objects of interest. The selection procedure, e.g., formation of a subset or some kind of discretization or aggregation, typically results in individual nodes of the studied network representing quite differently sized parts of the domain of interest. This heterogeneity may induce substantial bias and artifacts in derived network statistics. To avoid this bias, we propose an axiomatic scheme based on the idea of node splitting invariance to derive consistently weighted variants of various commonly used statistical network measures. The practical relevance and applicability of our approach is demonstrated for a number of example networks from different fields of research, and is shown to be of fundamental importance in particular in the study of spatially embedded functional networks derived from time series as studied in, e.g., neuroscience and climatology.Comment: 21 pages, 13 figure
    corecore