Independent process approximations for random combinatorial structures
From MaRDI portal
Publication:1328496
DOI10.1006/aima.1994.1022zbMath0802.60008arXiv1308.3279OpenAlexW2963534231MaRDI QIDQ1328496
Publication date: 12 December 1994
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3279
partitionspermutationsselectionsrecursionslarge deviation theorymultisetstotal variation distancesexistence of limiting processesheuristics for good approximationsmoment formulasnonuniform measuresrandom mapping functions
Related Items (40)
Size of the largest cluster under zero-range invariant measures ⋮ Limits of logarithmic combinatorial structures. ⋮ Independent sets of a given size and structure in the hypercube ⋮ DISTRIBUTION OF MULTIPLICATIVE FUNCTIONS DEFINED ON SEMIGROUPS ⋮ On the distribution for the duration of a randomized leader election algorithm ⋮ Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions ⋮ On a likely shape of the random Ferrers diagram ⋮ Large deviation results and applications to the generalized Cramér model ⋮ Ewens Sampling and Invariable Generation ⋮ The order of a typical matrix with entries in a finite field ⋮ Random set partitions: Asymptotics of subset counts ⋮ Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts ⋮ Asymptotics of random partitions of a set ⋮ Probabilistic divide-and-conquer: deterministic second half ⋮ Analytical depoissonization and its applications ⋮ Asymptotics of convex lattice polygonal lines with a constrained number of vertices ⋮ Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method ⋮ On the largest part size of low‐rank combinatorial assemblies ⋮ Limit shape of random convex polygonal lines: even more universality ⋮ Properties of the structure of random partitions of a finite set in parametric model;Свойства структуры случайных разбиений конечного множества в параметрической модели ⋮ Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example ⋮ Unnamed Item ⋮ Universality of the limit shape of convex lattice polygonal lines ⋮ The component counts of random injections ⋮ Local limit theorems for one class of distributions in probabilistic combinatorics ⋮ Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof ⋮ Size bias for one and all ⋮ Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws ⋮ Asymptotic formula for a partition function of reversible coagulation-fragmentation processes ⋮ Asymptotic results for weighted means of random variables which converge to a Dickman distribution, and some number theoretical applications ⋮ Gaussian fluctuations of Young diagrams under the Plancherel measure ⋮ Simulating the component counts of combinatorial structures ⋮ Rejoinder: The ubiquitous Ewens sampling formula ⋮ Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case ⋮ Limit Shapes via Bijections ⋮ The size of the largest antichain in the partition lattice ⋮ On the dependence of the component counting process of a uniform random variable ⋮ Random sampling of contingency tables via probabilistic divide-and-conquer ⋮ Cluster size distributions of economic agents of many types in a market ⋮ Phase transitions on Markovian bipartite graphs-an application of the zero-range process
This page was built for publication: Independent process approximations for random combinatorial structures
