You have just completed your registration at OpenAire.
Before you can login to the site, you will need to activate your account.
An e-mail will be sent to you with the proper instructions.
Important!
Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version
of the site upon release.
We study a class of loop models, parameterized by a continuously varying loop fugacity n, on the hydrogen-peroxide lattice, which is a three-dimensional cubic lattice of coordination number 3. For integer n > 0, these loop models provide graphical representations for n-vector models on the same lattice, while for n = 0 they reduce to the self-avoiding walk problem. We use worm algorithms to perform Monte Carlo studies of the loop model for n = 0, 0.5, 1, 1.5, 2, 3, 4, 5 and 10 and obtain the ...
Using Monte Carlo simulations and finite-size scaling, we investigate the XY antiferromagnet on the triangular, Union Jack and bisected-hexagonal lattices, and in each case find both Ising and Kosterlitz-Thouless transitions. As is well-known, on the triangular lattice, as the temperature decreases the system develops chiral order for temperatures $T < \Tc$, and then quasi-long-range magnetic order on its sublattices when $T < \Ts$, with $\Ts < \Tc$. The behavior $\Ts \Tc$, before chiral orde...
We investigate the geometric properties of percolation clusters, by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo simulations, we study the probability that a given edge is not a bridge but has both its loop arcs in the same loop, and find that it is governed by the two-arm exponent. We then classify bridges into two types: branches and junctions. A bridge is a {\em branch} i...
We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a corollary, we obtain a fully-polynomial randomized approximation scheme for the Ising susceptibility, and for a certain restriction of the two-point correlation function
We introduce the \emph{leaf-excluded} percolation model, which corresponds to independent bond percolation conditioned on the absence of leaves (vertices of degree one). We study the leaf-excluded model on the square and simple-cubic lattices via Monte Carlo simulation, using a worm-like algorithm. By studying wrapping probabilities, we precisely estimate the critical thresholds to be $0.355\,247\,5(8)$ (square) and $0.185\,022(3)$ (simple-cubic). Our estimates for the thermal and magnetic ex...
We consider the coupling from the past implementation of the random-cluster heat-bath process, and study its random running time, or coupling time. We focus on hypercubic lattices embedded on tori, in dimensions one to three, with cluster fugacity at least one. We make a number of conjectures regarding the asymptotic behaviour of the coupling time, motivated by rigorous results in one dimension and Monte Carlo simulations in dimensions two and three. Amongst our findings, we observe that, for...
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By performing extensive simulations at these estimated critical points, we then estimate the critical exponents $1/\nu =1.141\,0(15)$, $\beta/\nu=0.477\,05(15)$, the leading correction exponent $y_i =-1.2(2)$, and the shortest-path exponent $d_{\rm min}=1.375\,6(3)$...
No project research data found
No project statistics found
Scientific Results
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.
PUBLICATIONS BY ACCESS MODE
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.
Publications in Repositories
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.