Searcharxiv⌕ Search

arXiv subjects

Béatrice Désy

Publications and source records attributed to Béatrice Désy.

2 recordsLinked to original sources

Wasserstein recurrence networks for multiscale time series pattern analysis

Time series data are often generated by systems which operate on multiple temporal scales, of which Earth's climate system is a paramount example. Variations in global climate are recorded in paleo-environmental archives as temporal patterns across a wide range of time scales, from seasonal or decadal to multi-millennial. In this context, recurrence analysis, where repeating patterns are identified in time series, is limited by the underlying properties of the distance function used and of the time series data themselves, especially in terms of temporal resolution and scale dependence. In this paper, we present a novel recurrence analysis framework designed for multiscale time series data with abrupt changes and irregular temporal resolution as found in paleoclimate records. We introduce a simple mathematical transform to use the $1-$Wasserstein distance for recurring pattern detection in time series. The scale invariance of $1-$Wasserstein distance distributions between patterns in Brownian motion is demonstrated numerically, which provides a principled threshold choice for recurrences. At any time scale, recurrences are defined as local minima of the distance, granted that they are below a threshold given by the probability of encountering patterns at least as similar in one-dimensional Brownian motion. Recurrences can be further combined according to a non-overlapping condition to yield a distinct set of multiscale recurring events. We provide examples of climatic applications from ice-rafted debris and ice core records, where detected recurrences have durations spanning over two orders of magnitude. Our method extends recurrence analysis to more complex time series data and provides new avenues for statistical identification and analyses of recurring events at multiple temporal scales.

physics.soc-ph↗

Dimension matters when modeling network communities in hyperbolic spaces

Over the last decade, random hyperbolic graphs have proved successful in providing geometric explanations for many key properties of real-world networks, including strong clustering, high navigability, and heterogeneous degree distributions. These properties are ubiquitous in systems as varied as the internet, transportation, brain or epidemic networks, which are thus unified under the hyperbolic network interpretation on a surface of constant negative curvature. Although a few studies have shown that hyperbolic models can generate community structures, another salient feature observed in real networks, we argue that the current models are overlooking the choice of the latent space dimensionality that is required to adequately represent clustered networked data. We show that there is an important qualitative difference between the lowest-dimensional model and its higher-dimensional counterparts with respect to how similarity between nodes restricts connection probabilities. Since more dimensions also increase the number of nearest neighbors for angular clusters representing communities, considering only one more dimension allows us to generate more realistic and diverse community structures.

physics.soc-ph↗