It was proved in [4] that the knotting probability of a Gaussian random polygon goes to 1 as the length of the polygon goes to infinity. In this paper, we prove the same result for the equilateral random polygons in R3. More precisely, if EPn is an equilateral random polygon of n steps, then we have P(EPn is knotted) \u3e 1 - exp(-n∊) provided that n is large enough, where ∊ is some positive constant
In this paper we study the average crossing number and writhe of random freely-jointed polygons in s...
For even n≥4, let πn denote the probability that a random self-avoiding polygon of n steps on the th...
Abstract. We estimate by Monte Carlo simulations the configurational entropy of N-steps polygons in ...
In this paper, we consider knotting of Gaussian random polygons in 3-space. A Gaussian random polyg...
Abstract. Let pn denote the number of self-avoiding polygons of length n on a regular three-dimensio...
In this paper, we study the average crossing number of equilateral random walks and polygons. We sho...
We study universal properties of random knotting by making an extensive use of isotopy invariants of...
This data set consists of random equilateral confined knot configurations and their corresponding kn...
This data set consists of random equilateral confined knot configurations and their corresponding kn...
For a positive integer n ≥ 3, the collection of n-sided polygons embedded in 3-space defines the spa...
We use Monte Carlo methods to investigate the asymptotic behaviour of the number and mean-square rad...
We study the knot probability of polygons confined to slabs or prisms, considered as subsets of t...
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, w...
Random knots are created from the experiment of randomly closing the ends of nicked circular DNA. We...
Random knot models are often used to measure the types of entanglements one would expect to observe ...
In this paper we study the average crossing number and writhe of random freely-jointed polygons in s...
For even n≥4, let πn denote the probability that a random self-avoiding polygon of n steps on the th...
Abstract. We estimate by Monte Carlo simulations the configurational entropy of N-steps polygons in ...
In this paper, we consider knotting of Gaussian random polygons in 3-space. A Gaussian random polyg...
Abstract. Let pn denote the number of self-avoiding polygons of length n on a regular three-dimensio...
In this paper, we study the average crossing number of equilateral random walks and polygons. We sho...
We study universal properties of random knotting by making an extensive use of isotopy invariants of...
This data set consists of random equilateral confined knot configurations and their corresponding kn...
This data set consists of random equilateral confined knot configurations and their corresponding kn...
For a positive integer n ≥ 3, the collection of n-sided polygons embedded in 3-space defines the spa...
We use Monte Carlo methods to investigate the asymptotic behaviour of the number and mean-square rad...
We study the knot probability of polygons confined to slabs or prisms, considered as subsets of t...
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, w...
Random knots are created from the experiment of randomly closing the ends of nicked circular DNA. We...
Random knot models are often used to measure the types of entanglements one would expect to observe ...
In this paper we study the average crossing number and writhe of random freely-jointed polygons in s...
For even n≥4, let πn denote the probability that a random self-avoiding polygon of n steps on the th...
Abstract. We estimate by Monte Carlo simulations the configurational entropy of N-steps polygons in ...
DOI
Add to ORKG