Skip to main navigation Skip to search Skip to main content

Fast Consensus Topology Design via Minimizing Laplacian Energy

  • Stanford Online High School

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper characterizes the graphical properties of an optimal topology with minimal Laplacian energy under the constraint of fixed numbers of vertices and edges, and devises an algorithm to construct such connected optimal graphs. These constructed graphs possess maximum vertex and edge connectivity, and more importantly, generically exhibit large algebraic connectivity of an optimal order provided they are not sparse. These properties guarantee fast and resilient consensus processes over these graphs.

Original languageEnglish
Title of host publication2024 IEEE 63rd Conference on Decision and Control, CDC 2024
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages6187-6192
Number of pages6
ISBN (Electronic)9798350316339
DOIs
StatePublished - 2024
Event63rd IEEE Conference on Decision and Control, CDC 2024 - Milan, Italy
Duration: Dec 16 2024Dec 19 2024

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference63rd IEEE Conference on Decision and Control, CDC 2024
Country/TerritoryItaly
CityMilan
Period12/16/2412/19/24

Fingerprint

Dive into the research topics of 'Fast Consensus Topology Design via Minimizing Laplacian Energy'. Together they form a unique fingerprint.

Cite this