activity
20032021
most citedAccurate estimate of the critical exponent for self-avoiding walks via a fast implementation of the pivot algorithm

208 citations · 884 across the 18 of their papers we have counts for

collaborators

18 papers

math.CO2021

Classical length-5 pattern-avoiding permutations

Nathan Clisby, Andrew R. Conway, Anthony J. Guttmann +1

We have made a systematic numerical study of the 16 Wilf classes of length-5 classical pattern-avoiding permutations from their generating function coefficients. We have extended t…

cond-mat.stat-mech2020★ 86 cited

High-precision estimate of the hydrodynamic radius for self-avoiding walks

Nathan Clisby, Burkhard Duenweg

The universal asymptotic amplitude ratio between the gyration radius and the hydrodynamic radius of self-avoiding walks is estimated by high-resolution Monte Carlo simulations. By…

cond-mat.stat-mech2020★ 7 cited

Computation of the equilibrium three-particle entropy for dense atomic fluids by molecular dynamics simulation

Luca Maffioli, Nathan Clisby, Federico Frascoli +1

We have computed the two and three-particle contribution to the entropy of a Weeks-Chandler-Andersen fluid via molecular dynamics simulations. The three-particle correlation functi…

cond-mat.stat-mech2020★ 2 cited

Off-lattice and parallel implementations of the pivot algorithm

Nathan Clisby, Dac Thanh Chuong Ho

The pivot algorithm is the most efficient known method for sampling polymer configurations for self-avoiding walks and related models. Here we introduce two recent improvements to…

cond-mat.stat-mech2017★ 6 cited

High resolution Monte Carlo study of the Domb-Joyce model

Nathan Clisby

We study the Domb-Joyce model of weakly self-avoiding walks on the simple cubic lattice via Monte Carlo simulations. We determine to excellent accuracy the value for the interactio…

cond-mat.stat-mech2017★ 8 cited

Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps

Nathan Clisby

We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic correct…