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 条
  • [1] Bipartite graphs as models of complex networks
    Guillaume, Jean-Loup
    Latapy, Matthieu
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2006, 371 (02) : 795 - 813
  • [2] Internal links and pairs as a new tool for the analysis of bipartite complex networks
    Allali O.
    Tabourier L.
    Magnien C.
    Latapy M.
    Social Network Analysis and Mining, 2013, 3 (1) : 85 - 91
  • [3] Revealing intricate properties of communities in the bipartite structure of online social networks
    Tackx, Raphal
    Guillaume, Jean-Loup
    Tarissan, Fabien
    2015 IEEE 9TH INTERNATIONAL CONFERENCE ON RESEARCH CHALLENGES IN INFORMATION SCIENCE (RCIS), 2015, : 321 - 326
  • [4] Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
    Cheng, Eddie
    Hu, Philip
    Jia, Roger
    Liptak, Laszlo
    NETWORKS, 2012, 59 (04) : 349 - 356
  • [5] Bipartite and directed scale-free complex networks arising from zeta functions
    Tempesta, Piergiulio
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2014, 19 (07) : 2493 - 2504
  • [6] Building Smaller Sized Surrogate Models of Complex Bipartite Networks Based on Degree Distributions
    Le, Qize
    Panchal, Jitesh H.
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2012, 42 (05): : 1152 - 1166
  • [7] Optimal compression for bipartite networks
    Huang, Shuhong
    Wang, Xiangrong
    Peng, Liyang
    Xie, Jiarong
    Sun, Jiachen
    Hu, Yanqing
    CHAOS SOLITONS & FRACTALS, 2021, 151
  • [8] Balance in Signed Bipartite Networks
    Derr, Tyler
    Johnson, Cassidy
    Chang, Yi
    Tang, Jiliang
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 1221 - 1230
  • [9] Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph Discovery
    Lakhotia, Kartik
    Kannan, Rajgopal
    Prasanna, Viktor
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2023, 10 (02)
  • [10] Distributed edge coloration for bipartite networks
    Huang, Shing-Tsaan
    Tzeng, Chi-Hung
    DISTRIBUTED COMPUTING, 2009, 22 (01) : 3 - 14