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)- A generalized Watterson estimator for next-generation sequencing: from trios to autopolyploids
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance
- Moderate deviations for Poisson-Dirichlet distribution
- Hierarchical species sampling models
- One-dimensional distributions of subordinators with upper truncated Lévy measure, and applications
- Efficient generation of random derangements with the expected distribution of cycle lengths
- Size bias for one and all
- Limiting distributions of generalised Poisson-Dirichlet distributions based on negative binomial processes
- Weighted games of best choice
- Asymptotic enumeration and limit laws for multisets: the subexponential case
- Unlabelled Gibbs partitions
- Rényi 100, quantitative and qualitative (in)dependence
- Local probabilities and total variation distance for random permutations
- Monotonous subsequences and the descent process of invariant random permutations
- A view from the bridge spanning combinatorics and probability
- Arcsine laws for random walks generated from random permutations with applications to genomics
- The law of iterated logarithm for logarithmic combinatorial assemblies
- The Strassen law of iterated logarithm for combinatorial assemblies
- On the strange domain of attraction to generalized Dickman distributions for sums of independent random variables
- Feller coupling of cycles of permutations and Poisson spacings in inhomogeneous Bernoulli trials
- Limits of random tree-like discrete structures
- Weighted dependency graphs
- Ewens measures on compact groups and hypergeometric kernels
- Restrictive patterns of combinatorial structures via comparative analysis
- Stein's method for the Poisson-Dirichlet distribution and the Ewens sampling formula, with applications to Wright-Fisher models
- Split-and-merge in stationary random stirring on lattice torus
- Random graphs with forbidden vertex degrees
- Fundamentals of Stein's method
- Large genus asymptotic geometry of random square-tiled surfaces and of random multicurves
- Structural transition in random mappings
- Limit shape of random convex polygonal lines: even more universality
- Ergodicity of multiplicative statistics
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm
- On Consecutive Records in Certain Bernoulli Sequences
- Competition between discrete random variables, with applications to occupancy problems
- Asymptotics of discrete Schrödinger bridges via chaos decomposition
- Bin sizes in time-inhomogeneous infinite Polya processes
- Local probabilities for random permutations without long cycles
- A spatio-temporal point process model for particle growth
- Probabilistic divide-and-conquer: deterministic second half
- Limit distributions of smallest gap and largest repeated part in integer partitions
- A logical approach to asymptotic combinatorics I. First order properties
- On a limiting point process related to modified permutation matrices
- Boundaries from inhomogeneous Bernoulli trials
- Universality of the limit shape of convex lattice polygonal lines
- Regenerative compositions in the case of slow variation
- Random partitioning over a sparse contingency table
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Bayesian nonparametric estimators derived from conditional Gibbs structures
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
- On the number of eigenvalues of modified permutation matrices in mesoscopic intervals
- A note on the screaming toes game
- Size biased sampling from the Dickman subordinator
- Size distribution of the largest component of a random \(a\)-mapping
- A sharp inequality for the variance with respect to the Ewens sampling formula
- Asymptotic behavior of some factorizations of random words
- scientific article; zbMATH DE number 1995883 (Why is no real title available?)
- Random partitions and the gamma kernel
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- The characteristic polynomial of a random matrix
- Random mappings with constraints on the cycle lengths
- Limit theorems for the logarithm of the order of a random \(A\)-mapping
- The two-sided infinite extension of the Mallows model for random permutations
- Extreme sizes in Gibbs-type exchangeable random partitions
- The magical Ewens sampling formula
- Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case
- Lattice permutations and Poisson-Dirichlet distribution of cycle lengths
- Nicolaas Govert de Bruijn, the enchanter of friable integers
- Asymptotic statistics of cycles in surrogate-spatial permutations
- The number of components in a logarithmic combinatorial structure.
- Short cycles of random permutations with cycle weights: point processes approach
- Shannon information entropy, soliton clusters and Bose-Einstein condensation in log gravity
- Gaussian fluctuations of Young diagrams under the Plancherel measure
- Coherent random permutations with biased record statistics
- Permanental partition models and Markovian Gibbs structures
- A Turán-Kubilius inequality on mappings of a finite set
- Generalized Stirling permutations, families of increasing trees and urn models
- The Number of Two Consecutive Successes in a Hoppe-Pólya Urn
- Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
- Random permutation matrices under the generalized Ewens measure
- A study of counts of Bernoulli strings via conditional Poisson processes
- The Dickman subordinator, renewal theorems, and disordered systems
- Ancestral inference from haplotypes and mutations
- Simulating the component counts of combinatorial structures
- Independent process approximations for random combinatorial structures
- Probabilistic Methods in Combinatorial Analysis
- Asymptotic laws for compositions derived from transformed subordinators
- Moments of additive functions on random permutations
- The component counts of random functions
- Exact simulation of Poisson-Dirichlet distribution and generalised gamma process
- The Poisson distribution for linear statistics of random permutations
- The method of cumulants for the normal approximation
- Boltzmann distribution on ``short integer partitions with power parts: limit laws and sampling
- The hyperbolic geometry of random transpositions
- Limit theorems for the least common multiple of a random set of integers
- Recursive partition structures
- On the largest part size of low‐rank combinatorial assemblies
- Secular coefficients and the holomorphic multiplicative chaos
- Generalized Poisson--Dirichlet Distributions Based on the Dickman Subordinator
- Sharp bounds for the variance of linear statistics on random permutations
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)
