Uniform sampling of fixed size polyominoes

DOI10.1007/S11009-025-10236-9MaRDI QIDQ6869314zbMATH OpenFDO

Authors David Coupier, Julien Gheysens, Nicolas Wicker

Publication date 22 January 2026

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11009-025-10236-9

zbMATH Keywords

Markov chainMonte-Carlo methodpolyominoesspeed of convergence

Mathematics Subject Classification ID

Combinatorial probability (60C05) Geometric probability and stochastic geometry (60D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Monte Carlo methods (65C05)

Cites work

• \(1/d\)-expansions for the free energy of weakly embedded site animal models of branched polymers
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Alternating-sign matrices and domino tilings. I
• An asymptotic lower bound on the number of polyominoes
• Asymptotic properties of some underdiagonal walks generation algorithms
• Cell Growth Problems
• Checker Boards and Polyominoes
• Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs
• Counting polyominoes: yet another attack
• Enumerations of lattice animals and trees
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Generating uniformly distributed random latin squares
• Greedy lattice animals. I: Upper bounds
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 718850 (Why is no real title available?)
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Improved upper bounds on the growth constants of polyominoes and polycubes
• Inversion relations, reciprocity and polyominoes
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• On the complexity of Jensen's algorithm for counting fixed polyominoes
• Perfect sampling on contingency tables with an application to SAGE data
• Polynomial time perfect sampling algorithm for two-rowed contingency tables
• Punctured polygons and polyominoes on the square lattice
• Random sampling of large planar maps and convex polyhedra
• Simulations of lattice animals and trees
• Statistics of lattice animals (polyominoes) and polygons
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• What do we know about the Metropolis algorithm?

This page was built for publication: Uniform sampling of fixed size polyominoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869314)