Limit Theorems for Combinatorial Structures via Discrete Process Approximations
DOI10.1002/RSA.3240030310zbMATH Open0758.60009OpenAlexW2103268360WikidataQ104785218 ScholiaQ104785218MaRDI QIDQ4014642FDOQ4014642
Authors: Richard Arratia, Simon Tavaré 
Publication date: 18 October 1992
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240030310
Recommendations
functional limit theoremsrandom permutationrandom mappingcomponent counts of a random mappingcycle counts of a random permutationErdős-Turán law
Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Combinatorial probability (60C05)
Cites Work
Cited In (43)
- Discrete scale-free distributions and associated limit theorems
- The order of a typical matrix with entries in a finite field
- A limit theory for random skip lists
- Period Lengths for Iterated Functions
- Eigenvalue distributions of random permutation matrices.
- On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size
- Statistical mechanics of combinatorial partitions, and their limit shapes
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
- The magical Ewens sampling formula
- Limit theorems for the logarithm of the order of a random \(A\)-mapping
- Extreme sizes in Gibbs-type exchangeable random partitions
- General combinatorial schemas: Gaussian limit distributions and exponential tails
- Gaussian limiting distributions for the number of components in combinatorial structures
- Independent process approximations for random combinatorial structures
- Simulating the component counts of combinatorial structures
- The Poisson distribution for linear statistics of random permutations
- Logarithmic combinatorial structures: A probabilistic approach
- The number of decomposition of random permutation into the product of two involutions with given cycle in one of multipliers
- Stochastic processes with independent increments for random mappings
- The distribution of rare alleles
- Limit theorems for process-level Betti numbers for sparse and critical regimes
- Discrete limit laws for additive functions on the symmetric group
- On fluctuations of eigenvalues of random permutation matrices
- Markov chains generating random permutations and set partitions
- Factorization in Fq[x] and Brownian Motion
- Random permutations without macroscopic cycles
- Title not available (Why is that?)
- A functional combinatorial central limit theorem
- Title not available (Why is that?)
- Logical limit laws for layered permutations and related structures
- A Rate for the Erdős-Turán Law
- Functional limit theorems for the number of occupied boxes in the Bernoulli sieve
- Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers
- A limit theorem for additive functions defined on the symmetric group
- Steepest descent method and limiting distributions in combinatorial analysis
- The Feller coupling for random derangements
- Asymptotic value distribution of additive functions defined on the symmetric group
- Fisher's measure of variability in repeated samples
- On the order of random permutation with cycle weights
- Random \(A\)-permutations: convergence to a Poisson process
- Binary sequential representations of random partitions
- An analytic method in probabilistic combinatorics
- A generalization of the Erdős-Turán law for the order of random permutation
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)
