Related papers: Volumes of Random Alternating Link Diagrams
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
W. Thurston suggested a method for computing hyperbolic volume of hyperbolic 3-manifolds, based on a triangulation of the manifold. The method was implemented by J. Weeks in the program SnapPea, which produces a decimal approximation as a…
In this paper, we define invariants of links in terms of colorings of link diagrams and prove that these invariants coincide with various notions of widths of links with respect to the standard Morse function. Our formulations are…
We show that for a large class of hyperbolic knots and links, we can determine bounds on the volume of the link complement from combinatorial information given by a link diagram. Specifically, there is a universal constant C such that if a…
The ribbonlength of a link is a geometric invariant defined as the infimum of the ratio of the length to the width of a folded ribbon realization of the link. In this paper, we prove that if an alternating link admits an alternating diagram…
We show that the cusp volume of a hyperbolic alternating knot can be bounded above and below in terms of the twist number of an alternating diagram of the knot. This leads to diagrammatic estimates on lengths of slopes, and has some…
We consider and analyze a dynamic model of random hyperbolic graphs with link persistence. In the model, both connections and disconnections can be propagated from the current to the next snapshot with probability $\omega \in [0, 1)$.…
A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…
This article proposes a method to quantify the structure of a bipartite graph using a network entropy per link. The network entropy of a bipartite graph with random links is calculated both numerically and theoretically. As an application…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
We present a statistical approach for the discovery of relationships between mathematical entities that is based on linear regression and deep learning with fully connected artificial neural networks. The strategy is applied to…
We obtain bounds on hyperbolic volume for periodic links and Conway sums of alternating tangles. For links that are Conway sums we also bound the hyperbolic volume in terms of the coefficients of the Jones polynomial.
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…
We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…
Structural properties of large random maps and lambda-terms may be gleaned by studying the limit distributions of various parameters of interest. In our work we focus on restricted classes of maps and their counterparts in the…
Deformations of knots and links in ambient space can be studied combinatorially on their diagrams via local modifications called Reidemeister moves. While it is well-known that, in order to move between equivalent diagrams with Reidemeister…
We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and we…
The hyperbolic volume of a link complement is known to be unchanged when a half-twist is added to a link diagram, and a suitable 3-punctured sphere is present in the complement. We generalize this to the simplicial volume of link…
We examine the conjecture, due to Champanerkar, Kofman, and Purcell that $\text{vol}(K) < 2 \pi \log \det (K)$ for alternating hyperbolic links, where $\text{vol}(K) = \text{vol}(S^3\backslash K)$ is the hyperbolic volume and $\det(K)$ is…
It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…