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

3469103137 · Jun 202019922001200920172026
48 results for discrete Laplace

We study discrete conjugate nets whose Laplace sequence is of period four. Corresponding points of opposite nets in this cyclic sequence have equal osculating planes in different net directions, that is, they correspond in an asymptotic transformation. We show that this implies that the connecting lines of correspondin…

2011-04-19abs ↗pdf ↗

This research proves that quadratic regularized optimal transport can approximate the Laplace-Beltrami operator on smooth manifolds.

problem Approximating the Laplace-Beltrami operator using optimal transport with quadratic regularization.
method Deriving first-order optimal potentials and analyzing the convergence of discrete Laplace operators.
result The discrete Laplace operators converge to the Laplace-Beltrami operator on smooth manifolds.

We define a discrete Laplace-Beltrami operator for simplicial surfaces. It depends only on the intrinsic geometry of the surface and its edge weights are positive. Our Laplace operator is similar to the well known finite-elements Laplacian (the so called ``cotan formula'') except that it is based on the intrinsic Delau…

2005-03-11abs ↗pdf ↗

We propose simple conditions equivalent to the discreteness of the spectrum of the Laplace-Beltrami operator on a class of Riemannian manifolds close to warped products. For this class of manifolds we establish a relationship between discreteness of the spectrum and stochastic incompleteness.

2007-01-20abs ↗pdf ↗

Estimates eigenvalues of poly-Laplace operator on lattice subgraphs.

problem Estimating eigenvalues of poly-Laplace operator on subgraphs of lattice graphs.
method Introduced discrete poly-Laplace operator, derived upper and lower bounds for eigenvalues.
result Poly-Laplace eigenvalues are at least squares of lower-order poly-Laplace eigenvalues.

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.

Study on Lawson surfaces' first Laplace eigenvalue using symmetry and algebraic methods.

problem Yau's conjecture on first eigenvalue of minimal hypersurfaces in the sphere.
method Symmetry-based approach exploiting discrete reflection symmetries and algebraic structure of reflection groups.
result Equality λ1(ξ_{m,k})=2 for Lawson surfaces with m and k even.

Transforms game optimization dynamics into frequency domain for precise hyperparameter analysis.

problem Analyzing convergence of hyperparameters in game optimization.
method Frequency-domain framework using High-Resolution Differential Equations (HRDEs) and Laplace transforms.
result Derives precise convergence criteria for the Lookahead algorithm.

The paper extends graph-based semi-supervised learning to infinite-dimensional Wasserstein space.

problem Graph-based semi-supervised learning in high-dimensional data.
method Laplace Learning in the Wasserstein space, proving variational convergence and characterizing the Laplace-Beltrami operator.
result Consistent classification performance in high-dimensional settings.

The paper studies Fourier-Laplace transforms in polynomial OU volatility models for option pricing.

problem Calibrating and pricing options in polynomial Ornstein-Uhlenbeck volatility models.
method Analyzes Fourier-Laplace transforms, connects to Riccati equations, and develops numerical schemes.
result Establishes existence and solution for Riccati equations and provides efficient numerical methods.

Discrete vector bundles are important in Physics and recently found remarkable applications in Computer Graphics. This article approaches discrete bundles from the viewpoint of Discrete Differential Geometry, including a complete classification of discrete vector bundles over finite simplicial complexes. In particular,…

2015-06-25abs ↗pdf ↗

We approximate the spectral data (eigenvalues and eigenfunctions) of compact Riemannian manifold by the spectral data of a sequence of (computable) discrete Laplace operators associated to some graphs immersed in the manifold. We give an upper bound on the error that depends on upper bounds on the diameter and the sect…

2013-01-16abs ↗pdf ↗

We discuss discretization of Koenigs nets (conjugate nets with equal Laplace invariants) and of isothermic surfaces. Our discretization is based on the notion of dual quadrilaterals: two planar quadrilaterals are called dual, if their corresponding sides are parallel, and their non-corresponding diagonals are parallel.…

2007-09-21abs ↗pdf ↗

The paper analyzes Laplace learning for Gaussian measure data in infinite dimensions, proving convergence.

problem Analyzing Laplace learning for infinite-dimensional Gaussian measure data.
method Minimizes Dirichlet energy on a graph constructed from the full dataset.
result Proves pointwise convergence of the graph Dirichlet energy for Gaussian measure data.

Private two-sample tests under LDP achieve minimax rates for multinomial and continuous data.

problem Achieving statistical utility while maintaining privacy in two-sample testing.
method Private permutation tests for multinomial data and adaptive tests for continuous data.
result Minimax optimal tests for private two-sample testing under LDP.

Let (X,h)(X,h) be a compact and irreducible Hermitian complex space of complex dimension v>1v>1. In this paper we show that the Friedrichs extension of both the Laplace-Beltrami operator and the Hodge-Kodaira Laplacian acting on functions has discrete spectrum. Moreover we provide some estimates for the growth of the corre…

2017-06-16abs ↗pdf ↗

We prove that the nodal set (zero set) of a solution of a generalized Dirac equation on a Riemannian manifold has codimension 2 at least. If the underlying manifold is a surface, then the nodal set is discrete. We obtain a quick proof of the fact that the nodal set of an eigenfunction for the Laplace-Beltrami operator …

1997-07-10abs ↗pdf ↗

Optimizes survey design for private mean estimation with reduced variance.

problem Minimizing variance in private mean estimation with privacy constraints.
method Formulates optimal survey design as an optimization problem, determining optimal subsampling sizes to minimize variance.
result Identifies the first privacy-aware stratified sampling scheme that minimizes variance under different privacy mechanisms.

Fractional combinatorial flow improves surface conformal structures.

problem Improving discrete conformal structures on surfaces.
method Introducing a fractional combinatorial Calabi flow for discrete conformal structures on surfaces.
result Longtime existence and global convergence of the fractional combinatorial Calabi flow for various surface types.

The paper explores discrete isothermic nets using checkerboard patterns in quadrilateral nets.

problem Defining and understanding discrete isothermic nets in quadrilateral nets.
method Using checkerboard patterns and discrete differential geometry to define and analyze isothermic nets.
result The class of isothermic nets is invariant under dualization and Moebius transformations.

Sharp bounds for high-probability estimation of discrete distributions.

problem Estimating discrete distributions with high probability under χ2χ^2-divergence.
method Sharp upper and lower bounds for the classical Laplace estimator, and characterization of minimax high-probability risk for any estimator.
result Sharp bounds for high-probability estimation of discrete distributions can be achieved through a simple smoothing strategy.

The study explores discrete versions of Riemannian geometry structures on manifolds.

problem Understanding the relationship between discrete structures and continuous Riemannian geometry.
method Surveying and analyzing discrete counterparts of Riemannian geometry concepts on graphs and simplicial complexes.
result Recent developments include Cheeger type inequalities for higher-dimensional simplicial complexes and Floer type constructions.

Proposes a new method for robust uncertainty quantification in regression tasks.

problem Robust uncertainty estimation for deep neural networks in regression tasks.
method Generalized Auxiliary Uncertainty Estimator (AuxUE) scheme, considering both aleatoric and epistemic uncertainties.
result DIDO method provides robust uncertainty estimates in noisy inputs, scalable to image-level and pixel-wise tasks.

If GG is a compact Lie group endowed with a left invariant metric gg, then GG acts via pullback by isometries on each eigenspace of the associated Laplace operator ΔgΔ_g. We establish algebraic criteria for the existence of left invariant metrics gg on GG such that each eigenspace of ΔgΔ_g, regarded as the real ve…

2016-02-15abs ↗pdf ↗

LLapDiff models irregular multivariate time series without step-by-step integration.

problem Trade-off between discrete and continuous methods for long-horizon forecasting.
method Generative framework that models target as a low-dimensional latent trajectory, guided by modal parameterization and Laplace domain poles.
result Improves long-horizon forecasting over baselines and supports missing-value imputation.

Infinite volume requires no atoms at the bottom of the spectrum for certain groups.

problem Determining conditions for infinite volume in certain algebraic groups.
method Analyzing the spectral properties of Laplace operators on symmetric spaces.
result The bottom of the L2L^2-spectrum being an atom is necessary and sufficient for finite volume.

A new method for manifold learning using sparse regularised optimal transport.

problem Detecting latent manifolds in high-dimensional data with noisy observations.
method Proposes a symmetric version of optimal transport with quadratic regularisation to construct a sparse and adaptive affinity matrix.
result The method outperforms competing methods in numerical experiments and demonstrates robustness to heteroskedastic noise.

Latent Dirichlet Allocation models discrete data as a mixture of discrete distributions, using Dirichlet beliefs over the mixture weights. We study a variation of this concept, in which the documents' mixture weight beliefs are replaced with squashed Gaussian distributions. This allows documents to be associated with e…

2011-10-21abs ↗pdf ↗

This text is an exposition of a new approach into discrete differential geometry, called Script Geometry. In difference to classic approaches while scripts are based on complexes of cells we are not limited to simplicial complexes. One of the principal concepts of Script Geometry is the notion of tightness which is a m…

2019-11-16abs ↗pdf ↗