Related papers: A Sufficient Condition for the Super-linearization…
In this paper, a necessary and sufficient condition for the controllability of networked systems with heterogeneous dynamics is established where the nodes are higher dimensional linear time invariant systems and the network topology is…
It is ``folklore'' that the solution to a set reachability problem for a dynamical system is only noncomputable because of non-robustness reasons. A robustness condition that can be imposed on a dynamical system is the requirement of the…
We consider the problem of joint estimation of the parameters of $m$ linear dynamical systems, given access to single realizations of their respective trajectories, each of length $T$. The linear systems are assumed to reside on the nodes…
In this paper we obtain new sufficient conditions for representation of a function as an absolutely convergent Fourier integral. Unlike those known earlier, these conditions are given in terms of belonging to weighted spaces. Adding weights…
A class $\mathcal G$ of graphs is $\chi$-bounded if there is a function $f$ such that for every graph $G\in \mathcal G$ and every induced subgraph $H$ of $G$, $\chi(H)\le f(\omega(H))$. In addition, we say that $\mathcal G$ is polynomially…
Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible. The dynamic that…
Time-discrete dynamical systems on a finite state space have been used with great success to model natural and engineered systems such as biological networks, social networks, and engineered control systems. They have the advantage of being…
A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
The main purpose of this paper is to formulate new conditions for smooth linearization of nonautonomous systems with discrete and continuous time. Our results assume that the linear part admits a nonuniform polynomial dichotomy and that the…
Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are R-valued functions on the set of vertices and graph edges are permitted to have nonegative weights in R. Using this…
We present sufficient conditions under which a given linear nonautonomous system and its nonlinear perturbation are topologically conjugated. Our conditions are of a very general form and provided that the nonlinear perturbations are…
Let (G,w) be a weighted graph. The necessary and sufficient conditions under which a weight w : E(G)-->R^+ can be extended to a pseudoultrametric on V(G) are found. A criterion of the uniqueness of this extension is also obtained. It is…
Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…
It is well known that the dynamical behavior of a rational map $f:\widehat{\mathbb C}\to \widehat{\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical…
In this paper, we propose new conditions guaranteeing that the trajectories of a mechanical control system can track any curve on the configuration manifold. We focus on systems that can be represented as forced affine connection control…
We present necessary and sufficient optimality conditions for finite time optimal control problems for a class of hybrid systems described by linear complementarity models. Although these optimal control problems are difficult in general…
A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict)…