Related papers: Horizontal Visibility graphs generated by type-II …
Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or…
In this paper, we study the possible bifurcations of periodic orbits by reducing them to graphs. The aforementioned allows to study the genericity of routes to chaos, as well as to analyze their possible complexity. In particular, our…
Parameter space of a driven damped oscillator in a double well potential presents either a chaotic trajectory with sign oscillating amplitude or a non-chaotic trajectory with a fixed sign amplitude. A network of such delay coupled damped…
We show that global generalized synchronization (GS) exists in structurally different time-delay systems, even with different orders, with quite different fractal (Kaplan-Yorke) dimensions, which emerges via partial GS in symmetrically…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques,…
The transition to turbulence via spatiotemporal intermittency is investigated in the context of coupled maps defined on small-world networks. The local dynamics is given by the Chat\'e-Manneville minimal map previously used in studies of…
We study the chaoticity and the predictability of a turbulent flow on the basis of high-resolution direct numerical simulations at different Reynolds numbers. We find that the Lyapunov exponent of turbulence, which measures the exponential…
We investigate chaos in mixed-phase-space Hamiltonian systems using time series of the finite- time Lyapunov exponents. The methodology we propose uses the number of Lyapunov exponents close to zero to define regimes of ordered…
Time series and signals are attracting more attention across statistics, machine learning and pattern recognition as it appears widely in the industry especially in sensor and IoT related research and applications, but few advances has been…
Streamflow is a dynamical process that integrates water movement in space and time within basin boundaries. The authors characterize the dynamics associated with streamflow time series data from about seventy-one U.S. Geological Survey…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
By a classical result of Kathleen Alligood and James Yorke we know that as we isotopically deform a map $f:ABCD\to\mathbb{R}^2$ to a Smale horseshoe map we should often expect the dynamical complexity to increase via a period--doubling…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
The effectiveness of Spatio-temporal Graph Neural Networks (STGNNs) in time-series applications is often limited by their dependence on fixed, hand-crafted input graph structures. Motivated by insights from the Topological Data Analysis…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
We consider continuous-time random interlacements on a transient weighted graph. We prove an identity in law relating the field of occupation times of random interlacements at level u to the Gaussian free field on the weighted graph. This…
Using large-scale parallel numerical simulations we explore spatiotemporal chaos in Rayleigh-B\'enard convection in a cylindrical domain with experimentally relevant boundary conditions. We use the variation of the spectrum of Lyapunov…