23 citations · 148 across the 24 of their papers we have counts for
24 papers
Trajectories of square lattice staircase polygons
EJ Janse van Rensburg
The distribution of monomers in a coating of grafted and adsorbing polymers is modelled using a grafted staircase polygon in the square lattice. The adsorbing staircase polygon con…
Entropic exponents of grafted lattices stars
EJ Janse van Rensburg
The surface entropic exponents of half-space lattice stars grafted at their central nodes in a hard wall are estimated numerically using the PERM algorithm. In the square half-latt…
Phase diagrams of confined square lattice links
EJ Janse van Rensburg, E Orlandini
We study by Monte Carlo simulations and scaling analysis two models of pairs of confined and dense ring polymers in two dimensions. The pair of ring polymers are modelled by square…
Numerical estimates of square lattice star vertex exponents
S Campbell, EJ Janse van Rensburg
We implement parallel versions of the GARM and Wang-Landau algorithms for stars and for acyclic uniform branched networks in the square lattice. These are models of monodispersed b…
Force-induced desorption of -star polymers: a self-avoiding walk model
EJ Janse van Rensburg, S G Whittington
We consider a simple cubic lattice self-avoiding walk model of 3-star polymers adsorbed at a surface and then desorbed by pulling with an externally applied force. We determine rig…
Partition function zeros of adsorbing Dyck paths
NR Beaton, EJ Janse van Rensburg
The zeros of the size- partition functions for a statistical mechanical model can be used to help understand the critical behaviour of the model as . Here we use wei…
Polygons pulled from an adsorbing surface
AJ Guttmann, EJ Janse van Rensburg, I Jensen +1
We consider self-avoiding lattice polygons, in the hypercubic lattice, as a model of a ring polymer adsorbed at a surface and either being desorbed by the action of a force, or pus…
Mean Field Analysis of Algorithms for Scale-free Networks in Molecular Biology
S Konini, EJ Janse van Rensburg
The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addi…
Self-avoiding walks adsorbed at a surface and pulled at their mid-point
EJ Janse van Rensburg, SG Whittington
We consider a self-avoiding walk on the -dimensional hypercubic lattice, terminally attached to an impenetrable hyperplane at which it can adsorb. When a force is applied the wa…
Self-avoiding walks subject to a force
EJ Janse van Rensburg, SG Whittington
We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the…
Forces and pressures in adsorbing partially directed walks
E. J. Janse van Rensburg, T. Prellberg
Polymers in confined spaces lose conformational entropy. This induces a net repulsive entropic force on the walls of the confining space. A model for this phenomenon is a lattice w…
Microcanonical Simulations of Adsorbing Self-Avoiding Walks
Esaias J. Janse van Rensburg
Linear polymers adsorbing on a wall can be modelled by half-space self-avoiding walks adsorbing on a line in the square lattice, or on a surface in the cubic lattice. In this paper…
Phase diagram of inhomogeneous percolation with a defect plane
G. K. Iliev, E. J. Janse van Rensburg, N. Madras
Let be the -dimensional hypercubic lattice and let be an -dimensional sublattice, with . We consider a model of inhomogeneous bo…
Random sampling of trivials words in finitely presented groups
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo samp…
The cogrowth series for is D-finite
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg +1
We compute the cogrowth series for Baumslag-Solitar groups , which we show to be D-finite. It follows that their cogrowth rates are alg…
The entropic pressure of a lattice polygon
F. Gassoumov, E. J. Janse van Rensburg
The entropic pressure in the vicinity of a two dimensional square lattice polygon is examined as a model of the entropic pressure near a planar ring polymer. The scaling of the pre…
Adsorbed self-avoiding walks subject to a force
E. J. Janse van Rensburg, S. G. Whittington
We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force. In this paper the force is applied normal to…
On trivial words in finitely presented groups
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg +1
We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups w…
The pressure exerted by adsorbing directed lattice paths and staircase polygons
E. J. Janse van Rensburg, T. Prellberg
A directed path in the vicinity of a hard wall exerts pressure on the wall because of loss of entropy. The pressure at a particular point may be estimated by estimating the loss of…
Lattice Knots in a Slab
D. Gasumova, E. J. Janse van Rensburg, A. Rechnitzer
In this paper the number and lengths of minimal length lattice knots confined to slabs of width , is determined. Our data on minimal length verify the results by Sharein et.al.…
The Compressibility of Minimal Lattice Knots
Esaias J Janse van Rensburg, Andrew Rechnitzer
The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the com…
Minimal knotted polygons in cubic lattices
E. J. Janse van Rensburg, A. Rechnitzer
An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writ…
On the universality of knot probability ratios
E. J. Janse van Rensburg, A. Rechnitzer
Let denote the number of self-avoiding polygons of length on a regular three-dimensional lattice, and let be the number which have knot type . The probability…
BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
E. J. Janse van Rensburg, A. Rechnitzer
In this paper the elementary moves of the BFACF-algorithm for lattice polygons are generalised to elementary moves of BFACF-style algorithms for lattice polygons in the body-centre…