×

Approximate counting, uniform generation and rapidly mixing Markov chains. (English) Zbl 0668.05060

The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique based on the simulation of ergodic Markov chains, it is shown that, for self-reducible structures, almost uniform generation is possible in polynomial time provided only that randomized approximate counting to within some arbitrary polynomial factor is possible in polynomial time. It follows that, for self-reducible structures, polynomial time randomized algorithms for counting to within factors of the form \((1+n^{-\beta})\) are available either for all \(\beta\in {\mathbb{R}}\) or for no \(\beta\in {\mathbb{R}}\). A substantial part of the paper is devoted to investigating the rate of convergence of finite ergodic Markov chains, and a simple but powerful characterization of rapid convergence for a broad class of chains based on a structural property of the underlying graph is established. Finally, the general techniques of the paper are used to derive an almost uniform generation procedure for labelled graphs with a given degree sequence which is valid over a much wider range of degrees than previous methods: this in turn leads to randomized approximate counting algorithms for these graphs with very good asymptotic behaviour.

MSC:

05C99 Graph theory
60J10 Markov chains (discrete-time Markov processes on discrete state spaces)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aldous, D., Random walks on finite groups and rapidly mixing Markov chains, (Séminaire de Probabilités XVII. Séminaire de Probabilités XVII, Lecture Notes in Mathematics, Vol. 986 (1981), Springer-Verlag: Springer-Verlag New York/Berlin), 243-297
[2] Aldous, D., On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing, Prob. Engrg. Inform. Sci., 1, 33-46 (1987) · Zbl 1133.60327
[3] Aldous, D.; Diaconis, P., Shuffling cards and stopping times, Amer. Math. Monthly, 93, 333-348 (1986) · Zbl 0603.60006
[4] Aldous, D.; Diaconis, P., Strong uniform times and finite random walks, Adv. in Appl. Math., 8, 69-97 (1987) · Zbl 0631.60065
[5] Alon, N., Eigenvalues and expanders, Combinatorica, 6, 83-96 (1986) · Zbl 0661.05053
[6] Alon, N.; Milman, V. D., \(λ_1\), isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B, 38, 73-88 (1985) · Zbl 0549.05051
[7] Bach, E., How to generate random integers with known factorisation, (Proceedings 15th ACM Symposium on Theory of Computing (1983)), 184-188
[8] Binder, K., Monte Carlo investigations of phase transitions and critical phenomena, (Domb, C.; Green, M. S., Phase Transitions and Critical Phenomena, Vol. 5b (1976), Academic Press: Academic Press London), 1-105
[9] Bollobás, B., A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J. Combin., 1, 311-316 (1980) · Zbl 0457.05038
[10] Bollobás, B., (Random Graphs (1985), Academic Press: Academic Press London)
[11] Broder, A. Z., How hard is it to marry at random? (On the approximation of the permanent), (Proceedings, 18th ACM Symposium on Theory of Computing (1986)), 50-58, see also Erratum in “Proceedings, 20th ACM Symposium on Theory of Computing, 1988,” p. 551
[12] Cai, J.-y.; Hemachandra, L. A., (Exact Counting Is as Easy as Approximate Counting (1986), Department of Computer Science, Cornell University), Technical Report TR 86-761
[13] Cheeger, J., A lower bound for the smallest eigenvalue of the Laplacian, (Gunning, R. C., Problems in Analysis (1970), Princeton University Press: Princeton University Press New Jersey), 195-199 · Zbl 0212.44903
[14] Dodziuk, J., Difference equations, isoperimetric inequality and transience of certain random walks, Trans. Amer. Math. Soc., 284, 787-794 (1984) · Zbl 0512.39001
[15] Feller, W., (An Introduction to Probability Theory and Its Applications, Vol. I (1968), Wiley: Wiley New York) · Zbl 0155.23101
[16] Garey, M. R.; Johnson, D. S., (Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman: Freeman San Francisco) · Zbl 0411.68039
[17] Gill, J., Computational complexity of probabilistic Turing machines, SIAM J. Comput., 6, 675-695 (1977) · Zbl 0366.02024
[18] Guénoche, A., Random spanning tree, J. Algorithms, 4, 214-220 (1983) · Zbl 0521.68073
[19] Jerrum, M. R.; Sinclair, A. J., Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved, (Proceedings, 20th ACM Symposium on Theory of Computing (1988)), 235-244
[20] Jerrum, M. R.; Valiant, L. G.; Vazirani, V. V., Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci., 43, 169-188 (1986) · Zbl 0597.68056
[21] Karp, R. M.; Luby, M., Monte-Carlo algorithms for enumeration and reliability problems, (Proceedings, 24th IEEE Symposium on Foundations of Computer Science (1983)), 56-64 · Zbl 0596.90033
[22] Keilson, J., (Markov Chain Models—Rarity and Exponentiality (1979), Springer-Verlag: Springer-Verlag New York) · Zbl 0411.60068
[23] Kirkpatrick, S.; Gellatt, C. D.; Vecchi, M. P., Optimisation by simulated annealing, Science, 220, 671-680 (1983) · Zbl 1225.90162
[24] Kolmogorov, A. N.; Fomin, S. V., (Introductory Real Analysis (1970), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ)
[25] Lawler, G. F.; Sokal, A. D., Bounds on the \(L^2\) spectrum for Markov chains and Markov processes: A generalization of Cheeger’s inequality, Trans. Amer. Math. Soc., 309, 557-580 (1988) · Zbl 0716.60073
[26] McKay, B. D., Asymptotics for symmetric 0-1 matrices with prescribed row sums, Ars Combin., 19A, 15-25 (1985) · Zbl 0568.05032
[27] Nijenhuis, A.; Wilf, H. S., (Combinatorial Algorithms (1978), Academic Press: Academic Press Orlando, FL) · Zbl 0476.68047
[28] Schnorr, C. P., Optimal algorithms for self-reducible problems, (Proceedings, 3rd International Colloquium on Automata, Languages and Programming (1976)), 322-337
[29] Seneta, E., (Non-negative Matrices and Markov Chains (1981), Spring-Verlag: Spring-Verlag New York) · Zbl 0471.60001
[30] Sinclair, A. J., Randomised Algorithms for Counting and Generating Combinatorial Structures, (Ph.D. thesis (1988), University of Edinburgh)
[31] Stockmeyer, L., The polynomial-time hierarchy, Theoret. Comput. Sci., 3, 1-22 (1977) · Zbl 0353.02024
[32] Stockmeyer, L., The complexity of approximate counting, (Proceedings, 15th ACM Symposium on Theory of Computing (1983)), 118-126
[33] Tinhofer, G., On the generation of random graphs with given properties and known distribution, Appl. Comput. Sci., Ber. Prakt. Inf., 13, 265-297 (1979) · Zbl 0421.05064
[34] Valiant, L. G., The complexity of computing the permanent, Theoret. Comput. Sci., 8, 189-201 (1979) · Zbl 0415.68008
[35] Valiant, L. G., The complexity of enumeration and reliability problems, SIAM J. Comput., 8, 410-421 (1979) · Zbl 0419.68082
[36] Wilf, H. S., The uniform selection of free trees, J. Algorithms, 2, 204-207 (1981)
[37] Wormald, N. C., Generating random regular graphs, J. Algorithms, 5, 247-280 (1984) · Zbl 0543.68048
[38] Wormald, N. C., Generating random unlabelled graphs, SIAM J. Comput., 16, 717-727 (1987) · Zbl 0634.68067
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.