Limits of logarithmic combinatorial structures.
From MaRDI portal
Publication:1872161
DOI10.1214/AOP/1019160500zbMATH Open1044.60003OpenAlexW1965155608MaRDI QIDQ1872161FDOQ1872161
Authors: Richard Arratia, Simon Tavaré, A. D. Barbour 
Publication date: 6 May 2003
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1019160500
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
- On the rate of Poisson convergence
- The sampling theory of selectively neutral alleles
- Title not available (Why is that?)
- Gaussian limiting distributions for the number of components in combinatorial structures
- On some problems of a statistical group-theory. III
- Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I.
- Asymptotics of poisson approximation to random discrete distributions: an analytic approach
- Random permutations and Brownian motion
- A functional central limit theorem for random mappings
- Independent process approximations for random combinatorial structures
- Title not available (Why is that?)
- How random is the characteristic polynomial of a random matrix ?
- Order statistics for decomposable combinatorial structures
- Limits of logarithmic combinatorial structures.
- A functional central limit theorem for the Ewens sampling formula
- Title not available (Why is that?)
- On Poisson–Dirichlet Limits for Random Decomposable Combinatorial Structures
- On a class of differential-difference equations arising in number theory
- Random Matrices and Brownian Motion
- 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)
- A Rate for the Erdős-Turán Law
- On random polynomials over finite fields
- Title not available (Why is that?)
- Factorization in Fq[x] and Brownian Motion
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
- Periods of iterations of mappings over finite fields with restricted preimage sizes
- 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
- Oscillations for order statistics of some discrete processes
- The distribution of rare alleles
- Gibbs partitions: a comprehensive phase diagram
- The ubiquitous Ewens sampling formula
- Combinatorial logarithm and point-determining cographs
- Classical and almost sure local limit theorems
- Limiting survival functions of self-similar structures
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- Strong convergence on weakly logarithmic combinatorial assemblies
- A random mapping with preferential attachment
- Title not available (Why is that?)
- Total variation approximation for random assemblies and a functional limit theorem
- On strong and almost sure local limit theorems for a probabilistic model of the Dickman distribution
- Logical limit laws for layered permutations and related structures
- Approximation by the Dickman distribution and quasi-log arithmic combinatorial 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)
