Abstract
In this paper we present a new approach to uniform sampling and approximate counting. The presented method is called multisampling and is a generalization of the importance sampling technique. It has the same advantage as importance sampling, it is unbiased, but in contrary to it’s prototype it is also an almost uniform sampler. The approach seams to be as universal as Markov Chain Monte Carlo approach, but simpler. Here we report very promising test results of using multisampling to the following problems: counting matchings in graphs, counting colorings of graphs, counting independent sets in graphs, counting solutions to knapsack problem, counting elements in graph matroids and computing the partition function of the Ising model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barvinok, A.: Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor. Random Structures and Algorithms 14, 29–61 (1999)
Barvinok, A.: New Permanent Estimators Via Non-Commutative Determinants (preprint)
Beichl, I., Sullivan, F.: Approximating the Permanent via Importance Sampling with Application to Dimer Covering Problem. Journal of computational Physics 149, 1 (1999)
Chien, S., Rasmussen, L., Sinclair, A.: Clifford Algebras and Approximating the Permanent. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 712–721 (2001)
Dyer, M., Greenhill, C.: On Markov Chains for independent sets (1997) (preprint)
Feder, T., Mihail, M.: Balanced matroids. In: Proceedings of the 24th Annual ACM Symposium on the theory of Computing (STOC), pp. 26–38 (1992)
Frieze, A., Jerrum, M.: An analysis of a Monte Carlo algorithm for estimating the permanent. Combinatorica 15, 67–83 (1995)
Godsil, C.D., Gutman, I.: On the matching polynomial of a graph. In: Algebraic Methods in Graph Theory, Szeged (1978), vol. I, II, pp. 241–249. North-Holland, Amsterdam (1981)
Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM Journal on Computing 18, 1149–1178 (1989)
Jerrum, M., Sinclair, A.: Polynomial-time Approximation Algorithms for the Ising Model. SIAM Journal on Computing 22, 1087–1116 (1993)
Jerrum, M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures and Algorithms 7, 157–165 (1995)
Jerrum, M., Sinclair, A.: The Markov Chain Monte Carlo method: an approach to approximate counting and integration. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems. PWS (1996)
Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In: STOC (2000)
Karmarkar, N., Karp, R., Lipton, R., Lovász, L., Luby, M.: A Monte Carlo algorithm for estimating the permanent. SIAM Journal on Computing 22, 284–293 (1993)
Kaltofen, E., Villard, G.: On the complexity of computing determinants. In: Proc. Fifth Asian Symposium on Computer Mathematics (ASCM 2001), Singapore. Lecture Notes Series on Computing, vol. 9, pp. 13–27 (2001)
Rasmussen, L.E.: Approximating the Permanent: a Simple Approach. Random Structures Algorithms 5, 349–361 (1994)
Morris, B., Sinclair, A.: Random Walks on Truncated Cubes and Sampling 0−1 Kanpsack Solutions. In: Proceedings of the 40th IEEE Symposium on Fundations of Computer Science (FOCS), pp. 203–240 (1999)
Sankowski, P.: Alternative Algorithm for Counting All Matchings in Graphs. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 427–438. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sankowski, P. (2003). Multisampling: A New Approach to Uniform Sampling and Approximate Counting. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive