The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its v...
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
Abstract-- We address a new problem--the invertibility problem for continuous-time switched linear systems, which is the problem of recovering the switching signal and the input un...
We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide nece...
Peter Duersch, Joerg Oechssler, Burkhard C. Schipp...
In a multiple-access communication network, nodes must compete for scarce communication resources such as bandwidth. This paper analyzes the asymptotic behavior of a multipleaccess...
Hazer Inaltekin, Mung Chiang, Harold Vincent Poor,...