Вычисление распределения одной комбинаторной статистики, заданной на последовательностях с фиксированным составом знаков

DOI10.4213/mvk38zbMath1475.60039OpenAlexW2794027610MaRDI QIDQ4959023

D. V. Shuvaev

Publication date: 15 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk38

zbMATH Keywords

Markov chainnumber of readings

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of permutations by descents, idescents, imajor index, and basic components
• On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
• The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
• Exact and limiting distributions of the number of successions in a random permutation
• The number of readings of non-equiprobable files under stable sorting
• Permutations and sequences with repetitions by number of increases
• Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
• Distribution Theory of Runs: A Markov Chain Approach
• Simon Newcomb’s Problem
• Asymptotic Distribution of Runs Up and Down
• Joint distribution of rises and falls

This page was built for publication: Вычисление распределения одной комбинаторной статистики, заданной на последовательностях с фиксированным составом знаков