Related papers: Formation Control of Rigid Graphs with a Flex Node…
It is shown that a compound elastic structure, which displays a dynamic instability, may be designed as the union (or 'fusion') of two structures which are stable when separately analyzed. The compound elastic structure has two degrees of…
Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee…
In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…
A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…
We study modulational instability in a fiber system resembling a dispersion-managed link where the sign of the group-velocity dispersion varies randomly according to a telegraph process. We find that the instability gain of stochastic…
Graph-structured data arise in a variety of real-world context ranging from sensor and transportation to biological and social networks. As a ubiquitous tool to process graph-structured data, spectral graph filters have been used to solve…
This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…
In this paper, we propose a distance-based formation control strategy that can enable four mobile agents, which are modelled by a group of single-integrators, to achieve the desired formation shape specified by using six consistent…
This paper studies the problem of designing networks that are strong structurally controllable, and robust simultaneously. For given network specifications, including the number of nodes $N$, the number of leaders $N_L$, and diameter $D$,…
It is well known that if a network topology is a path or line and the states of vertices or nodes evolve according to the consensus policy, then the network is Laplacian controllable by an input connected to its terminal vertex. In this…
We develop local stable group theory directly from topological dynamics, and extend the main results in this subject to the setting of stability "in a model". Specifically, given a group $G$, we analyze the structure of sets $A\subseteq G$…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…
In this article we construct an expansive homeomorphism of a compact three-dimensional manifold with a fixed point whose local stable set is not locally connected. This homeomorphism is obtained as a topological perturbation of a…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…
This paper addresses the problem of bearing leader-follower formation control in three-dimensional space by exploring the persistence of excitation (PE) of the desired formation. Using only bearing and relative velocity measurements,…
Voltage control generally requires accurate information about the grid's topology in order to guarantee network stability. However, accurate topology identification is a challenging problem for existing methods, especially as the grid is…
A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…
We consider the problem of distributed formation control of a large number of vehicles. An individual vehicle in the formation is assumed to be a fully actuated point mass. A distributed control law is examined: the control action on an…
It is well-known that stable and unstable manifolds strongly influence fluid motion in unsteady flows. These emanate from hyperbolic trajectories, with the structures moving nonautonomously in time. The local directions of emanation at each…