{
  "id": "2001.02186",
  "version": "v1",
  "published": "2020-01-07T17:20:57.000Z",
  "updated": "2020-01-07T17:20:57.000Z",
  "title": "Off-lattice and parallel implementations of the pivot algorithm",
  "authors": [
    "Nathan Clisby",
    "Dac Thanh Chuong Ho"
  ],
  "comment": "7 pages, 2 figures. Presented at \"Recent Developments in Computer Simulation Studies in Condensed Matter Physics\" (32nd Annual CSP Workshop) in February 2019, and submitted for the workshop proceedings",
  "categories": [
    "cond-mat.stat-mech",
    "physics.comp-ph"
  ],
  "abstract": "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 an efficient binary tree implementation of the pivot algorithm: an extension to an off-lattice model, and a parallel implementation.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-01-07T17:20:57.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "pivot algorithm",
      "parallel implementation",
      "efficient binary tree implementation",
      "sampling polymer configurations",
      "off-lattice model"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}