Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.12726 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909692480978944 |
|---|---|
| author | Lu, Susie Gamarra, Marco Liu, Ji |
| author_facet | Lu, Susie Gamarra, Marco Liu, Ji |
| contents | This paper studies an open consensus network design problem: identifying the optimal simple directed graphs, given a fixed number of vertices and arcs, that maximize the second smallest real part of all Laplacian eigenvalues, referred to as algebraic connectivity. For sparse and dense graphs, the class of all optimal directed graphs that maximize algebraic connectivity is theoretically identified, leading to the fastest consensus. For general graphs, a computationally efficient sequence of almost regular directed graphs is proposed to achieve fast consensus, with algebraic connectivity close to the optimal value. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12726 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fast Consensus over Almost Regular Directed Graphs Lu, Susie Gamarra, Marco Liu, Ji Optimization and Control This paper studies an open consensus network design problem: identifying the optimal simple directed graphs, given a fixed number of vertices and arcs, that maximize the second smallest real part of all Laplacian eigenvalues, referred to as algebraic connectivity. For sparse and dense graphs, the class of all optimal directed graphs that maximize algebraic connectivity is theoretically identified, leading to the fastest consensus. For general graphs, a computationally efficient sequence of almost regular directed graphs is proposed to achieve fast consensus, with algebraic connectivity close to the optimal value. |
| title | Fast Consensus over Almost Regular Directed Graphs |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2507.12726 |