pith. sign in

arxiv: 1901.05621 · v1 · pith:ONDE6N74new · submitted 2019-01-17 · 🧮 math.PR · cs.DS

Generating Pareto records

classification 🧮 math.PR cs.DS
keywords generatorsefficientparetorecordstimealgorithmanalysisanalyze
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.