Admittance Matrix Concentration Inequalities for Understanding Uncertain Power Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912946761760768 |
|---|---|
| author | Talkington, Samuel Khanpour, Cameron Gupta, Rahul K. Dorado-Rojas, Sergio A. Turizo, Daniel Park, Hyeongon Ostrovskii, Dmitrii M. Molzahn, Daniel K. |
| author_facet | Talkington, Samuel Khanpour, Cameron Gupta, Rahul K. Dorado-Rojas, Sergio A. Turizo, Daniel Park, Hyeongon Ostrovskii, Dmitrii M. Molzahn, Daniel K. |
| contents | This paper presents conservative probabilistic bounds for the spectrum of the admittance matrix and classical linear power flow models under uncertain network parameters; for example, probabilistic line contingencies. Our proposed approach imports tools from probability theory, such as concentration inequalities for random matrices. This provides a theoretical framework for understanding error bounds of common approximations of the AC power flow equations under parameter uncertainty, including the DC and LinDistFlow approximations. Additionally, we show that the upper bounds scale as functions of nodal criticality. This network-theoretic quantity captures how uncertainty concentrates at critical nodes for use in contingency analysis. We validate these bounds on IEEE test networks, demonstrating that they correctly capture the scaling behavior of spectral perturbations up to conservative constants. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_17798 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Admittance Matrix Concentration Inequalities for Understanding Uncertain Power Networks Talkington, Samuel Khanpour, Cameron Gupta, Rahul K. Dorado-Rojas, Sergio A. Turizo, Daniel Park, Hyeongon Ostrovskii, Dmitrii M. Molzahn, Daniel K. Systems and Control Applications This paper presents conservative probabilistic bounds for the spectrum of the admittance matrix and classical linear power flow models under uncertain network parameters; for example, probabilistic line contingencies. Our proposed approach imports tools from probability theory, such as concentration inequalities for random matrices. This provides a theoretical framework for understanding error bounds of common approximations of the AC power flow equations under parameter uncertainty, including the DC and LinDistFlow approximations. Additionally, we show that the upper bounds scale as functions of nodal criticality. This network-theoretic quantity captures how uncertainty concentrates at critical nodes for use in contingency analysis. We validate these bounds on IEEE test networks, demonstrating that they correctly capture the scaling behavior of spectral perturbations up to conservative constants. |
| title | Admittance Matrix Concentration Inequalities for Understanding Uncertain Power Networks |
| topic | Systems and Control Applications |
| url | https://arxiv.org/abs/2510.17798 |