Limit Theorems for Combinatorial Structures via Discrete Process Approximations
From MaRDI portal
Recommendations
Cites work
- Brownian bridge asymptotics for random mappings
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Poisson process approximations for the Ewens sampling formula
- Random permutations and Brownian motion
- The cycle structure of random permutations
Cited in
(45)- An analytic method in probabilistic combinatorics
- Asymptotic value distribution of additive functions defined on the symmetric group
- A functional combinatorial central limit theorem
- Steepest descent method and limiting distributions in combinatorial analysis
- A limit theory for random skip lists
- Independent process approximations for random combinatorial structures
- Logarithmic combinatorial structures: A probabilistic approach
- Stochastic processes with independent increments for random mappings
- On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size
- Limit theorems for the logarithm of the order of a random \(A\)-mapping
- Eigenvalue distributions of random permutation matrices.
- The distribution of rare alleles
- The order of a typical matrix with entries in a finite field
- Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
- The Feller coupling for random derangements
- On fluctuations of eigenvalues of random permutation matrices
- Extreme sizes in Gibbs-type exchangeable random partitions
- The Poisson distribution for linear statistics of random permutations
- Random \(A\)-permutations: convergence to a Poisson process
- Random permutations without macroscopic cycles
- Fisher's measure of variability in repeated samples
- A generalization of the Erdős-Turán law for the order of random permutation
- Period Lengths for Iterated Functions
- Limit theorems for process-level Betti numbers for sparse and critical regimes
- The number of decomposition of random permutation into the product of two involutions with given cycle in one of multipliers
- Discrete limit laws for additive functions on the symmetric group
- Factorization in Fq[x] and Brownian Motion
- A Rate for the Erdős-Turán Law
- scientific article; zbMATH DE number 1545678 (Why is no real title available?)
- Discrete scale-free distributions and associated limit theorems
- On the order of random permutation with cycle weights
- Functional limit theorems for the number of occupied boxes in the Bernoulli sieve
- Gaussian limiting distributions for the number of components in combinatorial structures
- scientific article; zbMATH DE number 7750678 (Why is no real title available?)
- Logical limit laws for layered permutations and related structures
- The magical Ewens sampling formula
- A limit theorem for additive functions defined on the symmetric group
- Markov chains generating random permutations and set partitions
- Statistical mechanics of combinatorial partitions, and their limit shapes
- General combinatorial schemas: Gaussian limit distributions and exponential tails
- Processes in random permutations
- Involution factorizations of Ewens random permutations
- Simulating the component counts of combinatorial structures
- Binary sequential representations of random partitions
This page was built for publication: Limit Theorems for Combinatorial Structures via Discrete Process Approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014642)
