Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEfficient geodesics and an effective algorithm for distance in the complex of curves
97
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We give an algorithm for determining the distance between two vertices of the complex of curves. While there already exist such algorithms, for example by Leasure, Shackleton, and Webb, our approach is new, simple, and more effective for all distances accessible by computer. Our method gives a new preferred finite set of geodesics between any two vertices of the complex, called efficient geodesics, which are different from the tight geodesics introduced by Masur and Minsky.
rate research
Read More
We prove a quantitative estimate, with a power saving error term, for the number of simple closed geodesics of length at most $L$ on a compact surface equipped with a Riemannian metric of negative curvature. The proof relies on the exponential mixing rate for the Teichm{u}ller geodesic flow.
We express the Masur-Veech volume and the area Siegel-Veech constant of the moduli space of meromorphic quadratic differential with simple poles as polynomials in the intersection numbers of psi-classes supported on the boundary cycles of the Deligne-Mumford compactification of the moduli space of curves. Our formulae are derived from lattice point count involving the Kontsevich volume polynomials that also appear in Mirzakhanis recursion for the Weil-Petersson volumes of the moduli space of bordered hyperbolic Riemann surfaces. A similar formula for the Masur-Veech volume (though without explicit evaluation) was obtained earlier by Mirzakhani through completely different approach. We prove further result: up to an explicit normalization factor depending only on the genus and on the number of cusps, the density of the orbit of any simple closed multicurve computed by Mirzakhani coincides with the density of square-tiled surfaces having horizontal cylinder decomposition associated to the simple closed multicurve. We study the resulting densities in more detail in the special case when there are no cusps. In particular, we compute explicitly the asymptotic frequencies of separating and non-separating simple closed geodesics on a closed hyperbolic surface of genus g for all small genera g and we show that in large genera the separating closed geodesics are exponentially less frequent. We conclude with detailed conjectural description of combinatorial geometry of a random simple closed multicurve on a surface of large genus and of a random square-tiled surface of large genus. This description is conditional to the conjectural asymptotic formula for the Masur-Veech volume in large genera and to the conjectural uniform asymptotic formula for certain sums of intersection numbers of psi-classes in large genera.
We express the Masur-Veech volume and the area Siegel-Veech constant of the moduli space $mathcal{Q}_{g,n}$ of genus $g$ meromorphic quadratic differentials with $n$ simple poles as polynomials in the intersection numbers of $psi$-classes with explicit rational coefficients. The formulae obtained in this article result from lattice point counts involving the Kontsevich volume polynomials that also appear in Mirzakhanis recursion for the Weil-Petersson volumes of the moduli spaces of bordered hyperbolic surfaces with geodesic boundaries. A similar formula for the Masur-Veech volume (though without explicit evaluation) was obtained earlier by Mirzakhani via completely different approach. Furthermore, we prove that the density of the mapping class group orbit of any simple closed multicurve $gamma$ inside the ambient set of integral measured laminations computed by Mirzakhani coincides with the density of square-tiled surfaces having horizontal cylinder decomposition associated to $gamma$ among all square-tiled surfaces in $mathcal{Q}_{g,n}$. We study the resulting densities (or, equivalently, volume contributions) in more detail in the special case $n=0$. In particular, we compute the asymptotic frequencies of separating and non-separating simple closed geodesics on a closed hyperbolic surface of genus $g$ for small $g$ and we show that for large genera the separating closed geodesics are $sqrt{frac{2}{3pi g}}cdotfrac{1}{4^g}$ times less frequent.
We introduce an algebraic system which can be used as a model for spaces with geodesic paths between any two of their points. This new algebraic structure is based on the notion of mobility algebra which has recently been introduced as a model for the unit interval of real numbers. We show that there is a strong connection between modules over a ring and affine mobility spaces over a mobility algebra. However, geodesics in general fail to be affine thus giving rise to the new algebraic structure of mobility space. We show that the so called formula for spherical linear interpolation, which gives geodesics on the n-sphere, is an example of a mobility space over the unit interval mobility algebra.
Recently, a framework considering RNA sequences and their RNA secondary structures as pairs, led to some information-theoretic perspectives on how the semantics encoded in RNA sequences can be inferred. In this context, the pairing arises naturally from the energy model of RNA secondary structures. Fixing the sequence in the pairing produces the RNA energy landscape, whose partition function was discovered by McCaskill. Dually, fixing the structure induces the energy landscape of sequences. The latter has been considered for designing more efficient inverse folding algorithms. We present here the Hamming distance filtered, dual partition function, together with a Boltzmann sampler using novel dynamic programming routines for the loop-based energy model. The time complexity of the algorithm is $O(h^2n)$, where $h,n$ are Hamming distance and sequence length, respectively, reducing the time complexity of samplers, reported in the literature by $O(n^2)$. We then present two applications, the first being in the context of the evolution of natural sequence-structure pairs of microRNAs and the second constructing neutral paths. The former studies the inverse fold rate (IFR) of sequence-structure pairs, filtered by Hamming distance, observing that such pairs evolve towards higher levels of robustness, i.e.,~increasing IFR. The latter is an algorithm that constructs neutral paths: given two sequences in a neutral network, we employ the sampler in order to construct short paths connecting them, consisting of sequences all contained in the neutral network.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
