Some stochastic processes in a random permutation
From MaRDI portal
Publication:1105267
DOI10.1016/0378-3758(88)90075-4zbMath0648.60027MaRDI QIDQ1105267
Publication date: 1988
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(88)90075-4
62G10: Nonparametric hypothesis testing
60F05: Central limit and other weak theorems
05A05: Permutations, words, matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of permutations by descents, idescents, imajor index, and basic components
- On the number of combinations without a fixed distance
- On the number of combinations without unit separation
- Rank tests for bivariate symmetry
- Algebraic methods for permutations with prescribed patterns
- Équidistribution des permutations ayant une forme donnée selon les avances et coavances
- The number of increases in a random permutation
- A general Poisson approximation theorem
- Stochastic inequalities on partially ordered spaces
- Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
- Permutations and sequences
- Théorie géométrique des polynômes eulériens
- An approximation theorem for the Poisson binomial distribution
- The problem of the rooks and its applications
- An estimate of the remainder in a combinatorial central limit theorem
- A NOTE ON SAMPLING WITH AND WITHOUT REPLACEMENT
- Distance between sampling with and without replacement
- Combinations, Successions and the n-Kings Problem
- Permutations by Number of Rises and Successions
- Asymptotical independence of the lengths of subintervals of a randomly partitioned interval; a sample from S. Ikeda's work
- Enumeration of combinations with restricted differences and cospan
- Explicit Expressions for a Class of Permutation Problems
- Permutations without 3-sequences