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,695 papers · 148 categories

Trend · papers per month

21436485 · May 202619922001200920172026
48 results for cycle length

Generative model predicts menstrual cycle lengths accounting for self-tracking artifacts.

problem Uncertainty in self-tracked health data due to user adherence.
method Hierarchical, generative model using machine learning.
result Model yields state-of-the-art performance in predicting menstrual cycle lengths.

Study of lengths of cycles in large genus random maps converging to Poisson process.

problem Understanding the distribution of cycle lengths in large genus random maps.
method Teichmüller theory approach for uniformly random metric maps (ribbon graphs).
result The length spectrum converges to a Poisson point process with an explicit intensity as genus tends to infinity.

Let S(s,w)\mathfrak{S}(\underline{s},w) be the graph whose vertices are all subexpressions with target ww of a fixed expression s\underline{s} in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2. We prove that S(s,w)\mathfrak{S}(\underline{s},w) is connected and its cycle space …

2025-06-12abs ↗pdf ↗

Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to intr…

2012-10-16abs ↗pdf ↗

Study improves queue length estimation from connected vehicles by filtering parameters.

problem Large errors in estimated queue lengths at low market penetration rates.
method Used Kalman and Particle filters as multilevel real-time estimators.
result Filters reduce estimation errors and improve accuracy within 15 minutes.

The determinants of the velocity of money have been examined based on life-cycle hypothesis. The velocity of money can be expressed by reciprocal of the average value of holding time which is defined as interval between participating exchanges for one unit of money. This expression indicates that the velocity is govern…

2005-07-21abs ↗pdf ↗

We consider the space of all representations of the commutator subgroup of a knot group into a finite abelian group Σ, together with a shift map σ_x. This is a finite dynamical system, introduced by D.Silver and S. Williams. We describe the lengths of its cycles in terms of the roots of the Alexander polynomial of the …

2013-01-10abs ↗pdf ↗

I sketch a program for a microeconomic theory of the main component of the business cycle as a recurring disequilibrium, driven by incompleteness of the financial market and by information asymmetries between borrowers and lenders. This proposal seeks to incorporate five distinct but connected processes that have been …

2013-12-02abs ↗pdf ↗

Service-induced congestion in memory-constrained LLM serving

problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.

Following \cite{citeSavelyevVirtualMorsetheoryonOmegaOmegaHam(Momega)(Momega).}, we develop here a connection between Morse theory for the (positive) Hofer length functional L:ΩHam(M,ω)RL: Ω\text {Ham}(M, ω) \to \mathbb{R}, with Gromov-Witten/Floer theory, for monotone symplectic manifolds (M,ω) (M, ω) . This gives some immediate restrictio…

2013-08-15abs ↗pdf ↗

We consider the space of all representations of the commutator subgroup of a knot group into Z/p, p is prime. As proven by D. Silver and S. Williams, this space can be completely described by a finite oriented graph. We describe the lengths of cycles in this graph.

2009-06-16abs ↗pdf ↗

We prove that given a three manifold with an arbitrary metric (M3,g)(M^3, g) of positive Ricci curvature, there exists a sweepout of MM by surfaces of genus 3\leq 3 and areas bounded by Cvol(M3,g)2/3C vol(M^3, g)^{2/3}. We use this result to construct a sweepout of MM by 1-cycles of length at most Cvol(M3,g)1/3C vol(M^3, g)^{1/3}. The sweepo…

2015-10-10abs ↗pdf ↗

In [J.Birman, V.Gebhardt, J.Gonzalez-Meneses, Conjugacy in Garside groups I: cyclings, powers and rigidity] authors asked: (open question 2) is the size of USS of a rigid pseudo-Anosov braid is bounded above by some polynomial in the number of strands and the braid length? We answer this question in the negative.

2009-05-30abs ↗pdf ↗

Brooks and Makover introduced an approach to studying the global geometric quantities (in particular, the first eigenvalue of the Laplacian, injectivity radius and diameter) of a ``typical'' compact Riemann surface of large genus based on compactifying finite-area Riemann surfaces associated with random cubic graphs; b…

2005-01-19abs ↗pdf ↗

This study optimizes cycle representatives in persistent homology using linear programming.

problem Non-uniqueness of cycle representatives in persistent homology creates ambiguity.
method Optimization of cycle representatives using linear programming methods.
result Optimization reduces the size of cycle representatives and is effective in most data sets.

Given a 2-dimensional surface M and a constant C we construct a Riemannian metric g, so that diameter diam(M,g)=1 and every 1-cycle dividing M into two regions of equal area has length >C. It follows that there exists no universal inequality bounding 1-width of M in terms of its diameter. This answers a question of Ste…

2013-07-08abs ↗pdf ↗

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In their seminal paper on braid-cryptography, Ko, Lee et al. proposed the {\it cycling …

2007-04-19abs ↗pdf ↗

The paper examines how insurers manage risks and liquidity in a dynamic market.

problem Model uncertainty in insurance pricing and competitive equilibrium.
method Analyzes insurers' robustness preferences and optimization strategies for underwriting and liquidity management.
result Robust insurance pricing leads to higher premiums and equity valuations compared to a benchmark.

Symmetric TSP is structurally equivalent to a constrained Group Steiner Tree Problem.

problem Finding the shortest tour in a symmetric TSP.
method Structural equivalence between symmetric TSP and constrained Group Steiner Tree Problem.
result Maximizing net weight in the cGSTP is equivalent to minimizing the TSP tour length.

The topology of a power grid affects its dynamic operation and settlement in the electricity market. Real-time topology identification can enable faster control action following an emergency scenario like failure of a line. This article discusses a graphical model framework for topology estimation in bulk power grids (…

2017-07-05abs ↗pdf ↗

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which was left unsolved in both papers was the number m of times one must `cycle' (res…

2000-03-21abs ↗pdf ↗

New Lie algebras from quivers lead to rigid Ricci solitons.

problem Constructing Lie algebras from quivers to study geometric structures.
method Using finite quivers without cycles to construct solvable Lie algebras and proving their geometric properties.
result Simply-connected Lie groups corresponding to these Lie algebras admit left-invariant Ricci solitons, and when quivers are oriented multi-trees, these groups are rigid.

In this study we model the warranty claims process and evaluate the warranty servicing costs under non-renewing and renewing free repair warranties. We assume that the repair time for rectifying the claims is non-zero and the repair cost is a function of the length of the repair time. To accommodate the ageing of the p…

2018-03-02abs ↗pdf ↗

Study finds geodesic networks for surfaces with convex boundary.

problem Finding geodesic networks for surfaces with convex boundary.
method Investigates free boundary geodesic networks in surfaces with non-negative sectional curvature and convex boundary.
result Existence of a geodesic network realizing the first width of a surface with non-negative sectional curvature and strictly convex boundary.

Subsurface projection has become indispensable in studying the geometry of the mapping class group and the curve complex of a surface. When the subsurface is an annulus, this projection is sometimes called relative twisting. We give two alternate versions of relative twisting for the outer automorphism group of a free …

2011-07-19abs ↗pdf ↗

We introduce a new series RkR_k, k=2,3,4,k=2,3,4,\dots, of integer valued weight systems. The value of the weight system RkR_k on a chord diagram is a signed number of cycles of even length 2k2k in the intersection graph of the diagram. We show that this value depends on the intersection graph only. We check that for small o…

2013-07-18abs ↗pdf ↗

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.

We introduce a notion of natural orderings of elements of finite connected quandles of order nn. When the elements of such a quandle QQ are already ordered naturally, any automophism on QQ is a natural ordering. Although there are many natural orderings, the operation tables for such orderings coincide when the perm…

2011-10-09abs ↗pdf ↗

This work introduces novel methods to identify and compare cycles across topological objects.

problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.

Analyzes Gerstner's trochoidal waves and their geometric properties.

problem Understanding the geometry and kinematics of trochoidal waves.
method Derives velocity and arc length conditions for cycloidal, curtate, and prolate trochoids using Galilean transformations.
result Conditions for arc lengths of prolate and curtate trochoids to coincide over a wave cycle.

This paper identifies the unique efficient cycle for most hyperbolic manifolds but not for the figure-8 knot complement.

problem Identifying the unique efficient cycle for hyperbolic manifolds.
method Analyzing the limit of fundamental cycles and their 1\ell^1-norm convergence.
result The uniqueness of the efficient cycle is proven for most hyperbolic manifolds but not for the figure-8 knot complement.

Computes volumes of metric maps on surfaces, linking to Weil-Petersson volumes.

problem Computing volumes of specific metric maps on surfaces.
method Using recent results on discrete maps with irreducibility constraints, computes volumes as homogeneous polynomials.
result Identifies volumes as homogeneous polynomials and satisfies string and dilaton equations.