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)

• Moderate deviations for Poisson-Dirichlet distribution
• The law of iterated logarithm for logarithmic combinatorial assemblies
• The Strassen law of iterated logarithm for combinatorial assemblies
• Monotonous subsequences and the descent process of invariant random permutations
• Limits of random tree-like discrete structures
• Feller coupling of cycles of permutations and Poisson spacings in inhomogeneous Bernoulli trials
• Stein's method for the Poisson-Dirichlet distribution and the Ewens sampling formula, with applications to Wright-Fisher models
• Restrictive patterns of combinatorial structures via comparative analysis
• On Consecutive Records in Certain Bernoulli Sequences
• Competition between discrete random variables, with applications to occupancy problems
• Probabilistic divide-and-conquer: deterministic second half
• A logical approach to asymptotic combinatorics I. First order properties
• Regenerative compositions in the case of slow variation
• Random mappings with constraints on the cycle lengths
• Probabilistic Methods in Combinatorial Analysis
• Ancestral inference from haplotypes and mutations
• Simulating the component counts of combinatorial structures
• Moments of additive functions on random permutations
• Recursive partition structures
• Sharp bounds for the variance of linear statistics on random permutations
• The two-parameter Poisson-Dirichlet point process
• Record statistics of a strongly correlated time series: random walks and Lévy flights
• Discrete limit laws for additive functions on the symmetric group
• Veneziano amplitudes, spin chains and abelian reduction of QCD
• Asymptotic behavior of the number of distinct values in a sample from the geometric stick-breaking process
• Renewal sequences and record chains related to multiple zeta sums
• Genealogical properties of subsamples in highly fecund populations
• Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws
• Strong convergence on weakly logarithmic combinatorial assemblies
• Title not available (Why is that?)
• Connections Between Bernoulli Strings and Random Permutations
• Total variation approximation for random assemblies and a functional limit theorem
• Mod-\(\phi\) convergence: approximation of discrete measures and harmonic analysis on the torus
• The collision spectrum of \(\Lambda\)-coalescents
• Approximate sampling formulae for general finite-alleles models of mutation
• Approximation by the Dickman distribution and quasi-log arithmic combinatorial structures
• Long cycle of random permutations with polynomially growing cycle weights
• A functional limit theorem on powers of random permutations
• The Size of the Largest Part of Random Weighted Partitions of Large Integers
• A limit theorem for additive functions defined on the symmetric group
• When do combinatorial structures obey the Poisson-Dirichlet law?
• On nested infinite occupancy scheme in random environment
• Stein's method using approximate zero bias couplings with applications to combinatorial central limit theorems under the Ewens distribution
• On Approximations of Small Jumps of Subordinators with Particular Emphasis on a Dickman-Type Limit
• Asymptotic value distribution of additive functions defined on the symmetric group
• Asymptotic laws for regenerative compositions: gamma subordinators and the like
• A Note on Embedding Certain Bernoulli Sequences in Marked Poisson Processes
• On the order of random permutation with cycle weights
• Poisson-Dirichlet distribution for random Belyi surfaces
• A note on records in a random sequence
• Ordered and size-biased frequencies in GEM and Gibbs' models for species sampling
• Ewens' sampling formula and related formulae: combinatorial proofs, extensions to variable population size and applications to ages of alleles
• Binary sequential representations of random partitions
• One-dimensional distributions of subordinators with upper truncated Lévy measure, and applications
• Random permutations with logarithmic cycle weights
• Singularity analysis for heavy-tailed random variables
• Weighted games of best choice
• Hierarchical species sampling models
• 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
• 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
• 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

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)