Consider a weighted and undirected graph, possibly with self-loops, and its
corresponding Laplacian matrix, possibly augmented with additional diagonal
elements corresponding to the self-loops. The Kron reduction of this graph is
again a graph whose Laplacian matrix is obtained by the Schur complement of the
original Laplacian matrix with respect to a subset of nodes.
In the formation control problem for autonomous robots a distributed control
law steers the robots to the desired target formation. A local stability result
of the target formation can be derived by methods of linearization and center
manifold theory or via a Lyapunov-based approach.
In the current discussion about the future smart power grid one of the major
problems is that of transient stability, which is the power system's ability to
maintain synchronism in the presence of transient disturbances. This paper
proposes a novel network-based approach to this problem resulting in concise
and purely algebraic conditions that relate transient stability of a power
network to the underlying network parameters and state.