Pith. sign in

REVIEW

Stability Analysis of Networked Systems Containing Damped and Undamped Nodes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1603.03477 v1 pith:BQKFHMRG submitted 2016-03-10 math.OC

Stability Analysis of Networked Systems Containing Damped and Undamped Nodes

classification math.OC
keywords nodesanalysisdampedgraphundampedcontainingnetworkedstability
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper answers the question if a qualitatively heterogeneous passive networked system containing damped and undamped nodes shows consensus in the output of the nodes in the long run. While a standard Lyapunov analysis shows that the damped nodes will always converge to a steady-state value, the convergence of the undamped nodes is much more delicate and depends on the parameter values of the network as well as on the topology of the graph. A complete stability analysis is presented based on an eigenvector analysis involving the mass values and the topology of both the original graph and the reduced graph obtained by a Kron reduction that eliminates the damped nodes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.