The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach
From MaRDI portal
Publication:1587702
DOI10.1016/S0167-7152(00)00066-3zbMath0966.60066MaRDI QIDQ1587702
Publication date: 3 December 2000
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Distribution theory (60E99)
Related Items (4)
On finite Markov chain imbedding and its applications ⋮ On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation ⋮ Reliabilities for (n, f, k (i, j)) and ⟨n, f, k (i, j)⟩ Systems ⋮ The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of increases in a random permutation
- Permutations and successions
- Circular permutations by number of rises and successions
- On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
- Graphs, quasisymmetry and permutations with restricted positions
- Exact and limiting distributions of the number of successions in a random permutation
- Runs, scans and urn model distributions: A unified Markov chain approach
- Counting Successions in Permutations
- Decomposition Based Generating Functions for Sequences
- Distribution Theory of Runs: A Markov Chain Approach
- On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
- Combinations, Successions and the n-Kings Problem
- Permutations without Rising or Falling $\omega$-Sequences
- Permutations by Number of Rises and Successions
- Permutations without 3-sequences
- Additive Partition Functions and a Class of Statistical Hypotheses
- Symbolic solution of certain problems in permutations
- The Asymptotic Distribution of Runs of Consecutive Elements
- Note on Runs of Consecutive Elements
This page was built for publication: The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach