The pie sharing problem: Unbiased sampling of N+1 summative weights
MetadataShow full item record
A simple algorithm is provided for randomly sampling a set of N+1 weights such that their sum is constrained to be equal to one, analogous to randomly subdividing a pie into N+1 slices where the probability distribution of slice volumes are identically distributed. The cumulative density and probability density functions of the random weights are provided. The algorithmic implementation for the random number sampling are made available. This algorithm has potential applications in calibration, uncertainty analysis, and sensitivity analysis of environmental models. Three example applications are provided to demonstrate the efficiency and superiority of the proposed method compared to alternative sampling methods.
Cite this version of the work
Juliane Mai, James R. Craig, Bryan A. Tolson (2022). The pie sharing problem: Unbiased sampling of N+1 summative weights. UWSpace. http://hdl.handle.net/10012/18028
The following license files are associated with this item: