A selection-replacement process on the circle

DOI10.1214/AOAP/1177005365MaRDI QIDQ1308703zbMATH OpenOpenAlexFDO

Authors E. N. Gilbert, E. G. jun. Coffman, Peter W. Shor

Publication date 30 January 1994

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1177005365

zbMATH Keywords

matchingprobabilistic analysis of algorithmsselection-replacement operation

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Limit theorems in probability theory (60F99) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Sequencing Problems in Two-Server Systems
• On the minimal travel time needed to collect \(n\) items on a circle.
• Parking arcs on the circle with applications to one-dimensional communication networks
• Limiting distribution of the maximal distance between random points on a circle: a moments approach
• On point processes on the circle

Cited in

(1)

• On the minimal travel time needed to collect \(n\) items on a circle.

This page was built for publication: A selection-replacement process on the circle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1308703)