African Probability and Statistics (Pure Science) | 11 August 2011
Asymptotic Analysis and Identifiability Checks in Graph Theory for Power-Grid Forecasting in Nigeria
O, b, i, o, r, a, I, f, e, y, i, n, f, a, ,, I, f, e, y, i, n, n, a, O, b, i, o, r, a, ,, C, h, i, b, u, e, z, h, u, k, w, u, E, m, e, c, h, e, b, e
Abstract
Graph theory is a fundamental tool in network analysis, offering insights into complex systems such as power grids. In Nigeria, understanding and predicting power grid behaviour is crucial for ensuring reliable electricity supply. Graph theory principles, including node and edge representations, were utilised. Asymptotic analysis was conducted using stochastic processes for large-scale networks. Identifiability checks ensured that the model parameters could be uniquely determined from observable data. An empirical study on a representative Nigerian power grid revealed significant convergence in network behaviour over time, supporting the theoretical predictions. The findings confirm the effectiveness of graph theory in forecasting, with notable improvements in accuracy for future electricity supply planning. Further research should focus on integrating real-time data into the models to enhance predictive capabilities and ensure grid stability. Graph Theory, Power Grid Forecasting, Asymptotic Analysis, Identifiability Checks The analytical core is $\hat{y}<em>t=\mathcal{F}(x</em>t;\theta)$ with $\hat{\theta}=argmin_{\theta}L(\theta)$, and convergence is established under standard smoothness conditions.