Logarithmic combinatorial structures: A probabilistic approach

DOI10.4171/000zbMATH Open1040.60001OpenAlexW1489554514MaRDI QIDQ1422444FDOQ1422444

Authors: Richard Arratia, Simon Tavaré, A. D. Barbour 

Publication date: 15 February 2004

Published in: EMS Monographs in Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6c4bda4f818761a4479c95e332f3aa0c5ad3c299

Recommendations

• The number of components in a logarithmic combinatorial structure.
• The cycle structure of random permutations
• Limits of logarithmic combinatorial structures.
• Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes
• Limit Theorems for Combinatorial Structures via Discrete Process Approximations

zbMATH Keywords

permutationsfinite fieldstotal variation distanceEwens sampling formulaPoisson-Dirichlet distributionGEM distributiondecomposable combinatorial structures

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Geometric probability and stochastic geometry (60D05) Umbral calculus (05A40) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)

Cited In (only showing first 100 items - show all)

• Limiting distributions of generalised Poisson-Dirichlet distributions based on negative binomial processes
• Arcsine laws for random walks generated from random permutations with applications to genomics
• Rényi 100, quantitative and qualitative (in)dependence
• Monotonous subsequences and the descent process of invariant random permutations
• On the strange domain of attraction to generalized Dickman distributions for sums of independent random variables
• Weighted dependency graphs
• Random graphs with forbidden vertex degrees
• Split-and-merge in stationary random stirring on lattice torus
• Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm
• A note on the screaming toes game
• Asymptotic behavior of some factorizations of random words
• One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
• Size biased sampling from the Dickman subordinator
• A sharp inequality for the variance with respect to the Ewens sampling formula
• Size distribution of the largest component of a random \(a\)-mapping
• The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
• 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
• Lattice permutations and Poisson-Dirichlet distribution of cycle lengths
• Asymptotic statistics of cycles in surrogate-spatial permutations
• Variance of additive functions defined on random assemblies
• A Turán-Kubilius inequality on mappings of a finite set
• The number of components in a logarithmic combinatorial structure.
• The Dickman subordinator, renewal theorems, and disordered systems
• Exact simulation of Poisson-Dirichlet distribution and generalised gamma process
• The component counts of random functions
• The method of cumulants for the normal approximation
• Limit theorems for the least common multiple of a random set of integers
• The hyperbolic geometry of random transpositions
• Developments in coalescent theory from single loci to chromosomes
• The component counts of random injections
• Moment characteristics of a random mapping with restrictions on component sizes
• A conjugate class of random probability measures based on tilting and with its posterior analysis
• Malliavin and Dirichlet structures for independent random variables
• On the number of components of fixed size in a random \(A\)-mapping
• Statistical enumeration of groups by double cosets
• Precise asymptotics of longest cycles in random permutations without macroscopic cycles
• A penalised model reproducing the mod-Poisson fluctuations in the Sathé-Selberg theorem
• The minimal observable clade size of exchangeable coalescents
• Conditional large and moderate deviations for sums of discrete random variables. Combinatoric applications
• Random permutations without macroscopic cycles
• Fifty years of theoretical population biology
• Random permutations and queues
• Asymptotic results on Hoppe trees and their variations
• Dickman approximation in simulation, summations and perpetuities
• Poisson Approximations for Sum of Bernoulli Random Variables and its Application to Ewens Sampling Formula
• Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers
• On the dependence of the component counting process of a uniform random variable
• On the least common multiple of several random integers
• Distance between natural numbers based on their prime signature
• The Feller coupling for random derangements
• How long is the convex minorant of a one-dimensional random walk?
• A product of invariant random permutations has the same small cycle structure as uniform
• Convergence to scale-invariant Poisson processes and applications in Dickman approximation
• Efficient generation of random derangements with the expected distribution of cycle lengths
• Size bias for one and all
• Local probabilities and total variation distance for random permutations
• Ewens measures on compact groups and hypergeometric kernels
• Large genus asymptotic geometry of random square-tiled surfaces and of random multicurves
• Fundamentals of Stein's method
• Structural transition in random mappings
• Limit shape of random convex polygonal lines: even more universality
• Ergodicity of multiplicative statistics
• Boundaries from inhomogeneous Bernoulli trials
• Bin sizes in time-inhomogeneous infinite Polya processes
• Local probabilities for random permutations without long cycles
• Limit distributions of smallest gap and largest repeated part in integer partitions
• Universality of the limit shape of convex lattice polygonal lines
• Random partitioning over a sparse contingency table
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• On the number of eigenvalues of modified permutation matrices in mesoscopic intervals
• Bayesian nonparametric estimators derived from conditional Gibbs structures
• Random partitions and the gamma kernel
• The characteristic polynomial of a random matrix
• The two-sided infinite extension of the Mallows model for random permutations
• Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case
• Nicolaas Govert de Bruijn, the enchanter of friable integers
• Gaussian fluctuations of Young diagrams under the Plancherel measure
• The Number of Two Consecutive Successes in a Hoppe-Pólya Urn
• Coherent random permutations with biased record statistics
• Generalized Stirling permutations, families of increasing trees and urn models
• A study of counts of Bernoulli strings via conditional Poisson processes
• Random permutation matrices under the generalized Ewens measure
• Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
• Independent process approximations for random combinatorial structures
• Asymptotic laws for compositions derived from transformed subordinators
• On the largest part size of low‐rank combinatorial assemblies
• Periods of iterations of mappings over finite fields with restricted preimage sizes
• The scaling window for a random graph with a given degree sequence
• On smooth mesoscopic linear statistics of the eigenvalues of random permutation matrices
• Marginals of multivariate Gibbs distributions with applications in Bayesian species sampling
• The ubiquitous Ewens sampling formula
• Combinatorial logarithm and point-determining cographs
• On averages of randomized class functions on the symmetric groups and their asymptotics
• On fluctuations of eigenvalues of random permutation matrices
• Permutations without long or short cycles
• Distributions of linear functionals of two parameter Poisson-Dirichlet random measures
• Random combinatorial structures: the convergent case
• An asymptotic sampling formula for the coalescent with recombination

This page was built for publication: Logarithmic combinatorial structures: A probabilistic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422444)