Related papers: Path-complete $p$-dominant switching linear system…
The notion of path-complete positivity is introduced as a way to generalize the property of positivity from one LTI system to a family of switched LTI systems whose switching rule is constrained by a finite automaton. The generalization…
The paper extends the concepts of dominance and p-dissipativity to the non-smooth family of linear complementarity systems. Dominance generalizes incremental stability whereas p-dissipativity generalizes incremental passivity. The…
We revisit the classical dissipativity theorem of linear-quadratic theory in a generalized framework where the quadratic storage is negative definite in a p-dimensional subspace and positive definite in a complementary subspace. The…
The paper introduces notions of robustness margins geared towards the analysis and design of systems that switch and oscillate. While such phenomena are ubiquitous in nature and in engineering, a theory of robustness for behaviors away from…
A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…
We propose a new LMI approach to the design of optimal switching sequences for polynomial dynamical systems with state constraints. We formulate the switching design problem as an optimal control problem which is then relaxed to a linear…
A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…
Transition probabilities for stochastic systems can be expressed in terms of a functional integral over paths taken by the system. Evaluating the integral by the saddle point method in the weak-noise limit leads to a remarkable mapping…
We consider the modeling, stability analysis and controller design problems for discrete-time LTI systems with state feedback, when the actuation signal is subject to switching propagation delays, due to e.g. the routing in a multi-hop…
The concept of quasi-PT symmetry in optical wave guiding system is elaborated by comparing the evolution dynamics of a PT-symmetric directional coupler and a passive directional coupler. In particular we show that in the low loss regime,…
A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…
Studies of periodically driven one-dimensional many-body systems have advanced our understanding of complex systems and stimulated promising developments in quantum simulation. It is hence of interest to go one step further, by…
We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…
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…
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…
The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…
The linear switching system is a system of ODE with the time-dependent matrix taking values from a given control matrix set. The system is (asymptotically) stable if all its trajectories tend to zero for every control function. We consider…
The first part of the paper is an introduction to the theory of probabilistic concurrent systems under a partial order semantics. Key definitions and results are given and illustrated on examples. The second part includes contributions. We…
Given two distinct subsets $A,B$ in the state space of some dynamical system, Transition Path Theory (TPT) was successfully used to describe the statistical behavior of transitions from $A$ to $B$ in the ergodic limit of the stationary…
This paper introduces the concept of compliant vertices and compliant graphs, with a focus on the total domination degree (TDD) of a vertex in compliant graphs. The TDD is systematically calculated for various graph classes, including path…