IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v19y2017i1d10.1007_s11009-015-9457-4.html
   My bibliography  Save this article

Stochastic Enumeration Method for Counting Trees

Author

Listed:
  • Radislav Vaisman

    (The University of Queensland)

  • Dirk P. Kroese

    (The University of Queensland)

Abstract

The problem of estimating the size of a backtrack tree is an important but hard problem in the computational sciences. An efficient solution of this problem can have a major impact on the hierarchy of complexity classes. The first randomized procedure, which repeatedly generates random paths through the tree, was introduced by Knuth. Unfortunately, as was noted by Knuth and a few other researchers, the estimator can introduce a large variance and become ineffective in the sense that it underestimates the cost of the tree. Recently, a new sequential algorithm called Stochastic Enumeration (SE) method was proposed by Rubinstein et al. The authors showed numerically that this simple algorithm can be very efficient for handling different counting problems, such as counting the number of satisfiability assignments and enumerating the number of perfect matchings in bipartite graphs. In this paper we introduce a rigorous analysis of SE and show that it results in significant variance reduction as compared to Knuth’s estimator. Moreover, we establish that for almost all random trees the SE algorithm is a fully polynomial time randomized approximation scheme (FPRAS) for the estimation of the overall tree size.

Suggested Citation

  • Radislav Vaisman & Dirk P. Kroese, 2017. "Stochastic Enumeration Method for Counting Trees," Methodology and Computing in Applied Probability, Springer, vol. 19(1), pages 31-73, March.
    • Handle: RePEc:spr:metcap:v:19:y:2017:i:1:d:10.1007_s11009-015-9457-4
    DOI: 10.1007/s11009-015-9457-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-015-9457-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-015-9457-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Reuven Rubinstein, 2009. "The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling," Methodology and Computing in Applied Probability, Springer, vol. 11(4), pages 491-549, December.
    2. Yuguo Chen & Junyi Xie & Jun S. Liu, 2005. "Stopping‐time resampling for sequential Monte Carlo methods," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(2), pages 199-217, April.
    3. Zdravko I. Botev & Dirk P. Kroese, 2008. "An Efficient Algorithm for Rare-event Probability Estimation, Combinatorial Optimization, and Counting," Methodology and Computing in Applied Probability, Springer, vol. 10(4), pages 471-505, December.
    4. Yuguo Chen & Persi Diaconis & Susan P. Holmes & Jun S. Liu, 2005. "Sequential Monte Carlo Methods for Statistical Analysis of Tables," Journal of the American Statistical Association, American Statistical Association, vol. 100, pages 109-120, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alathea Jensen, 2018. "Stochastic Enumeration with Importance Sampling," Methodology and Computing in Applied Probability, Springer, vol. 20(4), pages 1259-1284, December.
    2. Radislav Vaisman & Ilya B. Gertsbakh, 2023. "Optimal balanced chain decomposition of partially ordered sets with applications to operating cost minimization in aircraft routing problems," Public Transport, Springer, vol. 15(1), pages 199-225, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Radislav Vaisman & Ofer Strichman & Ilya Gertsbakh, 2015. "Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 406-415, May.
    2. Ian Dinwoodie & Kruti Pandya, 2015. "Exact tests for singular network data," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 67(4), pages 687-706, August.
    3. Francesco Bartolucci & Claudia Pigini & Francesco Valentini, 2024. "MCMC conditional maximum likelihood for the two-way fixed-effects logit," Econometric Reviews, Taylor & Francis Journals, vol. 43(6), pages 379-404, July.
    4. Clemens Draxler, 2018. "Bayesian conditional inference for Rasch models," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 102(2), pages 245-262, April.
    5. Sanda Micula, 2015. "Statistical Computer Simulations And Monte Carlo Methods," Romanian Economic Business Review, Romanian-American University, vol. 9(2), pages 384-394, December.
    6. Reuven Rubinstein, 2013. "Stochastic Enumeration Method for Counting NP-Hard Problems," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 249-291, June.
    7. M. Garvels, 2011. "A combined splitting—cross entropy method for rare-event probability estimation of queueing networks," Annals of Operations Research, Springer, vol. 189(1), pages 167-185, September.
    8. Drew Creal, 2012. "A Survey of Sequential Monte Carlo Methods for Economics and Finance," Econometric Reviews, Taylor & Francis Journals, vol. 31(3), pages 245-296.
    9. Reuven Rubinstein, 2010. "Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms Do Not Work and How to Make them Work," Methodology and Computing in Applied Probability, Springer, vol. 12(1), pages 1-50, March.
    10. Dyer, Martin & Greenhill, Catherine & Kleer, Pieter & Ross, James & Stougie, Leen, 2021. "Sampling hypergraphs with given degrees," Other publications TiSEM 2d323767-8066-4c28-92cc-b, Tilburg University, School of Economics and Management.
    11. Reuven Rubinstein, 2009. "The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling," Methodology and Computing in Applied Probability, Springer, vol. 11(4), pages 491-549, December.
    12. Paul Dupuis & Bahar Kaynar & Ad Ridder & Reuven Rubinstein & Radislav Vaisman, 2011. "Counting with Combined Splitting and Capture-Recapture Methods," Tinbergen Institute Discussion Papers 11-062/4, Tinbergen Institute.
    13. Kleijnen, Jack P.C. & Ridder, A.A.N. & Rubinstein, R.Y., 2010. "Variance Reduction Techniques in Monte Carlo Methods," Other publications TiSEM 87680d1a-53c1-4107-ada4-7, Tilburg University, School of Economics and Management.
    14. Christophe Andrieu & Arnaud Doucet & Roman Holenstein, 2010. "Particle Markov chain Monte Carlo methods," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 72(3), pages 269-342, June.
    15. Zhang, Linjun & Small, Michael & Judd, Kevin, 2015. "Exactly scale-free scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 433(C), pages 182-197.
    16. Jing Xi & Ruriko Yoshida & David Haws, 2013. "Estimating the number of zero-one multi-way tables via sequential importance sampling," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 65(4), pages 763-783, August.
    17. Stephen DeSalvo & James Zhao, 2020. "Random sampling of contingency tables via probabilistic divide-and-conquer," Computational Statistics, Springer, vol. 35(2), pages 837-869, June.
    18. Ogawa, Mitsunori & Takemura, Akimichi, 2012. "Markov bases for typical block effect models of two-way contingency tables," Journal of Multivariate Analysis, Elsevier, vol. 112(C), pages 219-229.
    19. Hao Ma & Henk A. P. Blom, 2022. "Random Assignment Versus Fixed Assignment in Multilevel Importance Splitting for Estimating Stochastic Reach Probabilities," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 2313-2338, December.
    20. Ali Eshragh & Jerzy Filar & Michael Haythorpe, 2011. "A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem," Annals of Operations Research, Springer, vol. 189(1), pages 103-125, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:19:y:2017:i:1:d:10.1007_s11009-015-9457-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.