The authors describe a simple and general algorithm to calculate series expansions in enumeration problems to large orders approximately by a Monte Carlo method. It can be used to generate unbiased samples in cluster studies, e.g. linear or branched polymers, random surfaces, etc., in any dimension. They calculate the number of site animals of size n on the square lattice for n < or= 50 and their average size to better than 1% accuracy
RESUMEN: Se ha implementado un esquema de Montecarlo apto para la determinación de los coeficientes ...
Abstract. We discuss uniform sampling algorithms that are based on stochastic growth methods, using ...
Conventional Monte Carlo tallies are well suited for estimating integral quantities over large volum...
We describe an algorithm for the Rosenbluth Monte Carlo enumeration of clusters and lattice animals....
We have developed an improved algorithm that allows us to enumerate the number of site animals on th...
For functions with power-law singularities we consider series expansions whose coefficients have bee...
based on Markov chain simulation have been in use for many years. The validity of these algorithms d...
The Monte Carlo method is a broad class of random sampling techniques. One facet of its power arises...
We have developed an improved algorithm that allows us to enumerate the number of site animals (poly...
We present a simple but very general Monte-Carlo technique for the approximate solution of enumerati...
AbstractA direct Monte Carlo method for volume estimation of star-shaped or convex domains is presen...
Monte Carlo methods form an experimental branch of mathematics that employs simulations driven by ra...
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling o...
For functions with power-law singularities we consider series expansions whose coefficients have bee...
his paper will trace the history and development of a useful stochastic method for approximating cer...
RESUMEN: Se ha implementado un esquema de Montecarlo apto para la determinación de los coeficientes ...
Abstract. We discuss uniform sampling algorithms that are based on stochastic growth methods, using ...
Conventional Monte Carlo tallies are well suited for estimating integral quantities over large volum...
We describe an algorithm for the Rosenbluth Monte Carlo enumeration of clusters and lattice animals....
We have developed an improved algorithm that allows us to enumerate the number of site animals on th...
For functions with power-law singularities we consider series expansions whose coefficients have bee...
based on Markov chain simulation have been in use for many years. The validity of these algorithms d...
The Monte Carlo method is a broad class of random sampling techniques. One facet of its power arises...
We have developed an improved algorithm that allows us to enumerate the number of site animals (poly...
We present a simple but very general Monte-Carlo technique for the approximate solution of enumerati...
AbstractA direct Monte Carlo method for volume estimation of star-shaped or convex domains is presen...
Monte Carlo methods form an experimental branch of mathematics that employs simulations driven by ra...
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling o...
For functions with power-law singularities we consider series expansions whose coefficients have bee...
his paper will trace the history and development of a useful stochastic method for approximating cer...
RESUMEN: Se ha implementado un esquema de Montecarlo apto para la determinación de los coeficientes ...
Abstract. We discuss uniform sampling algorithms that are based on stochastic growth methods, using ...
Conventional Monte Carlo tallies are well suited for estimating integral quantities over large volum...