Related papers: Graph-Based Minimum Dwell Time and Average Dwell T…
We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here disjoint can mean vertex-disjoint or edge-disjoint, and the…
In this paper we consider distributed adaptive stabilization for uncertain multivariable linear systems with a time-varying diagonal matrix gain. We show that uncertain multivariable linear systems are stabilizable by diagonal matrix high…
A network is said to have the properties of a small world if a suitably defined average distance between any two nodes is proportional to the logarithm of the number of nodes, $N$. In this paper, we present a novel derivation of the…
We study the state consensus problem for linear shift-invariant discrete-time homogeneous multi-agent systems (MASs) over time-varying graphs. A novel approach based on the small gain theorem is proposed to design the consensus control…
In this paper we study a generalization of distributed conditional gradient method to time-varying network architectures. We theoretically analyze convergence properties of the algorithm and provide numerical experiments. The time-varying…
We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that…
This paper provides a framework to characterize the gain margin, phase margin, and maximum input delay margin of a linear time-invariant multi-agent system where the interaction topology is described by a graph with a directed spanning…
This paper revisits a recently developed methodology based on the matrix Lambert W function for the stability analysis of linear time invariant, time delay systems. By studying a particular, yet common, second order system, we show that in…
Existing methods to determine the stability of a power system to small perturbations are based on eigenvalue analysis and focus on the asymptotic (long-term) behavior of the power grid. During the preasymptotic (short-term) transient,…
This paper presents a combined sliding-mode control and subspace stabilization methodology for orbital stabilization of periodic trajectories in underactuated mechanical systems with one degree of underactuation. The approach starts with…
For irreducible, time-homogeneous Markov networks, mutual linearity has recently been established for both occupation probabilities and network currents in the stationary regime as well as in the non-stationary regime in Laplace space. The…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
This paper explores the observability and estimation capability of dynamical systems using predominantly relative measurements of the system's state-space variables, with minimal to no reliance on absolute measurements of these variables.…
Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two…
High-dimensional multivariate time series are common in many scientific and industrial applications, where the interest lies in identifying key dependence structure within the data for subsequent analysis tasks, such as forecasting. An…
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in D and D is an independent set, i.e. no two vertices of D are adjacent in G. Finding a minimum…
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 introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
A useful approach to the mathematical analysis of large-scale biological networks is based upon their decompositions into monotone dynamical systems. This paper deals with two computational problems associated to finding decompositions…
The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…