Limit Theorems for Combinatorial Structures via Discrete Process Approximations
From MaRDI portal
Publication:4014642
DOI10.1002/rsa.3240030310zbMath0758.60009OpenAlexW2103268360WikidataQ104785218 ScholiaQ104785218MaRDI QIDQ4014642
Publication date: 18 October 1992
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240030310
functional limit theoremsrandom permutationrandom mappingErdős-Turán lawcomponent counts of a random mappingcycle counts of a random permutation
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Related Items
Eigenvalue distributions of random permutation matrices. ⋮ One-dimensional cellular automata with random rules: longest temporal period of a periodic solution ⋮ The Feller coupling for random derangements ⋮ The distribution of rare alleles ⋮ A Generalization of the Erdős–Turán Law for the Order of Random Permutation ⋮ The order of a typical matrix with entries in a finite field ⋮ Factorization in Fq[x and Brownian Motion] ⋮ Unnamed Item ⋮ Extreme sizes in Gibbs-type exchangeable random partitions ⋮ Random permutations without macroscopic cycles ⋮ A Rate for the Erdős-Turán Law ⋮ The magical Ewens sampling formula ⋮ Fisher's measure of variability in repeated samples ⋮ Unnamed Item ⋮ A limit theorem for additive functions defined on the symmetric group ⋮ On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size ⋮ The Poisson distribution for linear statistics of random permutations ⋮ Limit theorems for the logarithm of the order of a random \(A\)-mapping ⋮ Statistical mechanics of combinatorial partitions, and their limit shapes ⋮ Unnamed Item ⋮ Functional limit theorems for the number of occupied boxes in the Bernoulli sieve ⋮ Random \(A\)-permutations: convergence to a Poisson process ⋮ Simulating the component counts of combinatorial structures ⋮ On the Order of Random Permutation with Cycle Weights ⋮ An analytic method in probabilistic combinatorics ⋮ Period Lengths for Iterated Functions ⋮ Число разложений случайной подстановки в композицию двух инволюций с заданным циклом в одном из сомножителей ⋮ Asymptotic value distribution of additive functions defined on the symmetric group ⋮ Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers ⋮ Stochastic processes with independent increments for random mappings ⋮ On fluctuations of eigenvalues of random permutation matrices ⋮ Binary sequential representations of random partitions
Cites Work
