---
title: "Sampling Combinatorial Spaces Using Biased Random Walks"
authors:
  - "Jordan Erenrich"
  - "Bart Selman"
doi: ""
url: "https://ijcai.org/proceedings/2003/204"
pdf: "https://ijcai.org/proceedings/2003/0204.pdf"
venue: "Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence"
year: 2003
pages: "1376-1379"
track: ""
keywords:
---

# Sampling Combinatorial Spaces Using Biased Random Walks

Jordan Erenrich, Bart Selman

*Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence*, pages 1376-1379.

## Abstract

For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can state-of-the-art search procedures for SAT be used to sample effectively from the space of all solutions? And, if so, how uniformly do they sample? Our initial results find that on the positive side, one can find all solutions to a given instance. Nevertheless, sampling can be highly biased. This research provides a starting point for the development of more balanced procedures.