Probabilistic divide-and-conquer: deterministic second half

DOI10.1016/j.aam.2017.06.005zbMath1375.65084arXiv1411.6698OpenAlexW2962856370MaRDI QIDQ2407388

Stephen DeSalvo

Publication date: 29 September 2017

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6698

zbMATH Keywords

random sampling algorithmprobabilistic divide-and-conquer method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15)

Related Items (7)

Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method ⋮ On the largest part size of low‐rank combinatorial assemblies ⋮ Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example ⋮ On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size ⋮ Limit Shapes via Bijections ⋮ Random sampling of contingency tables via probabilistic divide-and-conquer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions
• Log-concavity of the partition function
• The cycle structure of random permutations
• Poisson process approximations for the Ewens sampling formula
• A method and two algorithms on the theory of partitions
• Sur les entiers n pour lesquels il y à beaucoup de groupes abéliens d'ordre \(n\)
• Uniform random generation of decomposable structures using floating-point arithmetic
• Independent process approximations for random combinatorial structures
• Uniform generation of a Motzkin word
• Random set partitions: Asymptotics of subset counts
• Logarithmic combinatorial structures: A probabilistic approach
• Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
• A probabilistic approach to the geometry of the \(\ell^n_p\)-ball
• Bounds for Kac's master equation
• A linear algorithm for the random sampling from regular languages
• The sampling theory of selectively neutral alleles
• Random Sampling of Plane Partitions
• Permutohedra, Associahedra, and Beyond
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• An alternate development of conditioning
• The Structure of Random Partitions of Large Integers
• Conditioning as disintegration
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Efficient implementation of the Hardy–Ramanujan–Rademacher formula
• Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example
• Small Ball Probability, Inverse Theorems, and Applications
• Ordered Cycle Lengths in a Random Permutation
• Asymptotic properties of eulerian numbers
• A problem of the Allocation of Particles in Cells and Cycles of Random Permutations
• On the Partition Function p (n )
• On the Remainders and Convergence of the Series for the Partition Function
• An Inequality
• The fundamental limit theorems in probability
• Probability

This page was built for publication: Probabilistic divide-and-conquer: deterministic second half