Related papers: Predicting Optimal Lengths of Random Knots
We probe the character of knotting in open, confined polymers, assigning knot types to open curves by identifying their projections as virtual knots. In this sense, virtual knots are transitional, lying in between classical knot types,…
In polymer physics it is typically assumed that excluded volume interactions are effectively screened in polymer melts. Hence, chains could be described by an effective random walk without excluded volume interactions. In this letter, we…
We study experimentally statistical properties of the opening times of knots in vertically vibrated granular chains. Our measurements are in good qualitative and quantitative agreement with a theoretical model involving three random walks…
The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…
We study the formation of knots on a macroscopic ball-chain, which is shaken on a horizontal plate at 12 times the acceleration of gravity. We find that above a certain critical length, the knotting probability is independent of chain…
We find a power law for the number of knot-monomers with an exponent $0.39 \pm0.13$ in agreement with previous simulations. For the average size of a knot we also obtain a power law $N_m=2.56\cdot N^{0.20\pm0.04}$. We further present data…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…
We give two different, statistically consistent definitions of the length l of a prime knot tied into a polymer ring. In the good solvent regime the polymer is modelled by a self avoiding polygon of N steps on cubic lattice and l is the…
Predicting links in complex networks has been one of the essential topics within the realm of data mining and science discovery over the past few years. This problem remains an attempt to identify future, deleted, and redundant links using…
The weights of a neural network are typically initialized at random, and one can think of the functions produced by such a network as having been generated by a prior over some function space. Studying random networks, then, is useful for a…
A central paradigm of polymer physics states that chains in melts behave like random walks as intra- and interchain interactions effectively cancel each other out. Likewise, $\theta$-chains, i.e., chains at the transition from a swollen…
The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…
The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topological objects with interesting properties. The knotting of…
The freely jointed chain is often applied to model the thermodynamics of single polymer chains, but the traditional formulation of the model lacks internal energy changes due to bond stretching. For this reason, the extensible freely…
An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…
The problem of missing link prediction in complex networks has attracted much attention recently. Two difficulties in link prediction are the sparsity and huge size of the target networks. Therefore, the design of an efficient and effective…
For a knot or link K, let L(K) be the ropelength of K and Cr(K) be the crossing number of K. In this paper, we show that there exists a constant a>0 such that L(K) is bounded above by a Cr(K) ln^5 (Cr(K)) for any knot K. This result shows…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius $r$. We show numerically that the characteristic length of random knotting is roughly…