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

275481108 · Jun 202019922001200920172026
48 results for topological vertices

The lattice cohomology of a plumbed 3--manifold MM associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of MM, and in the comparison of the topological properties with analytic ones when MM is realized as complex analytic singularity link. By defini…

2013-02-19abs ↗pdf ↗

The paper explores how to find relevant vertices in one graph using another graph's attributes and structure.

problem Finding relevant vertices in one graph using another graph's attributes and structure.
method Theoretical and practical exploration of vertex nomination schemes that leverage both content (edge and vertex attributes) and context (network topology).
result Necessary and sufficient conditions for schemes that use both content and context to outperform those using only one.

We uncover some connections between the topology of a complete Riemannian surface M and the minimum number of vertices, i.e., critical points of geodesic curvature, of closed curves in M. In particular we show that the space forms with finite fundamental group are the only surfaces in which every simple closed curve ha…

2010-06-21abs ↗pdf ↗
Graphoidsmath.CO

Graphoids are topological invariants of virtual graph diagrams.

problem Understanding knotted graphs with open ends in proteins and simplifying virtual spatial graphs.
method Topological interpretations of graphoids using graph Reidemeister moves.
result Virtual graphoids are useful for studying knotted graphs and simplifying spatial graphs.

We explore the consequences of curvature and torsion on the topology of quaternionic contact manifolds with integrable vertical distribution. We prove a general Myers theorem and establish a Cartan-Hadamard result for almost qc-Einstein manifolds.

2014-02-07abs ↗pdf ↗

We make a new attempt at the recently suggested program to express knot polynomials through topological vertices, which can be considered as a possible approach to the tangle calculus: we discuss the Macdonald deformation of the relation between the convolution of two topological vertices and the HOMFLY-PT invariant of…

2019-05-01abs ↗pdf ↗

This paper examines how graph topology affects adversarial attacks on vertex classification.

problem Adversarial attacks on vertex classification are vulnerable to graph topology changes.
method Examined two topological graph characteristics and their impact on adversary perturbation budgets.
result Training sets including high-degree vertices or those ensuring all unlabeled nodes have neighbors can significantly increase the adversary's perturbation budget.

We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…

2014-08-15abs ↗pdf ↗

In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing which vertex to query in order to learn as much as possible about the attributes of …

2010-05-05abs ↗pdf ↗

The notion of covering type was recently introduced by Karoubi and Weibel to measure the complexity of a topological space by means of good coverings. When X has the homotopy type of a finite CW-complex, its covering type coincides with the minimum possible number of vertices of a simplicial complex homotopy equivalent…

2017-12-07abs ↗pdf ↗

Minimal Delaunay triangulations on hyperbolic surfaces have linear number of vertices.

problem Finding the minimum number of vertices in Delaunay triangulations of hyperbolic surfaces.
method Analyzing the genus gg of hyperbolic surfaces to derive bounds on the number of vertices.
result The number of vertices in minimal Delaunay triangulations of hyperbolic surfaces is linear in the genus gg.

Graph neural controlled differential equations learn graph dynamics from vertex observations.

problem Predicting future states of dynamical systems on graphs with limited vertex data.
method Incorporates graph topology information into NCDE to predict graph dynamics.
result Informed NCDE requires fewer parameters and lower MAE compared to previous methods.

We start with a disk with 2n2n vertices along its boundary where pairs of vertices are connected with nn strips with certain restrictions. This forms a {\it pairing}. To relate two pairings, we define an operator called a cut-and-glue operation. We show that this operation does not change an invariant of pairings know…

2019-10-25abs ↗pdf ↗

This is a survey article for the forthcoming `A Concise Encyclopedia of Knot Theory.' We focus on the topology of spatial graphs with few vertices and edges, paying particular attention to Brunnian θθ-graphs.

2019-02-05abs ↗pdf ↗

This expository article describes applications of topological configuration spaces to the control of robotic systems. In particular, we review recent work by the authors on configuration spaces of graphs. These are lovely spaces: we show for example that the configuration space of two points on the complete graph of fi…

2000-09-12abs ↗pdf ↗

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an…

2008-08-29abs ↗pdf ↗

The geometric, topological, and symplectic properties of moduli spaces (spaces of configurations modulo rotations and translations) of polygonal linkages have been studied by Kapovich, Millson, and Kamiyama, et. al. One can form a polygonal linkage by taking two free linkages and identifying initial and terminal vertic…

2003-06-30abs ↗pdf ↗

We study the asymptotic geometry of Teichmueller geodesic rays. We show that when the transverse measures to the vertical foliations of the quadratic differentials determining two different rays are topologically equivalent, but are not absolutely continuous with respect to each other, then the rays diverge in Teichmue…

2008-03-12abs ↗pdf ↗

The study classifies discrete pseudomanifolds with up to 2d+7 vertices.

problem Understanding discrete pseudomanifolds with a small number of vertices.
method Proved existence of at least 2(d+1) vertices, classified up to 2d+6 vertices, established equivalence with edge graphs of flag normal pseudomanifolds.
result Every flag normal d-pseudomanifold with at most 2d+7 vertices is either a simplicial d-sphere or a flag triangulation of the (d-2)-fold suspension of RP^2.

Paper explores applying TDA to text classification, improving model performance.

problem Applying TDA to text classification is challenging due to the complexity of text geometry.
method Used word embeddings and TF-IDF vectors to extract topological features from text.
result Topological features improve classification results, especially in ensemble models.

The aim of this text is to provide an elementary and self-contained exposition of Gromov's argument on topological overlap (the presentation is based on Gromov's work, as well as two follow-up papers of Matousek and Wagner, and of Dotterrer, Kaufman and Wagner). We also discuss a simple generalization in which the vert…

2015-08-04abs ↗pdf ↗

In 1997, Collin proved that any properly embedded minimal surface in R3\mathbb{R}^3 with finite topology and more than one end has finite total Gaussian curvature. Hence, by an earlier result of Lopez and Ros, catenoids are the only non-planar, non-simply connected, properly embedded, minimal planar domains in $\mathbb…

2013-06-07abs ↗pdf ↗

The recently suggested tangle calculus for knot polynomials is intimately related to topological string considerations and can help to build the HOMFLY-PT invariants from the topological vertices. We discuss this interplay in the simplest example of the Hopf link and link L8n8L_{8n8}. It turns out that the resolved conif…

2018-06-04abs ↗pdf ↗

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense. We show that the graphs we construct are generally connected, infinite diameter a…

2014-10-12abs ↗pdf ↗

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory, combinatorics, and singularity theory. The multidimensional analogues of this complex ar…

2014-09-21abs ↗pdf ↗

In 1983, Conway-Gordon showed that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices, the sum of the Arf invariants over all of the Hamiltonian knots is also congruen…

2009-07-01abs ↗pdf ↗

We derive a recursion relation for hyperbolic string vertices and apply it to string field theory.

problem Deriving a recursion relation for hyperbolic string vertices and its implications for string field theory.
method Using systolic volumes and a modified Mirzakhani's recursion, we construct a higher-order vertex determination for hyperbolic string field theory.
result The higher order vertices in hyperbolic string field theory are determined by the cubic vertex iteratively for any background.