Generalized Theorems for Nonlinear State Space Reconstruction

Takens' theorem (1981) shows how lagged variables of a single time series can be used as proxy variables to reconstruct an attractor for an underlying dynamic process. State space reconstruction (SSR) from single time series has been a powerful approach for the analysis of the complex, non-linear systems that appear ubiquitous in the natural and human world. The main shortcoming of these methods is the phenomenological nature of attractor reconstructions. Moreover, applied studies show that these single time series reconstructions can often be improved ad hoc by including multiple dynamically coupled time series in the reconstructions, to provide a more mechanistic model. Here we provide three analytical proofs that add to the growing literature to generalize Takens' work and that demonstrate how multiple time series can be used in attractor reconstructions. These expanded results (Takens' theorem is a special case) apply to a wide variety of natural systems having parallel time series observations for variables believed to be related to the same dynamic manifold. The potential information leverage provided by multiple embeddings created from different combinations of variables (and their lags) can pave the way for new applied techniques to exploit the time-limited, but parallel observations of natural systems, such as coupled ecological systems, geophysical systems, and financial systems. This paper aims to justify and help open this potential growth area for SSR applications in the natural sciences

Contagion in Bitcoin networks

12 pages, 6 figures. Paper accepted in 2nd Workshop on Blockchain and Smart Contract Technologies (BSCT 2019), workshop satellite of 22nd International Conference on Business Information Systems (BIS 2019)International audienceWe construct the Google matrices of bitcoin transactions for all year quarters during the period of January 11, 2009 till April 10, 2013. During the last quarters the network size contains about 6 million users (nodes) with about 150 million transactions. From PageRank and CheiRank probabilities, analogous to trade import and export, we determine the dimensionless trade balance of each user and model the contagion propagation on the network assuming that a user goes bankrupt if its balance exceeds a certain dimensionless threshold $\kappa$. We find that the phase transition takes place for $\kappa0.55$ almost all users remain safe. We find that even on a distance from the critical threshold $\kappa_c$ the top PageRank and CheiRank users, as a house of cards, rapidly drop to the bankruptcy. We attribute this effect to strong interconnections between these top users which we determine with the reduced Google matrix algorithm. This algorithm allows to establish efficiently the direct and indirect interactions between top PageRank users. We argue that this study models the contagion on real financial networks

Network analysis of the e-MID overnight money market: the informational value of different aggregation levels for intrinsic dynamic processes

In this paper, we analyze the network properties of the Italian e-MID data based on overnight loans during the period 1999-2010. We show that the networks appear to be random at the daily level, but contain significant non-random structure for longer aggregation periods. In this sense, the daily networks cannot be considered as being representative for the underlying `latent' network. Rather, the development of various network statistics under time aggregation points toward strong non-random determinants of link formation. We also identify the global financial crisis as a significant structural break for many network measures