scientific article; zbMATH DE number 7650121

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.54MaRDI QIDQ5875513

Dana Randall, Cem Gokmen, Joshua J. Daymude, Sarah M. Cannon, Andréa W. Richa

Publication date: 3 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov chainscluster expansionprogrammable matter

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items

The canonical amoebot model: algorithms and concurrency control

Uses Software

• AmoebotSim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics and complexity of partition functions
• Computing the partition function for graph homomorphisms with multiplicities
• On the mixing time of the 2D stochastic Ising model with ``Plus boundary conditions at low temperature
• Cluster expansion for abstract polymer models
• A stochastic approach to shortcut bridging in programmable matter
• Self-organized segregation on the grid
• Quasi-polynomial mixing of the 2D stochastic Ising model with ``plus boundary up to criticality
• Dynamic models of segregation†
• Clustering in Interfering Binary Mixtures
• Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals
• Beitrag zur Theorie des Ferromagnetismus
• Algorithmic Pirogov-Sinai theory
• Algorithms for #BIS-hard problems on expander graphs
• A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
• Statistical Mechanics of Lattice Systems
• Clustering and Mixing Times for Segregation Models on ℤ²
• Monte Carlo sampling methods using Markov chains and their applications
• The Statistical Mechanics of Condensing Systems. I
• Counting Independent Sets and Colorings on Random Regular Bipartite Graphs