| Proj No. | A1111-251 |
| Title | Spectral Analysis of Laplacian Matrices for Connectivity and Fundamental Limits in Growing Graphs |
| Summary | This research investigates the spectral properties of Laplacian matrices to study the connectivity and node scalability of dynamically growing graphs. Focusing on algebraic connectivity and the spectral gap, the project explores how adding nodes affects graph stability and performance. By analyzing plug-and-play network expansion algorithms, we assess the network's ability to integrate new nodes while maintaining connectivity. The study provides insights into how many nodes can be efficiently added to a network (fundamental limits of a growing graph), offering practical guidance for scalable network design in fields like telecommunications and distributed computing. 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?: |