In this paper, we show that the extremal length functions on Teichmüller space are log-plurisubharmonic. As a corollary, we obtain an alternative proof of L.Liu and W.Su's results on the plurisubharmonicity of extremal length functions. We also obtain alternative proofs of S.Krushkal's results that a function defined b…
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,742 papers · 148 categories
Trend · papers per month
48 results for “log Λ-lengths”
Algorithms compute length spectra of torus graphs efficiently.
problem Computing length spectra of graphs embedded on a torus.
method Preprocessing and algorithms based on polyhedral norms.
result Efficient computation of length spectra and spectrum comparison.
Multivariate Poisson approximation of the length spectrum of random surfaces is studied by means of the Chen-Stein method. This approach delivers simple and explicit error bounds in Poisson limit theorems. They are used to prove that Poisson approximation applies to curves of length up to order with …
Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an …
The study of random surfaces reveals asymptotic lengths of separating geodesics.
problem Understanding geometric properties of random hyperbolic surfaces.
method Analysis of Weil-Petersson measure and asymptotic behavior of lengths.
result The shortest separating closed geodesics have lengths about .
Study simplicial volume and stable commutator length for one-relator groups.
problem Understanding the relationship between simplicial volume and stable commutator length for one-relator groups.
method Introduced simplicial volume for one-relator groups and related it to stable commutator length. Analyzed the relationship for various cases and random elements.
result Often, the relationship between simplicial volume and stable commutator length is linear, with a multiplicative error of O(1/N).
In this paper, we are interested in short homologically and homotopically independent loops based at the same point on Riemannian surfaces and metric graphs. First, we show that for every closed Riemannian surface of genus and area normalized to , there are at least $\ceil{\log(2g)+1}$ homotopically indep…
Estimates for geodesics on hyperbolic tori improve previous bounds.
problem Counting simple closed geodesics on hyperbolic tori.
method McShane-Rivin norm balls and Markoff numbers.
result The number of simple closed geodesics of length exactly is at most .
We obtain sharp estimates on the growth rate of stable commutator length on random (geodesic) words, and on random walks, in hyperbolic groups and groups acting nondegenerately on hyperbolic spaces. In either case, we show that with high probability stable commutator length of an element of length is of order $n/\l…
Unified framework for critical scaling of inverse temperature in self-attention.
problem Conflicting inverse-temperature laws for long-context self-attention.
method Counting gaps and defining an upper-tail accumulation scale.
result Critical inverse-temperature scale determined by gap-counting function.
We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n) + o(n/log(n)) with high probability, and the unit ball in a subspace spanned by…
Lower bounds on geodesic length with few intersections on hyperbolic surfaces.
problem Finding the minimum length of geodesics with at least 2 intersections.
method Analyzing geodesics on hyperbolic surfaces with at least 2 self-intersections.
result The minimum length of such geodesics is , and this bound is sharp.
Minimal geodesics on hyperbolic surfaces are long.
problem Finding the shortest closed geodesics on hyperbolic surfaces.
method Analyzing the self-intersection number to estimate geodesic lengths.
result The minimal length of geodesics grows logarithmically with the self-intersection number.
Study on geodesics on high genus expander surfaces, proving filling and non-simple properties.
problem Properties of geodesics on expander surfaces of high genus.
method Adapting Margulis' counting strategy to low length scales.
result Almost every geodesic of certain lengths is filling or non-simple.
We define a Hamilton-Jacobi semigroup acting on continuous functions on a compact length space. Following a strategy of Bobkov, Gentil and Ledoux, we use some basic properties of the semigroup to study geometric inequalities related to concentration of measure. Our main results are that (1) a Talagrand inequality on a …
We give a lower and an upper bound for the conformal dimension of the boundaries of certain small cancellation groups. We apply these bounds to the few relator and density models for random groups. This gives generic bounds of the following form, where is the relator length, going to infinity. (a) $1 + 1/C < \Cdim(…
Given a Riemannian surface, we consider a naturally embedded graph which captures part of the topology and geometry of the surface. By studying this graph, we obtain results in three different directions. First, we find bounds on the lengths of homologically independent curves on closed Riemannian surfaces. As a conseq…
Short geodesics are important in the study of the geometry and the spectra of Riemann surfaces. Bers' theorem gives a global bound on the length of the first geodesics. We use the construction of Brooks and Makover of random Riemann surfaces to investigate the distribution of short () geodesics on a …
Study of circle homeomorphisms with square summable diamond shears.
problem Characterizing circle homeomorphisms with specific summability properties.
method Analysis of homeomorphisms in modular coordinates and comparison to Weil-Petersson class.
result Sharp results comparing new class to Weil-Petersson class and Hölder classes.
We consider the problem of predicting the next observation given a sequence of past observations, and consider the extent to which accurate prediction requires complex algorithms that explicitly leverage long-range dependencies. Perhaps surprisingly, our positive results show that for a broad class of sequences, there …
The study constructs a Lorentzian length space and explores its properties and relationships with metric and causal geometry.
problem Understanding the relationship between metric and causal geometry in Lorentzian spaces.
method Constructing a Lorentzian length space with an orthogonal splitting on a product of an interval and a metric space, and using synthetic time-like Ricci curvature bounds.
result Established sufficient conditions for global hyperbolicity and formulated time-like Ricci curvature bounds without push-up and regularity assumptions.
Paper disproves conjecture about log-Sobolev constants.
problem Log-Sobolev constants and curvature bounds.
method Counterexample on birth-death chains.
result Conjecture about Ollivier curvature is incorrect.
HGConv uses HRR to efficiently detect malware, outperforming existing methods.
problem Efficiently detecting malware with long sequences.
method Holographic Global Convolutional Networks (HGConv) utilizing Holographic Reduced Representations (HRR).
result Achieved state-of-the-art results on malware benchmarks.
New language model shows context length impacts generation quality and reasoning ability.
problem Analyzing the impact of context length and reasoning on autoregressive generation.
method Introduced synthetic hierarchical languages, used an exact k-gram ansatz, derived asymptotic predictions, and validated empirically.
result Reasoning models with limited context can generate sequences from the true language, improving exponentially over standard models.
Improved algorithm reduces excess risk in selective learning.
problem Selective learning with windowed model selection.
method Hybrid Exponential Weights Algorithm and bounded-recall ERM.
result Achieves expected excess risk of O((log log |L| + log log n) / log n).
The study quantifies the information needed for causal queries at different levels of Pearl's hierarchy.
problem How much additional information is needed for interventional and counterfactual queries compared to observational queries?
method Formalized via query-class description length, using Kolmogorov complexity of answer oracles induced by SCMs.
result Binary acyclic SCMs show a quadratic gap between observational and interventional descriptions, and a logarithmic gap between interventional and counterfactual descriptions.
The -gradient flow shrinks circles with radius to a point.
problem The triviality of the metric topology on immersed planar curves.
method Gradient flow of the length functional with respect to the -metric.
result Circles shrink to a point under the -gradient flow.
The paper improves transformer generalization bounds using rank-dependent covering number bounds.
problem Improving generalization bounds for transformers.
method Introducing rank-dependent covering number bounds for linear function classes and applying them to transformers.
result Generalization error bounds for transformers decay as and , improving existing bounds.
We derive bounds on the path length of gradient descent (GD) and gradient flow (GF) curves for various classes of smooth convex and nonconvex functions. Among other results, we prove that: (a) if the iterates are linearly convergent with factor , then is at most ; (b) under the Polyak-K…
Surprisal-Rényi Free Energystat.ML
SRFE clarifies KL divergences without unifying learning frameworks.
problem Inductive biases of KL divergences and their limitations.
method Introducing SRFE, a log-moment-based functional of the likelihood ratio.
result SRFE recovers KL divergences as limits and reveals a mean-variance tradeoff.
Formula estimates pseudo-Anosov maps' fixed points, linking to surface properties.
problem Estimating fixed points of pseudo-Anosov maps.
method Formula using Teichmüller translation length for fixed points of strong irreducible maps.
result Log of fixed points coarsely equals Teichmüller translation length for strong irreducible maps.
Given a pseudo-Anosov map, let denote the translation length of in the Teichmüller space, and let denote the stable translation length of in the curve graph. Gadre--Hironaka--Kent--Leininger showed that, as a function of Euler characteristic , the minimal po…
Given a closed hyperbolic 3-manifold M of volume V, and a link L in M such that the complement M \ L is hyperbolic, we establish a bound for the systole length of M \ L in terms of V. This extends a result of Adams and Reid, who showed that in the case that M is not hyperbolic, there is a universal bound of 7.35534... …
The paper develops algorithms to minimize queue length regret in a communication system.
problem Minimizing the difference between actual and optimal queue lengths over time slots.
method Introduces queue length regret and applies algorithms from stochastic multi-armed bandit problem to analyze system performance.
result Order optimal queue length regret can be achieved with queue-length based policies.
The length of shortest non-simple geodesics grows logarithmically with surface genus.
problem Understanding the behavior of shortest non-simple closed geodesics on hyperbolic surfaces.
method Investigation of asymptotic behavior on random hyperbolic surfaces using the Weil-Petersson measure.
result The non-simple systole behaves like log(g) as g goes to infinity.
We propose to describe the variety of galaxies from SDSS by using only one affine parameter. To this aim, we build the Principal Curve (P-curve) passing through the spine of the data point cloud, considering the eigenspace derived from Principal Component Analysis of morphological, physical and photometric galaxy prope…
The LIBOR market model is very popular for pricing interest rate derivatives, but is known to have several pitfalls. In addition, if the model is driven by a jump process, then the complexity of the drift term is growing exponentially fast (as a function of the tenor length). In this work, we consider a Lévy-driven LIB…
Short proof for ideal polygons with near optimal orthogeodesic decomposition.
problem Decomposing ideal polygons into orthogeodesics.
method Short proof with orthogeodesic decomposition of length at most .
result Optimal orthogeodesic decomposition of ideal polygons with length .
For word-equations in groups, we find a logarithmic bound on non-solutions.
problem Finding the length of non-solutions to word-equations in groups.
method Analyzing finite-rank free groups and applying results to broader classes of groups.
result Logarithmic bound on non-solutions for word-equations in groups.
New findings on translation lengths in Teichmüller and curve graphs for pseudo-Anosovs.
problem Comparing translation lengths in Teichmüller and curve graphs for pseudo-Anosovs.
method Combining techniques for upper and lower bounds with Rauzy-Veech induction machinery.
result Minimal stable curve graph translation length is of order 1/g for fixed genus g.
A3T-GCN model forecasts FTSE100 stock prices using technical indicators and financial ratios.
problem Forecasting closing stock prices of FTSE100 constituents.
method Hybrid A3T-GCN architecture using technical indicators, financial ratios, and sector correlations.
result A3T-GCN model improves prediction accuracy with annualized log-returns and shorter sequence lengths.
New statistical models for predicting ranked preferences from partial orders.
problem Statistical models overlook information in list length.
method Composite and augmented ranking models for joint modeling of partial orders and list lengths.
result Augmented ranking models best predict both length and preferences.
Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimalstat.ML
New algorithm reduces regret bounds for Bayesian optimization with unknown hyperparameters.
problem Optimizing black-box functions with unknown hyperparameters, especially length scale.
method Length Scale Balancing (LB) - aggregating multiple surrogate models with varying length scales.
result LB achieves a regret bound only logaritically away from the oracle algorithm.
A major problem for the learning of Bayesian networks (BNs) is the exponential number of parameters needed for conditional probability tables. Recent research reduces this complexity by modeling local structure in the probability tables. We examine the use of log-linear local models. While log-linear models in this con…
Semi-Supervised Bayesian GANs with Log-Signatures for Uncertainty-Aware Credit Card Fraud Detectionstat.ML
Semi-supervised GANs with log-signatures improve credit card fraud detection.
problem Detecting fraud in large, complex financial transaction data streams.
method Conditional GANs with Bayesian inference and log-signatures for robust feature encoding.
result Consistent improvements over benchmarks in global and domain-specific metrics.
We prove an inequality that must be satisfied by displacement of generators of free Fuchsian groups, which is the two-dimensional version of the Theorem for Kleinian groups due to Anderson-Canary-Culler-Shalen. As applications, we obtain quantitative results on the geometry of hyperbolic surfaces such as …
Random hyperbolic surfaces are mostly tangle-free, with geometric implications.
problem Understanding the structure of random hyperbolic surfaces.
method Introduced and analyzed L-tangle-free compact hyperbolic surfaces.
result Random surfaces are (a log g)-tangle-free for any a < 1, almost optimal.
Study reveals how model volume affects learning curves in machine learning.
problem Understanding the double descent risk phenomenon in machine learning.
method Investigates the role of model volume using MDL, Occam's Razor, and information geometry.
result Model volume can explain the double descent risk, suggesting better generalization with increased dimensionality.