| Proj No. | A1114-251 |
| Title | Spectral Analysis of Laplacian Matrices for Connectivity in Growing Graphs: A Plug-and-Play Approach to Network Expansion |
| Summary | In the field of graph theory, understanding the connectivity of dynamically growing graphs is essential for optimizing complex network systems. This research investigates the spectral properties of Laplacian matrices as they relate to the connectivity and robustness of growing graphs, with a specific focus on plug-and-play algorithms that facilitate network expansion. The project explores how changes in the graph structure, such as the addition of nodes or edges, influence eigenvalue distributions of the Laplacian matrix, providing key insights into network stability and performance. By examining both theoretical and simulated growing graphs, this study analyzes how spectral gaps, algebraic connectivity (Fiedler value), and other spectral properties evolve in response to network growth. The research further explores the practical applications of these findings in scalable and adaptive networks, offering a comprehensive understanding of how graph connectivity is maintained or disrupted under dynamic conditions. Strong maths (linear algebra, calculus, complex analysis) and systems control backgrounds are required. |
| Supervisor | Dr Yamin Yan (Loc:S2 > S2 B2A > S2 B2A 09, Ext: +65 67904239) |
| Co-Supervisor | - |
| RI Co-Supervisor | - |
| Lab | Internet of Things Laboratory (Loc: S1-B4c-14, ext: 5470/5475) |
| Single/Group: | Single |
| Area: | Intelligent Systems and Control Engineering |
| ISP/RI/SMP/SCP?: |