Bipartite structure of all complex networks

被引:149
作者
Guillaume, JL [1 ]
Latapy, M [1 ]
机构
[1] Univ Paris 07, CNRS, LIAFA, F-75005 Paris, France
关键词
graphs; interconnection networks; modelling; bipartite graphs;
D O I
10.1016/j.ipl.2004.03.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The analysis and modelling of various complex networks has received much attention in the last few years. Some such networks display a natural bipartite structure: two kinds of nodes coexist with links only between nodes of different kinds. This bipartite structure has not been deeply studied until now, mainly because it appeared to be specific to only a few complex networks. However, we show here that all complex networks can be viewed as bipartite structures sharing some important statistics, like degree distributions. The basic properties of complex networks can be viewed as consequences of this underlying bipartite structure. This leads us to propose the first simple and intuitive model for complex networks which captures the main properties met in practice. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:215 / 221
页数:7
相关论文
共 50 条
[31]   Recognizing the P4-structure of bipartite graphs [J].
Babel, L ;
Brandstädt, A ;
Le, VB .
DISCRETE APPLIED MATHEMATICS, 1999, 93 (2-3) :157-168
[32]   L-BGNN: Layerwise Trained Bipartite Graph Neural Networks [J].
Xie, Tian ;
He, Chaoyang ;
Ren, Xiang ;
Shahabi, Cyrus ;
Kuo, C. -C. Jay .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (12) :10711-10723
[33]   BAYESIAN LATENT FEATURE MODELING FOR MODELING BIPARTITE NETWORKS WITH OVERLAPPING GROUPS [J].
Jorgensen, Philip H. ;
Morup, Morten ;
Schmidt, Mikkel N. ;
Herlau, Tue .
2016 IEEE 26TH INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING (MLSP), 2016,
[34]   Bipartite Consensus for Multi-agent Systems on Directed Signed Networks [J].
Hu, Jiangping ;
Zheng, Wei Xing .
2013 IEEE 52ND ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2013, :3451-3456
[35]   Heat conduction information filtering via local information of bipartite networks [J].
Guo, Q. ;
Leng, R. ;
Shi, K. ;
Liu, J. G. .
EUROPEAN PHYSICAL JOURNAL B, 2012, 85 (08)
[36]   Evolving Bipartite Model Reveals the Bounded Weights in Mobile Social Networks [J].
Liu, Jiaqi ;
Deng, Cheng ;
Fu, Luoyi ;
Long, Huan ;
Gan, Xiaoying ;
Wang, Xinbing ;
Chen, Guihai ;
Xu, Jun .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2022, 21 (03) :971-985
[37]   On the construction of all shortest node-disjoint paths in star networks [J].
Lai, Cheng-Nan .
INFORMATION PROCESSING LETTERS, 2016, 116 (04) :299-303
[38]   Symmetry in Complex Networks [J].
Garrido, Angel .
SYMMETRY-BASEL, 2011, 3 (01) :1-15
[39]   Empirical analysis of web-based user-object bipartite networks [J].
Shang, Ming-Sheng ;
Lue, Linyuan ;
Zhang, Yi-Cheng ;
Zhou, Tao .
EPL, 2010, 90 (04)
[40]   A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks [J].
Tzeng, Chi-Hung ;
Jiang, Jehn-Ruey ;
Huang, Shing-Tsaan .
INFORMATION PROCESSING LETTERS, 2009, 109 (10) :518-522