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

Trend · papers per month

79158236315 · Jun 202019922001200920172026
48 results for discrete metrics

A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a unique hyperbolic polyhedral metric with a given discrete curvature satisfying …

2014-01-18abs ↗pdf ↗

The paper proves a theorem for discretizing Gaussian curvature on surfaces.

problem Discretizing Gaussian curvature on surfaces with nonpositive Euler number.
method Discrete conformal theory and variational principles with constraints.
result Each decorated piecewise Euclidean metric on surfaces with nonpositive Euler number is discrete conformal to a metric with a specific discrete curvature constant.

A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature polyhedral metric which is unique up to scaling. Furthermore, the constant curvature me…

2013-09-17abs ↗pdf ↗

We introduce the discrete Einstein metrics as critical points of discrete energy on triangulated 3-manifolds, and study them by discrete curvature flow of second (fourth) order. We also study the convergence of the discrete curvature flow. Discrete curvature flow of second order is an analogue of smooth Ricci flow.

2013-12-03abs ↗pdf ↗

The paper introduces a new discretization of Gaussian curvature on surfaces.

problem Discretizing Gaussian curvature on surfaces with conic singularities.
method Discrete conformal theory and variational principles with constraints.
result Established a discrete uniformization theorem for surfaces with non-positive Euler number.

In this short note, we prove that the space of all admissible piecewise linear metrics parameterized by length square on a triangulated manifolds is a convex cone. We further study Regge's Einstein-Hilbert action and give a much more reasonable definition of discrete Einstein metric than our former version in \cite{G}.…

2015-08-25abs ↗pdf ↗

The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and explicitly allow infinite graphs. Motivated by the general form of a Laplacian on …

2007-12-10abs ↗pdf ↗

The paper establishes a discrete uniformization theorem for surfaces with piecewise hyperbolic metrics.

problem Finding decorated piecewise hyperbolic metrics with prescribed combinatorial curvature.
method Introduced combinatorial α-Ricci flow with surgery to handle potential singularities and prove longtime existence and convergence.
result Existence of decorated piecewise hyperbolic metrics with prescribed combinatorial α-curvature.

The paper studies singularities in discrete indefinite affine minimal surfaces.

problem Characterizing singularities in discrete indefinite affine minimal surfaces.
method Discretizing smooth curves and applying discrete Lelieuvre's formulas to study the resulting surfaces.
result The definition of singular edges and vertices in discrete asymptotic nets mirrors properties of smooth surfaces.

The paper proposes a new way to approximate Riemannian metrics using discrete wall systems.

problem Approximating Riemannian metrics and proving geometric conjectures.
method Discretization of metrics using walls and triangulations.
result The discrete filling area conjecture is equivalent to Gromov's original conjecture.

Study discrete analog of zeta-determinant maximization on triangulated surfaces.

problem Maximizing zeta-determinant for discrete Laplacian on triangulated surfaces.
method Analogous to Osgood, Phillips, and Sarnak's theorem, study stationary points of determinants for discrete cotan-Laplacian.
result Discrete metrics of constant discrete Gaussian curvature are stationary points of the determinant, suggesting minima.

The paper tackles prescribing discrete Gaussian curvature on polyhedral surfaces.

problem Prescribing discrete Gaussian curvature on polyhedral surfaces.
method Discrete conformal theory and variational principles with constraints.
result Proves Kazdan-Warner type theorems for polyhedral surfaces.

Rigidity theorem for discrete metric spaces embedded in Riemannian surfaces.

problem Understanding the rigidity of discrete metric spaces embedded in Riemannian surfaces.
method Proving that certain discrete metric spaces are rigidly embedded in the Euclidean plane or other Riemannian surfaces.
result Riemannian embeddings of certain discrete metric spaces are rigid, meaning they cannot be deformed without changing distances.

Inspired by the Weierstrass representation of smooth affine minimal surfaces with indefinite metric, we propose a constructive process producing a large class of discrete surfaces that we call discrete affine minimal surfaces. We show that they are critical points of an affine area functional defined on the space of qu…

2008-03-10abs ↗pdf ↗

This paper completes the classification of discrete conformal structures on surfaces.

problem Classifying discrete conformal structures on surfaces.
method Axiomatic approach and study of existing structures.
result Find new classes of discrete conformal structures, including generalized circle packing metrics.

Study on Brownian motion on discrete curve spaces, proving stochastic completeness.

problem Analyzing Brownian motion on spaces of discrete curves.
method Introduced and studied Brownian motion on spaces of discrete regular curves with Sobolev-type metrics.
result All geodesically complete spaces of discrete regular curves are stochastically complete.

The paper develops algorithms for finding metrics with prescribed combinatorial curvature on polyhedral surfaces.

problem Finding metrics with prescribed combinatorial curvature on polyhedral surfaces.
method Discrete uniformization theorem, combinatorial α-Yamabe flow, combinatorial α-Calabi flow, edge flipping surgery.
result Longtime existence and convergence of combinatorial α-Yamabe flow and combinatorial α-Calabi flow with surgery.

This study introduces balanced DRPS and OrderedLogitNN for better QDE of discrete-level questions.

problem Lack of ordinal regression methods and fair evaluation metrics for discrete-level QDE.
method Introduces balanced DRPS and OrderedLogitNN, fine-tunes BERT on RACE++ and ARC datasets.
result OrderedLogitNN outperforms other models on complex QDE tasks.

Study on deforming discrete conformal structures on surfaces with boundaries.

problem Deforming discrete conformal structures on surfaces with boundaries.
method Introduce combinatorial Ricci flow and combinatorial Calabi flow, establish longtime existence and global convergence of solutions.
result Effective algorithms for finding discrete hyperbolic metrics on surfaces with totally geodesic boundaries of prescribed lengths.

New discrete conformal structures on surfaces with boundary, proving global rigidity and constructing hyperbolic metrics.

problem Creating new discrete conformal structures on surfaces with boundary.
method Introducing new discrete conformal structures, proving global rigidity using variational principles, and introducing combinatorial curvature flows.
result Global rigidity of new discrete conformal structures and effective algorithms for constructing hyperbolic metrics.

StochasticRank optimizes ranking metrics efficiently and guarantees global convergence.

problem Optimizing discrete ranking metrics due to their ill-posed nature.
method Stochastic smoothing, gradient estimate, debiasing, and Stochastic Gradient Langevin Boosting.
result Global convergence and superior performance on ranking datasets.

This work revisits, from a geometric perspective, the notion of discrete connection on a principal bundle, introduced by M. Leok, J. Marsden and A. Weinstein. It provides precise definitions of discrete connection, discrete connection form and discrete horizontal lift and studies some of their basic properties and rela…

2013-11-01abs ↗pdf ↗

Study shows convergence of anticanonically balanced metrics to Kähler-Einstein metrics on Fano manifolds.

problem Finding anticanonically balanced metrics on Fano manifolds.
method Simplification of Donaldson's proof using Berezin-Toeplitz quantization.
result Sequence of anticanonically balanced metrics converges to Kähler-Einstein metric.

Neural networks learn discrete tasks on continuous data via emergent geometry.

problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.

We analyze convergence of Fermat distances and their application in clustering.

problem Understanding convergence properties of Fermat distances on Riemannian manifolds.
method Geometric and statistical arguments in percolation theory, leveraging novel arguments for non-uniform densities and curved domains.
result Discrete, sample-based Fermat distances converge to their continuum analogues with a precise rate dependent on intrinsic dimensionality.

In \cite{Luo0}, Feng Luo conjectured that the discrete Yamabe flow will converge to the constant curvature PL-metric after finite number of surgeries on the triangulation. In this paper, we prove that the flow can always be extended (without surgeries) to a solution that converges exponentially fast to the constant cur…

2016-04-28abs ↗pdf ↗

In this paper, we generalize our results in \cite{GX3} to triangulated surfaces in hyperbolic background geometry, which means that all triangles can be embedded in the standard hyperbolic space. We introduce a new discrete Gaussian curvature by dividing the classical discrete Gauss curvature by an area element, which …

2015-05-19abs ↗pdf ↗

New metrics produce discrete zero sets for nondegenerate harmonic forms.

problem Creating metrics to produce discrete zero sets for nondegenerate harmonic forms.
method Metric perturbation to produce new nondegenerate harmonic forms with discrete zero sets.
result Existence of metrics producing discrete zero sets for nondegenerate harmonic forms.

We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott, Sturm, and Villani for geodesic measure spaces. In order to apply to the discrete setting, the role of the Wasserstein metric…

2011-11-11abs ↗pdf ↗

Asymptotic net is an important concept in discrete differential geometry. In this paper, we show that we can associate affine discrete geometric concepts to an arbitrary non-degenerate asymptotic net. These concepts include discrete affine area, mean curvature, normal and co-normal vector fields and cubic form, and the…

2008-05-14abs ↗pdf ↗

The paper proves the existence of a complete holomorphic vector field on a complex manifold with a Kähler-Einstein metric.

problem Existence of complete holomorphic vector fields on complex manifolds with specific metrics.
method Method of potential scaling to find a potential function with constant length differential, then constructing a vector field from its gradient.
result A complete holomorphic vector field is constructed on a complex manifold with a Kähler-Einstein metric.

Let K be an irreducible and reversible Markov kernel on a finite set X. We construct a metric W on the set of probability measures on X and show that with respect to this metric, the law of the continuous time Markov chain evolves as the gradient flow of the entropy. This result is a discrete counterpart of the Wassers…

2011-02-25abs ↗pdf ↗

This paper develops efficient bounds on the Wasserstein metric for discrete measures.

problem Computing the exact Wasserstein metric is computationally expensive.
method Formulates and solves a Kantorovich problem on a coarse grid using quantized measures and cost matrices, followed by upscaling and correction.
result Achieves a 10x-100x speedup while maintaining low approximation error.