Block size in geometric(\(p\))-biased permutations

DOI10.1214/18-ECP182zbMath1398.05004arXiv1708.05626OpenAlexW2885904292MaRDI QIDQ1990049

Yanyan Li

Publication date: 24 October 2018

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.05626

zbMATH Keywords

Bernoulli sieveregenerative permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Renewal theory (60K05)

Related Items (1)

Poisson percolation on the square lattice

Cites Work

• Unnamed Item
• \(q\)-exchangeability via quasi-invariance
• The Bernoulli sieve revisited
• On the distribution for the duration of a randomized leader election algorithm
• Analysis of an asymmetric leader election algorithm
• The Bernoulli sieve
• Limit theorems for longest monotone subsequences in random Mallows permutations
• Limit theorems for the number of occupied boxes in the Bernoulli sieve
• A Generalization of the Erdős–Turán Law for the Order of Random Permutation
• The Bernoulli sieve: an overview

This page was built for publication: Block size in geometric(\(p\))-biased permutations