Random sampling of self-avoiding theta-graphs
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Pseudo-random numbers; Monte Carlo methods (11K45) Relations of low-dimensional topology with graph theory (57M15) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Cites work
- A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
- A parallel implementation of the Wang-Landau algorithm
- Adsorption of uniform lattice animals with specified topology
- ALMOST UNKNOTTED EMBEDDINGS OF GRAPHS IN Z3 AND HIGHER DIMENSIONAL ANALOGUES
- AN ENUMERATION OF THETA-CURVES WITH UP TO SEVEN CROSSINGS
- BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Correction-to-scaling exponents for two-dimensional self-avoiding walks
- Entanglement complexity of graphs in Z3
- Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats
- Exponential growth rate of lattice comb polymers
- Force-induced desorption of 3-star polymers in two dimensions
- Generalized atmospheric sampling of knotted polygons
- History and introduction to polygon models and polyominoes
- Knots in self-avoiding walks
- Lattice conformation of theta-curves accompanied with Brunnian property
- MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
- Monte Carlo methods for the self-avoiding walk
- Numerical integration using Wang-Landau sampling
- On the growth constant for square-lattice self-avoiding walks
- On the universality of knot probability ratios
- ON THE WANG–LANDAU METHOD USING THE N-FOLD WAY
- Self-avoiding walks and trails on the 3.122 lattice
- Statistical properties of multi-theta polymer chains
- The BFACF algorithm and knotted polygons
- The dimensions of knotted polygons
- The knot probability in lattice polygons
- The self-avoiding walk.
- The statistical mechanics of interacting walks, polygons, animals and vesicles
- Thoughts on lattice knot statistics
- Topological aspects of theta-curves in cubic lattice*
- Wang-Landau sampling for estimation of the reliability of physical networks
This page was built for publication: Random sampling of self-avoiding theta-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444806)