博文
二部分网络研究论文入选BioMedLib领域Top-10
|||
[1] Zhou T, Ren J, Medo M, Zhang YC: Bipartite network projection and personal recommendation. Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct;76(4 Pt 2):046115
Go to the article
[2] Wang RL, Tang Z, Cao QP: A hopfield network learning method for bipartite subgraph problem. IEEE Trans Neural Netw; 2004 Nov;15(6):1458-65
Go to the article
[3] Brynildsen MP, Tran LM, Liao JC: Versatility and connectivity efficiency of bipartite transcription networks. Biophys J; 2006 Oct 15;91(8):2749-59
Go to the article
[4] Lind PG, Gonz谩lez MC, Herrmann HJ: Cycles and cluste ring in bipartite networks. Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Nov;72(5 Pt 2):056127
Go to the article
[5] Burgos E, Ceva H, Hern谩ndez L, Perazzo RP, Devoto M, Medan D: Two classes of bipartite networks: nested biological and social systems. Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Oct;78(4 Pt 2):046113
Go to the article
[6] Barber MJ: Modularity and community detection in bipartite networks. Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Dec;76(6 Pt 2):066102
Go to the article
[7] Liu Q, Cao J: A recurrent neural network based on projection operator for extended general variational inequalities. IEEE Trans Syst Man Cybern B Cybern; 2010 Jun;40(3):928-38
Go to the article
[8] Wang J, Tang Z, Wang R: An annealed chaotic maximum neural network for bipartite subgraph problem. Int J Neural Syst; 2004 Apr;14(2):107-16
Go to the article
[9] Lambiotte R, Ausloos M: Uncovering collective listening habits and music genres in bipartite networks. Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Dec;72(6 Pt 2):066107
Go to the article
[10] Chakraborty A, Manna SS: Weighted trade network in a model of preferential bipartite transactions. Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Jan;81(1 Pt 2):016111
Go to the article
One-mode projecting is extensively used to compress bipartite networks. Since one-mode projection
is always less informative than the bipartite representation, a proper weighting method is required
to better retain the original information. In this article, inspired by the network-based ...
被引用次数：112 - 相关文章 - 所有 12 个版本
Abstract. In this paper, we study network ow algorithms for bipartite networks. A network G =
(V;E) is called bipartite if its vertex set V can be partitioned into two subsets V1 and V2 such that
all edges have one endpoint in V1 and the other in V2. Let n = jVj, n1 = jV1j, n2 = jV2j, m ...
被引用次数：97 - 相关文章 - HTML 版 - 所有 14 个版本
Modularity is one of the most prominent properties of real-world complex networks. Here, we
address the issue of module identification in two important classes of networks: bipartite networks
and directed unipartite networks. Nodes in bipartite networks are divided into two ...
被引用次数：71 - 相关文章 - 所有 21 个版本
We investigate the clustering coefficient in bipartite networks where cycles of size three are absent
and therefore the standard definition of clustering coefficient cannot be used. Instead, we use
another coefficient given by the fraction of cycles with size four, showing that both ...
被引用次数：59 - 相关文章 - 所有 19 个版本
The modularity of a network quantifies the extent, relative to a null model network, to which vertices
cluster into community groups. We define a null model appropriate for bipartite networks, and
use it to define a bipartite modularity. The bipartite modularity is presented in terms of a ...
被引用次数：61 - 相关文章 - 所有 8 个版本
In this paper, we analyze web-downloaded data on people sharing their music library, that we
use as their individual musical signatures. The system is represented by a bipartite network,
nodes being the music groups and the listeners. Music groups' audience size behaves ...
被引用次数：54 - 相关文章 - 所有 13 个版本
We will not describe how to construct a layered graph and update the flow, but it is well known
[E] that both those operations can be done in time linear in the number of edges in the
graph. In G(F) the nodes are partitioned into layers which are ordered so that edges only ...
被引用次数：52 - 相关文章 - 所有 6 个版本
... 8 MAXIMUM FLOWS: ADDITIONAL TOPICS, 250 8.1 Introduction, 250 8.2 Flows in Unit Capacity
Networks, 252 8.3 Flows in Bipartite Networks, 255 8.4 Flows in Planar Undirected Networks,
260 8.5 Dynamic Tree Implementations, 265 vi Contents Page 4. ...
被引用次数：6729 - 相关文章 - HTML 版 - 所有 14 个版本
... Fortunately, for many biological systems partial prior knowledge about the connectivity patterns
of the bipartite networks is beginning to become available via high-throughput experiments (7)
or data mining of interaction knowledge (8–10), even though the detailed mechanisms ...
被引用次数：292 - 相关文章 - 所有 25 个版本
It appeared recently that the classical random graph model used to represent real-world complex
networks does not capture their main properties. Since then, various attempts have been made
to provide accurate models. We study here a model which achieves the following ...
被引用次数：35 - 相关文章 - 所有 3 个版本
https://m.sciencenet.cn/blog-3075-429799.html
上一篇：入选《新物理学》2010年最佳论文
下一篇：复杂性科学专栏三篇论文及评述
