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)- Periods of iterations of mappings over finite fields with restricted preimage sizes
- The scaling window for a random graph with a given degree sequence
- Developments in coalescent theory from single loci to chromosomes
- On smooth mesoscopic linear statistics of the eigenvalues of random permutation matrices
- The component counts of random injections
- The two-parameter Poisson-Dirichlet point process
- Moment characteristics of a random mapping with restrictions on component sizes
- Marginals of multivariate Gibbs distributions with applications in Bayesian species sampling
- The ubiquitous Ewens sampling formula
- Gibbs partitions: a comprehensive phase diagram
- Evaluating the generalized Buchshtab function and revisiting the variance of the distribution of the smallest components of combinatorial objects
- A conjugate class of random probability measures based on tilting and with its posterior analysis
- Combinatorial logarithm and point-determining cographs
- On averages of randomized class functions on the symmetric groups and their asymptotics
- Multiple partition structures and harmonic functions on branching graphs
- Malliavin and Dirichlet structures for independent random variables
- On fluctuations of eigenvalues of random permutation matrices
- Discrete limit laws for additive functions on the symmetric group
- On the number of components of fixed size in a random \(A\)-mapping
- Veneziano amplitudes, spin chains and abelian reduction of QCD
- Record statistics of a strongly correlated time series: random walks and Lévy flights
- Permutations without long or short cycles
- Statistical enumeration of groups by double cosets
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- Asymptotic behavior of the number of distinct values in a sample from the geometric stick-breaking process
- Random combinatorial structures: the convergent case
- Precise asymptotics of longest cycles in random permutations without macroscopic cycles
- Distributions of linear functionals of two parameter Poisson-Dirichlet random measures
- An asymptotic sampling formula for the coalescent with recombination
- Renewal sequences and record chains related to multiple zeta sums
- The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations.
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- Classical and almost sure local limit theorems
- Multiplicative chaos of the Brownian loop soup
- The height of record‐biased trees
- Variance of a strongly additive function defined on random permutations
- scientific article; zbMATH DE number 3670386 (Why is no real title available?)
- A penalised model reproducing the mod-Poisson fluctuations in the Sathé-Selberg theorem
- Looking-backward probabilities for Gibbs-type exchangeable random partitions
- Central limit theorem for random partitions under the Plancherel measure
- Multiplicative arithmetic functions and the generalized Ewens measure
- A generalised Dickman distribution and the number of species in a negative binomial process model
- Beta-coalescents and continuous stable random trees
- Genealogical properties of subsamples in highly fecund populations
- The minimal observable clade size of exchangeable coalescents
- A martingale approach to Gaussian fluctuations and laws of iterated logarithm for Ewens-Pitman model
- scientific article; zbMATH DE number 6693372 (Why is no real title available?)
- Law of large numbers for the SIR epidemic on a random graph with given degrees
- Another view of sequential sampling in the birth process with immigration
- The component sizes of a critical random graph with given degree sequence
- Limit Theorems for Combinatorial Structures via Discrete Process Approximations
- Markov chains generating random permutations and set partitions
- Conditional large and moderate deviations for sums of discrete random variables. Combinatoric applications
- Strong convergence on weakly logarithmic combinatorial assemblies
- Asymptotic estimates for the number of permutations without short cycles
- Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws
- Random permutations without macroscopic cycles
- Counts of Failure Strings in Certain Bernoulli Sequences
- Total variation approximation for random assemblies and a functional limit theorem
- Connections Between Bernoulli Strings and Random Permutations
- scientific article; zbMATH DE number 7750678 (Why is no real title available?)
- Mod-\(\phi\) convergence: approximation of discrete measures and harmonic analysis on the torus
- The collision spectrum of \(\Lambda\)-coalescents
- A probabilistic interpretation of the Macdonald polynomials
- Euler's constant: Euler's work and modern developments
- Fifty years of theoretical population biology
- Approximation by the Dickman distribution and quasi-log arithmic combinatorial structures
- Minimal clade size in the Bolthausen-Sznitman coalescent
- Approximate sampling formulae for general finite-alleles models of mutation
- Effective bounds of the variance of statistics on multisets of necklaces
- The Bernoulli sieve revisited
- Coagulation Processes with Gibbsian Time Evolution
- Asymptotic results on Hoppe trees and their variations
- The cycle structure of random permutations
- Random permutations and queues
- A functional limit theorem on powers of random permutations
- Dickman approximation in simulation, summations and perpetuities
- Long cycle of random permutations with polynomially growing cycle weights
- Random cubic planar graphs
- Broadcasting on random recursive trees
- Functional limit theorems for the number of occupied boxes in the Bernoulli sieve
- Poisson Approximations for Sum of Bernoulli Random Variables and its Application to Ewens Sampling Formula
- A limit theorem for additive functions defined on the symmetric group
- Bounded size bias coupling: a gamma function bound, and universal Dickman-function behavior
- 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
- The Size of the Largest Part of Random Weighted Partitions of Large Integers
- The secretary problem with non-uniform arrivals via a left-to-right minimum exponentially tilted distribution
- On nested infinite occupancy scheme in random environment
- Block characters of the symmetric groups.
- When do combinatorial structures obey the Poisson-Dirichlet law?
- On the least common multiple of several random integers
- Concentration inequalities using approximate zero bias couplings with applications to Hoeffding’s statistic under the Ewens distribution
- Hahn polynomials and the Burnside process
- Stick-breaking processes, clumping, and Markov chain occupation laws
- Limit behavior of order statistics on cycle lengths of random \(A\)-permutations
- Construction of the beta distributions using the random permutation divisors
- Limits of logarithmic combinatorial structures.
- Stein's method using approximate zero bias couplings with applications to combinatorial central limit theorems under the Ewens distribution
- Distance between natural numbers based on their prime signature
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)
