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

Trend · papers per month

139279418557 · May 202619922001200920172026
48 results for discrete structures

The paper introduces discrete Dirac structures for mechanics, simplifying dynamics.

problem Formulating discrete mechanics with constraints.
method Developed (±)(\pm)-discrete Dirac structures and induced Dirac structures.
result Discrete Lagrange--Dirac systems are equivalent to (±)(\pm)-discrete Lagrange--d'Alembert equations.

Extends rigidity and existence results for discrete conformal structures on surfaces with boundary.

problem Rigidity and existence of discrete conformal structures on surfaces with boundary.
method Axiomatic framework and classification of discrete conformal structures.
result Extends results by Guo-Luo and Guo to a general context.

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.

NES optimizes discrete structured VAEs effectively without gradient propagation.

problem Learning high-dimensional discrete latent spaces in generative models.
method Natural Evolution Strategies (NES) for gradient-free optimization of discrete structures.
result NES effectively optimizes discrete structured VAEs, comparable to gradient-based methods.

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.

Study preserves symplectic structure in forced discrete mechanical systems.

problem Preserving symplectic structure in forced discrete mechanical systems.
method Analyzes a specific type of forced discrete mechanical system (Q,Ld,fd)(Q,L_d,f_d), preserving a symplectic structure on QimesQQ imes Q.
result The preserved symplectic structure can be seen as Marsden-Weinstein reduction of the canonical symplectic structure.

Novel symmetry found in nanocarbons' discrete principal curvature structure.

problem Identifying novel symmetries in nanocarbons' geometric structures.
method First-principles calculations and discrete geometry analysis.
result Discovery of a novel symmetry (pre-constant discrete principal curvature) in nanocarbons.

New theorem proves convergence of various discrete conformal structures to conformal maps.

problem Proving convergence of discrete conformal structures to conformal maps.
method General theorem using piecewise linear discrete conformal mappings and Riemannian barycentric coordinates.
result Discrete conformal mappings converge to conformal maps under certain conditions.

This paper classifies discrete conformal structures on surfaces with boundary.

problem Classifying discrete conformal structures on surfaces with boundary.
method Axiomatic approach ensuring good geometric structure, classification based on triangulation and axioms.
result Unified and generalized existing discrete conformal structures on surfaces with boundary.

Study discretizes Dirac and port-Hamiltonian systems using manifolds.

problem Discretization of Dirac and port-Hamiltonian systems.
method Retraction and discretization maps on manifolds for Dirac structures, applied to port-Hamiltonian systems.
result Numerical integrators for port-Hamiltonian systems derived from discretization techniques.

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.

The paper studies deformation of discrete conformal structures on surfaces using combinatorial curvature flows.

problem Finding piecewise constant curvature metrics on surfaces with prescribed combinatorial curvatures.
method Combinatorial curvature flows, including Ricci flow and Calabi flow, are applied to deform Glickenstein's discrete conformal structures.
result The solution of the combinatorial Ricci flow can be uniquely extended and converges exponentially fast for any initial value under certain conditions.

The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.

problem Discrete conformal structures on polyhedral surfaces and their rigidity.
method Parameterized combinatorial curvature, combinatorial α-Ricci flow, and flow extension through singularities.
result Existence and convergence of combinatorial α-Ricci flow for solving the Yamabe problem.

Proposes a differentiable structure learning framework for general binary data.

problem Limitations of existing methods in discrete data structure learning.
method Formulates a differentiable optimization task for arbitrary dependencies in general discrete models.
result Establishes identifiability of complete set of compatible parameters and structures under mild assumptions.

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.

This text explores strategies for learning discrete latent structures in neural networks.

problem Learning discrete latent structures in neural networks is challenging.
method Continuous relaxation, surrogate gradients, and probabilistic estimation.
result Many latent structure learning strategies use the same fundamental building blocks but apply them differently.

Optimal discrete harmonic maps between hyperbolic surfaces are found via minimizing energy.

problem Finding optimal discrete harmonic maps between hyperbolic surfaces.
method Minimizing Dirichlet energy over all possible hyperbolic structures and realizations within a fixed homotopy class.
result At the optimal hyperbolic structure, the discrete harmonic map and edge weights are induced from a weighted Delaunay decomposition.

In the framework of nonassociative geometry (hep-th/0003238) a unified description of continuum and discrete spacetime is proposed. In our approach at the Planck scales the spacetime is described as a so-called "diodular discrete structure" which at large spacetime scales `looks like' a differentiable manifold. After a…

2000-10-19abs ↗pdf ↗

This paper solves PDEs for embedding discrete lattices into smooth manifolds.

problem Embedding discrete lattices into smooth manifolds while preserving geometric and topological properties.
method Rigorous mathematical framework and analysis of partial differential equations (PDEs).
result Existence and regularity of solutions to PDEs under initial boundary conditions.

New framework for discrete-state diffusion models reduces sample complexity.

problem Lack of theoretical understanding and sample complexity analysis for discrete-state diffusion models.
method Developed a principled theoretical framework, decomposing score estimation error.
result Established sample complexity bound of O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}).

We develop variational integrators from discrete Hamiltonian systems with external forces.

problem Creating accurate discrete models of continuous Hamiltonian systems.
method Constructing discrete Hamiltonian systems with external forces, analyzing symplectic structure, and combining methods to build variational integrators.
result We derive variational integrators that approximate continuous Hamiltonian systems with high accuracy.

Library learns Bayesian networks from mixed data without discretization.

problem Learning Bayesian networks from mixed data (discrete and continuous variables).
method Proposes an algorithm for structural and parameter learning of Bayesian networks from mixed data using a mixed MI score function and Gaussian approximation. Offers two graph structure enumeration algorithms.
result Advantages in solving approximation and gap recovery problems on synthetic and real datasets.

CANDI solves the gap between continuous and discrete diffusion models for text generation.

problem Underperformance of continuous diffusion models in discrete data domains.
method Introduces token identifiability and a hybrid framework (CANDI) to decouple discrete and continuous corruption.
result CANDI successfully avoids temporal dissonance, enabling continuous diffusion benefits for discrete spaces.

In this paper we build the structure equations and the integrable systems for a discrete centroaffine indefinite surface in R3\R^3. At the same time, some centroaffine invariants are obtained according to the structure equations. Using these centroaffine invariants, we study the Laplacian operator and the convexity of …

2016-09-09abs ↗pdf ↗

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.

We consider the problem of learning the structure of a pairwise graphical model over continuous and discrete variables. We present a new pairwise model for graphical models with both continuous and discrete variables that is amenable to structure learning. In previous work, authors have considered structure learning of…

2012-05-22abs ↗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.

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.

Novel SVAE learns interpretable discrete data representations from deep learning.

problem Learning interpretable discrete data representations from deep learning.
method Structured variational autoencoder (SVAE) with novel optimization algorithms.
result First competitive comparisons with state-of-the-art time series models.

The paper develops algorithms and topological invariants for distinguishing dynamic systems.

problem Distinguishing the topological type of surfaces and functions in dynamic systems.
method Construction of algorithms and topological invariants using discrete topological structures.
result The development of discrete topological structures for topological equivalence of dynamic systems.

We detail the theory of Discrete Riemann Surfaces. It takes place on a cellular decomposition of a surface, together with its Poincaré dual, equipped with a discrete conformal structure. A lot of theorems of the continuous theory follow through to the discrete case, we define the discrete analogs of period matrices, Ri…

2008-02-12abs ↗pdf ↗