Logarithmic combinatorial structures: A probabilistic approach
From MaRDI portal
(Redirected from Publication:1422444)
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
Cited in
(only showing first 100 items - show all)- An analytic method in probabilistic combinatorics
- Veneziano amplitudes, spin chains and abelian reduction of QCD
- Asymptotic value distribution of additive functions defined on the symmetric group
- A functional limit theorem on powers of random permutations
- A logical approach to asymptotic combinatorics I. First order properties
- The cycle structure of random permutations
- Independent process approximations for random combinatorial structures
- On rational structures and their asymptotics
- The collision spectrum of \(\Lambda\)-coalescents
- Ordered and size-biased frequencies in GEM and Gibbs' models for species sampling
- Genealogical properties of subsamples in highly fecund populations
- Local probabilities and total variation distance for random permutations
- When do combinatorial structures obey the Poisson-Dirichlet law?
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance
- Singularity analysis for heavy-tailed random variables
- Monotonous subsequences and the descent process of invariant random permutations
- On the number of eigenvalues of modified permutation matrices in mesoscopic intervals
- Limit theorems for the logarithm of the order of a random \(A\)-mapping
- On the strange domain of attraction to generalized Dickman distributions for sums of independent random variables
- Size bias for one and all
- Random combinatorial structures: the convergent case
- The ubiquitous Ewens sampling formula
- Limits of logarithmic combinatorial structures.
- The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations.
- The number of components in a logarithmic combinatorial structure.
- Conditional large and moderate deviations for sums of discrete random variables. Combinatoric applications
- Random permutation matrices under the generalized Ewens measure
- Marginals of multivariate Gibbs distributions with applications in Bayesian species sampling
- Weighted dependency graphs
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm
- Size distribution of the largest component of a random \(a\)-mapping
- Precise asymptotics of longest cycles in random permutations without macroscopic cycles
- 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
- Distance between natural numbers based on their prime signature
- Asymptotic behavior of the number of distinct values in a sample from the geometric stick-breaking process
- The characteristic polynomial of a random matrix
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Broadcasting on random recursive trees
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
- Moment characteristics of a random mapping with restrictions on component sizes
- The method of cumulants for the normal approximation
- The component counts of random functions
- The Feller coupling for random derangements
- Statistical enumeration of groups by double cosets
- Large genus asymptotic geometry of random square-tiled surfaces and of random multicurves
- A penalised model reproducing the mod-Poisson fluctuations in the Sathé-Selberg theorem
- Fifty years of theoretical population biology
- Developments in coalescent theory from single loci to chromosomes
- Limits of random tree-like discrete structures
- Split-and-merge in stationary random stirring on lattice torus
- How long is the convex minorant of a one-dimensional random walk?
- Convergence to scale-invariant Poisson processes and applications in Dickman approximation
- A product of invariant random permutations has the same small cycle structure as uniform
- Efficient generation of random derangements with the expected distribution of cycle lengths
- Limiting distributions of generalised Poisson-Dirichlet distributions based on negative binomial processes
- The component counts of random injections
- Hierarchical species sampling models
- Random permutations with logarithmic cycle weights
- Size biased sampling from the Dickman subordinator
- A sharp inequality for the variance with respect to the Ewens sampling formula
- The minimal observable clade size of exchangeable coalescents
- Rényi 100, quantitative and qualitative (in)dependence
- Stein's method for the Poisson-Dirichlet distribution and the Ewens sampling formula, with applications to Wright-Fisher models
- Asymptotic statistics of cycles in surrogate-spatial permutations
- The Dickman subordinator, renewal theorems, and disordered systems
- Malliavin and Dirichlet structures for independent random variables
- On the least common multiple of several random integers
- Dickman approximation in simulation, summations and perpetuities
- Looking-backward probabilities for Gibbs-type exchangeable random partitions
- On fluctuations of eigenvalues of random permutation matrices
- On the number of components of fixed size in a random \(A\)-mapping
- Central limit theorem for random partitions under the Plancherel measure
- Extreme sizes in Gibbs-type exchangeable random partitions
- Probabilistic divide-and-conquer: deterministic second half
- Distributions of linear functionals of two parameter Poisson-Dirichlet random measures
- Lattice permutations and Poisson-Dirichlet distribution of cycle lengths
- The characteristic polynomial of a random permutation matrix at different points
- A conjugate class of random probability measures based on tilting and with its posterior analysis
- Permanental partition models and Markovian Gibbs structures
- Beta-coalescents and continuous stable random trees
- The Poisson distribution for linear statistics of random permutations
- The law of iterated logarithm for logarithmic combinatorial assemblies
- The Strassen law of iterated logarithm for combinatorial assemblies
- Ewens' sampling formula and related formulae: combinatorial proofs, extensions to variable population size and applications to ages of alleles
- The hyperbolic geometry of random transpositions
- Asymptotic laws for compositions derived from transformed subordinators
- Asymptotic laws for regenerative compositions: gamma subordinators and the like
- Regenerative compositions in the case of slow variation
- An isoperimetric inequality for conjugation-invariant sets in the symmetric group
- Central limit theorem for multiplicative class functions on the symmetric group
- Mod-\(\phi\) convergence: approximation of discrete measures and harmonic analysis on the torus
- Random permutations without macroscopic cycles
- On smooth mesoscopic linear statistics of the eigenvalues of random permutation matrices
- Fisher's measure of variability in repeated samples
- Bin sizes in time-inhomogeneous infinite Polya processes
- Local probabilities for random permutations without long cycles
- Euler's constant: Euler's work and modern developments
- Approximate sampling formulae for general finite-alleles models of mutation
- The scaling window for a random graph with a given degree sequence
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)
