Abstract
We extend our previous study of vulnerability of a linear network synchronization process to external intrusion at a single network component. Our previous efforts on the topic were limited to undirected graphs. The principal limitation in generalizing to all graph classes is the complexity introduced by the possibility of a non-diagonalizable graph Laplacian. Here, we take a step towards overcoming this hurdle by developing closed-form expressions for the inverse reachability Gramian in cases where the Laplacian has a single nontrivial Jordan block. Our approach for handling a single Jordan block represents a path forward for the more general case of multiple Jordan blocks of varying sizes, and hence towards a complete graphical characterization of vulnerability of networked synchronization processes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
