Results 1  10
of
778
BIPARTITE NETWORKS
, 2008
"... Collections of journal papers, often referred to as ’citation networks’, can be modeled as a collection of coupled bipartite networks which tend to exhibit linear growth and preferential attachment as papers are added to the collection. Assuming primary nodes in the first partition and secondary nod ..."
Abstract
 Add to MetaCart
Collections of journal papers, often referred to as ’citation networks’, can be modeled as a collection of coupled bipartite networks which tend to exhibit linear growth and preferential attachment as papers are added to the collection. Assuming primary nodes in the first partition and secondary
Searching for Communities in Bipartite Networks
, 803
"... Abstract. Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman’s modularity measure. A specialized version of t ..."
Abstract
 Add to MetaCart
Abstract. Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman’s modularity measure. A specialized version
On the Resilience of Bipartite Networks
, 2013
"... Motivated by problems modeling the spread of infections in networks, in this paper we explore which bipartite graphs are most resilient to widespread infections under various parameter settings. Namely, we study bipartite networks with a requirement of a minimum degree d on one side under an indep ..."
Abstract
 Add to MetaCart
Motivated by problems modeling the spread of infections in networks, in this paper we explore which bipartite graphs are most resilient to widespread infections under various parameter settings. Namely, we study bipartite networks with a requirement of a minimum degree d on one side under
Competition for popularity in bipartite networks
"... We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its u ..."
Abstract
 Add to MetaCart
We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its
Improved Algorithms For Bipartite Network Flow
, 1994
"... In this paper, we study network flow algorithms for bipartite networks. A network G = (V; E) is called bipartite if its vertex set V can be partitioned into two subsets V 1 and V 2 such that all edges have one endpoint in V 1 and the other in V 2 . Let n = jV j, n 1 = jV 1 j, n 2 = jV 2 j, m = jE ..."
Abstract

Cited by 46 (4 self)
 Add to MetaCart
In this paper, we study network flow algorithms for bipartite networks. A network G = (V; E) is called bipartite if its vertex set V can be partitioned into two subsets V 1 and V 2 such that all edges have one endpoint in V 1 and the other in V 2 . Let n = jV j, n 1 = jV 1 j, n 2 = jV 2 j, m = j
Matchings in Colored Bipartite Networks
, 2000
"... In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n − r) blue edges for specified 0 ≤ r ≤ n, is a nontrivial integer program. We present an alternative, logically simpler proof of a th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
theorem in [3] which establishes necessary and sufficient conditions for the existance of a solution matching and a new O(n 2.5) algorithm. This shows that the problem of finding an assignment of specified cost r in an assignment problem on the complete bipartite graph with a 0−1 cost matrix
Rationing Problems in Bipartite Networks
"... The standard theory of rationing problems is extended to the bipartite context. The focus is on consistency, a compelling rationality property of fair division methods in the standard setting. ..."
Abstract
 Add to MetaCart
The standard theory of rationing problems is extended to the bipartite context. The focus is on consistency, a compelling rationality property of fair division methods in the standard setting.
Overlapping Community Detection in Bipartite Networks
, 2008
"... Recent researches have discovered that rich interactions among entities in nature and society bring about complex networks with community structures. Although the investigation of the community structures has promoted the development of many successful algorithms, most of them only find separated c ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
overlapping communities in largescale sparse bipartite networks. It only depends on the network topology, and does not require any priori knowledge about the number or the original partition of the network. We apply the algorithm to realworld data from different domains, showing that BiTector can
Generalized Stable Matching in Bipartite Networks
, 2010
"... In this paper we study the generalized version of weighted matching in bipartite networks. Consider a weighted matching in a bipartite network in which the nodes derive value from the split of the matching edge assigned to them if they are matched. The value a node derives from the split depends bot ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we study the generalized version of weighted matching in bipartite networks. Consider a weighted matching in a bipartite network in which the nodes derive value from the split of the matching edge assigned to them if they are matched. The value a node derives from the split depends
Modularity Density for Evaluating Community Structure in Bipartite Networks
, 2014
"... Girvan proposed a measurement called modularity to evaluate community structure in unipartite networks called modularity. Due to the success of modularity in unipartite networks, bipartite modularity is developed according to different understandings of community in bipartite networks which all co ..."
Abstract
 Add to MetaCart
Girvan proposed a measurement called modularity to evaluate community structure in unipartite networks called modularity. Due to the success of modularity in unipartite networks, bipartite modularity is developed according to different understandings of community in bipartite networks which all
Results 1  10
of
778