First occurrence of a word among the elements of a finite dictionary in random sequences of letters

DOI10.1214/EJP.V17-1878MaRDI QIDQ428640zbMATH OpenFDO

Authors Emilio De Santis, F. Spizzichino

Publication date 22 June 2012

Published in Electronic Journal of Probability (Search for Journal in Brave)

zbMATH Keywords

renewal theoremergodic theoremcompeting wordssub-words

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Recommendations

• First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner
• On the first occurrence of strings
• A new method of approximating the probability of matching common words in multiple random sequences
• Exact distribution of word occurrences in a random sequence of letters
• Waiting for ABRACADABRA. Occurrences of words and leading numbers

Cited in

(12)

• Construction of voting situations concordant with ranking patterns
• Ranking graphs through hitting times of Markov chains
• Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
• On the first occurrence of strings
• Joint weak hazard rate order under non-symmetric copulas
• scientific article; zbMATH DE number 1285631 (Why is no real title available?)
• First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner
• Stochastic precedence and minima among dependent variables
• Construction of aggregation paradoxes through load-sharing models
• Relations between stochastic orderings and generalized stochastic precedence
• The Lexicographic First Occurrence of a I-II-III pattern
• Waiting for ABRACADABRA. Occurrences of words and leading numbers

This page was built for publication: First occurrence of a word among the elements of a finite dictionary in random sequences of letters

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