Maximum Waiting Times are Asymptotically Independent

DOI10.1017/S0963548300000286zbMATH Open0798.60013OpenAlexW2081322508MaRDI QIDQ4291202FDOQ4291202

Authors: Tamás F. Móri 

Publication date: 5 May 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000286

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

zbMATH Keywords

asymptotically independentrandom letters

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Limit theorems in probability theory (60F99)

Cites Work

• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run
• Large deviation results for waiting times in repeated experiments
• On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
• Random walks on \(Z^n_2\)
• On the waiting time till each of some given patterns occurs as a run

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
• Asymptotic independence of maximum waiting times for increasing alphabet
• Large deviation results for waiting times in repeated experiments
• 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)