Mean unknotting times of random knots and embeddings
From MaRDI portal
Publication:5239356
Recommendations
Cites work
- scientific article; zbMATH DE number 201032 (Why is no real title available?)
- A note on expected hitting times for birth and death chains
- A note on unknotting number
- Another Look at the Ehrenfest Urn Via Electric Networks
- Entanglement complexity of graphs in Z3
- Entanglement complexity of lattice ribbons
- Fluctuation Theory for the Ehrenfest urn
- Fluctuation theory for the Ehrenfest urn via electric networks
- Knots in random walks
- Knots in self-avoiding walks
- Mean passage times for tridiagonal transition matrices and a two-parameter ehrenfest urn model
- Monte Carlo results for projected self-avoiding polygons: a two-dimensional model for knotted polymers
- ON RANDOM KNOTS
- On a generalization of the ehrenfest urn model
- On the Number of Self-Avoiding Walks
- Some Examples Related to 4-Genera, Unknotting Numbers and Knot Polynomials
- Some Inequalities for Reversible Markov Chains
- The unknotting numbers of \(10_{139}\) and \(10_{152}\) are 4
- UNKNOTTING NUMBERS AND MINIMAL KNOT DIAGRAMS
Cited in
(1)
This page was built for publication: Mean unknotting times of random knots and embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239356)