The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the asymptotic ($n\rightarrow\infty$) mean of this number in the cases...
Saved in:
| Main Authors: | Guy Louchard, Werner Schachinger, Mark Daniel Ward |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-10-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/9293/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation
by: Anant Godbole, et al.
Published: (2024-05-01) -
A note on limits of sequences of binary trees
by: Rudolf Grübel
Published: (2023-05-01) -
A logical limit law for $231$-avoiding permutations
by: Michael Albert, et al.
Published: (2024-04-01) -
Measurable Vizing’s theorem
by: Jan Grebík
Published: (2025-01-01) -
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
by: Michael Anastos, et al.
Published: (2025-01-01)