The 3-d Random Field Ising Model at zero temperature

We study numerically the zero temperature Random Field Ising Model on cubic lattices of various linear sizes $L$ in three dimensions. For each random field configuration we vary the ferromagnetic coupling strength $J$. We find that in the infinite volume limit the magnetization is discontinuous in $J$. The energy and its first $J$ derivative are continuous. The approch to the thermodynamic limit is slow, behaving like $L^{-p}$ with $p \sim .8$ for the gaussian distribution of the random field. We also study the bimodal distribution $h_{i} = \pm h$, and we find similar results for the magnetization but with a different value of the exponent $p \sim .6$. This raises the question of the validity of universality for the random field problem.Comment: 8 pages, 3 PostScript Figure

Disorder driven phase transitions of the large q-state Potts model in 3d

Phase transitions induced by varying the strength of disorder in the large-q state Potts model in 3d are studied by analytical and numerical methods. By switching on the disorder the transition stays of first order, but different thermodynamical quantities display essential singularities. Only for strong enough disorder the transition will be soften into a second-order one, in which case the ordered phase becomes non-homogeneous at large scales, while the non-correlated sites percolate the sample. In the critical regime the critical exponents are found universal: \beta/\nu=0.60(2) and \nu=0.73(1).Comment: 4 pages; 3 figure

On the complexity of some birational transformations

Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines, and relies mainly on univariate polynomial algebra, the second approach is a singularity analysis, and the third method is more numerical, using integer arithmetics. Each method has its own domain of application, but they give corroborating results, and lead us to a conjecture on the complexity of a class of maps constructed from matrix inversions

Critical slowing down in polynomial time algorithms

Combinatorial optimization algorithms which compute exact ground state configurations in disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using arguments based on the physical picture of the model, including vanishing stiffness on scales beyond the correlation length and the ground state degeneracy, the number of operations carried out by one such algorithm, the push-relabel algorithm for the random field Ising model, can be estimated. Some scaling can also be predicted for the 2D spin glass.Comment: 4 pp., 3 fig

Symmetry, complexity and multicritical point of the two-dimensional spin glass

We analyze models of spin glasses on the two-dimensional square lattice by exploiting symmetry arguments. The replicated partition functions of the Ising and related spin glasses are shown to have many remarkable symmetry properties as functions of the edge Boltzmann factors. It is shown that the applications of homogeneous and Hadamard inverses to the edge Boltzmann matrix indicate reduced complexities when the elements of the matrix satisfy certain conditions, suggesting that the system has special simplicities under such conditions. Using these duality and symmetry arguments we present a conjecture on the exact location of the multicritical point in the phase diagram.Comment: 32 pages, 6 figures; a few typos corrected. To be published in J. Phys.

Minimum spanning trees on random networks

We show that the geometry of minimum spanning trees (MST) on random graphs is universal. Due to this geometric universality, we are able to characterise the energy of MST using a scaling distribution ($P(\epsilon)$) found using uniform disorder. We show that the MST energy for other disorder distributions is simply related to $P(\epsilon)$. We discuss the relationship to invasion percolation (IP), to the directed polymer in a random media (DPRM) and the implications for the broader issue of universality in disordered systems.Comment: 4 pages, 3 figure

The Computational Complexity of Generating Random Fractals

In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation. Diffusion limited aggregation and several widely used algorithms for equilibrating the Ising model are shown to be highly sequential; it is unlikely they can be simulated efficiently in parallel. This is in contrast to Mandelbrot percolation that can be simulated in constant parallel time. Our research helps shed light on the intrinsic complexity of these models relative to each other and to different growth processes that have been recently studied using complexity theory. In addition, the results may serve as a guide to simulation physics.Comment: 28 pages, LATEX, 8 Postscript figures available from [email protected]

Geometric effects on critical behaviours of the Ising model

We investigate the critical behaviour of the two-dimensional Ising model defined on a curved surface with a constant negative curvature. Finite-size scaling analysis reveals that the critical exponents for the zero-field magnetic susceptibility and the correlation length deviate from those for the Ising lattice model on a flat plane. Furthermore, when reducing the effects of boundary spins, the values of the critical exponents tend to those derived from the mean field theory. These findings evidence that the underlying geometric character is responsible for the critical properties the Ising model when the lattice is embedded on negatively curved surfaces.Comment: 16 pages, 6 figures, to appear in J. Phys. A: Math. Ge

Spontaneous magnetization of the Ising model on the Sierpinski carpet fractal, a rigorous result

We give a rigorous proof of the existence of spontaneous magnetization at finite temperature for the Ising spin model defined on the Sierpinski carpet fractal. The theorem is inspired by the classical Peierls argument for the two dimensional lattice. Therefore, this exact result proves the existence of spontaneous magnetization for the Ising model in low dimensional structures, i.e. structures with dimension smaller than 2.Comment: 14 pages, 8 figure

Post-critical set and non existence of preserved meromorphic two-forms

We present a family of birational transformations in $CP_2$ depending on two, or three, parameters which does not, generically, preserve meromorphic two-forms. With the introduction of the orbit of the critical set (vanishing condition of the Jacobian), also called ``post-critical set'', we get some new structures, some "non-analytic" two-form which reduce to meromorphic two-forms for particular subvarieties in the parameter space. On these subvarieties, the iterates of the critical set have a polynomial growth in the \emph{degrees of the parameters}, while one has an exponential growth out of these subspaces. The analysis of our birational transformation in $CP_2$ is first carried out using Diller-Favre criterion in order to find the complexity reduction of the mapping. The integrable cases are found. The identification between the complexity growth and the topological entropy is, one more time, verified. We perform plots of the post-critical set, as well as calculations of Lyapunov exponents for many orbits, confirming that generically no meromorphic two-form can be preserved for this mapping. These birational transformations in $CP_2$, which, generically, do not preserve any meromorphic two-form, are extremely similar to other birational transformations we previously studied, which do preserve meromorphic two-forms. We note that these two sets of birational transformations exhibit totally similar results as far as topological complexity is concerned, but drastically different results as far as a more ``probabilistic'' approach of dynamical systems is concerned (Lyapunov exponents). With these examples we see that the existence of a preserved meromorphic two-form explains most of the (numerical) discrepancy between the topological and probabilistic approach of dynamical systems.Comment: 34 pages, 7 figure