scientific article; zbMATH DE number 3104491
From MaRDI portal
Publication:5843243
Cited in
(31)- Reziprozitätsgesetze in der kombinatorischen Zähltheorie
- The analysis of heuristics for search trees
- Limiting distributions for the number of distinct component sizes in relational structures
- On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size
- Martingales and descent statistics
- Large genus asymptotic geometry of random square-tiled surfaces and of random multicurves
- Central limit theorem for the prefix exchange distance under Ewens sampling formula
- An asymptotic distribution theory for Eulerian recurrences with applications
- Asymptotic normality of the major index on standard tableaux
- Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register
- Probabilistic divide-and-conquer: deterministic second half
- Efficient slide attacks
- Random \(A\)-permutations: convergence to a Poisson process
- Stochastic and deterministic characteristics of orbits in chaotically looking dynamical systems
- The Möbius function and statistical mechanics
- Counts of Bernoulli success strings in a multivariate framework
- Poisson approximation for the number of non-decreasing runs in Markov chains
- The roots of generating functions and sums of integer-valued random variables
- A view from the bridge spanning combinatorics and probability
- On longest consecutive patterns in Markov chains
- On some problems of a statistical group-theory. I
- The Dickman–Goncharov distribution
- Variations of central limit theorems and Stirling numbers of the first kind
- scientific article; zbMATH DE number 7750678 (Why is no real title available?)
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- Stanley-Wilf limits for patterns in rooted labeled forests
- A limit theorem for additive functions defined on the symmetric group
- Random a-permutations in a parametric model
- Smooth permutations and polynomials revisited
- Poisson approximation for large permutation groups
- The inversion statistic in derangements and in other permutations with a prescribed number of fixed points
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5843243)
