pith. machine review for the scientific record. sign in

arxiv: 2605.04367 · v1 · submitted 2026-05-06 · ❄️ cond-mat.stat-mech · cond-mat.soft

Recognition: unknown

Random sampling of self-avoiding theta-graphs

Aleksander L. Owczarek, Nicholas R. Beaton

Pith reviewed 2026-05-08 17:32 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech cond-mat.soft
keywords self-avoiding walkstheta-graphscritical exponentsMonte Carlo samplingWang-Landau algorithmlattice embeddingspolymer statistics
0
0 comments X

The pith

Numerical sampling estimates critical exponents for self-avoiding theta-graphs on lattices and supports a conjecture for equal-arm cases in two dimensions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The work develops a Monte Carlo method to sample self-avoiding embeddings of theta-graphs, which consist of two points joined by three paths, on the square lattice in two dimensions and the cubic lattice in three dimensions. It calculates how the total number of such graphs scales with size and how the lengths of the three arms are distributed on average. These scaling exponents are then compared to known values for knotted loops in three dimensions. For graphs where the three arms have identical lengths, the two-dimensional results align with a specific conjectured exponent value.

Core claim

A combination of the modified BFACF algorithm for degree-three vertices and Wang-Landau sampling generates large sets of self-avoiding theta-graph embeddings on lattices. Critical exponents are extracted for the growth in the number of such graphs and for the distributions of arm lengths. These are compared to prime-knot exponents in three dimensions. In two dimensions the equal-arm-length subclass provides supporting evidence for a conjectured value of the critical exponent.

What carries the argument

The modified BFACF algorithm adapted for degree-three vertices, paired with Wang-Landau flat-histogram sampling to generate unbiased theta-graph configurations.

If this is right

  • The number of theta-graphs grows according to a power law whose exponent can be read from the sampled ensembles.
  • The distribution of arm lengths obeys scaling relations whose moments supply additional critical exponents.
  • In three dimensions the theta-graph exponents stand in a definite relation to those already known for prime knots.
  • In two dimensions the monodisperse subclass obeys an exponent consistent with the value conjectured for equal-arm theta-graphs.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same sampling scheme could be applied to theta-graphs whose arms are further constrained by knotting or by fixed total perimeter.
  • Agreement with the two-dimensional conjecture would tighten the connection between theta-graph counting and two-dimensional loop models.
  • Reliable three-dimensional exponents would supply input for polymer models in which three paths link a pair of endpoints.

Load-bearing premise

The sampling algorithm produces configurations whose statistics accurately capture the infinite-size limiting behavior without persistent biases from the way degree-three vertices or lattice edges are handled.

What would settle it

An exact enumeration of all theta-graphs up to moderate sizes on the square lattice that yields a different growth rate or arm-length distribution from the Monte Carlo extrapolation would falsify the estimated exponents.

Figures

Figures reproduced from arXiv: 2605.04367 by Aleksander L. Owczarek, Nicholas R. Beaton.

Figure 1
Figure 1. Figure 1: (a) A star, (b) a watermelon, (c) a comb, (d) a tadpole, and (e) a dumbbell. 1 arXiv:2605.04367v1 [cond-mat.stat-mech] 6 May 2026 view at source ↗
Figure 2
Figure 2. Figure 2: A size 500 theta on the square lattice, with arm lengths 18, 66 and 416. different ‘knot’ types, which can be grouped according to their crossing number in a similar manner to regular knots, and for which there exist invariants for distinguishing them [46]. While the methods we use here can be applied to thetas of any specified knot type, we focus only on ‘unknotted’ thetas with crossing number 0 (equivale… view at source ↗
Figure 3
Figure 3. Figure 3: (a) and (b) Two thetas with different distributions of arm lengths. (c) A trefoil knot with a localised knot component. (d) A theta with non-trivial ‘knot’ type view at source ↗
Figure 4
Figure 4. Figure 4: The basic BFACF moves for the square and cubic lattices. shapes and sizes, in order to compute estimates of the number of thetas of a given size, as well as the distribution of the length of shortest or second-shortest arm, or the sum of both. From these data, we calculate estimates for several critical exponents, namely those which govern the number of thetas, the number of monodisperse thetas, the averag… view at source ↗
Figure 5
Figure 5. Figure 5: The set of BFACF moves for spatial graphs on the cubic lattice. The moves in (a) do not change the location of the vertices of degree 3, while the moves in (b) do move at least one of the degree 3 vertices. These are in addition to the regular BFACF moves in view at source ↗
Figure 6
Figure 6. Figure 6: A plot of the average error (3.7) for the Wang-Landau algorithm, sampling SAPs on the square lattice up to size nmax = 130, with a total of 2×108 samples. Algorithm 2 is in green, while Algorithm 3 coincides with Algorithm 2 up to ≈ 1.47 × 107 samples, after which it switches to the “1/t algorithm” and is plotted in blue. It remains to define the random walk over the set of SAPs of size ≤ Nmax. This is whe… view at source ↗
Figure 7
Figure 7. Figure 7: (a) A plot of L ∗ n − n log µ − (α − 2) log n for the square lattice against 1 n . The data are from (I) (blue), (II) (orange) and (III) (green), taken by first averaging over the 20 independent Wang-Landau runs. (b) The same data, except with the value −1.459 used instead of (α − 2). Square lattice For the square and cubic lattices we essentially have two sequences – one for even n and one for odd n. We e… view at source ↗
Figure 8
Figure 8. Figure 8: (a) Plots of the estimated values of ζ for the square lattice, using median data from (I) (blue), (II) (orange) and (III) (green). These are obtained using Mathematica’s LinearModelFit function, fitting L ∗ n − n log µ. The top three sets are fit without any correction-to-scaling term, while the bottom three do include the a n∆ term, with ∆ = 1. The horizontal axis is 1 nmin . (b) A plot of R∗ n as per (4.… view at source ↗
Figure 9
Figure 9. Figure 9: (a) Plots of θ [1]∗ n −n log µ−(α−2) (blue) and similarly for θ [2]∗ n (orange) and θ [12]∗ n (green), all against 1 n , for the square lattice. These have been shifted vertically so that the final term is 0 (so that they all fit on the same plot). The plots are linear as expected. (b) A similar plot to view at source ↗
Figure 10
Figure 10. Figure 10: (a) A plot of L ∗ n − n log µ0 − (α − 2) log n for the cubic lattice against √ 1 n . The data are from (I) (blue), (II) (orange) and (III) (green), taken by first averaging over the 20 independent Wang-Landau runs. (b) A plot of R∗ n as per (4.11), using data from (I) (blue), (II) (orange) and (III) (green) computed by first averaging over the 20 independent Wang-Landau runs. The horizontal axis is √ 1 n . 13 view at source ↗
Figure 11
Figure 11. Figure 11: (a) A plot of L ∗ n−n log µ0−(−1.67) log n for the cubic lattice against 1 n . The data are from (I) (blue), (II) (orange) and (III) (green), taken by first averaging over the 20 independent Wang-Landau runs. (b) A plot of R∗ n as per (4.11), using data from (I) (blue), (II) (orange) and (III) (green) computed by first averaging over the 20 independent Wang-Landau runs. The horizontal axis is 1 n . A line… view at source ↗
Figure 12
Figure 12. Figure 12: (a) Plots of ⟨ℓ1⟩ ∗ n − 0.574 log n (blue), ⟨ℓ2⟩ ∗ n − 0.579 log n (orange) and ⟨ℓ12⟩ ∗ n − 0.579 log n (green) against 1 n for the square lattice. These have been shifted vertically so that the final term is 0. (b) Plots of the analogous quantities to (4.20), with the same colour schemes. Linear fits have intercepts 0.575 (blue), 0.577 (orange) and 0.581 (green). for a constant s. For 3D we consider both… view at source ↗
Figure 13
Figure 13. Figure 13: (a) Plots of ⟨ℓ1⟩ ∗ n − 0.779 log n (blue), ⟨ℓ2⟩ ∗ n − 0.769 log n (orange) and ⟨ℓ12⟩ ∗ n − 0.769 log n (green) against √ 1 n for the cubic lattice. These have been shifted vertically so that the final term is 0. (b) Plots of the analogous quantities to (4.20), with the same colour schemes, plotted against √ 1 n . Linear fits have intercepts 0.781 (blue), 0.768 (orange) and 0.773 (green). 0.05 0.10 0.15 0… view at source ↗
Figure 14
Figure 14. Figure 14: (a) The distribution of ℓ1 (i.e. the fraction of thetas with a given ℓ1) across thetas of size n = 200 (blue), 300 (orange), 400 (green) and 500 (red). The horizontal axis has been scaled by n. (b) The same plot for the cubic lattice. 16 view at source ↗
Figure 15
Figure 15. Figure 15: Ratio plots for estimating 2η on the (a) square lattice and (b) cubic lattice, both plotted against 1 n and using the median data in all cases. The Metropolis-Hastings transition probabilities were calculated using estimates from (I) (blue), (II) (orange) and (III) (green). 5 Results: monodisperse theta-graphs In this section we consider monodisperse theta-graphs, where the three arms have the same length… view at source ↗
Figure 16
Figure 16. Figure 16: The ratio θ [12] n /θ [1] n for the square lattice (a) and the cubic lattice (b), with n ≡ 0 (mod 3) (blue), n ≡ 1 (mod 3) (orange), and n ≡ 2 (mod 3) (green). The ratios were computed by first averaging over the 10 independent Wang-Landau runs. 0.002 0.004 0.006 0.008 0.010 -4.0 -3.8 -3.6 -3.4 -3.2 0.002 0.004 0.006 0.008 0.010 -3.930 -3.925 -3.920 -3.915 -3.910 -3.905 -3.900 view at source ↗
Figure 17
Figure 17. Figure 17: (a) A ratio plot for θ [1] n (blue) and θ [12] n (orange) on the square lattice, plotted against 1 n (using only values of n which are multiples of 6). Taking linear fits through the last 50 points of both gives the intercept −3.908. (b) The equivalent plot for the cubic lattice. Square lattice Two-dimensional polymer networks with a fixed typology were studied by Duplantier in [17] using renormalisation … view at source ↗
read the original abstract

Theta-graphs are a type of spatial graph with two vertices connected by three edges. We investigate embeddings of theta-graphs in the square and simple cubic lattices, using a combination of the Wang-Landau Monte Carlo method with a variant of the BFACF algorithm which accommodates vertices of degree 3. This allows us to estimate the critical exponents governing the number of theta-graphs and the distributions of the different arm-lengths. For the cubic lattice these values can be compared to the corresponding exponents for prime knots. We also study the number of `monodisperse' theta-graphs where the three arms have the same lengths, and find evidence supporting a conjecture for the critical exponent in two dimensions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript uses a modified BFACF algorithm combined with Wang-Landau Monte Carlo sampling to generate self-avoiding embeddings of theta-graphs on the square and simple cubic lattices. It estimates critical exponents for the number of theta-graphs and arm-length distributions, compares the cubic-lattice results to those for prime knots, and reports numerical evidence supporting a conjecture on the critical exponent for monodisperse (equal arm-length) theta-graphs in two dimensions.

Significance. If the sampling procedure is unbiased and the finite-size analysis is robust, the work supplies new numerical data on the scaling of self-avoiding spatial graphs, extending established techniques from self-avoiding walks and knots. The comparison with knot exponents and the 2D monodisperse conjecture support are of interest to the statistical mechanics of polymers and entangled graphs.

major comments (2)
  1. [Methods] Methods section: The variant of the BFACF algorithm that accommodates degree-3 vertices is described only at a high level; no explicit move set, acceptance probabilities, or handling of the vertex constraint is provided. Because all reported exponent estimates rest on the assumption that this sampler produces unbiased configurations, the absence of these details prevents verification that systematic errors from vertex handling or lattice boundaries are absent.
  2. [Results] Results and finite-size scaling: No error bars, autocorrelation times, convergence diagnostics, or explicit finite-size scaling procedure (e.g., how the effective exponents are extrapolated to the infinite-volume limit) are reported for the central exponent estimates. This directly affects the reliability of the claimed support for the 2D monodisperse conjecture.
minor comments (2)
  1. [Abstract] The abstract states that cubic-lattice values 'can be compared' to knot exponents but does not indicate whether any quantitative comparison or table is provided in the text.
  2. [Introduction] Notation for the critical exponents (e.g., how the growth constant and entropic exponents are defined) should be introduced consistently in the introduction and used uniformly in all figures and tables.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and the constructive comments, which highlight important aspects of reproducibility and statistical reliability. We address each major comment below and outline the revisions we will make.

read point-by-point responses

  1. Referee: [Methods] Methods section: The variant of the BFACF algorithm that accommodates degree-3 vertices is described only at a high level; no explicit move set, acceptance probabilities, or handling of the vertex constraint is provided. Because all reported exponent estimates rest on the assumption that this sampler produces unbiased configurations, the absence of these details prevents verification that systematic errors from vertex handling or lattice boundaries are absent.

    Authors: We agree that the current description of the modified BFACF algorithm is at a high level and insufficient for full verification. In the revised manuscript we will expand the Methods section to include: (i) the complete move set for degree-3 vertices (including the specific local moves that preserve the theta-graph topology while maintaining self-avoidance), (ii) the acceptance probabilities derived from the Wang-Landau flat-histogram sampling, and (iii) the explicit rules used to enforce the vertex constraint and handle lattice-boundary effects. We will also add a short pseudocode outline of the update procedure. These additions will allow independent confirmation that the sampler is unbiased and free of the systematic errors noted by the referee. revision: yes

  2. Referee: [Results] Results and finite-size scaling: No error bars, autocorrelation times, convergence diagnostics, or explicit finite-size scaling procedure (e.g., how the effective exponents are extrapolated to the infinite-volume limit) are reported for the central exponent estimates. This directly affects the reliability of the claimed support for the 2D monodisperse conjecture.

    Authors: We acknowledge that the Results section currently omits quantitative error analysis and a transparent description of the extrapolation procedure. In the revision we will: (i) report statistical error bars on all exponent estimates, (ii) include measured autocorrelation times and convergence diagnostics (e.g., integrated autocorrelation times and histogram flatness checks) for the Wang-Landau runs, and (iii) detail the finite-size scaling ansatz and fitting protocol used to extrapolate effective exponents to the infinite-volume limit. With these additions the numerical support for the 2D monodisperse conjecture will be presented with the necessary statistical safeguards. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper generates numerical estimates of theta-graph counts and arm-length distributions via direct Monte Carlo sampling on lattices using a modified BFACF algorithm with Wang-Landau sampling. Critical exponents are extracted from finite-size scaling of these independently generated counts, including for monodisperse cases, without any algebraic derivation, parameter fitting to prior outputs, or self-referential definitions that reduce the reported results to their inputs by construction. Support for the 2D exponent conjecture follows from these simulation outputs rather than from any load-bearing self-citation or ansatz smuggled in via prior work.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on the assumption that the adapted Monte Carlo algorithm correctly samples the self-avoiding theta-graph ensemble and that finite-size data can be extrapolated to obtain reliable critical exponents.

axioms (1)
  • domain assumption The modified BFACF algorithm generates an unbiased sample of self-avoiding theta-graphs on the lattice.
    The paper's exponent estimates depend on this sampling step being statistically correct.

pith-pipeline@v0.9.0 · 5416 in / 1237 out tokens · 71462 ms · 2026-05-08T17:32:22.895172+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

61 extracted references · 53 canonical work pages

  1. [1]

    A new Monte-Carlo approach to the critical properties of self- avoiding random walks

    C. Aragão de Carvalho and S. Caracciolo. “A new Monte-Carlo approach to the critical properties of self- avoiding random walks”.J. Physique44.3 (1983), pages 323–331.doi: 10.1051/jphys:01983004403032300

    work page doi:10.1051/jphys:01983004403032300 1983

  2. [2]

    Polymers andg|φ| 4 theory in four dimensions

    C. Aragão de Carvalho, S. Caracciolo, and J. Fröhlich. “Polymers andg|φ| 4 theory in four dimensions”. Nuclear Physics B215.2 (1983), pages 209–248.doi: 10.1016/0550-3213(83)90213-4

    work page doi:10.1016/0550-3213(83)90213-4 1983

  3. [3]

    Wang–Landau sampling for estimation of the reliability of physi- cal networks

    W. Atisattapong and P. Marupanthorn. “Wang–Landau sampling for estimation of the reliability of physi- cal networks”.Computer Physics Communications262(2021), page 107831.doi: 10.1016/j.cpc.2021.107831

    work page doi:10.1016/j.cpc.2021.107831 2021

  4. [4]

    The entropic cost to tie a knot

    M. Baiesi, E. Orlandini, and A. L. Stella. “The entropic cost to tie a knot”.J. Stat. Mech.2010.6 (2010), P06012.doi: 10.1088/1742-5468/2010/06/P06012

    work page doi:10.1088/1742-5468/2010/06/p06012 2010

  5. [5]

    Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats

    N. R. Beaton et al. “Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats”.Discrete Applied Mathematics379(2026), pages 242–271.doi: 10.1016/j.dam.2025.08.042

    work page doi:10.1016/j.dam.2025.08.042 2026

  6. [6]

    Fast algorithm to calculate density of states

    R. E. Belardinelli and V. D. Pereyra. “Fast algorithm to calculate density of states”.Phys. Rev. E75.4 (2007), page 046701.doi: 10.1103/PhysRevE.75.046701

    work page doi:10.1103/physreve.75.046701 2007

  7. [7]

    Random paths and random surfaces on a digital computer

    B. Berg and D. Foerster. “Random paths and random surfaces on a digital computer”.Phys. Lett. B106.4 (1981), pages 323–326.doi: 10.1016/0370-2693(81)90545-1

    work page doi:10.1016/0370-2693(81)90545-1 1981

  8. [8]

    Force-induced desorption of 3-star polymers in two dimensions

    C. J. Bradly et al. “Force-induced desorption of 3-star polymers in two dimensions”.J. Phys. A: Math. Theor. 52.31 (2019), page 315002.doi: 10.1088/1751-8121/ab2af4

    work page doi:10.1088/1751-8121/ab2af4 2019

  9. [9]

    Correction-to-Scaling Exponents for Two-Dimensional Self-Avoiding Walks

    S. Caracciolo et al. “Correction-to-Scaling Exponents for Two-Dimensional Self-Avoiding Walks”.J. Stat. Phys.120.5 (2005), pages 1037–1100.doi: 10.1007/s10955-005-7004-3

    work page doi:10.1007/s10955-005-7004-3 2005

  10. [10]

    Accurate Estimate of the Critical Exponentνfor Self-Avoiding Walks via a Fast Implementation of the Pivot Algorithm

    N. Clisby. “Accurate Estimate of the Critical Exponentνfor Self-Avoiding Walks via a Fast Implementation of the Pivot Algorithm”.Phys. Rev. Lett.104.5 (2010), page 055702.doi: 10.1103/PhysRevLett.104.055702

    work page doi:10.1103/physrevlett.104.055702 2010

  11. [11]

    Calculation of the connective constant for self-avoiding walks via the pivot algorithm

    N. Clisby. “Calculation of the connective constant for self-avoiding walks via the pivot algorithm”.J. Phys. A: Math. Theor.46.24 (2013), page 245001.doi: 10.1088/1751-8113/46/24/245001

    work page doi:10.1088/1751-8113/46/24/245001 2013

  12. [12]

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

    N. Clisby and B. Dünweg. “High-precision estimate of the hydrodynamic radius for self-avoiding walks”. Phys. Rev. E94.5 (2016), page 052102.doi: 10.1103/PhysRevE.94.052102

    work page doi:10.1103/physreve.94.052102 2016

  13. [13]

    A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice

    N. Clisby and I. Jensen. “A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice”.J. Phys. A: Math. Theor.45.11 (2012), page 115202.doi: 10.1088/1751-8113/45/11/115202

    work page doi:10.1088/1751-8113/45/11/115202 2012

  14. [14]

    Theta-curves in proteins

    P. Dabrowski-Tumanski et al. “Theta-curves in proteins”.Protein Science33.9 (2024), e5133.doi: 10.1002/pro.5133

    work page doi:10.1002/pro.5133 2024

  15. [15]

    De Gennes.Scaling Concepts in Polymer Physics

    P. De Gennes.Scaling Concepts in Polymer Physics. Cornell University Press, 1979.isbn: 9780801412035

    1979

  16. [16]

    Mathematical Problems in the Biological Sciences

    M. Delbruck and F. B. Fuller. “Mathematical Problems in the Biological Sciences”.Proceedings of the Sympo- sium on Applied Mathematics. Volume 14. Providence, RI: American Mathematical Society, 1962, pages 55– 63.doi: https://doi.org/10.1090/psapm/014

    work page doi:10.1090/psapm/014 1962

  17. [17]

    Polymer Network of Fixed Topology: Renormalization, Exact Critical Exponentγin Two Dimensions, andd= 4−ε

    B. Duplantier. “Polymer Network of Fixed Topology: Renormalization, Exact Critical Exponentγin Two Dimensions, andd= 4−ε”.Phys. Rev. Lett.57.18 (1986), pages 2332–2332.doi: 10.1103/PhysRevLett.57.2332

    work page doi:10.1103/physrevlett.57.2332 1986

  18. [18]

    Statistical mechanics of polymer networks of any topology

    B. Duplantier. “Statistical mechanics of polymer networks of any topology”.J. Stat. Phys.54.3 (1989), pages 581–680.doi: 10.1007/BF01019770

    work page doi:10.1007/bf01019770 1989

  19. [19]

    Pulling knotted polymers

    O. Farago, Y. Kantor, and M. Kardar. “Pulling knotted polymers”.Europhys Lett.60.1 (2002), page 53.doi: 10.1209/epl/i2002-00317-0

    work page doi:10.1209/epl/i2002-00317-0 2002

  20. [20]

    Chemical Topology

    H. L. Frisch and E. Wasserman. “Chemical Topology”.J. Amer. Chem. Soc.83.18 (1961), pages 3789–3795. doi: 10.1021/ja01479a015.url: https://doi.org/10.1021%2Fja01479a015

    work page doi:10.1021/ja01479a015.url: 1961

  21. [21]

    Monte Carlo Enumeration of Topological Polymers

    J. Gleeson. “Monte Carlo Enumeration of Topological Polymers”. Master’s thesis. University of Melbourne, 2024

    2024

  22. [22]

    Polymer Networks: From Plastics and Gels to Porous Frameworks

    Y. Gu, J. Zhao, and J. A. Johnson. “Polymer Networks: From Plastics and Gels to Porous Frameworks”. Angewandte Chemie International Edition59.13 (2020), pages 5022–5049.doi: 10.1002/anie.201902900

    work page doi:10.1002/anie.201902900 2020

  23. [23]

    A. J. Guttmann, editor.Polygons, Polyominoes and Polycubes. Lecture Notes in Physics. Springer Nether- lands, 2009. 21

    2009

  24. [24]

    Limiting ring closure probability index for the self avoiding random walk problem

    A. J. Guttmann and M. F. Sykes. “Limiting ring closure probability index for the self avoiding random walk problem”.J. Phys. C: Solid State Phys.6.6 (1973), page 945.doi: 10.1088/0022-3719/6/6/009

    work page doi:10.1088/0022-3719/6/6/009 1973

  25. [25]

    Two-dimensional lattice embeddings of connected graphs of cy- clomatic index two

    A. J. Guttmann and S. G. Whittington. “Two-dimensional lattice embeddings of connected graphs of cy- clomatic index two”.J. Phys. A: Math. Gen.11.4 (1978), pages 721–729.doi: 10.1088/0305-4470/11/4/013

    work page doi:10.1088/0305-4470/11/4/013 1978

  26. [26]

    Self-avoiding walks and trails on the3.12 2 lattice

    A. J. Guttmann, R. Parviainen, and A. Rechnitzer. “Self-avoiding walks and trails on the3.12 2 lattice”.J. Phys. A: Math. Gen.38.3 (2004), page 543.doi: 10.1088/0305-4470/38/3/002

    work page doi:10.1088/0305-4470/38/3/002 2004

  27. [27]

    A. J. Guttmann. Private communication. 2021

    2021

  28. [28]

    On the growth constant for square-lattice self-avoiding walks

    J. L. Jacobsen, C. R. Scullard, and A. J. Guttmann. “On the growth constant for square-lattice self-avoiding walks”.J. Phys. A: Math. Theor.49.49 (2016), page 494004.doi: 10.1088/1751-8113/49/49/494004

    work page doi:10.1088/1751-8113/49/49/494004 2016

  29. [29]

    Exponential growth rate of lattice comb polymers

    E. J. Janse van Rensburg and S. G. Whittington. “Exponential growth rate of lattice comb polymers”.J. Phys. A: Math. Theor.57.48 (2024), page 485002.doi: 10.1088/1751-8121/ad8a2d

    work page doi:10.1088/1751-8121/ad8a2d 2024

  30. [30]

    Thoughts on lattice knot statistics

    E. J. Janse van Rensburg. “Thoughts on lattice knot statistics”.J. Math. Chem.45.1 (2008), page 7.doi: 10.1007/s10910-008-9364-9

    work page doi:10.1007/s10910-008-9364-9 2008

  31. [31]

    Monte Carlo methods for the self-avoiding walk

    E. J. Janse van Rensburg. “Monte Carlo methods for the self-avoiding walk”.J. Phys. A: Math. Theor.42.32 (2009), page 323001.doi: 10.1088/1751-8113/42/32/323001

    work page doi:10.1088/1751-8113/42/32/323001 2009

  32. [32]

    E. J. Janse van Rensburg.The Statistical Mechanics of Interacting Walks, Polygons, Animals and Vesicles. Second Edition. Oxford Lecture Series in Mathematics and Its Applications. Oxford, New York: Oxford University Press, 2015. 640 pages

    2015

  33. [33]

    (2015) Hamiltonian formalism and path entropy maximization.J

    E. J. Janse van Rensburg and A. Rechnitzer. “BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices”.J. Phys. A: Math. Theor.44.16 (2011), page 165001.doi: 10.1088/1751- 8113/44/16/165001

    work page doi:10.1088/1751- 2011

  34. [34]

    On the universality of knot probability ratios

    E. J. Janse van Rensburg and A. Rechnitzer. “On the universality of knot probability ratios”.J. Phys. A: Math. Theor.44.16 (2011), page 162002.doi: 10.1088/1751-8113/44/16/162002

    work page doi:10.1088/1751-8113/44/16/162002 2011

  35. [35]

    Generalized atmospheric sampling of knotted polygons

    E. J. Janse van Rensburg and A. Rechnitzer. “Generalized atmospheric sampling of knotted polygons”.J. Knot Theory Ramifications(2012).doi: 10.1142/S0218216511009170

    work page doi:10.1142/s0218216511009170 2012

  36. [36]

    The knot probability in lattice polygons

    E. J. Janse van Rensburg and S. G. Whittington. “The knot probability in lattice polygons”.J. Phys. A: Math. Gen.23.15 (1990), page 3573.doi: 10.1088/0305-4470/23/15/028

    work page doi:10.1088/0305-4470/23/15/028 1990

  37. [37]

    The BFACF algorithm and knotted polygons

    E. J. Janse van Rensburg and S. G. Whittington. “The BFACF algorithm and knotted polygons”.J. Phys. A: Math. Gen.24.23 (1991), pages 5553–5567.doi: 10.1088/0305-4470/24/23/021

    work page doi:10.1088/0305-4470/24/23/021 1991

  38. [38]

    The dimensions of knotted polygons

    E. J. Janse van Rensburg and S. G. Whittington. “The dimensions of knotted polygons”.J. Phys. A: Math. Gen.24.16 (1991), page 3935.doi: 10.1088/0305-4470/24/16/028

    work page doi:10.1088/0305-4470/24/16/028 1991

  39. [39]

    Lattice conformation of theta-curves accompanied with Brunnian property

    H. Kim et al. “Lattice conformation of theta-curves accompanied with Brunnian property”.J. Phys. A: Math. Theor.55.43 (2022), page 435207.doi: 10.1088/1751-8121/ac845a

    work page doi:10.1088/1751-8121/ac845a 2022

  40. [40]

    A new approach to Monte Carlo simulations in statistical physics: Wang-Landau sampling

    D. P. Landau, S.-H. Tsai, and M. Exler. “A new approach to Monte Carlo simulations in statistical physics: Wang-Landau sampling”.Am. J. Phys.72.10 (2004), pages 1294–1302.doi: 10.1119/1.1707017

    work page doi:10.1119/1.1707017 2004

  41. [41]

    Numerical integration using Wang–Landau sampling

    Y. Li et al. “Numerical integration using Wang–Landau sampling”.Computer Physics Communications 177.6 (2007), pages 524–529.doi: 10.1016/j.cpc.2007.06.001

    work page doi:10.1016/j.cpc.2007.06.001 2007

  42. [42]

    Madras and G

    N. Madras and G. Slade.The Self-Avoiding Walk. Boston: Birkhäuser, 1996.isbn: 978-0-8176-3891-7 978-3- 7643-3891-6 978-0-8176-3589-3

    1996

  43. [43]

    On the Wang–Landau method using the N-fold way

    A. Malakis et al. “On the Wang–Landau method using the N-fold way”.Int. J. Mod. Phys. C15.5 (2004), pages 729–740.doi: 10.1142/S0129183104006182

    work page doi:10.1142/s0129183104006182 2004

  44. [44]

    Properties of knotted ring polymers. I. Equilibrium dimensions

    M. L. Mansfield and J. F. Douglas. “Properties of knotted ring polymers. I. Equilibrium dimensions”.J. Chem. Phys.133.4 (2010), page 044903.doi: 10.1063/1.3457160

    work page doi:10.1063/1.3457160 2010

  45. [46]

    An enumeration of theta-curves with up to seven crossings

    H. Moriuchi. “An enumeration of theta-curves with up to seven crossings”.J. Knot Theory Ramifications 18.2 (2009), pages 167–197.doi: 10.1142/S0218216509006884. 22

    work page doi:10.1142/s0218216509006884 2009

  46. [47]

    Topological aspects of theta-curves in cubic lattice

    S. No, S. Oh, and H. Yoo. “Topological aspects of theta-curves in cubic lattice”.J. Phys. A: Math. Theor. 54.45 (2021), page 455204.doi: 10.1088/1751-8121/ac2ae9

    work page doi:10.1088/1751-8121/ac2ae9 2021

  47. [48]

    The size of knots in polymers

    E. Orlandini, A. L. Stella, and C. Vanderzande. “The size of knots in polymers”.Phys. Biol.6.2 (2009), page 025012.doi: 10.1088/1478-3975/6/2/025012

    work page doi:10.1088/1478-3975/6/2/025012 2009

  48. [49]

    Knots in self-avoiding walks

    D. W. Sumners and S. G. Whittington. “Knots in self-avoiding walks”.J. Phys. A: Math. Gen.21.7 (1988), page 1689.doi: 10.1088/0305-4470/21/7/030

    work page doi:10.1088/0305-4470/21/7/030 1988

  49. [50]

    Some Counting Theorems in the Theory of the Ising Model and the Excluded Volume Prob- lem

    M. F. Sykes. “Some Counting Theorems in the Theory of the Ising Model and the Excluded Volume Prob- lem”.J. Math. Phys.2.1 (1961), pages 52–62.doi: 10.1063/1.1724212

    work page doi:10.1063/1.1724212 1961

  50. [51]

    Knots and Spatial Graphs in the Simple Cubic Lattice

    K. Tamaki. “Knots and Spatial Graphs in the Simple Cubic Lattice”. Master’s thesis. Saitama University, 2018

    2018

  51. [52]

    Phase transitions of a single polymer chain: A Wang–Landau sim- ulation study

    M. P. Taylor, W. Paul, and K. Binder. “Phase transitions of a single polymer chain: A Wang–Landau sim- ulation study”.J. Chem. Phys.131.11 (2009), page 114907.doi: 10.1063/1.3227751

    work page doi:10.1063/1.3227751 2009

  52. [53]

    Synthesis ofθ-Shaped Poly(THF) by Electrostatic Self-Assembly and Covalent Fixation with Three-Armed Star Telechelics Having Cyclic Ammonium Salt Groups

    Y. Tezuka et al. “Synthesis ofθ-Shaped Poly(THF) by Electrostatic Self-Assembly and Covalent Fixation with Three-Armed Star Telechelics Having Cyclic Ammonium Salt Groups”.Macromolecules36.1 (2003), pages 65–70.doi: 10.1021/ma0209850

    work page doi:10.1021/ma0209850 2003

  53. [54]

    Spontaneous Knotting and Unknotting of Flexible Linear Polymers: Equilibrium and Kinetic Aspects

    L. Tubiana et al. “Spontaneous Knotting and Unknotting of Flexible Linear Polymers: Equilibrium and Kinetic Aspects”.Macromolecules46.9 (2013), pages 3669–3678.doi: 10.1021/ma4002963

    work page doi:10.1021/ma4002963 2013

  54. [55]

    Topology in soft and biological matter

    L. Tubiana et al. “Topology in soft and biological matter”.Physics Reports1075(2024), pages 1–137.doi: 10.1016/j.physrep.2024.04.002

    work page doi:10.1016/j.physrep.2024.04.002 2024

  55. [56]

    Statistical properties of multi-theta polymer chains

    E. Uehara and T. Deguchi. “Statistical properties of multi-theta polymer chains”.J. Phys. A: Math. Theor. 51.13 (2018), page 134001.doi: 10.1088/1751-8121/aaae2d

    work page doi:10.1088/1751-8121/aaae2d 2018

  56. [57]

    Knots in Globule and Coil Phases of a Model Polyethylene

    P. Virnau, Y. Kantor, and M. Kardar. “Knots in Globule and Coil Phases of a Model Polyethylene”.127.43 (2005), pages 15102–15106.doi: 10.1021/ja052438a

    work page doi:10.1021/ja052438a 2005

  57. [58]

    Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States

    F. Wang and D. P. Landau. “Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States”.Phys. Rev. Lett.86.10 (2001), pages 2050–2053.doi: 10.1103/PhysRevLett.86.2050

    work page doi:10.1103/physrevlett.86.2050 2001

  58. [59]

    S. G. Whittington. Private communication. 2026

    2026

  59. [60]

    Barra and P

    T. Wüst and D. P. Landau. “Versatile Approach to Access the Low Temperature Thermodynamics of Lattice Polymers and Proteins”.Phys. Rev. Lett.102.17 (Apr. 29, 2009), page 178101.doi: 10.1103/Phys- RevLett.102.178101

    work page doi:10.1103/phys- 2009

  60. [61]

    Massively parallel Wang–Landau sampling on multiple GPUs

    J. Yin and D. Landau. “Massively parallel Wang–Landau sampling on multiple GPUs”.Computer Physics Communications183.8 (2012), pages 1568–1573.doi: 10.1016/j.cpc.2012.02.023

    work page doi:10.1016/j.cpc.2012.02.023 2012

  61. [62]

    A parallel implementation of the Wang–Landau algorithm

    L. Zhan. “A parallel implementation of the Wang–Landau algorithm”.Computer Physics Communications 179.5 (2008), pages 339–344.issn: 0010-4655.doi: 10.1016/j.cpc.2008.04.002. 23

    work page doi:10.1016/j.cpc.2008.04.002 2008