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

4591136181 · Jun 202019922001200920172026
48 results for discrete degree

Defines discrete symmetry of manifolds and proves bounds on its value.

problem Understanding the symmetry of manifolds and proving bounds on their discrete symmetry.
method Defining discrete degree of symmetry and proving bounds using effective actions of groups.
result Proves discsym(X)3n/2disc-sym(X) \leq 3n/2 for connected manifolds and provides evidence for discsym(X)ndisc-sym(X) \leq n.

Study finite group actions on manifolds with non-zero degree maps to nilmanifolds.

problem Understanding finite group actions on manifolds with specific properties.
method Analyzes effective actions, bounds discrete degrees, studies toral rank conjecture, and introduces iterated actions.
result Proves Homeo(M) is Jordan and bounds the discrete degree of symmetry.

Drawing a sample from a discrete distribution is one of the building components for Monte Carlo methods. Like other sampling algorithms, discrete sampling suffers from the high computational burden in large-scale inference problems. We study the problem of sampling a discrete random variable with a high degree of depen…

2015-06-30abs ↗pdf ↗

Mixed finite element methods solve a PDE using two or more variables. The theory of Discrete Exterior Calculus explains why the degrees of freedom associated to the different variables should be stored on both primal and dual domain meshes with a discrete Hodge star used to transfer information between the meshes. We s…

2010-12-17abs ↗pdf ↗

Uniformly finite homology is a coarse homology theory, defined via chains that satisfy a uniform boundedness condition. By construction, uniformly finite homology carries a canonical \ell^\infty-semi-norm. We show that, for uniformly discrete spaces of bounded geometry, this semi-norm on uniformly finite homology in …

2015-02-04abs ↗pdf ↗

The study shows how discrete graphs can resemble hypercube structures under certain curvature conditions.

problem Understanding the structure of graphs with specific curvature conditions.
method Analyzing weighted graphs with lower Ricci curvature bounds and eigenvalue closeness to establish structural similarity.
result Discrete graphs with specific curvature conditions are close to hypercube structures in terms of Frobenius distance and eigenfunctions.

A closed linkage mechanism in three-dimensional space is an object comprising rigid bodies connected with hinges in a circular form like a rosary. Such linkages include Bricard6R and Bennett4R. To design such a closed linkage, it is necessary to solve a high-degree algebraic equation, which is generally difficult. In t…

2019-09-05abs ↗pdf ↗

Let ΓΓ be a discrete group. Assuming rational injectivity of the Baum-Connes assembly map, we provide new lower bounds on the rank of the positive scalar curvature bordism group and the relative group in Stolz' positive scalar curvature sequence for BΓ\mathrm{B} Γ. The lower bounds are formulated in terms of the part …

2017-09-21abs ↗pdf ↗

This paper constructs Poisson transforms and analyzes their properties on complex hyperbolic spaces.

problem Understanding discrete series representations of SU(n+1,1) using differential forms.
method Constructing Poisson transforms and analyzing their boundary asymptotics and intertwining properties with the Rumin complex.
result The constructed transforms realize the direct sum of all discrete series representations of SU(n+1,1).

Let TT be a triangulation of a Riemann surface. We show that the 1-skeleton of TT may be oriented so that there is a global bound on the outdegree of the vertices. Our application is to construct extremal metrics on triangulations formed from TT by attaching new edges and vertices and subdividing its faces. Such ref…

2010-07-03abs ↗pdf ↗

Generalized meshes for non-regular geometries, including fractures.

problem Discretization of partial differential equations in non-regular geometries.
method Introduces generalized meshes with overlapping elements and flexible adjacency relations.
result Discrete differential forms on virtually inflated meshes characterize the trace space of forms in surrounding volumes.

A central question in modern machine learning and imaging sciences is to quantify the number of effective parameters of vastly over-parameterized models. The degrees of freedom is a mathematically convenient way to define this number of parameters. Its computation and properties are well understood when dealing with di…

2019-11-08abs ↗pdf ↗

Measures neural network complexity via effective degrees of freedom.

problem Challenges in quantifying neural network complexity.
method Adapts generalized degrees of freedom (GDF) for binary outcomes and compares with cross-validation and null degrees of freedom.
result GDF provides a robust measure of model complexity for neural networks.

The aim of this paper is twofold. On the one hand, it provides a review of the links between random tensor models, seen as quantum gravity theories, and the PL-manifolds representation by means of edge-colored graphs (crystallization theory). On the other hand, the core of the paper is to establish results about the to…

2017-04-10abs ↗pdf ↗

We address two fundamental and well-known problems of Gromov and Lyndon: \demo{Problem A} (Gromov, see [5]). Consider a category MnM_n of closed manifolds of dimension nn with nonzero-degree ways as morphisms. Study a partial order MNMor(M,N)φM \ge N \Leftrightarrow Mor (M, N) \neq φ. For which NN the degrees of maps $f: M \t…

1995-06-25abs ↗pdf ↗

This paper develops a cohomological hierarchy for bistable visual paradoxes.

problem Understanding the hierarchy of visual paradoxes built from bistable elements.
method Develops a cohomological hierarchy using Z2\mathbb{Z}_2 coefficients and a discrete Stokes theorem.
result Reveals a hierarchy of paradox classes from H0H^0 through H2H^2, refined at each degree by the relative/absolute distinction.

A new method for generative modeling of discrete data using geometric latent subspaces.

problem Learning generative models for discrete data with statistical dependencies.
method Geometric latent-subspace framework in exponential parameter space of product manifolds of categorical distributions.
result Low-dimensional latent space encodes statistical dependencies and accurately models high-dimensional discrete data.

Graphs with bounded degrees and non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk.

problem Understanding geometric properties of graphs with non-negative Ollivier-Ricci curvature.
method Analyzing the geometric properties of graphs with non-negative Ollivier-Ricci curvature, proving subexponential growth and diffusive random walk.
result For graphs with bounded degrees and non-negative Ollivier-Ricci curvature, the average log-volume growth and random walk displacement are subexponential.

Let GG be a semisimple Lie group with discrete series. We use maps K0(CrG)CK_0(C^*_rG)\to \mathbb{C} defined by orbital integrals to recover group theoretic information about GG, including information contained in KK-theory classes not associated to the discrete series. An important tool is a fixed point formula for equiv…

2018-03-20abs ↗pdf ↗

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.

We study proper losses for discrete generative models without knowing the target distribution.

problem Evaluating generative models in the discrete setting without direct access to the target distribution.
method Define and construct black-box proper losses using statistical estimation theory.
result Black-box proper losses must be of polynomial form and involve more samples than the polynomial degree.

The paper analyzes counterfactual invariance and its relation to conditional independence.

problem Understanding the relationship between counterfactual invariance and conditional independence.
method Theoretical analysis of existing definitions, graphical implications, and mathematical proofs.
result Counterfactual invariance implies conditional independence, but not the other way around.

The paper analyzes network models with binary values and sub-Gamma noise, deriving asymptotic properties.

problem Analyzing network models with binary values and sub-Gamma noise.
method Derives asymptotic properties of network models with binary values and sub-Gamma noise.
result Established asymptotic consistency and normality of parameter estimators in network models.

In his PhD thesis, Abrams proved that, for a natural number n and a graph G with at least n vertices, the n-strand configuration space of G deformation retracts to a compact subspace, the discretized n-strand configuration space, provided G satisfies two conditions: each path between distinct essential vertices (vertic…

2009-09-30abs ↗pdf ↗

For a dataset of label-count pairs, an anonymized histogram is the multiset of counts. Anonymized histograms appear in various potentially sensitive contexts such as password-frequency lists, degree distribution in social networks, and estimation of symmetric properties of discrete distributions. Motivated by these app…

2019-10-08abs ↗pdf ↗

We develop numerical algorithms for solving the Einstein equation on Calabi-Yau manifolds at arbitrary values of their complex structure and Kahler parameters. We show that Kahler geometry can be exploited for significant gains in computational efficiency. As a proof of principle, we apply our methods to a one-paramete…

2005-06-15abs ↗pdf ↗

We show that for each discrete group G, the rational assembly map K_*(BG) \otimes Q \to K_*(C*_{max} G) \otimes \Q is injective on classes dual to the subring generated by cohomology classes of degree at most 2 (identifying rational K-homology and homology via the Chern character). Our result implies homotopy invarianc…

2007-05-17abs ↗pdf ↗

Study on Čech-de Rham obstruction in diffeological spaces.

problem Obstruction to Čech-de Rham map being an isomorphism in diffeological spaces.
method Higher topos theory, homotopy pullback diagrams, Čech-de Rham bicomplex, \infty-stack cohomology.
result New exact sequences in all higher degrees and conceptual proof of cohomology agreement.

The action dimension of a discrete group ΓΓ is the smallest dimension of a contractible manifold which admits a proper action of ΓΓ. Associated to any flag complex LL there is a right-angled Artin group, ALA_L. We compute the action dimension of ALA_L for many LL. Our calculations come close to confirming the conje…

2014-09-22abs ↗pdf ↗

The paper defines surface area for graphs and derives spectral estimates.

problem Understanding connectivity measures and spectral properties of graphs.
method Introducing surface area concepts related to inverse degree and deriving spectral bounds.
result An upper bound on the second eigenvalue for planar graphs.

Let M be a complex nilmanifold, that is, a compact quotient of a nilpotent Lie group endowed with an invariant complex structure by a discrete lattice. A holomorphic differential on M is a closed, holomorphic 1-form. We show that a(M)ka(M)\leq k, where a(M)a(M) is the algebraic dimension a(M)a(M) (i.e. the transcendence degre…

2016-03-06abs ↗pdf ↗

This paper studies how adding leaves to a tree affects its spectral properties.

problem Investigating the asymptotic behavior of tree spectra under leaf attachment.
method Analyzing the Ricci matrix and its largest eigenvalue for trees with pendant edges added.
result The sequence of largest eigenvalues converges to a limit that depends on local branch data.

The paper estimates Betti numbers for graphs with specific curvatures, proving bounds and characterizing rigidity.

problem Estimating Betti numbers for graphs with non-negative curvatures.
method Establishing Betti number estimates for graphs with non-negative Ollivier and Bakry-Émery curvatures.
result Upper bounds on the first Betti number for graphs with non-negative curvatures, with characterizations of rigidity.

If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We apply a discrete version of Morse theory to these UC^n(Gamma), for any n and any …

2004-10-25abs ↗pdf ↗

We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this matching along with discrete Morse theory and some topological techniques to cl…

2011-08-30abs ↗pdf ↗