2006Combinatorics Probability ComputingOpen access

A Tale of Three Couplings: Poisson–Dirichlet and GEM Approximations for Random Permutations

Richard Arratia, A. D. Barbour, Simon Tavaré

Open full text 16 citations

Abstract

For a random permutation of distance between the process of cycle length proportions and the Poisson–Dirichlet process. We investigate how rapid this metric convergence can be, and in doing so, give two new proofs of the distributional convergence.One of the couplings we consider has an analogue for the prime factorizations of a uniformly distributed random integer, and these couplings rely on the ‘scale-invariant spacing lemma’ for the scale-invariant Poisson processes, proved in this paper.

Open-access reader

About this research paper

What this paper is about

For a random permutation of distance between the process of cycle length proportions and the Poisson–Dirichlet process. We investigate how rapid this metric convergence can be, and in doing so, give two new proofs of the distributional convergence.One of the couplings we consider has an analogue for the prime factorizations of a uniformly distributed random integer, and these couplings rely on the ‘scale-invariant spacing lemma’ for the scale-invariant Poisson processes, proved in this paper.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

For a random permutation of distance between the process of cycle length proportions and the Poisson–Dirichlet process. We investigate how rapid this metric convergence can be, and in doing so, give two new proofs of the distributional convergence.One of the couplings we consider has an analogue for the prime factorizations of a uniformly distributed random integer, and these couplings rely on the ‘scale-invariant spacing lemma’ for the scale-invariant Poisson processes, proved in this paper.

Key concepts: Mathematics, Poisson distribution, Dirichlet distribution, Lemma (botany), Mathematical proof, Random graph, Combinatorics, Permutation (music)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Tale of Three Couplings: Poisson–Dirichlet and GEM Approximations for Random Permutations — Research Paper | ScholarLens