Related papers: Statistical Distance For Chaotic Maps
Using the tools of Differential Geometry, we define a new <<fast>> chaoticity indicator, able to detect dynamical instability of trajectories much more effectively, (i.e. "quickly") than the usual tools, like Lyapunov Characteristic Numbers…
Chaos is widely understood as being a consequence of sensitive dependence upon initial conditions. This is the result of an instability in phase space, which separates trajectories exponentially. Here, we demonstrate that this criterion…
In this paper, we describe a representation for spatial information, called the stochastic map, and associated procedures for building it, reading information from it, and revising it incrementally as new information is obtained. The map…
Dynamical behaviour of discrete dynamical systems has been investigated extensively in the past few decades. However, in several applications, long term memory plays an important role in the evolution of dynamical variables. The definition…
It is well established numerically that spectral statistics of pseudo-integrable models differs considerably from the reference statistics of integrable and chaotic systems. In [PRL,93 (2004) 254102] statistical properties of a certain…
Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent…
Self-consistent chaotic transport is studied in a Hamiltonian mean-field model. The model provides a simplified description of transport in marginally stable systems including vorticity mixing in strong shear flows and electron dynamics in…
We investigate the properties of motion in a map model derived from a galactic Hamiltonian made up of perturbed elliptic oscillators. The phase space portrait is obtained in all three different cases using the map and numerical integration…
We study chaotic orbits of conservative low--dimensional maps and present numerical results showing that the probability density functions (pdfs) of the sum of $N$ iterates in the large $N$ limit exhibit very interesting time-evolving…
By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using L^p Wasserstein distances between probability measures, we define the corresponding spectral distances d_p on the set of all graphs.…
We investigate the effects of random perturbations on fully chaotic open systems. Perturbations can be applied to each trajectory independently (white noise) or simultaneously to all trajectories (random map). We compare these two scenarios…
We explore the concept of scaling invariance in a type of dynamical systems that undergo a transition from order (regularity) to disorder (chaos). The systems are described by a two-dimensional, nonlinear mapping that preserves the area in…
Some properties of chaotic dynamical systems can be probed through features of recurrences, also called analogs. In practice, analogs are nearest neighbours of the state of a system, taken from a large database called the catalog. Analogs…
Many functions have been recently defined to assess the similarity among networks as tools for quantitative comparison. They stem from very different frameworks - and they are tuned for dealing with different situations. Here we show an…
We present several natural notions of distance between spectral density functions of (discrete-time) random processes. They are motivated by certain filtering problems. First we quantify the degradation of performance of a predictor which…
Two replicas of spatially extended chaotic systems synchronize to a common spatio-temporal chaotic state when coupled above a critical strength. As a prototype of each single spatio-temporal chaotic system a lattice of maps interacting via…
Subject of this letter is the dynamics of a chain obtained performing the continuous limit of a system of links and beads. In particular, the probability distribution of the relative position between two points of the chain averaged over a…
We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
Recently patterns were found in the least significant digits in the logistic map orbits in the chaotic regime. However, the dynamic of these digits was not explored in deep. We propose a new interpretation of the patterns found in the least…