Probabilistic Load Flow Modeling Comparing Maximum Entropy and Gram-Charlier Probability Density Function Reconstructions
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Probabilistic load flow (PLF) modeling is gaining renewed popularity as power grid complexity increases due to growth in intermittent renewable energy generation and unpredictable probabilistic loads such as plug-in hybrid electric vehicles (PEVs). In PLF analysis of grid design, operation and optimization, mathematically correct and accurate predictions of probability tail regions are required. In this paper, probability theory is used to solve electrical grid power load flow. The method applies two Maximum Entropy (ME) methods and a Gram-Charlier (GC) expansion to generate voltage magnitude, voltage angle and power flow probability density functions (PDFs) based on cumulant arithmetic treatment of linearized power flow equations. Systematic ME and GC parameter tuning effects on solution accuracy and performance is reported relative to converged deterministic Monte Carlo (MC) results. Comparing ME and GC results versus MC techniques demonstrates that ME methods are superior to the GC methods used in historical literature, and tens of thousands of MC iterations are required to reconstitute statistically accurate PDF tail regions. Direct probabilistic solution methods with ME PDF reconstructions are therefore proposed as mathematically correct, statistically accurate and computationally efficient methods that could be applied in the load flow analysis of large-scale networks.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it