Related papers: Second extra differential on odd graph complexes
We introduce a new homological machine for the study of secondary geometric invariants. The objects, called spark complexes, occur in many areas of mathematics. The theory is applied here to establish the equivalence of a large family of…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
We introduce a new cohomology theory for stacks called elliptic Hochschild homology, prove some fundamental properties and compute it in some classes of examples. We then introduce its periodic cyclic version and show that, over the complex…
We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexity of dual-criticality testing. By the definition the problem…
This paper explores the effect of various graphical constructions upon the associated graph $C^*$-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
Kontsevich constructed a map between `good' graph cocycles $\gamma$ and infinitesimal deformations of Poisson bivectors on affine manifolds, that is, Poisson cocycles in the second Lichnerowicz--Poisson cohomology. For the tetrahedral graph…
Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…
For any graph G we define bigraded cohomology groups whose graded Euler characteristic is a multiple of the Yamada polynomial of G.
A cohomology theory for "odd polygon" relations -- algebraic imitations of Pachner moves in dimensions 3, 5, ... -- is constructed. Manifold invariants based on polygon relations and nontrivial polygon cocycles are proposed. Example…
Graph-level contrastive learning, aiming to learn the representations for each graph by contrasting two augmented graphs, has attracted considerable attention. Previous studies usually simply assume that a graph and its augmented graph as a…
This paper has dual aims. First is to develop practical universal coding methods for unlabeled graphs. Second is to use these for graph anomaly detection. The paper develops two coding methods for unlabeled graphs: one based on the degree…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
An odd (resp. even) subgraph in a multigraph is its subgraph in which every vertex has odd (resp. even) degree. We say that a multigraph can be decomposed into two odd subgraphs if its edge set can be partitioned into two sets so that both…
Covariant first order differential calculus over quantum complex Grassmann manifolds is considered. It is shown by a Pusz-Woronowicz type argument that under restriction to calculi close to classical Kaehler differentials there exist…
Cobordisms are naturally bigraded and we show that this grading extends to Khovanov homology, making it a triply graded theory. Although the new grading does not make the homology a stronger invariant, it can be used to show that odd…
The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular…
We introduce Hochschild (co-)homology of morphisms of schemes or analytic spaces and study its fundamental properties. In analogy with the cotangent complex we introduce the so called (derived) Hochschild complex of a morphism; the…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
This paper studies the problem of detecting anomalous graphs using a machine learning model trained on only normal graphs, which has many applications in molecule, biology, and social network data analysis. We present a self-discriminative…