Critical Behavior of the Ferromagnetic Ising Model on a Sierpinski Carpet: Monte Carlo Renormalization Group Study

We perform a Monte Carlo Renormalization Group analysis of the critical behavior of the ferromagnetic Ising model on a Sierpi\'nski fractal with Hausdorff dimension $d_f\simeq 1.8928$. This method is shown to be relevant to the calculation of the critical temperature $T_c$ and the magnetic eigen-exponent $y_h$ on such structures. On the other hand, scaling corrections hinder the calculation of the temperature eigen-exponent $y_t$. At last, the results are shown to be consistent with a finite size scaling analysis.Comment: 16 pages, 7 figure

Renormalization group maps for Ising models in lattice gas variables

Real space renormalization group maps, e.g., the majority rule transformation, map Ising type models to Ising type models on a coarser lattice. We show that each coefficient of the renormalized Hamiltonian in the lattice gas variables depends on only a finite number of values of the renormalized Hamiltonian. We introduce a method which computes the values of the renormalized Hamiltonian with high accuracy and so computes the coefficients in the lattice gas variables with high accuracy. For the critical nearest neighbor Ising model on the square lattice with the majority rule transformation, we compute over 1,000 different coefficients in the lattice gas variable representation of the renormalized Hamiltonian and study the decay of these coefficients. We find that they decay exponentially in some sense but with a slow decay rate. We also show that the coefficients in the spin variables are sensitive to the truncation method used to compute them.Comment: 22 pages, 9 color postscript figures; minor revisions in version

Green's Functions from Quantum Cluster Algorithms

We show that cluster algorithms for quantum models have a meaning independent of the basis chosen to construct them. Using this idea, we propose a new method for measuring with little effort a whole class of Green's functions, once a cluster algorithm for the partition function has been constructed. To explain the idea, we consider the quantum XY model and compute its two point Green's function in various ways, showing that all of them are equivalent. We also provide numerical evidence confirming the analytic arguments. Similar techniques are applicable to other models. In particular, in the recently constructed quantum link models, the new technique allows us to construct improved estimators for Wilson loops and may lead to a very precise determination of the glueball spectrum.Comment: 15 pages, LaTeX, with four figures. Added preprint numbe

Transition Matrix Monte Carlo Reweighting and Dynamics

We study an induced dynamics in the space of energy of single-spin-flip Monte Carlo algorithm. The method gives an efficient reweighting technique. This dynamics is shown to have relaxation times proportional to the specific heat. Thus, it is plausible for a logarithmic factor in the correlation time of the standard 2D Ising local dynamics.Comment: RevTeX, 5 pages, 3 figure

The Block Spin Renormalization Group Approach and Two-Dimensional Quantum Gravity

A block spin renormalization group approach is proposed for the dynamical triangulation formulation of two-dimensional quantum gravity. The idea is to update link flips on the block lattice in response to link flips on the original lattice. Just as the connectivity of the original lattice is meant to be a lattice representation of the metric, the block links are determined in such a way that the connectivity of the block lattice represents a block metric. As an illustration, this approach is applied to the Ising model coupled to two-dimensional quantum gravity. The correct critical coupling is reproduced, but the critical exponent is obscured by unusually large finite size effects.Comment: 10 page

Graphical representations and cluster algorithms for critical points with fields

A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical representation. Results from numerical simulations of the Ising model in a staggered field are presented. The dynamic exponent for the algorithm is measured to be less than 0.5.Comment: Revtex, 12 pages with 2 figure

Dual Monte Carlo and Cluster Algorithms

We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. By using the perspective of probability theory, we detail the nature of a cluster algorithm, make explicit the assumptions embodied in all clusters of which we are aware, and define the construction of free cluster algorithms. We also illustrate these procedures by rederiving the Swendsen-Wang algorithm, presenting the details of the loop algorithm for a worldline simulation of a quantum $S=$ 1/2 model, and proposing a free cluster version of the Swendsen-Wang replica method for the random Ising model. How the principle of maximum entropy might be used to aid the construction of cluster algorithms is also discussed.Comment: 25 pages, 4 figures, to appear in Phys.Rev.

Monte Carlo Renormalization of the 3-D Ising model: Analyticity and Convergence

We review the assumptions on which the Monte Carlo renormalization technique is based, in particular the analyticity of the block spin transformations. On this basis, we select an optimized Kadanoff blocking rule in combination with the simulation of a d=3 Ising model with reduced corrections to scaling. This is achieved by including interactions with second and third neighbors. As a consequence of the improved analyticity properties, this Monte Carlo renormalization method yields a fast convergence and a high accuracy. The results for the critical exponents are y_H=2.481(1) and y_T=1.585(3).Comment: RevTeX, 4 PostScript file