Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

57114171228 · Jun 202019922001200920172026
48 results for knot probabilities

We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability. Every free knot diagram is proven to produce trefoil knots, and certain simple fami…

2019-12-13abs ↗pdf ↗

Study reveals a universal formula for knotting in random equilateral polygons.

problem Probability of knotting in equilateral random polygons.
method Extensive Monte Carlo simulations with improved algorithms and knot invariants.
result A universal scaling formula for knotting probability with number of edges, involving exponential and power law factors.

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 compute exact probabilities for knots in this model. As expected, most diagrams with 1…

2015-12-17abs ↗pdf ↗

It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the knotting probability of an arc diagram is defined as an invariant under isomorphic …

2019-07-24abs ↗pdf ↗

For a positive integer n3n\ge 3, the collection of nn-sided polygons embedded in 33-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded nn-sided polygons with unit length edges. Paths in this space determine isotopies of polygons, so path-components …

2018-10-28abs ↗pdf ↗

We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a knot at random among all knots with bridge index at most 2. Restricted to this c…

2015-05-28abs ↗pdf ↗

The representation of knots by petal diagrams (Adams et al. 2012) naturally defines a sequence of distributions on the set of knots. In this article we establish some basic properties of this randomized knot model. We prove that in the random n-petal model the probability of obtaining every specific knot type decays to…

2017-06-20abs ↗pdf ↗

In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also show that the probability of any given knot appearing in this model decays to ze…

2016-06-01abs ↗pdf ↗

For a polygonal knot K, it is shown that a tube of radius R(K), the polygonal thickness radius, is an embedded torus. Given a thick configuration K, perturbations of size r<R(K) define satellite structures, or local knotting. We explore knotting within these tubes both theoretically and numerically. We provide bounds o…

2005-08-16abs ↗pdf ↗

We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for k18k \geq 18, most graphs of order kk are intrinsically knotted and, for k2n+9k \geq 2n+9, most of order kk are not nn-apex…

2018-11-23abs ↗pdf ↗

The trunk of a knot in S3S^3, defined by Makoto Ozawa, is a measure of geometric complexity similar to the bridge number or width of a knot. We prove that for any two knots K1K_1 and K2K_2, we have tr(K1#K2)=max{tr(K1),tr(K2)}tr(K_1 \# K_2) = \max\{tr(K_1),tr(K_2)\}, confirming a conjecture of Ozawa. Another conjecture of Ozawa asserts that any…

2016-07-29abs ↗pdf ↗

Uniform Closure Method and Bayes classifier perform similarly in classifying open knots.

problem Classifying knots in open macromolecular chains.
method Used the Bayes MAP classifier and compared it to the Uniform Closure Method.
result Both methods have comparable accuracy and positive predictive value.

Study on knotting in very long polymer chains, finding Poisson distribution for prime knot types.

problem Understanding knotting in very long polymer chains.
method Generated and analyzed 243k2^{43-k} polygons of size n=2kn=2^k using tree data structure and pivot algorithm. Used new knot diagram simplification and invariant-free classification.
result Number of prime summands of knot type KK in a random nn-gon is well described by a Poisson distribution.

A knot K in the 3-sphere is said to have Property nR if, whenever K is a component of an n-component link L and some integral surgery on L produces the connected sum of n copies of S^1 x S^2, there is a sequence of handle slides on L that converts L into a 0-framed unlink. The Generalized Property R Conjecture is that …

2009-08-19abs ↗pdf ↗

A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane curves. At present the most efficient method for sampling diagrams is rejection sa…

2018-04-10abs ↗pdf ↗

A surprising image of the stock market arises if the price time series of all Dow Jones Industrial Average stock components are represented in one chart at once. The chart evolves into a braid representation of the stock market by taking into account only the crossing of stocks and fixing a convention defining overcros…

2014-06-13abs ↗pdf ↗

We study random knots, which we define as a triple of random periodic functions (where a random function is a random trigonometric series, \[f(θ) = \sum_{k=1}^\infty a_k \cos (k θ) +b_k (\sin k θ),\] with ak,bka_k, b_k are independent gaussian random variables with mean 00 and variance σ(k)2σ(k)^2 - our results will depend …

2016-07-18abs ↗pdf ↗

In recent work with J.Mostovoy and T.Stanford,the author found that for every natural number n, a certain polynomial in the coefficients of the Conway polynomial is a primitive integer-valued degree n Vassiliev invariant, but that modulo 2, it becomes degree n-1. The conjecture then naturally suggests itself that these…

2005-03-28abs ↗pdf ↗

Earlier work with Robert Gompf and Abigail Thompson classified, via a natural slope indexed by the rationals, all two-component links which contain the square knot and from which (S1×S2)#(S1×S2)(S^1 \times S^2) \# (S^1 \times S^2) can be obtained by surgery. It was argued that a certain family LnL_n of such links probably contradic…

2012-08-06abs ↗pdf ↗

Study on entanglement complexity of confined ring polymers in lattice tubes.

problem Understanding the entanglement complexity of confined ring polymers in lattice tubes.
method Applied knot theory to extend and prove results about the complexity of 2SAPs.
result Proved that all but exponentially few size m 2SAPs have F complexity that grows at least linearly in m as m approaches infinity.

Knot contact homology is an invariant of knots derived from Legendrian contact homology which has numerous connections to the knot group. We use basic properties of knot groups to prove that knot contact homology detects every torus knot. Further, if the knot contact homology of a knot is isomorphic to that of a cable …

2015-09-05abs ↗pdf ↗

We study Legendrian knots in a cabled knot type. Specifically, given a topological knot type K, we analyze the Legendrian knots in knot types obtained from K by cabling, in terms of Legendrian knots in the knot type K. As a corollary of this analysis, we show that the (2,3)-cable of the (2,3)-torus knot is not transver…

2003-06-23abs ↗pdf ↗

Study concordance of alternating torus knots to L-space knots.

problem When are linear combinations of alternating torus knots concordant to L-space knots?
method Proved Allen's conjecture for alternating torus knots and established a necessary condition.
result Linear combinations of alternating torus knots are concordant to L-space knots if and only if they are a single torus knot.

The study confirms conjectures about slopes of knots using knot Floer homology.

problem Verifying conjectures about non-integer characterizing slopes of knots.
method Using knot Floer homology, the study verifies conjectures for specific classes of knots.
result Almost all slopes are characterizing for many knots, and infinitely many for LL-space knots.

A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the quadrisecant approximation of the original knot. It was conjectured that the quadrisecan…

2016-05-02abs ↗pdf ↗