Poisson approximation for large permutation groups
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6096295 (Why is no real title available?)
- scientific article; zbMATH DE number 3739805 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 66574 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3999929 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3231901 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3104489 (Why is no real title available?)
- scientific article; zbMATH DE number 3104491 (Why is no real title available?)
- A central limit theorem for a new statistic on permutations
- A cycle index sum inversion theorem
- An application of Polya's theory of counting to an enumeration problem arising in quadratic form theory
- Between the enhanced power graph and the commuting graph
- Combinatorial enumeration of groups, graphs, and chemical compounds. Translated from the German by Dorothee Aeppli
- Compound Poisson approximation: A user's guide
- Conjugacy classes and centralisers in wreath products
- Cycle index of direct product of permutation groups and number of equivalence classes of subsets of \(\mathbb{Z}_ v\)
- Derangements in subspace actions of finite classical groups
- Design of Comparative Experiments
- Dimension and randomness in groups acting on rooted trees
- Feller coupling of cycles of permutations and Poisson spacings in inhomogeneous Bernoulli trials
- Further probabilistic results on the symmetric p-groups
- Hit and run as a unifying device
- Inequalities for multivariate compound Poisson distributions
- Limit shapes via bijections
- Logarithmic combinatorial structures: A probabilistic approach
- Matchings and phylogenetic trees
- On Infinitely Divisible Random Vectors
- On fixed points of permutations.
- Ordered Cycle Lengths in a Random Permutation
- Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
- Random matrix theory over finite fields
- Random sampling of contingency tables and partitions: two practical examples of the Burnside process
- Realizability problem for commuting graphs
- Stationary sequences with simple joint Poisson distributions
- Statistical enumeration of groups by double cosets
- Stopped Random Walks
- The Structure of Random Partitions of Large Integers
- The characters of the wreath product group acting on the homology groups of the Dowling lattices
- The mathematics of perfect shuffles
- The ‘Burnside Process’ Converges Slowly
- There is no upper bound for the diameter of the commuting graph of a finite group
Cited in
(2)
This page was built for publication: Poisson approximation for large permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6997820)
