Limits of logarithmic combinatorial structures.
From MaRDI portal
Publication:1872161
Recommendations
- Logarithmic combinatorial structures: A probabilistic approach
- On Poisson–Dirichlet Limits for Random Decomposable Combinatorial Structures
- The number of components in a logarithmic combinatorial structure.
- Order statistics for decomposable combinatorial structures
- Strong convergence on weakly logarithmic combinatorial assemblies
Cites work
- scientific article; zbMATH DE number 3873438 (Why is no real title available?)
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 17682 (Why is no real title available?)
- scientific article; zbMATH DE number 3421645 (Why is no real title available?)
- A Rate for the Erdős-Turán Law
- A functional central limit theorem for random mappings
- A functional central limit theorem for the Ewens sampling formula
- Asymptotics of poisson approximation to random discrete distributions: an analytic approach
- Distribution statistique de l'ordre d'un élément du groupe symétrique. (Statistical distribution of the order of an element of the symmetric group)
- Factorization in Fq[x] and Brownian Motion
- Gaussian limiting distributions for the number of components in combinatorial structures
- How random is the characteristic polynomial of a random matrix ?
- Independent process approximations for random combinatorial structures
- Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I.
- Limits of logarithmic combinatorial structures.
- On Poisson–Dirichlet Limits for Random Decomposable Combinatorial Structures
- On a class of differential-difference equations arising in number theory
- On random polynomials over finite fields
- On some problems of a statistical group-theory. III
- On the rate of Poisson convergence
- Order statistics for decomposable combinatorial structures
- Random Matrices and Brownian Motion
- Random permutations and Brownian motion
- The sampling theory of selectively neutral alleles
Cited in
(37)- Compton's method for proving logical limit laws
- Competition between discrete random variables, with applications to occupancy problems
- A logical approach to asymptotic combinatorics I. First order properties
- On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size
- Poisson-Dirichlet distribution with small mutation rate
- The characteristic polynomial of a random matrix
- Enumeration of decomposable combinatorial structures with restricted patterns
- Asymptotics of decomposable combinatorial structures of alg-log type with positive log exponent
- The number of components in a logarithmic combinatorial structure.
- Universality for random surfaces in unconstrained genus
- Almost sure local limit theorem for the Dickman distribution
- Simulating the component counts of combinatorial structures
- Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
- 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
- Periods of iterations of mappings over finite fields with restricted preimage sizes
- Oscillations for order statistics of some discrete processes
- The distribution of rare alleles
- The ubiquitous Ewens sampling formula
- Gibbs partitions: a comprehensive phase diagram
- Combinatorial logarithm and point-determining cographs
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- Classical and almost sure local limit theorems
- Limiting survival functions of self-similar structures
- Strong convergence on weakly logarithmic combinatorial assemblies
- Total variation approximation for random assemblies and a functional limit theorem
- A random mapping with preferential attachment
- scientific article; zbMATH DE number 7750678 (Why is no real title available?)
- On strong and almost sure local limit theorems for a probabilistic model of the Dickman distribution
- Approximation by the Dickman distribution and quasi-log arithmic combinatorial structures
- Logical limit laws for layered permutations and related structures
- When do combinatorial structures obey the Poisson-Dirichlet law?
- Limits of logarithmic combinatorial structures.
- Power laws for family sizes in a duplication model
- Asymptotics for logical limit laws: When the growth of the components is in an RT class
- Ewens sampling and invariable generation
- A product of invariant random permutations has the same small cycle structure as uniform
This page was built for publication: Limits of logarithmic combinatorial structures.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872161)
