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

184367551734 · Jun 202019922001200920172026
48 results for discrete functions

Simple constructions of semi-discrete and discrete surfaces using Jacobi elliptic functions.

problem Constructing semi-discrete and discrete surfaces explicitly.
method Using Jacobi elliptic functions and τ-functions.
result Explicit constructions and periodicities of semi-discrete and discrete surfaces.

A formula connects discrete harmonic surfaces to holomorphic functions.

problem Creating smooth discrete harmonic surfaces from holomorphic data.
method Weierstrass representation formula for discrete harmonic surfaces.
result Smooth converging sequence of discrete harmonic surfaces converges to a minimal surface.

The paper studies stability of discrete planar curves using variational methods.

problem Stability of discrete planar curves under area constraints.
method Unified interpretation of discrete curvatures, determination of equilibrium curves, stability analysis.
result Equilibrium curves for the length functional under area-constraint conditions are determined and their stability is studied.

A new method for discrete data normalizing flows using latent transformations.

problem Challenges in parameterizing bijective transformations for discrete data.
method Predict a distribution over latent transformations to make the marginal likelihood differentiable.
result Discrete-data normalizing flows can be trained using gradient-based learning with unbiased score function estimation.

Discrete Morse functions induce shellings with critical tiles corresponding to function's critical faces.

problem Mapping discrete Morse functions to shellings for topological analysis.
method Inducing Morse shellings on the second barycentric subdivision of a simplicial complex.
result Critical tiles of induced shellings correspond to critical faces of the discrete Morse function.

Authors prove an asymptotic expansion for spectral zeta functions on discrete tori.

problem Proving an asymptotic expansion for spectral zeta functions on discrete tori.
method Inspired by Friedli and Karlsson's work, the authors derive an asymptotic expansion for the spectral zeta function on discrete tori.
result Similar asymptotic expansions hold for m=2 and higher dimensions, equivalent to the Epstein-Riemann conjecture.

Exact Bayesian inference for discrete models using probability generating functions.

problem Discrete statistical models with infinite support and continuous priors.
method Probabilistic programming language with automatic differentiation and probability generating functions.
result Genfer tool provides exact solutions for a wide range of inference problems.

PDHAMS improves sampling for discrete distributions with quadratic potential functions.

problem Sampling discrete distributions efficiently and accurately.
method Integrates a second-order approximation of the potential function and uses Gaussian integral trick.
result PDHAMS yields superior performance compared to other methods.

The paper uses MDM theory to analyze multifiltering functions on simplicial complexes.

problem Understanding multifiltering functions through discrete Morse theory.
method Applying multiparameter discrete Morse theory to vector-valued multifiltering functions.
result Any multifiltering function can be approximated by a compatible MDM function.

We derive a discrete analogue of Morse-Bott theory on CW complexes and use this discrete Morse-Bott function to do some Conley theory analysis. It turns out that our discrete Morse-Bott theory is indeed a generalization of Forman's discrete Morse theory.

2017-11-29abs ↗pdf ↗

The study identifies all possible vector field structures on specific 2D shapes.

problem Optimal discrete gradient vector fields on surfaces with 1-2 critical cells.
method Analysis of discrete vector fields on 2D shapes with minimal critical cells.
result All possible structures of discrete Morse functions on specified shapes.

The paper analyzes Laplacian pyramids for extending and denoising discrete functions.

problem Analyzing conditions for convergence and stability of Laplacian pyramids.
method Investigates Laplacian pyramids for extension and denoising, providing convergence conditions and stability bounds.
result Mild conditions are provided under which the Laplacian pyramids algorithm converges and stability bounds are proven.

New method reduces bias in estimating causal effects from discretized variables.

problem Bias in estimating causal effects from discretized continuous variables.
method Proposes a bias-reduced functional that evaluates outcome regression at within-bin conditional means.
result Demonstrates substantial bias reduction and near-nominal confidence interval coverage.

Improved density estimation for mixed discrete-continuous data.

problem Inconsistent density estimation for mixtures of continuous and discrete data.
method Modification of existing nonparametric density estimation methods to handle mixed discrete-continuous data.
result Improved consistency and empirical performance for mixed discrete-continuous data.

We construct explicit solutions to the discrete motion of discrete plane curves that has been introduced by one of the authors recently. Explicit formulas in terms the ττ function are presented. Transformation theory of the motions of both smooth and discrete curves is developed simultaneously.

2010-08-17abs ↗pdf ↗

A new functional for simplicial surfaces is suggested. It is invariant with respect to Moebius transformations and is a discrete analogue of the Willmore functional. Minima of this functional are investigated. as an application a bending energy for discrete thin-shells is derived.

2004-06-07abs ↗pdf ↗

The paper proves a discrete positive mass theorem for graphs.

problem Formulating and proving a discrete positive mass theorem for graphs.
method Introducing asymptotically flat graphs, defining ADM mass, and using discrete harmonic functions.
result An asymptotically flat graph with non-negative Ricci curvature is isomorphic to the standard grid graph.

Paper introduces DMPMs for efficient discrete data generation with sharp convergence bounds.

problem Efficient generation of discrete data with theoretical guarantees.
method Discrete Markov Probabilistic Models (DMPMs) operating in bit space with time-reversal process.
result Sharp convergence bounds established under minimal assumptions, competitive performance in discrete data generation.

Paper tackles functional linear regression using spectral algorithms with discrete observations.

problem Functional linear regression problem with discretely observed data.
method Combines distributed spectral algorithms with Sobolev kernels for regularization.
result Derives matching upper and lower bounds for convergence in Sobolev norm.

In this paper, we consider the problem of black box continuous submodular maximization where we only have access to the function values and no information about the derivatives is provided. For a monotone and continuous DR-submodular function, and subject to a bounded convex body constraint, we propose Black-box Contin…

2019-01-28abs ↗pdf ↗

Lyons and Sullivan have shown how to discretize harmonic functions on a Riemannian manifold MM whose Brownian motion satisfies a certain recurrence property called \ast-recurrence. We study analogues of this discretization for tensor fields which are harmonic in the sense of the covariant Laplacian. We show that, un…

2016-03-28abs ↗pdf ↗

Proves hardness of semi-discrete optimal transport and proposes regularization methods.

problem Computing Wasserstein distance between discrete and non-discrete probability measures.
method Proves hardness, introduces distributionally robust dual optimal transport, regularizes primal objective, uses stochastic gradient descent.
result Regularization schemes and improved convergence guarantees for semi-discrete optimal transport problems.

Study shows financial value of weak information converges in discrete vs continuous markets.

problem Analyzing financial value of weak information in discrete vs continuous markets.
method Defined minimal probability measure and financial value of weak information, then showed convergence.
result Financial value of weak information converges in discrete vs continuous markets.

Framework for training-free guidance in discrete diffusion models for molecular generation.

problem No equivalent training-free guidance methods for discrete diffusion models.
method Framework using guidance functions for discrete data.
result Demonstrated utility on molecular graph generation tasks.

The paper analyzes spectral properties of connection Laplacian on tori, proving convergence to real torus.

problem Spectral analysis of connection Laplacian on tori.
method Employing parallel orthonormal basis in pullback bundle, examining eigenvalues of connection Laplacian on real and discrete tori.
result Eigenvalues of connection Laplacian on discrete tori converge to those on real torus, with unique twist in torsion matrix.

Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, a…

2003-09-04abs ↗pdf ↗