Related papers: Linear dynamical systems on graphs
Markov diagrams provide a way to understand the structures of topological dynamical systems. We examine the construction of such diagrams for subshifts, including some which do not have any nontrivial Markovian part, in particular Sturmian…
In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify…
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…
Dynamically changing graphs are used in many applications of graph algorithms. The scope of these graphs are in graphics, communication networks and in VLSI designs where graphs are subjected to change, such as addition and deletion of…
In 2019 Anthony Quas, Philippe Thieullen and Mohamed Zarrabi introduced the concept of strong fast invertibility for linear cocycles. It relates the growth of volumes between different initial times and, together with a condition on…
A system of coupled oscillators on an arbitrary graph is locally driven by the tendency to mutual synchronization between nearby oscillators, but can and often exhibit nonlinear behavior on the whole graph. Understanding such nonlinear…
In this paper we deal with infinite-dimensional nonlinear forward complete dynamical systems which are subject to external disturbances. We first extend the well-known Datko lemma to the framework of the considered class of systems. Thanks…
We analyze stability properties of monotone nonlinear systems via max-separable Lyapunov functions, motivated by the following observations: first, recent results have shown that asymptotic stability of a monotone nonlinear system implies…
In this paper, we study the multifractal analysis for Markov-R\'{e}nyi maps, which form a canonical class of piecewise differentiable interval maps, with countably many branches and may contain a parabolic fixed point simultaneously, and do…
Being cognizant of the abundance of multi-body interactions in various complex systems, here we investigate a possible way to incorporate multi-body interactions in dynamical networks. Adopting hypergraph as the underlying architecture aids…
The prevalence of technologies in the space of the Internet of Things and use of multi-processing computing platforms to aid in the computation required to perform learning and inference from large volumes of data has necessitated the…
New sufficient conditions for the characterization of dwell-times for linear impulsive systems are proposed and shown to coincide with continuous decrease conditions of a certain class of looped-functionals, a recently introduced type of…
We propose a precise definition of a continuous time dynamical system made up of interacting open subsystems. The interconnections of subsystems are coded by directed graphs. We prove that the appropriate maps of graphs called graph…
In this paper, we exhibit an irreducible Markov chain $M$ on the edge $k$-colorings of bipartite graphs based on certain properties of the solution space. We show that diameter of this Markov chain grows linearly with the number of edges in…
We consider a class of skew product maps of interval diffeomorphisms over the doubling map. The interval maps fix the end points of the interval. It is assumed that the system has zero fiber Lyapunov exponent at one endpoint and zero or…
We carry out extensive computer simulations to study the Lyapunov instability of a two-dimensional hard disk system in a rectangular box with periodic boundary conditions. The system is large enough to allow the formation of Lyapunov modes…
One of the most common hypotheses on the theory of non-smooth dynamical systems is a regular surface as switching manifold, at which case there is at least well-defined and established Filippov dynamics. However, systems with singular…
We propose generalizations of a number of standard network models, including the classic random graph, the configuration model, and the stochastic block model, to the case of time-varying networks. We assume that the presence and absence of…
We define a Markov process on the set of countable graphs with spins. Transitions are local substitutions in the graph. It is proved that the scaling macrodimension is an invariant of such dynamics.
In skew-product systems with contractive factors, all orbits asymptotically approach the graph of the so-called sync function; hence, the corresponding regularity properties primarily matter. In the literature, sync function Lipschitz…