A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
From MaRDI portal
Publication:612956
zbMath1203.60013arXiv1005.1893MaRDI QIDQ612956
Christian Houdré, Ricardo L. Restrepo
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.1893
law of the iterated logarithmcentral limit theoremrandom permutationsrandom words\(m\)-dependencelongest alternating subsequence
Gaussian processes (60G15) Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Sample path properties (60G17) Asymptotic enumeration (05A16)
Related Items (12)
Martingales and descent statistics ⋮ Asymptotic normality of pattern counts in conjugacy classes ⋮ Unnamed Item ⋮ Descent-inversion statistics in riffle shuffles ⋮ Staircase patterns in words: subsequences, subwords, and separation number ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ On the longest \(k\)-alternating subsequence ⋮ On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data ⋮ On unfair permutations ⋮ A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming ⋮ Online Selection of Alternating Subsequences from a Random Sample ⋮ Multi-state asymmetric simple exclusion processes
This page was built for publication: A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
