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

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

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 $m \times n$ two-dimensional rectangular lattice strips with fixed dimer density $\rho$. For any dimer density $0 < \rho < 1$, 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 $f_2(\rho)$ for large lattices can be obtained. For example, for a half-filled lattice, $f_2(1/2) = 0.633195588930$, while $f_2(1/4) = 0.4413453753046$ and $f_2(3/4) = 0.64039026$. For $\rho < 0.65$, $f_2(\rho)$ is accurate at least to 10 decimal digits. The function $f_2(\rho)$ reaches the maximum value $f_2(\rho^*) = 0.662798972834$ at $\rho^* = 0.6381231$, 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

Schizotypy but not Cannabis Use Modestly Predicts Psychotogenic Experiences: A Cross-Sectional Study Using the Oxford-Liverpool Inventory of Feelings and Experiences (O-LIFE)

Objective. Cannabis use predicts psychosis in longitudinal studies, but it is difficult to infer causation. Some precursor variables predict both, including childhood trauma and adversity. Additionally, some of the desired effects of cannabis use resemble the symptoms of psychosis. It would be preferable to assess psychotomimetic or “unusual” experiences that include psychotic symptoms but without assuming pathology. Finally, it is possible that similar people are prone to psychosis and drawn to cannabis use, perhaps, because they are sensitive or attracted to unusual experiences. Schizotypy provides a trait measure of proneness to unusual experiences. The study aimed to examine cross-sectionally relationships between cannabis use, schizotypy, and unusual experiences whilst controlling for current trauma symptoms. Method. A volunteer online sample (n = 129, 64% women, predominantly students) who had used cannabis at least once was recruited. People who reported active effects of past trauma were excluded with a brief primary care posttraumatic stress disorder screen. Participants completed the Oxford-Liverpool Inventory of Feelings and Experience, the Cognitive Failures Questionnaire, and measures of substance use and sociodemographics. Results. The majority of respondents recounted unusual experiences after cannabis use, and many of these might have been considered symptoms of psychosis if they had received medical attention. In regression analysis, the only predictor of the unusual experiences scale of O-LIFE was schizotypy (measured by the remaining subscales; 4% of variance). There were no correlations between cannabis use frequency and schizotypy or unusual experiences. Conclusions. These findings suggest that, after controlling for schizotypy and excluding people who are actively experiencing the effects of past trauma, frequency of cannabis use does not predict unusual experiences. However, individuals with schizotypal personality traits may have more unusual experiences when using cannabis

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 $Z^d$. The method is based on loop erasure and restoration, and does not require exact enumeration data. Our bounds are best for high $d$, and in fact agree with the first four terms of the $1/d$ expansion for the connective constant. The bounds are the best to date for dimensions $d \geq 3$, but do not produce good results in two dimensions. For $d=3,4,5,6$, 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

Localization criteria for Anderson models on locally finite graphs

We prove spectral and dynamical localization for Anderson models on locally finite graphs using the fractional moment method. Our theorems extend earlier results on localization for the Anderson model on \ZZ^d. We establish geometric assumptions for the underlying graph such that localization can be proven in the case of sufficiently large disorder

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.

The problem of political science and practical politics

Copyright @ 2006 The AuthorsWe reflect on the reasons why there is not a greater and more fruitful relationship between those who seek to understand policy and the political process from academia and those with a similar task in ‘practical politics’. We attribute this lack of engagement to three core factors: (1) from without, instrumental government visions of political science perpetuate the view that the discipline exists to serve those with power; (2) from within, scientism and abstraction diminish the discipline's stock of ‘usable’ product for ‘practical politics’; and (3) where relevant research exists, its uptake is hampered by limited communication between these spheres