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

136271407542 · Jun 202019922001200920172026
48 results for higher graph manifolds

Proves Singer conjecture for graph manifolds with residually finite groups.

problem Proving the Singer conjecture for graph manifolds with specific properties.
method Used residual finiteness and graph manifold properties to prove the conjecture.
result Proved the Singer conjecture for extended graph manifolds and pure complex-hyperbolic higher graph manifolds.

In this paper, we first introduce higher order Dirichlet-to-Neumann maps on graphs which can be viewed as a discrete analogue of the corresponding Dirichlet-to-Neumann maps on compact Riemannian manifolds with boundary and a higher order generalization of the Dirichlet-to-Neumann map on graphs introduced by Hua-Huang-W…

2019-04-08abs ↗pdf ↗

In this short note we introduce higher graph manifolds and use a version of the barycenter technique to characterize when they undergo volume collapse. In the case when the pure pieces are hyperbolic, we compute the exact value of the minimal volume. We verify the coarse Baum--Connes conjecture for these manifolds and …

2012-08-23abs ↗pdf ↗

Random matrix models generalize to Group Field Theories (GFT) whose Feynman graphs are dual to gluings of higher dimensional simplices. It is generally assumed that GFT graphs are always dual to pseudo manifolds. In this paper we prove that already in dimension three (and in all higher dimensions), this is not true due…

2010-06-03abs ↗pdf ↗

The study shows how to embed cusp-decomposable manifolds quasi-isometrically.

problem Embedding cusp-decomposable manifolds quasi-isometrically.
method Using properties of the electric space of the universal cover, we show quasi-isometric embeddings.
result Isomorphisms between fundamental groups of higher graph manifolds preserve the decomposition into pieces.

We show that after one stabilization, a strongly irreducible Heegaard splitting of suitably large genus of a graph manifold is isotopic to an amalgamation along a modified version of the system of canonical tori in the JSJ decomposition. As a corollary, two strongly irreducible Heegaard splittings of a graph manifold o…

2006-04-05abs ↗pdf ↗

The study constructs geometrically decomposable aspherical 4-manifolds with non-zero signature and explores their properties.

problem Characterizing geometrically decomposable aspherical 4-manifolds with non-zero signature.
method Constructing examples and proving inequalities for geometrically decomposable aspherical 4-manifolds.
result All geometrically decomposable aspherical 4-manifolds with non-zero signature satisfy the inequality \( \chi \geq 3|σ| \).

Paper rigorously defines Feynman graph integrals on Kähler manifolds.

problem Establishing convergence of Feynman graph integrals on Kähler manifolds.
method Using Getzler's rescaling technique, graph integrands are extended to forms with divisorial-type singularities in the compactification of configuration spaces.
result Feynman graph integrals are rigorously defined as Cauchy principal value integrals.

Study of mean curvature flows on graphs in warped product manifolds, focusing on behavior at infinity.

problem Behavior of mean curvature flows on graphs in warped product manifolds, especially at infinity.
method Analysis of curve shortening flow and mean curvature flow on geodesic graphs for various warping functions.
result Long-time existence of mean curvature flows and vanishing of curvature and derivatives at infinity.

The paper presents a new method to represent directed graphs using pseudo-Riemannian manifolds.

problem Representing directed graphs in a compact and meaningful way.
method Combines pseudo-Riemannian metric structure, non-trivial global topology, and a unique likelihood function.
result Low-dimensional cylindrical Minkowski and anti-de Sitter spacetimes produce equal or better graph representations than curved Riemannian manifolds.

The paper characterizes graph manifolds using fold maps and embeddability of polyhedra.

problem Understanding the global topologies of graph manifolds.
method Using fold maps into the plane and embeddability of polyhedra in 3-manifolds.
result Characterizes graph manifolds via fold maps and polyhedra embeddability.

This paper reconstructs complex graph signals using kernel methods on manifolds.

problem Reconstructing complex graph signals from samples on graph vertices.
method Kernel methods on complex manifolds, embedding vertices into higher-dimensional spaces.
result Effective reconstruction of complex graph signals, outperforming conventional methods.

Study compares hypergraph and graph-level models for higher-order relational learning.

problem Evaluating effectiveness of hypergraph-level vs. graph-level models in relational learning.
method Systematic evaluation of various hypergraph and graph-level architectures.
result Graph-level models applied to hypergraph expansions outperform hypergraph-level models.

A new method predicts higher-order interactions in evolving graphs using simplicial complexes.

problem Predicting higher-order interactions in dynamic graphs with theoretical guarantees.
method Capturing higher-order interactions as simplices, modeling neighborhoods with face-vectors, and developing a nonparametric kernel estimator.
result Our method outperforms existing higher-order prediction methods and is theoretically consistent.

In this paper, we study the algebraic properties of the higher analogues of Courant algebroid structures on the direct sum bundle TMnTMTM\oplus\wedge^nT^*M for an mm-dimensional manifold. As an application, we revisit Nambu-Poisson structures and multisymplectic structures. We prove that the graph of an (n+1)(n+1)-vector fi…

2010-03-06abs ↗pdf ↗

Combines neural networks and probabilistic graphical models for efficient higher-order inference.

problem Lack of efficient higher-order relational information in graph neural networks and probabilistic graphical models.
method Derives efficient approximate sum-product loopy belief propagation for higher-order PGMs, embeds into neural network, proposes methods for constructing higher-order factors.
result Substantially outperforms state-of-the-art k-order graph neural networks in molecular datasets.

This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the formalization of most mathematical theories and have been shown to pose a significa…

2019-05-24abs ↗pdf ↗

We introduce nonlinear higher-order label spreading for semi-supervised learning.

problem Efficient semi-supervised learning on graphs with complex label spreading.
method We add nonlinearity to label spreading through higher-order graph structures, proving convergence and demonstrating efficiency on various datasets.
result Our nonlinear higher-order label spreading algorithm converges to the global solution and performs favorably compared to classical methods.

In recent years, graph neural networks (GNNs) have emerged as a powerful neural architecture to learn vector representations of nodes and graphs in a supervised, end-to-end fashion. Up to now, GNNs have only been evaluated empirically -- showing promising results. The following work investigates GNNs from a theoretical…

2018-10-04abs ↗pdf ↗

SpeqNets improve graph neural networks by scaling and adapting to graph sparsity.

problem Graph neural networks struggle with permutation-equivariant functions and scalability to large graphs.
method Introducing sparsity-aware, permutation-equivariant graph networks with heuristics for graph isomorphism.
result Significantly improved predictive performance and reduced computation times compared to existing methods.

The study proves conditions for hyperbolic isometries on fine curve graphs of higher genus surfaces.

problem Conditions for hyperbolic isometries on fine curve graphs of higher genus surfaces.
method Proves equivalence of conditions involving isotopic maps, pseudo-Anosov maps, and ergodic rotation sets.
result Ergodic homological rotation sets have nonempty interior for certain isotopic maps.

We define two new families of invariants for (3-manifold, graph) pairs which detect the unknot and are additive under connected sum of pairs and (-1/2)-additive under trivalent vertex sum of pairs. The first of these families is closely related to both bridge number and tunnel number. The second of these families is a …

2016-06-10abs ↗pdf ↗

Investigates conditions for GKM fiber bundles and realizability of fiber bundles of GKM graphs.

problem Conditions for GKM fiber bundles and realizability of fiber bundles of GKM graphs.
method Analysis of GKM graphs and fiber bundles, counterexamples, and classification of twist automorphisms.
result Realizability of fiber bundles of GKM graphs depends on the twist automorphism and can be decided in terms of the classification.

Derives formulae for general permutation equivariant layers and presents a second order graph variational encoder.

problem Tackles the limitation of previous equivariant neural networks by considering permutations of matrices.
method Derives formulae for general permutation equivariant layers, including matrix permutations. Presents a second order graph variational encoder.
result Latent distribution of equivariant generative models must be exchangeable.

The pants graph has proved to be influential in understanding 3-manifolds concretely. This stems from a quasi-isometry between the pants graph and the Teichmüller space with the Weil-Petersson metric. Currently, all estimates on the quasi-isometry constants are dependent on the surface in an undiscovered way. This pape…

2019-05-31abs ↗pdf ↗

This work proposes a geometric approach to equivariant message passing on Riemannian manifolds.

problem Efficiently processing data on Riemannian manifolds with equivariance.
method Geometric insight into equivariant message passing on Riemannian manifolds, using an equivariant embedding and diffusion process.
result A new class of equivariant GNNs on Riemannian manifolds.

A simplified proof for embedding higher-dimensional complexes into manifolds.

problem Embedding higher-dimensional complexes into manifolds with constraints.
method A short and accessible proof for the Patak-Tancer theorem.
result A simplified proof for the Heawood inequality in higher dimensions.

New theory defines invariants for framed 3-manifolds using trivalent graphs with self-loops.

problem Defining invariants for framed 3-manifolds with semi-simple Lie groups.
method Constructing graph complexes and cocycles, including self-loops, to define invariants.
result Higher-loop invariants can be defined by graph cocycles with or without self-loops.

H-GAT improves stock selection by capturing complex higher-order stock relations and integrating both technical and fundamental analysis.

problem Stock selection difficulty and lack of comprehensive analysis.
method Higher-order Graph Attention Network (H-GAT) that incorporates both technical and fundamental analysis.
result H-GAT outperforms existing methods in stock selection metrics.

With higher-order neighborhood information of graph network, the accuracy of graph representation learning classification can be significantly improved. However, the current higher order graph convolutional network has a large number of parameters and high computational complexity. Therefore, we propose a Hybrid Lower …

2019-08-02abs ↗pdf ↗

The covering spectrum is a geometric invariant of a Riemannian manifold, more generally of a metric space, that measures the size of its one-dimensional holes by isolating a portion of the length spectrum. In a previous paper we demonstrated that the covering spectrum is not a spectral invariant of a manifold in dimens…

2010-06-28abs ↗pdf ↗

Novel TRI-GNN framework improves graph classification robustness.

problem Graph neural networks suffer from over-smoothing and vulnerability to graph perturbations.
method Integrates higher-order graph information via persistent homology and local graph structure learning.
result TRI-GNN outperforms state-of-the-art baselines on node classification tasks.

Gromov and Piatetski-Shapiro proved existence of finite volume non-arithmetic hyperbolic manifolds of any given dimension. In dimension four and higher, we show that there are about v^v such manifolds of volume at most v, considered up to commensurability. Since the number of arithmetic ones tends to be polynomial, alm…

2014-01-30abs ↗pdf ↗