Monte Carlo sampling of self-avoiding theta-graphs on lattices yields estimates of critical exponents for enumeration and arm lengths, plus evidence supporting a 2D monodisperse conjecture.
Limiting ring closure probability index for the self avoiding random walk problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.stat-mech 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Random sampling of self-avoiding theta-graphs
Monte Carlo sampling of self-avoiding theta-graphs on lattices yields estimates of critical exponents for enumeration and arm lengths, plus evidence supporting a 2D monodisperse conjecture.