1,984 research outputs found
Asymptotic Expansions for lambda_d of the Dimer and Monomer-Dimer Problems
In the past few years we have derived asymptotic expansions for lambda_d of
the dimer problem and lambda_d(p) of the monomer-dimer problem. The many
expansions so far computed are collected herein. We shine a light on results in
two dimensions inspired by the work of M. E. Fisher. Much of the work reported
here was joint with Shmuel Friedland.Comment: 4 page
Complementary algorithms for graphs and percolation
A pair of complementary algorithms are presented. One of the pair is a fast
method for connecting graphs with an edge. The other is a fast method for
removing edges from a graph. Both algorithms employ the same tree based graph
representation and so, in concert, can arbitrarily modify any graph. Since the
clusters of a percolation model may be described as simple connected graphs, an
efficient Monte Carlo scheme can be constructed that uses the algorithms to
sweep the occupation probability back and forth between two turning points.
This approach concentrates computational sampling time within a region of
interest. A high precision value of pc = 0.59274603(9) was thus obtained, by
Mersenne twister, for the two dimensional square site percolation threshold.Comment: 5 pages, 3 figures, poster version presented at statphys23 (2007
An Asymptotic Expansion and Recursive Inequalities for the Monomer-Dimer Problem
Let (lambda_d)(p) be the p monomer-dimer entropy on the d-dimensional integer
lattice Z^d, where p in [0,1] is the dimer density. We give upper and lower
bounds for (lambda_d)(p) in terms of expressions involving (lambda_(d-1))(q).
The upper bound is based on a conjecture claiming that the p monomer-dimer
entropy of an infinite subset of Z^d is bounded above by (lambda_d)(p). We
compute the first three terms in the formal asymptotic expansion of
(lambda_d)(p) in powers of 1/d. We prove that the lower asymptotic matching
conjecture is satisfied for (lambda_d)(p).Comment: 15 pages, much more about d=1,2,
Logarithmic corrections in the free energy of monomer-dimer model on plane lattices with free boundaries
Using exact computations we study the classical hard-core monomer-dimer
models on m x n plane lattice strips with free boundaries. For an arbitrary
number v of monomers (or vacancies), we found a logarithmic correction term in
the finite-size correction of the free energy. The coefficient of the
logarithmic correction term depends on the number of monomers present (v) and
the parity of the width n of the lattice strip: the coefficient equals to v
when n is odd, and v/2 when n is even. The results are generalizations of the
previous results for a single monomer in an otherwise fully packed lattice of
dimers.Comment: 4 pages, 2 figure
Monomer-dimer model in two-dimensional rectangular lattices with fixed dimer density
The classical monomer-dimer model in two-dimensional lattices has been shown
to belong to the \emph{``#P-complete''} class, which indicates the problem is
computationally ``intractable''. We use exact computational method to
investigate the number of ways to arrange dimers on
two-dimensional rectangular lattice strips with fixed dimer density . For
any dimer density , we find a logarithmic correction term in the
finite-size correction of the free energy per lattice site. The coefficient of
the logarithmic correction term is exactly -1/2. This logarithmic correction
term is explained by the newly developed asymptotic theory of Pemantle and
Wilson. The sequence of the free energy of lattice strips with cylinder
boundary condition converges so fast that very accurate free energy
for large lattices can be obtained. For example, for a half-filled lattice,
, while and . For , is accurate at least to 10 decimal
digits. The function reaches the maximum value at , with 11 correct digits. This is also
the \md constant for two-dimensional rectangular lattices. The asymptotic
expressions of free energy near close packing are investigated for finite and
infinite lattice widths. For lattices with finite width, dependence on the
parity of the lattice width is found. For infinite lattices, the data support
the functional form obtained previously through series expansions.Comment: 15 pages, 5 figures, 5 table
A multiple replica approach to simulate reactive trajectories
A method to generate reactive trajectories, namely equilibrium trajectories
leaving a metastable state and ending in another one is proposed. The algorithm
is based on simulating in parallel many copies of the system, and selecting the
replicas which have reached the highest values along a chosen one-dimensional
reaction coordinate. This reaction coordinate does not need to precisely
describe all the metastabilities of the system for the method to give reliable
results. An extension of the algorithm to compute transition times from one
metastable state to another one is also presented. We demonstrate the interest
of the method on two simple cases: a one-dimensional two-well potential and a
two-dimensional potential exhibiting two channels to pass from one metastable
state to another one
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 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.
Enumeration of self avoiding trails on a square lattice using a transfer matrix technique
We describe a new algebraic technique, utilising transfer matrices, for
enumerating self-avoiding lattice trails on the square lattice. We have
enumerated trails to 31 steps, and find increased evidence that trails are in
the self-avoiding walk universality class. Assuming that trails behave like , we find and .Comment: To be published in J. Phys. A:Math Gen. Pages: 16 Format: RevTe
New Lower Bounds on the Self-Avoiding-Walk Connective Constant
We give an elementary new method for obtaining rigorous lower bounds on the
connective constant for self-avoiding walks on the hypercubic lattice .
The method is based on loop erasure and restoration, and does not require exact
enumeration data. Our bounds are best for high , and in fact agree with the
first four terms of the expansion for the connective constant. The bounds
are the best to date for dimensions , but do not produce good results
in two dimensions. For , respectively, our lower bound is within
2.4\%, 0.43\%, 0.12\%, 0.044\% of the value estimated by series extrapolation.Comment: 35 pages, 388480 bytes Postscript, NYU-TH-93/02/0
A critical dimension for the stability of perfect fluid spheres of radiation
An analysis of radiating perfect fluid models with asymptotically AdS
boundary conditions is presented. Such scenarios consist of a spherical gas of
radiation (a "star") localised near the centre of the spacetime due to the
confining nature of the AdS potential. We consider the variation of the total
mass of the star as a function of the central density, and observe that for
large enough dimensionality, the mass increases monotonically with the density.
However in the lower dimensional cases, oscillations appear, indicating that
the perfect fluid model of the star is becoming unrealistic. We find the
critical dimension separating these two regimes to be eleven.Comment: 18 pages, 5 figures; v2 reference and footnote added; v3 slight
reordering of content, new section added with further analysis; v4 Final
version - small changes, including a new title, accepted for publication in
CQ
- …