arXiv research

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

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the Kauffman bracket to an invariant of looped graphs, and an extension of Reidemeis…

Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to show that these graphs determine the chord diagram if the graph has at most one loo…

Paper detects non-trivial cycles in embedding spaces using graph integrals.

In the present paper we construct a one-to-one correspondence between the set of graph-knots and the set of homotopy classes of looped graphs. Moreover, the graph-knot and the homotopy class constructed from a given knot are related with this correspondence. This correspondence is given by a simple formula.

Polynomial-time algorithm finds short non-orientable loops intersecting graph edges up to 30 times.

We propose a novel spectral convolutional neural network (CNN) model on graph structured data, namely Distributed Feedback-Looped Networks (DFNets). This model is incorporated with a robust class of spectral graph filters, called feedback-looped filters, to provide better localization on vertices, while still attaining…

Our purpose is to explore, in the context of loop ensembles on finite graphs, the relations between combinatorial group theory, loops topology, loop measures, and signatures of discrete paths. We determine the distributions of the loop homotopy class, and of the first and second homologies, defined by the lower central…

New rays on infinite type surfaces help understand their boundaries.

Infinite clique of rays in plane minus Cantor set.

New $\alpha$-BP algorithm improves belief propagation for graphs with loops.

The Kinoshita graph is a particular embedding in the 3-sphere of a graph with three edges, two vertices and no loops. It has the remarkable property that although the removal of any edge results in an unknotted loop, the Kinoshita graph is itself knotted. We use two classical theorems from knot theory to give two parti…

The paper constructs non-trivial cocycles for long embeddings with more than one loop.

We prove the following estimate for the spectrum of the normalized Laplace operator $Δ$ on a finite graph $G$, \begin{equation*}1- (1- k[t])^{\frac{1}{t}}\leq λ_1 \leq \cdots \leq λ_{N-1}\leq 1+ (1- k[t])^{\frac{1}{t}}, \,\forall \,\,\text{integers}\,\, t\geq 1. \end{equation*} Here $k[t]$ is a lower bound for the Olli…

Motivated by the problem of deformation quantization we introduce and study directed graph complexes with oriented loops and wheels. We develop some technique for computing cohomology of such graph complexes and apply it to several concrete examples such as wheeled completion of the operad of strongly homotopy Lie alge…

New invariant links graph structure to tropical curve properties.

Study of infinite-type surfaces' automorphisms and graph structures.

New algorithm finds more arbitrage opportunities in DEXs.

Belief propagation (BP) can do exact inference in loop-free graphs, but its performance could be poor in graphs with loops, and the understanding of its solution is limited. This work gives an interpretable belief propagation rule that is actually minimization of a localized $α$-divergence. We term this algorithm as $α…

We give a generalization of Fukaya's Morse homotopy theoretic approach for 2-loop Chern--Simons perturbation theory to 3-valent graphs with arbitrary number of loops at least 2. We construct a sequence of invariants of integral homology 3-spheres with values in a space of 3-valent graphs (Jacobi diagrams or Feynman dia…

In this paper, we are interested in short homologically and homotopically independent loops based at the same point on Riemannian surfaces and metric graphs. First, we show that for every closed Riemannian surface of genus $g \geq 2$ and area normalized to $g$, there are at least $\ceil{\log(2g)+1}$ homotopically indep…

Loops in surfaces and chord diagrams are studied with graph factorizations and grammars.

The paper explores the structure of Reeb spaces for smooth functions on manifolds.

We discuss a new approach to computing the standard algebraic operations on homotopy classes of loops in surfaces: the homological intersection number, Goldman's Lie bracket, and the author's Lie cobracket. Our approach uses fillings of the surfaces by certain graphs.

A 2-dimensional braid over an oriented surface-knot $F$ is presented by a graph called a chart on a surface diagram of $F$. We consider 2-dimensional braids obtained by an addition of 1-handles equipped with chart loops. We introduce moves of 1-handles with chart loops, called 1-handle moves, and we investigate how muc…

We introduce and study the Wilson loops in a general 3D topological field theories (TFTs), and show that the expectation value of Wilson loops also gives knot invariants as in Chern-Simons theory. We study the TFTs within the Batalin-Vilkovisky (BV) and Alexandrov-Kontsevich-Schwarz-Zaboronsky (AKSZ) framework, and the…

We prove that for some knot-like objects one can easily recognize non-equivalence w.r.t. all Reidemeister moves by studying some equivalence classes modulo only 2nd Reidemeister moves. There are applications to virtual knots, graph-links and looped graphs.

We study trivalent graphs in $S^{3}$ whose closed complement is a genus two handlebody. We show that such a graph, when put in thin position, has a simple (i. e. non-loop) level edge.

In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus the ribbon graph minor relation is incompatible wi…

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simp…

A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$. For a branched covering surface-knot, an addition of 1-handles equipped with cha…

The Reeb graph $\mathcal{R}(f)$ is one of the fundamental invariants of a smooth function $f\colon M\to \mathbb{R}$ with isolated critical points. It is defined as the quotient space $M/_{\!\sim}$ of the closed manifold $M$ by a relation that depends on $f$. Here we construct a $1$-dimensional complex $Γ(f)$ embedded…

Study quantization schemes on Kähler manifolds linking star products and BV quantizations.

We study mapping class groups of infinite type surfaces with isolated punctures and their actions on the loop graphs introduced by Bavard-Walker. We classify all of the mapping classes in these actions which are loxodromic with a WWPD action on the corresponding loop graph. The WWPD property is a weakening of Bestvina-…

The abstract theorem is extended to higher genus surfaces.

New algorithm reduces high-probability regret for time-varying feedback graphs.

The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the Reidemeister moves for links into the language of intersection graphs of chord diagrams. I…

We study the statistical behavior of reasoning probes in a stylized model of iterative computation inspired by neural algorithmic reasoning. The underlying computation is given by a looped Boolean circuit whose graph is a perfect $ν$-ary tree ($ν\ge 2$), with outputs recursively fed back as inputs across computation ro…

We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, ie, …

Interactive RL and DT feedback improve feature selection efficiency.

Generalized belief propagation converges to optimal solutions on graphs with motifs.

In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated to a directed Euler system of the universe graph of D. Here we extend the graph b…

We will construct differential forms on the embedding spaces Emb(R^j,R^n) for n-j>=2 using configuration space integral associated with 1-loop graphs, and show that some linear combinations of these forms are closed in some dimensions. There are other dimensions in which we can show the closedness if we replace Emb(R^j…

We study the expectation value of a nonplanar Wilson graph operator in SL(2,C) Chern-Simons theory on $S^3$. In particular we analyze its asymptotic behaviour in the double-scaling limit in which both the representation labels and the Chern-Simons coupling are taken to be large, but with fixed ratio. When the Wilson gr…

New bounds for bandits with graph feedback, improving previous results.

Study asymptotic expansion of graph Laplacian on discretized surfaces, relating spanning trees and cycle-rooted forests.

Quantum model for knotted graphs from knot theory.

A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over the graph. When applying the proximal gradient algorithm to solve this problem, t…