Related papers: Graph-Based Minimum Dwell Time and Average Dwell T…
Large continuous-time Markov chains with exponentially small transition rates arise in modeling complex systems in physics, chemistry and biology. We propose a constructive graph-algorithmic approach to determine the sequence of critical…
We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in…
With the emergence of smart grids as the primary means of distribution across wide areas, the importance of improving its resilience to faults and mishaps is increasing. The reliability of a distribution system depends upon its tolerance to…
The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We present an efficient…
We consider a classic two-state switching diffusion model from a single-particle tracking perspective. The mean and the variance of the time-averaged mean square displacement (TAMSD) are computed exactly. When the measurement time (i.e.,…
We propose an extension of the theory of control sets to the case of inputs satisfying a dwell-time constraint. Although the class of such inputs is not closed under concatenation, we propose a suitably modified definition of control sets…
We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…
The assumption of using a static graph to represent multivariate time-varying signals oversimplifies the complexity of modeling their interactions over time. We propose a Dynamic Multi-hop model that captures dynamic interactions among…
We revisit Min-Mean-Cycle, the classical problem of finding a cycle in a weighted directed graph with minimum mean weight. Despite an extensive algorithmic literature, previous work falls short of a near-linear runtime in the number of…
In the recent research of data mining, frequent structures in a sequence of graphs have been studied intensively, and one of the main concern is changing structures along a sequence of graphs that can capture dynamic properties of data. On…
We propose a minimal model, based on active Brownian particles, for the dynamics of cells confined in a two-state micropattern, composed of two rectangular boxes connected by a bridge, and investigate the transition statistics. A transition…
Eigenvectors of the Laplacian of a cycle graph exhibit the sinusoidal characteristics of the standard DFT basis, and signals defined on such graphs are amenable to linear shift invariant (LSI) operations. In this paper we propose to reduce…
We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A…
In this paper, we first propose a method that can efficiently compute the maximal robust controlled invariant set for discrete-time linear systems with pure delay in input. The key to this method is to construct an auxiliary linear system…
In this paper we develop the theory of discrete averaging designed to study discrete time dynamical systems defined by iterates of a map. The discrete averaging uses weighted averages over a segment of trajectory to find an autonomous…
Consider the random subgraph process on a base graph $G$ on $n$ vertices: a sequence $\lbrace G_t \rbrace _{t=0} ^{|E(G)|}$ of random subgraphs of $G$ obtained by choosing an ordering of the edges of $G$ uniformly at random, and by…
Strong stability, defined by bounds that decay not only over time but also with the number of impulses, has been established as a requirement to ensure robustness properties for impulsive systems with respect to inputs or disturbances. Most…
The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a…
We study dynamics of a bimodal planar linear switched system with a Hurwitz stable and an unstable subsystem. For given \textit{flee time} from the unstable subsystem, the goal is to find corresponding \textit{dwell time} in the Hurwitz…
We consider the problem of controlling in minimum time a two-level quantum system which can be subject to a drift. The control is assumed to be bounded in magnitude, and to affect two or three independent generators of the dynamics. We…