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.

169,291 papers · 148 categories

Trend · papers per month

86172258344 · Jun 202019922001200920182026
48 results for compact graphs

Constructs real algebraic functions with both compact and non-compact preimages.

problem Finding real algebraic functions with specific preimage properties.
method Explicit construction of real algebraic functions.
result Demonstrates real algebraic functions on non-compact manifolds with non-compact preimages.

The paper estimates heights of constant mean curvature graphs in specific spaces.

problem Estimating heights of constant mean curvature graphs in Nil3\mathrm{Nil}_3 and PSL~2(R)\widetilde{PSL}_2(\mathbb{R}).
method Height estimates for compact, constant mean curvature graphs in Nil3\mathrm{Nil}_3 and PSL~2(R)\widetilde{PSL}_2(\mathbb{R}).
result Announced a structure-type result for proper graphs defined on relatively compact domains.

Defined a new graph type for compact surfaces, proving its connectedness and infinite diameter.

problem Understanding the structure of arc graphs on compact surfaces.
method Defining and analyzing the prescribed arc graph A(Σ,Γ)\mathscr A(Σ,Γ) for compact surfaces ΣΣ with boundary and relations ΓΓ.
result The prescribed arc graph A(Σ,Γ)\mathscr A(Σ,Γ) is connected and infinite-diameter, with specific conditions for Gromov hyperbolicity.

Automates graph convolutional network design for semi-supervised node classification.

problem Designing optimal graph convolutional network architectures for semi-supervised node classification.
method An automatic process to define a problem-specific architecture based on graph structure.
result The proposed method outperforms existing methods in classification performance and network compactness.

A compact 4-dimensional manifold is a non-singular graph-manifold if it can be obtained by the glueing T^2-bundles over compact surfaces (with boundary) of negative Euler characteristics. If none of glueing diffeomorphisms respect the bundle structures, the graph-structure is called reduced. We prove that any homotopy …

2004-11-15abs ↗pdf ↗

Proposes methods for local clustering in attributed graphs.

problem Finding a single cluster concentrated on a specific region in a graph.
method Introduces Graph Unimodality (GU) and Attribute Unimodality (AU) measures, and LOCLU algorithm to optimize Compactness score.
result Local cluster detected by LOCLU concentrates on the region of interest and exhibits unimodal data distribution.

Every graph can be represented as a singular set of a special surface.

problem Representing any finite graph as the singular set of a compact 3D surface.
method Constructing a calibrated 3-dimensional homologically area minimizing surface with a special Lagrangian form.
result The singular set of the surface is precisely the given graph.

Let M be a graph manifold. We show that π_1M is the fundamental group of a compact nonpositively curved cube complex if and only if M is chargeless. We also prove that in that case π_1M is virtually compact special.

2013-10-04abs ↗pdf ↗

Study of mapping class groups on infinite graphs, focusing on their large-scale geometry.

problem Understanding the large-scale geometry of mapping class groups on infinite graphs.
method Using coarse geometry techniques, classify coarsely bounded groups and compute asymptotic dimension.
result Identify conditions for global and local coarsely bounded pure mapping class groups of infinite rank graphs.

The paper extends graph complexity calculations for certain 3-manifolds up to 14.

problem Calculating the minimum 4-colored graph complexity of compact 3-manifolds.
method Exact calculations and two-sided bounds for graph complexity.
result Exact value of graph complexity computed for an infinite family of tetrahedral manifolds.

We introduce a representation of compact 3-manifolds without spherical boundary components via (regular) 4-colored graphs, which turns out to be very convenient for computer aided study and tabulation. Our construction is a direct generalization of the one given in the eighties by S. Lins for closed 3-manifolds, which …

2013-04-18abs ↗pdf ↗

Groups of homotopy equivalences of graphs help realize compact subgroups.

problem Realizing compact subgroups of homotopy equivalences of graphs.
method Introduced a Polish group topology on the group of proper homotopy equivalences and proved the Nielsen Realization theorem.
result Compact subgroups of homotopy equivalences can be realized by simplicial isomorphisms of graphs.

Compact clustering in latent space improves semi-supervised learning.

problem Improving semi-supervised learning with unlabeled data.
method Dynamic graph creation over embeddings, label propagation, and Markov chain regularization.
result Compact clustering in latent space facilitates better separation and separation of labeled and unlabeled data.

In this paper, we address the following question: What does a typical compact Riemann surface of large genus look like geometrically? We do so by constructing compact Riemann surfaces from oriented 3-regular graphs. The set for such Riemann surfaces is dense in the space of all compact Riemann surfaces, namely Belyi su…

2001-06-28abs ↗pdf ↗

The study provides a structure theorem for a new class of noncompact 3-manifolds.

problem Understanding a new class of noncompact 3-manifolds.
method Proved a structure theorem for irreducible open graph manifolds.
result A canonical 'reduced' decomposition of irreducible open graph manifolds along embedded, incompressible 2-tori.

Minimal graphs over non-compact domains in 3-manifolds solved with estimates and uniqueness results.

problem Solving minimal graphs over non-compact domains in 3-manifolds with a Killing vector field.
method Killing Submersion, Dirichlet problem, Collin-Krust estimates, uniqueness results, removable singularities.
result General Collin-Krust type estimates and uniqueness results for minimal Killing graphs.

Study shows consistency of shallow GCNNs on sampled point clouds under manifold assumption.

problem Consistency of shallow GCNNs on sampled point clouds under manifold assumption.
method Functional analysis perspective, weakly compact product of unit balls, Sobolev regularity, frequency cutoff.
result Proves ΓΓ-convergence of regularized empirical risk minimization functionals and convergence of their global minimizers.

This paper is concerned with lower bounds for the connectivity of graphs (one-dimensional skeleta) of triangulations of compact manifolds. We introduce a structural invariant b_M for simplicial d-manifolds M taking values in the range 0 <= b_M <= d-1. The main result is that b_M influences connectivity in the following…

2012-07-23abs ↗pdf ↗

The paper proves removable singularity for nonlocal minimal graphs.

problem Proving removable singularities for nonlocal minimal graphs.
method Analyzing (s,1)(s, 1)-capacity zero compact sets to ensure graphs are minimal in the entire domain.
result Nonlocal minimal graphs are removable in the entire domain if they are minimal in a set of (s,1)(s, 1)-capacity zero.

We prove that the existence of a positively defined, invariant Einstein metric mm on a connected homogeneous space G/HG/H of a compact Lie group GG is the consequence of non-contractibility of some compact set C=XG,HΣC=X_{G,H}^Σ (Böhm polyhedron) introduced by C.Böhm. There is a natural continuous map of CC onto the flag …

2011-10-17abs ↗pdf ↗

Let S be a compact surface, and M be the double of a handlebody. Given a homotopy class of maps from S to M inducing an isomorphism of fundamental groups, we describe a canonical uniformly lipschitz retraction of the sphere graph of M to the arc graph of S. We also show that this retraction is a uniformly bounded dista…

2015-12-14abs ↗pdf ↗

GOTabPFN improves tabular model performance with compact tokenization for HDLSS data.

problem Making tabular models effective for high-dimensional, low-sample size data without retraining.
method Introducing Graph-guided Ordering with Local Refinement (GO-LR) and Neuro-Inspired Subunit Compression (NSC) to create compact meta-features.
result GOTabPFN improves stability and accuracy in tabular benchmarks with compact tokenization.

The paper studies the connectedness of a graph's boundary for surfaces.

problem Understanding the topology of the Gromov boundary of fine curve graphs for surfaces.
method Proved a bounded geodesic image theorem, used to show linear connectivity of the Gromov boundary.
result The Gromov boundary of fine curve graphs for surfaces is linearly connected.

The paper extends spectral results to non-abelian groups acting on compact Riemannian manifolds.

problem Determining potential functions from spectral data for non-abelian group actions.
method Generalized Legendrian relations and spectral invariants.
result Potential functions are determined by the equivariant spectrum for certain Schrödinger operators.

We prove the connectedness and calculate the diameter of the oriented graph of graftings associated to exotic complex projective structures on a compact surface S with a given holonomy representation of Fuchsian type. The oriented graph of graftings is the graph whose vertices are the equivalence classes of marked CP^1…

2012-05-28abs ↗pdf ↗

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a dd-dimensional compact submanifold MM in RD\mathbb{R}^D, we establish the spectral convergence rate…

2015-10-27abs ↗pdf ↗

Graph Laplace operators uniquely identify metrics and densities on manifolds.

problem Identifying Riemannian metrics and sampling densities from graph Laplace operators.
method Analyzing intrinsic and extrinsic graph Laplace operators on compact Riemannian manifolds.
result Graph Laplace operators uniquely determine metrics and densities under certain conditions.

Diagrammatic method characterizes non-split surfaces in 3-sphere.

problem Characterizing non-split compact surfaces in the 3-sphere.
method Using diagrams of spatial trivalent graphs with signs and Reidemeister moves.
result Two diagrams of embedded surfaces are related by Reidemeister moves if and only if the surfaces are ambient isotopic.