Approximate Counting via Markov Chains
Aldous, David
Statist. Sci., Tome 8 (1993) no. 4, p. 16-19 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
For large finite sets where there is no explicit formula for the size, one can often devise a randomized algorithm that approximately counts the size by simulating Markov chains on the set and on recursively defined subsets.
Publié le : 1993-02-14
Classification:  Approximate counting,  Markov times,  mixing times 
@article{1177011078,
     author = {Aldous, David},
     title = {Approximate Counting via Markov Chains},
     journal = {Statist. Sci.},
     volume = {8},
     number = {4},
     year = {1993},
     pages = { 16-19},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1177011078}
}

Aldous, David. Approximate Counting via Markov Chains. Statist. Sci., Tome 8 (1993) no. 4, pp.  16-19. http://gdmltest.u-ga.fr/item/1177011078/