论文信息 - Generating Pareto records

Generating Pareto records

We present, (partially) analyze, and apply an efficient algorithm for the simulation of multivariate Pareto records. A key role is played by minima of the record-setting region (we call these generators) each time a new record is generated, and two highlights of our work are (i) efficient dynamic maintenance of the set of generators and (ii) asymptotic analysis of the expected number of generators at each time.

Daniel Q. Naiman | James Allen Fill

[2] A. Frigessi,et al. An analysis of monte carlo algorithms for counting problems , 1985 .

[3] Daniel Q. Naiman,et al. Abstract tubes, improved inclusion-exclusion identities and inequalities and importance sampling , 1997 .

[4] Richard M. Karp,et al. A new Monte-Carlo Method for Estimating the Failure Probability of an N-Component System , 1983 .

[5] Daniel Q. Naiman,et al. p-Value Simulation for Affected Sib Pair Multiple Testing , 2005, Human Heredity.

[6] Hsien-Kuei Hwang,et al. Maxima in hypercubes , 2005, Random Struct. Algorithms.

[7] Hsien-Kuei Hwang,et al. LIMIT THEOREMS FOR THE NUMBER OF MAXIMA IN RANDOM SAMPLES FROM PLANAR REGIONS , 2001 .

[8] Daniel Q. Naiman,et al. The Pareto Record Frontier , 2019, Electronic Journal of Probability.

[9] Carey E Priebe,et al. Computing Scan Statistic p Values Using Importance Sampling, With Applications to Genetics and Medical Image Analysis , 2001 .