Results 1 
7 of
7
An Optimal Algorithm for Monte Carlo Estimation
, 1995
"... A typical approach to estimate an unknown quantity is to design an experiment that produces a random variable Z distributed in [0; 1] with E[Z] = , run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a ..."
Abstract

Cited by 53 (4 self)
 Add to MetaCart
A typical approach to estimate an unknown quantity is to design an experiment that produces a random variable Z distributed in [0; 1] with E[Z] = , run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a priori information about Z is known except that is distributed in [0; 1]. We describe an approximation algorithm AA which, given ffl and ffi, when running independent experiments with respect to any Z, produces an estimate that is within a factor 1 + ffl of with probability at least 1 \Gamma ffi. We prove that the expected number of experiments run by AA (which depends on Z) is optimal to within a constant factor for every Z. An announcement of these results appears in P. Dagum, D. Karp, M. Luby, S. Ross, "An optimal algorithm for MonteCarlo Estimation (extended abstract)", Proceedings of the Thirtysixth IEEE Symposium on Foundations of Computer Science, 1995, pp. 142149 [3]. Section ...
Markov Chains and Polynomial time Algorithms
, 1994
"... This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing ..."
Abstract

Cited by 48 (0 self)
 Add to MetaCart
This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets.
The Numbers Of Spanning Trees, Hamilton Cycles And Perfect Matchings In A Random Graph
"... The numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph Gnm are shown to be asymptotically normal if m is neither too large nor too small. At the lower limit m n 3=2 , these numbers are asymptotically lognormal. For Gnp , the numbers are asymptotically lognormal f ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
The numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph Gnm are shown to be asymptotically normal if m is neither too large nor too small. At the lower limit m n 3=2 , these numbers are asymptotically lognormal. For Gnp , the numbers are asymptotically lognormal for a wide range of p, including p constant. The same results are obtained for random directed graphs and bipartite graphs. The results are proved using decomposition and projection methods.
Approximating the Number of MonomerDimer Coverings of a Lattice
 Journal of Statistical Physics
, 1996
"... The paper studies the problem of counting the number of coverings of a ddimensional rectangular lattice by a specified number of monomers and dimers. This problem arises in several models in statistical physics, and has been widely studied. A classical technique due to Fisher, Kasteleyn and Temper ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
The paper studies the problem of counting the number of coverings of a ddimensional rectangular lattice by a specified number of monomers and dimers. This problem arises in several models in statistical physics, and has been widely studied. A classical technique due to Fisher, Kasteleyn and Temperley solves the problem exactly in two dimensions when the number of monomers is zero (the dimer covering problem), but is not applicable in higher dimensions or in the presence of monomers. This paper presents the first provably polynomial time approximation algorithms for computing the number of coverings with any specified number of monomers in ddimensional rectangular lattices with periodic boundaries, for any fixed dimension d , and in twodimensional lattices with fixed boundaries. The algorithms are based on Monte Carlo simulation of a suitable Markov chain, and, in contrast to most Monte Carlo algorithms in statistical physics, have rigorously derived performance guarantees that do n...
Coupling vs. Conductance for the JerrumSinclair Chain
, 1999
"... We address the following question: is the Causal Coupling method as strong as the Conductance method in showing rapid mixing of Markov Chains? A causal coupling is a coupling which uses only past and present information, but not information about the future. We answer the above question in the negat ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We address the following question: is the Causal Coupling method as strong as the Conductance method in showing rapid mixing of Markov Chains? A causal coupling is a coupling which uses only past and present information, but not information about the future. We answer the above question in the negative by showing that there exists a bipartite graph G such that any causal coupling argument on the JerrumSinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect matchings of G must necessarily take time exponential in the number of vertices in G. In contrast, the above Markov chain on G has been shown to mix in polynomial time using conductance arguments. An extended abstract of this work appeared in the Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999.
Counting in Lattices: Combinatorial Problems from Statistical Mechanics
, 1994
"... In this thesis we consider two classical combinatorial problems arising in statistical mechanics: counting matchings and selfavoiding walks in lattice graphs. The first problem arises in the study of the thermodynamical properties of monomers and dimers (diatomic molecules) in crystals. Fisher, Kas ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this thesis we consider two classical combinatorial problems arising in statistical mechanics: counting matchings and selfavoiding walks in lattice graphs. The first problem arises in the study of the thermodynamical properties of monomers and dimers (diatomic molecules) in crystals. Fisher, Kasteleyn and Temperley discovered an elegant technique to exactly count the number of perfect matchings in two dimensional lattices, but it is not applicable for matchings of arbitrary size, or in higher dimensional lattices. We present the first efficient approximation algorithm for computing the number of matchings of any size in any periodic lattice in arbitrary dimension. The algorithm is based on Monte Carlo simulation of a suitable Markov chain and has rigorously derived performance guarantees that do not rely on any assumptions. In addition, we show that these results generalize to counting matchings in any graph which is the Cayley graph of a finite group. The second problem is countin...
Counting the number of Hamilton cycles in random digraphs, Random Struct. Alg
, 1992
"... We show that there exists a a fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs. 1 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We show that there exists a a fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs. 1