Related papers: Streams and Graphs of Dynamical Systems
Spiral waves are striking self-organized coherent structures that organize spatio-temporal dynamics in dissipative, spatially extended systems. In this paper, we provide a conceptual approach to various properties of spiral waves. Rather…
Topological data analysis can reveal higher-order structure beyond pairwise connections between vertices in complex networks. We present a new method based on discrete Morse theory to study topological properties of unweighted and…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
Dynamical systems with complex behaviours, e.g. immune system cells interacting with a pathogen, are commonly modelled by splitting the behaviour into different regimes, or modes, each with simpler dynamics, and then learning the switching…
Graph processing has become an important part of various areas of computing, including machine learning, medical applications, social network analysis, computational sciences, and others. A growing amount of the associated graph processing…
These are lecture notes for a simple minicourse approaching the satistical properties of a dynamical system by the study of the associated transfer operator (considered on a suitable functions or measures spaces). The following questions…
A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
Dynamic graph clustering aims to detect and track time-varying clusters in dynamic graphs, revealing how complex real-world systems evolve over time. However, existing methods are predominantly black-box models. They lack interpretability…
Models describing transport and diffusion processes occurring along the edges of a graph and interlinked by its vertices have been recently receiving a considerable attention. In this paper we generalize such models and consider a network…
Turbulent pipe flows exhibit organizational states (OSs) that are labelled by discrete azimuthal wavenumber modes and are reminiscent of the traveling wave solutions of low Reynolds number regimes. The discretized time evolution of the OSs,…
Using a certain well-posed ODE problem introduced by Shilnikov in the sixties, G. Minervini proved in his PhD thesis [17], among other things, the Harvey-Lawson Diagonal Theorem but without the restrictive tameness condition for Morse…
We study a non-linear dynamical system on networks inspired by the pitchfork bifurcation normal form. The system has several interesting interpretations: as an interconnection of several pitchfork systems, a gradient dynamical system and…
This work investigates the quantum transport in a narrow constriction acted upon by a finite-range transversely polarized time-dependent electric field. A generalized scattering-matrix method is developed that has incorporated a…
This paper provides an algorithmic pipeline for studying the intrinsic structure of a finite discrete dynamical system (DDS) modelling an evolving phenomenon. Here, by intrinsic structure we mean, regarding the dynamics of the DDS under…
Maintaining a sustainable socio-ecological state of a river delta requires delivery of material and energy fluxes to its body and coastal zone in a way that avoids malnourishment that would compromise system integrity. We present a…
The stratified inclined duct (SID) experiment consists of a zero-net-volume exchange flow in a long tilted rectangular duct, which allows the study of realistic stratified shear flows with sustained internal forcing. We present the first…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected…
Graphs are ubiquitous and ever-present data structures that have a wide range of applications involving social networks, knowledge bases and biological interactions. The evolution of a graph in such scenarios can yield important insights…