Maximum Waiting Times are Asymptotically Independent
From MaRDI portal
Publication:4291202
Recommendations
- Asymptotic independence of maximum waiting times for increasing alphabet
- scientific article; zbMATH DE number 3888676
- scientific article; zbMATH DE number 4078366
- Tails of waiting times and their bounds
- Maxima of waiting times for the random order service \(M|M|1\) queue
- The Distribution of the Time the Maximum is Achieved for Processes with Independent Increments
- scientific article; zbMATH DE number 2036020
- scientific article; zbMATH DE number 6308065
- scientific article; zbMATH DE number 1166248
Cites work
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- Large deviation results for waiting times in repeated experiments
- More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run
- On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
- On the waiting time till each of some given patterns occurs as a run
- Random walks on \(Z^n_2\)
Cited in
(7)- On expected waiting time until given words appear in random sequence
- Cover times for words in symmetric and nonsymmetric cases: A comparison
- Application of Smirnov words to waiting time distributions of runs
- Covering with blocks in the non-symmetric case
- Large deviation results for waiting times in repeated experiments
- Asymptotic independence of maximum waiting times for increasing alphabet
- Waiting for ABRACADABRA. Occurrences of words and leading numbers
This page was built for publication: Maximum Waiting Times are Asymptotically Independent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291202)
