Related papers: Dynamics on the graph of the torus parametrisation
Dynamic networks are interconnected dynamic systems with measured node signals and dynamic modules reflecting the links between the nodes. We address the problem of \red{identifying a dynamic network with known topology, on the basis of…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
This work is devoted to modelling and identification of the dynamics of the inter-sectoral balance of a macroeconomic system. An approach to the problem of specification and identification of a weakly formalized dynamical system is…
The analysis of global dynamics, particularly the identification and characterization of attractors and their regions of attraction, is essential for complex nonlinear and hybrid systems. Combinatorial methods based on Conley's index theory…
Given a $d$-dimensional torus map $F(z)=Mz+G(z)\bmod 1$, where $M$ is an integer-matrix and and $G$ is a periodic function, we find conditions on $M$ under which $F$ is semi-conjugate to a linear torus map, independently of $G$. We also…
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations…
The generic linear evolution of the density matrix of a system with a finite-dimensional state space is by stochastic maps which take a density matrix linearly into the set of density matrices. These dynamical stochastic maps form a linear…
The point vortex model is an idealized model for describing the dynamics of many vortices with numerical efficiency, and has been shown to be powerful in modeling the dynamics of vortices in a superfluid. The model can be extended to…
Dynamic graph datasets often exhibit strong temporal patterns, such as recency, which prioritizes recent interactions, and popularity, which favors frequently occurring nodes. We demonstrate that simple heuristics leveraging only these…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
A widely studied model for influence diffusion in social networks are {\it target sets}. For a graph $G$ and an integer-valued threshold function $\tau$ on its vertex set, a {\it target set} or {\it dynamic monopoly} is a set of vertices of…
This paper demonstrates a refined approach to solving dynamic optimization problems for underactuated marine surface vessels. To this end the differential flatness of a mathematical model assuming full actuation is exploited to derive an…
Discrete-time regulatory networks are dynamical systems on directed graphs, with a structure inspired on natural systems of interacting units. There is a natural notion of determination amongst vertices, which we use to classify the nodes…
By choosing a dynamical system with d different couplings, one can rearrange a system based on the graph with given vertex dependent on the dynamical system elements. The relation between the dynamical elements (coupling) is replaced by a…
The evaluation mechanism of pattern matching with dynamic patterns is modelled in the Pure Pattern Calculus by one single meta-rule. This contribution presents a refinement which narrows the gap between the abstract calculus and its…
In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…
We present cut and project formalism based on measures and continuous weight functions of sufficiently fast decay. The emerging measures are strongly almost periodic. The corresponding dynamical systems are compact groups and homomorphic…
A coupled map lattice whose topology changes at each time step is studied. We show that the transversal dynamics of the synchronization manifold can be analyzed by the introduction of effective dynamical quantities. These quantities are…
We consider the problem of learning a graph from a finite set of noisy graph signal observations, the goal of which is to find a smooth representation of the graph signal. Such a problem is motivated by the desire to infer relational…
We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…