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

0.3%0.5%0.8%0.4% · Dec 200819922001200920172026
14 results for N-graphs

Study on spatial graphs and their constituent knots, linking polynomial invariants.

problem Understanding the polynomial invariants of spatial graphs and their constituent knots.
method Analyzing spatial K4K_4 graphs, constructing band surfaces, and relating polynomials.
result Relations between Yamada/Jaeger polynomials and Jones polynomials of constituent knots and associated links.

New hyperbolic graph constructed from projections of free splitting graph.

problem Constructing a new hyperbolic graph from projections of free splitting graph.
method Using submanifold projections and geometric realization of free splitting graph.
result A new hyperbolic graph constructed for n3n\geq 3.

Let nn be a nonnegative integer, we use ribbon nn-graph diagrams and the Yamada polynomial skein relations to construct an algebra Yn{\mathcal Y}_n which is shown to be closely related to the Temerley-Lieb Algebra. We prove that the algebra Y2{\mathcal Y}_2 is isomorphic to some quotient of a three variables polynomi…

2012-03-27abs ↗pdf ↗

We associate a moduli problem to a colored trivalent graph; such graphs, when planar, appear in the state-sum description of the quantum sl(N) knot polynomial due to Murakami, Ohtsuki, and Yamada. We discuss how the resulting moduli space can be thought of a representation variety. We show that the Euler characteristic…

2012-04-24abs ↗pdf ↗

E-NFs generate molecules and their positions while preserving Euclidean symmetries.

problem Generating molecules with their positions while preserving Euclidean symmetries.
method Integrating E(n) graph neural networks into a differential equation to create an invertible equivariant function.
result E-NFs significantly outperform baselines and existing methods in log-likelihood for particle systems and molecules.

Spectral clustering is one of the most popular methods for community detection in graphs. A key step in spectral clustering algorithms is the eigen decomposition of the n×nn{\times}n graph Laplacian matrix to extract its kk leading eigenvectors, where kk is the desired number of clusters among nn objects. This is pro…

2017-02-12abs ↗pdf ↗

The study constructs a Legendrian cycle for FnW2,nF_nW^{2,n}-sets and proves Reilly-type variational formulae.

problem Understanding higher-order mean curvature integrals of non-smooth sets.
method Construction of a Legendrian cycle and analysis of proximal unit normal bundles.
result Reilly-type variational formulae for higher-order mean curvature integrals of FnW2,nF_nW^{2,n}-sets.

The study finds many Lagrangian fillings for Legendrian links of specific types.

problem Understanding the number and types of Lagrangian fillings for Legendrian links.
method Proved the existence of at least as many exact embedded Lagrangian fillings as seeds for Legendrian links of finite or affine Dynkin type.
result Found many Lagrangian fillings with rotational and conjugation symmetries for specific types of Legendrian links.

New algorithm achieves almost exact graph matching in almost quadratic time.

problem Graph matching under correlated Erdős-Rényi models.
method Rank-based graph matching using local tree correlation tests.
result Achieves almost exact recovery in almost quadratic time complexity.