Related papers: Polymer simulation by means of tree data-structure…
We present Monte Carlo simulations of lattice models of polymers. These simulations are intended to demonstrate the strengths of a powerful new flat histogram algorithm which is obtained by adding microcanonical reweighting techniques to…
We observe $n$ sequences at each of $m$ sites, and assume that they have evolved from an ancestral sequence that forms the root of a binary tree of known topology and branch lengths, but the sequence states at internal nodes are unknown.…
This paper describes a new Monte Carlo method based on a novel stochastic potential switching algorithm. This algorithm enables the equilibrium properties of a system with potential $V$ to be computed using a Monte Carlo simulation for a…
We introduce a new Monte Carlo method for pure gauge theories. It is not intended for use with dynamical fermions. It belongs to the class of Local Hybrid Monte Carlo (LHMC) algorithms, which make use of the locality of the action by…
A technique is presented which maps the parameters of a bead spring model, using the Flory Huggins theory, to a specific experimental system. By keeping only necessary details, for the description of these systems, the mapping procedure…
We model a set of point-to-point transports on a network as a system of polydisperse interacting self-avoiding walks (SAWs) over a finite square lattice. The ends of each SAW may be located both at random, uniformly distributed, positions…
We present the results of Monte Carlo simulation for a Kondo lattice model in which itinerant electrons interact with Ising spins with spin-ice type easy-axis anisotropy on a pyrochlore lattice. We demonstrate the efficiency of the…
We show that equilibrium monomer and centre-of-mass concentration profiles of lattice polymers in a gravitational field, computed by Monte-Carlo simulations, provide an accurate and efficient road to the osmotic equation-of-state of polymer…
The effect of different Monte Carlo move sets on the the folding kinetics of lattice polymer chains is studied from the geometry of the conformation-network. The networks have the characteristics of small- world. The Monte Carlo move, rigid…
We present a rigorous efficient event-chain Monte Carlo algorithm for long-range interacting particle systems. Using a cell-veto scheme within the factorized Metropolis algorithm, we compute each single-particle move with a fixed number of…
A hybrid Monte Carlo (HMC) approach is employed to quantify the influence of inelastic deformation on the microstructural evolution of polycrystalline materials. This approach couples a time explicit material point method (MPM) for…
In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a…
The behaviour of the one--dimensional random--forced Burgers equation is investigated in the path integral formalism, using a discrete space--time lattice. We show that by means of Monte Carlo methods one may evaluate observables, such as…
Single two dimensional polymers confined to a strip are studied by Monte Carlo simulations. They are described by N-step self-avoiding random walks on a square lattice between two parallel hard walls with distance 1 << D << N^\nu (\nu = 3/4…
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubic lattices. As a stochastic sampling method we use…
We solve a model of self-avoiding walks with up to two monomers per site on the Bethe lattice. This model, inspired on the Domb-Joyce model, was recently proposed to describe the collapse transition observed in interacting polymers [J.…
A new Monte Carlo method for computing thermodynamical properties of very large polyelectrolytes is presented. It is based on a renormalization group relating the original polymer to a smaller system, where in addition to the naively…
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is…
We introduce a Monte-Carlo algorithm for the simulation of charged particles moving in the continuum. Electrostatic interactions are not instantaneous as in conventional approaches, but are mediated by a constrained, diffusing electric…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…