PubMed Health⌕ Search

Biomedical subjects

Jonathan Machta

Publications and source records attributed to Jonathan Machta.

3 recordsLinked to original sources

Overcoming the slowing down of flat-histogram Monte Carlo simulations: cluster updates and optimized broad-histogram ensembles.

We study the performance of Monte Carlo simulations that sample a broad histogram in energy by determining the mean first-passage time to span the entire energy space of d-dimensional ferromagnetic Ising/Potts models. We first show that flat-histogram Monte Carlo methods with single-spin flip updates such as the Wang-Landau algorithm or the multicanonical method perform suboptimally in comparison to an unbiased Markovian random walk in energy space. For the d = 1, 2, 3 Ising model, the mean first-passage time tau scales with the number of spins N = L(d) as tau proportional N2L(z). The exponent z is found to decrease as the dimensionality d is increased. In the mean-field limit of infinite dimensions we find that z vanishes up to logarithmic corrections. We then demonstrate how the slowdown characterized by z > 0 for finite d can be overcome by two complementary approaches--cluster dynamics in connection with Wang-Landau sampling and the recently developed ensemble optimization technique. Both approaches are found to improve the random walk in energy space so that tau proportional N2 up to logarithmic corrections for the d = 1, 2 Ising model.

Journal Article↗

Ground states and thermal states of the random field Ising model.

The random field Ising model is studied numerically at both zero and positive temperature. Ground states are mapped out in a region of random field and external field strength. Thermal states and thermodynamic properties are obtained for all temperatures using the Wang-Landau algorithm. The specific heat and susceptibility typically display sharp peaks in the critical region for large systems and strong disorder. These sharp peaks result from large domains flipping. For a given realization of disorder, ground states and thermal states near the critical line are found to be strongly correlated--a concrete manifestation of the zero temperature fixed point scenario.

Journal Article↗

Parallel dynamics and computational complexity of network growth models.

The parallel computational complexity or depth of growing network models is investigated. The networks considered are generated by preferential attachment rules where the probability of attaching a new node to an existing node is given by a power alpha of the connectivity of the existing node. Algorithms for generating growing networks very quickly in parallel are described and studied. The sublinear and superlinear cases require distinct algorithms. As a result, there is a discontinuous transition in the parallel complexity of sampling these networks corresponding to the discontinuous structural transition at alpha=1 , where the networks become scale-free. For alpha>1 , networks can be generated in constant time while for 0</=alpha<1 , logarithmic parallel time is required. The results show that these networks have little depth and embody very little history dependence despite being defined by sequential growth rules.

Journal Article↗