Ferromagnetic phase transition for the spanning-forest model (q \to 0 limit of the Potts model) in three or more dimensions

We present Monte Carlo simulations of the spanning-forest model (q \to 0 limit of the ferromagnetic Potts model) in spatial dimensions d=3,4,5. We show that, in contrast to the two-dimensional case, the model has a "ferromagnetic" second-order phase transition at a finite positive value w_c. We present numerical estimates of w_c and of the thermal and magnetic critical exponents. We conjecture that the upper critical dimension is 6.Comment: LaTex2e, 4 pages; includes 6 Postscript figures; Version 2 has expanded title as published in PR

Critical speeding-up in a local dynamics for the random-cluster model

We study the dynamic critical behavior of the local bond-update (Sweeny) dynamics for the Fortuin-Kasteleyn random-cluster model in dimensions d=2,3, by Monte Carlo simulation. We show that, for a suitable range of q values, the global observable S_2 exhibits "critical speeding-up": it decorrelates well on time scales much less than one sweep, so that the integrated autocorrelation time tends to zero as the critical point is approached. We also show that the dynamic critical exponent z_{exp} is very close (possibly equal) to the rigorous lower bound \alpha/\nu, and quite possibly smaller than the corresponding exponent for the Chayes-Machta-Swendsen-Wang cluster dynamics.Comment: LaTex2e/revtex4, 4 pages, includes 5 figure

Cluster simulations of loop models on two-dimensional lattices

We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n \ge 1. We show that our algorithm has little or no critical slowing-down when 1 \le n \le 2. We use this algorithm to investigate the honeycomb-lattice O(n) loop model, for which we determine several new critical exponents, and a square-lattice O(n) loop model, for which we obtain new information on the phase diagram.Comment: LaTex2e, 4 pages; includes 1 table and 2 figures. Totally rewritten in version 2, with new theory and new data. Version 3 as published in PR

Existence and Nonlinear Stability of Rotating Star Solutions of the Compressible Euler-Poisson Equations

We prove existence of rotating star solutions which are steady-state solutions of the compressible isentropic Euler-Poisson (EP) equations in 3 spatial dimensions, with prescribed angular momentum and total mass. This problem can be formulated as a variational problem of finding a minimizer of an energy functional in a broader class of functions having less symmetry than those functions considered in the classical Auchmuty-Beals paper. We prove the nonlinear dynamical stability of these solutions with perturbations having the same total mass and symmetry as the rotating star solution. We also prove local in time stability of W^{1, \infty}(\RR^3) solutions where the perturbations are entropy-weak solutions of the EP equations. Finally, we give a uniform (in time) a-priori estimate for entropy-weak solutions of the EP equations

Testing Reactive Probabilistic Processes

We define a testing equivalence in the spirit of De Nicola and Hennessy for reactive probabilistic processes, i.e. for processes where the internal nondeterminism is due to random behaviour. We characterize the testing equivalence in terms of ready-traces. From the characterization it follows that the equivalence is insensitive to the exact moment in time in which an internal probabilistic choice occurs, which is inherent from the original testing equivalence of De Nicola and Hennessy. We also show decidability of the testing equivalence for finite systems for which the complete model may not be known

Finite-temperature phase transition in a class of 4-state Potts antiferromagnets

We argue that the 4-state Potts antiferromagnet has a finite-temperature phase transition on any Eulerian plane triangulation in which one sublattice consists of vertices of degree 4. We furthermore predict the universality class of this transition. We then present transfer-matrix and Monte Carlo data confirming these predictions for the cases of the union-jack and bisected hexagonal lattices.Comment: LaTeX2e/Revtex4, 5 page

Some geometric critical exponents for percolation and the random-cluster model

We introduce several infinite families of new critical exponents for the random-cluster model and present scaling arguments relating them to the k-arm exponents. We then present Monte Carlo simulations confirming these predictions. These new exponents provide a convenient way to determine k-arm exponents from Monte Carlo simulations. An understanding of these exponents also leads to a radically improved implementation of the Sweeny Monte Carlo algorithm. In addition, our Monte Carlo data allow us to conjecture an exact expression for the shortest-path fractal dimension d_min in two dimensions: d_min = (g+2)(g+18)/(32g) where g is the Coulomb-gas coupling, related to the cluster fugacity q via q = 2 + 2 cos(g\pi/2) with 2 \le g \le 4.Comment: LaTeX2e/Revtex4. Version 2 is completely rewritten to make the exposition more reader-friendly; it consists of a 4-page main paper (including 3 figures) and a 2-page EPAPS appendix (given as a single Postscript file). To appear in Phys Rev

Approximating a Behavioural Pseudometric without Discount for<br> Probabilistic Systems

Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue of probabilistic bisimilarity. Distance zero captures probabilistic bisimilarity. Each pseudometric has a discount factor, a real number in the interval (0, 1]. The smaller the discount factor, the more the future is discounted. If the discount factor is one, then the future is not discounted at all. Desharnais et al. showed that the behavioural distances can be calculated up to any desired degree of accuracy if the discount factor is smaller than one. In this paper, we show that the distances can also be approximated if the future is not discounted. A key ingredient of our algorithm is Tarski's decision procedure for the first order theory over real closed fields. By exploiting the Kantorovich-Rubinstein duality theorem we can restrict to the existential fragment for which more efficient decision procedures exist