2011
DOI: 10.1080/03610918.2010.551012
|View full text |Cite
|
Sign up to set email alerts
|

Conditional Distribution Inverse Method in Generating Uniform Random Vectors Over a Simplex

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 5 publications
0
8
0
Order By: Relevance
“…Algorithm 3 (Fang and Yang 2000;Moeini et al 2011) 1. Generate n − 1 independent random numbers Z 1 , .…”
Section: Uniform Random Variate Generation Over Standard Simplexesmentioning
confidence: 99%
See 1 more Smart Citation
“…Algorithm 3 (Fang and Yang 2000;Moeini et al 2011) 1. Generate n − 1 independent random numbers Z 1 , .…”
Section: Uniform Random Variate Generation Over Standard Simplexesmentioning
confidence: 99%
“…He also developed a map for converting the points uniformly generated over the standard simplex to an arbitrary simplex. Fang and Yang (2000) and Moeini et al (2011) proposed a new algorithm based on different ways of using the conditional method. Rubin (1984) developed a triangulation algorithm for a general n-dimensional polytope.…”
Section: Introductionmentioning
confidence: 99%
“…To sample the continuum of all process options, the weights need to be independently and identically distributed (iid). Therefore, random numbers r i are sampled from the uniform distribution, U[0,1], and transformed into the weights following the approach described by Moeini et al (2011). N − 1 such random numbers are required for N weights of competing options.…”
Section: Artificial Benchmark Model Setupsmentioning
confidence: 99%
“…For sampling the continuum of all process options, the weights need to be independently and identically distributed (iid). Therefore, random numbers r i are sampled from the uniform distribution, U[0,1], and transformed into the weights following the approach described by Moeini et al (2011). N − 1 such random numbers are required for N weights of competing options.…”
Section: Artificial Benchmark Model Setupsmentioning
confidence: 99%
“…The sampling strategy introduced by Moeini et al (2011) can be summarized as follows: For each set of weights N +1 needed, first generate a vector of random numbers (r 1 , r 2 , . .…”
Section: Appendix A: Generating Weightsmentioning
confidence: 99%