Related papers: Dynamics on the graph of the torus parametrisation
The richness of many complex systems stems from the interactions among their components. The higher-order nature of these interactions, involving many units at once, and their temporal dynamics constitute crucial properties that shape the…
We introduce a new class of filtrations indexed by attracting levels in dynamical systems, providing novel inputs for persistent homology and related methods in topological data analysis. These filtrations quantify, in a forward direction,…
We demonstrate the control of vortical motion of neutral classical particles in driven superlattices. Our superlattice consists of a superposition of individual lattices whose potential depths are modulated periodically in time but with…
Some general dynamical properties of models for compaction of granular media based on master equations are analyzed. In particular, a one-dimensional lattice model with short-ranged dynamical constraints is considered. The stationary state…
Deep sequence models are receiving significant interest in current machine learning research. By representing probability distributions that are fit to data using maximum likelihood estimation, such models can model data on general…
The dynamics of one dimensional iterative maps in the regime of fully developed chaos is studied in detail. Motivated by the observation of dynamical structures around the unstable fixed point we introduce the geometrical concept of a…
Bragg peaks in point set diffraction show up as eigenvalues of a dynamical system. Topological Bragg peaks arrise from topological eigenvalues and determine the torus parametrisation of the point set. We will discuss how qualitative…
Thanks to novel, powerful brain activity recording techniques, we can create data-driven models from thousands of recording channels and large portions of the cortex, which can improve our understanding of brain-states neuromodulation and…
In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and velocities to edges. However, directly using Newton's method on…
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…
While deep learning is facing an homogenization across modalities led by Transformers, they are still challenged by shallow linear models in the time series forecasting task. Our hypothesis is that models should learn a direct link from…
Temporal networks model how the interaction between elements in a complex system evolve over time. Just like complex systems display collective dynamics, here we interpret temporal networks as trajectories performing a collective motion in…
A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines…
This paper provides a unified framework connecting dynamical systems with tools from topological data analysis and geometric topology and inspires new interactions among dynamical systems, topology, and nonlinear analysis. To this end, we…
In previous works, we introduced the notion of dominant vertices in the context of dynamical systems on networks. This is a set of nodes in the underlying network whose evolution determines the whole network's dynamics after a transient…
We show that, when music pieces are cast in the form of time series of pitch variations, the concepts and tools of dynamical systems theory can be applied to the analysis of {\it temporal dynamics} in music. (i) Phase space portraits are…
We introduce an algorithmic model of heat conduction, the thermodynamic graph. The thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of…
Graph is a fundamental mathematical structure in characterizing relations between different objects and has been widely used on various learning tasks. Most methods implicitly assume a given graph to be accurate and complete. However, real…
We generalize the technique of smoothed analysis to distributed algorithms in dynamic network models. Whereas standard smoothed analysis studies the impact of small random perturbations of input values on algorithm performance metrics,…
In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence…