Many social networks in our daily life are bipartite networks that are built on reciprocity. How can we recommend users/friends to a user, so that the user is interested in and attractive to recommended users? In this research, we propose a new collaborative filtering model to improve user recommendations in reciprocal and bipartite social networks. The model considers a user’s “taste” in picki...

In this work we present a dynamical model that succesfully describes the organization of mutualistic ecological systems. The main characteristic of these systems is the nested structure of the bipartite adjacency matrix describing their interactions. We introduce a nestedness coefficient, as an alternative to the Atmar and Patterson temperature, commonly used to measure the nestedness degree of...

It is important to cluster heterogeneous information networks. A fast clustering algorithm based on an approximate commute time embedding for heterogeneous information networks with a star network schema is proposed in this paper by utilizing the sparsity of heterogeneous information networks. First, a heterogeneous information network is transformed into multiple compatible bipartite graphs fr...

We consider the idea of using a centralized controller to schedule network traffic within a datacenter and implement an algorithm that edge-colors bipartite multigraphs to select the paths that packets should take through the network. We implement three different data structures to represent the bipartite graphs: a matrix data structure, an adjacency list data structure, and an adjacency list d...

This study aims to understand how inherent ecological network structures of nestedness and modularity vary over large geographic scales with implications for community stability. Bipartite networks from previous research from 68 locations globally were analyzed. Using a meta-analysis approach, we examine relationships between the structure of 22 trophic and 46 mutualistic bipartite networks in ...

Using a model of wealth distribution where traders are characterized by quenched random saving propensities and trade among themselves by bipartite transactions, we mimic the enhanced rates of trading of the rich by introducing the preferential selection rule using a pair of continuously tunable parameters. The bipartite trading defines a growing trade network of traders linked by their mutual ...

This paper presents the first sublinear-time deterministic parallel algorithms fix bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to...

OBJECTIVE Several studies have shown how sets of single-nucleotide polymorphisms (SNPs) can help to classify subjects on the basis of their continental origins, with applications to case-control studies and population genetics. However, most of these studies use dimensionality-reduction methods, such as principal component analysis, or clustering methods that result in unipartite (either subjec...