arXiv research

Study explores properties of bipartite knots.

New method extends knot theory to non-bipartite knots, revealing PDs.

Simplified Khovanov polynomials for bipartite links.

Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing approaches to bipartite community detection have drawbacks, including im…

New model for detecting communities in weighted bipartite networks.

New research finds six bipartite intrinsically knotted graphs with 23 edges.

Simplified Khovanov-Rozansky calculus for bipartite knots.

Proves Khovanov homology has no torsion for bipartite circle graphs.

Improved bipartite link prediction using 2-hop paths.

New model for detecting communities in weighted bipartite networks.

Bipartite graphs have been used to represent data relationships in many data-mining applications such as in E-commerce recommendation systems. Since learning in graph space is more complicated than in Euclidian space, recent studies have extensively utilized neural nets to effectively and efficiently embed a graph's no…

A new method calculates HOMFLY-PT polynomials for bipartite links.

We define integral odd Khovanov homology of principally unimodular bipartite graph-links.

A new SBM for bipartite networks improves community detection in noisy data.

PAC learning simplified as bipartite matching.

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links. We then introduce a combinatorial notion of adjacency for bipartite graph links…

We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| \geq 4 |V(G)| - 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six vertices in one part. We also show that there is a constant C_n such that a bipa…

Develops a new variational estimator for node popularity in bipartite networks.

Improved text summarization using belief propagation on weighted bipartite graphs.

New method for matching bipartite and unipartite graphs without collapsing.

Bipartite Riemann-Finsler geometries with complementary Finsler structures are constructed. Calculable examples are presented based on a bilinear-form coefficient for explicit Lorentz violation.

Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.

New method for calculating HOMFLY polynomials in symmetric representations.

A new model detects common patterns in pollination networks.

We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.

Neural execution solves complex graph problems like bipartite matching.

A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, $K_7$ and the 13 graphs obtained from $K_7$ by $\nabla Y$ moves, are the only minor minimal intrinsically knotted graphs with 21 edges. This set incl…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular abstract graphs. This question has been answered for complete graphs; it is natu…

New tests detect communities in dense bipartite graphs with high accuracy.

We study the Thurston-Bennequin number of complete and complete bipartite Legendrian graphs. We define a new invariant called the total Thurston-Bennequin number of the graph. We show that this invariant is determined by the Thurston-Bennequin numbers of 3-cycles for complete graphs and by the Thurston-Bennequin number…

The interior polynomial is an invariant of (signed) bipartite graphs, and the interior polynomial of a plane bipartite graph is equal to a part of the HOMFLY polynomial of a naturally associated link. The HOMFLY polynomial $P_L(v,z)$ is a famous link invariant with many known properties. For example, the HOMFLY polynom…

In this paper we analyse the bipartite Colombian firms-products network, throughout a period of five years, from 2010 to 2014. Our analysis depicts a strongly modular system, with several groups of firms specializing in the export of specific categories of products. These clusters have been detected by running the bipa…

Positive Thompson links are arborescent tangles.

Temperley-Lieb algebras have been generalized to sl(3) web spaces. Since a cubic bipartite planar graph with suitable directions on edges is a web, the quantum sl(3) invariants naturally extend to all cubic bipartite planar graphs. First we completely classify them as a connected sum of primes webs. We also provide a m…

We determine for which $n$, the complete bipartite graph $K_{n,n}$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

The interior polynomial is an invariant of bipartite graphs, and a part of the HOMFLY polynomial of a special alternating link coincides with the interior polynomial of the Seifert graph of the link. We extend the interior polynomial to signed bipartite graphs, and we show that, in the planar case, it is equal to a par…

We introduce a new invariant of bipartite chord diagrams and use it to construct the first examples of groups with Dehn function $n^2\log n$ and other small Dehn functions. Some of these groups have undecidable conjugacy problem.

New algorithm uses imperfect advice to improve online bipartite matching performance.

Improved model for grouping nodes in bipartite networks.

The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. …

This work analyzes two methods for combining multiple binary labels in bipartite ranking.

We generalize the construction of the Heegaard Floer homology for a singular knot to that for a balanced bipartite graph. For a given graph, we provide a combinatorial description of the Euler characteristic of its Heegaard Floer homology by using the "Kauffman states" on a graph diagram.

The study proves conjecture for specific Artin groups.

Recent years have witnessed a widespread increase of interest in network representation learning (NRL). By far most research efforts have focused on NRL for homogeneous networks like social networks where vertices are of the same type, or heterogeneous networks like knowledge graphs where vertices (and/or edges) are of…

Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade network…

Community detection or clustering is a fundamental task in the analysis of network data. Many real networks have a bipartite structure which makes community detection challenging. In this paper, we consider a model which allows for matched communities in the bipartite setting, in addition to node covariates with inform…

We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this method to define bisimplices, the cells of a class of regular CW complexes we call bisimplicial complexes. The 1-skeleta of bisimplices are complete bipartite graphs making them suitable in constr…

We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by over…