Physica A: Statistical Mechanics and its Applications
Bipartite graphs as models of complex networks
Introduction
It has been shown recently that most real-world complex networks have some specific properties in common. These properties are not captured by the model generally used before this discovery, although they play a central role in many contexts like the robustness of the Internet [1], [2], [3], [4], [5], the spread of viruses or rumors over the Internet, the Web or other social networks [6], [7], [8], the performance of protocols and algorithms [9], [10], [11], and many others.
This is why a strong effort has been put in the realistic modeling of complex networks in the last few years, and much progress has been accomplished in this field. Some models achieve the aim of producing graphs which capture some, but not all of the main properties of real-world complex networks. Some models obtain all the wanted properties but rely on artificial methods which give unrealistic graphs (trees, graphs with uniform degrees, etc.). Others rely on construction processes which may induce some hidden properties, or are too difficult to analyze.
In this paper, we propose the random bipartite graph model as a general model for complex networks. We will show that this model produces graphs with many observed properties. It relies on real-world observations and gives realistic graphs. Finally, it is simple enough to make it possible to prove its main properties. We will also discuss some identified drawbacks of this model.
We will first present an overview of the context in which our work lies. In particular, we use some ideas introduced in previous papers, which we need to describe precisely. Then we show how all complex networks may be described as bipartite structures. After this, we present the random bipartite model and analyze it to show that the main properties of complex networks are somehow a consequence of their underlying bipartite structure. We also present a growing bipartite model based on the same ideas. Finally, we discuss the advantages and limitations of these models.
Section snippets
Context
Throughout our presentation, we will use a representative set of complex networks which have received much attention and span quite well the variety of contexts in which complex networks appear: an Internet graph at router level [12], [13], [14] consisting of physical links between routers; a web graph from Notre Dame university [15], [16] where web pages are linked by hyperlinks; a co-occurrence graph in which words are linked if they belong to a same sentence in a given text [17], [18]; the
Complex networks as bipartite graphs
A bipartite graph is a triple where and are two disjoint sets of vertices, respectively, the top and bottom vertices, and is the set of edges. The difference with classical graphs lies in the fact that edges exist only between top vertices and bottom vertices.
Two degree distributions can naturally be associated with such a graph, namely the top degree distribution: and the bottom degree distribution: . These two distributions play a
The bipartite models
Our aim is now to use the new general property of real-world complex networks discovered in the previous section, namely their underlying bipartite structure, as a way to propose a model which captures the main wanted properties.
As discussed in the first section of this paper, there are basically two ways to achieve this goal. First, we may try to sample random bipartite graphs with prescribed (top and bottom) degree distributions. Second, we may try to propose a construction process similar to
Analysis of the models
Our aim in this section is to give formal proofs for the main properties of the -projection of a random bipartite graph with prescribed degree distributions. Some of these properties, and others, have been studied independently in Refs. [24], [35] with different techniques and a different point of view. We however believe that our proofs give new insight on these properties, therefore, we give them below. In particular, our proof techniques may be considered as more mathematically rigorous.
Experimental results
The formal results of the previous section give a precise intuition on how the random bipartite graph model with prescribed degree distributions behaves. We can also check its properties experimentally by generating graphs using this model and the same parameters as the ones measured on real-world complex networks. This is what we do in this section with our six examples, for the purely random bipartite model as well as for the one with preferential attachment.
More precisely, the networks are
Conclusion and discussion
In this paper, we propose bipartite graphs as a general tool for the modeling of real-world complex networks. They make it possible to achieve the following challenges:
the obtained networks have the three main wanted properties (logarithmic average distance, high clustering and power law degree distribution);
the models are based on a realistic construction process representative of what happens in some real-world cases, and
their definitions are simple enough to make it possible to give some
Acknowledgments
We thank Annick Lesne, Clémence Magnien and James Martin for careful reading of preliminary versions and useful comments. We also thank the anonymous referees for helpful comments.
References (70)
- et al.
Metric structure of random networks
Nucl. Phys. B
(2003) - et al.
The asymptotic number of labeled graphs with given degree sequences
J. Combin. Theory Ser. A
(1978) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
Eur. J. Combin.
(1980)- et al.
Deterministic scale-free networks
Physica A
(2001) - et al.
Bipartite structure of all complex networks
Inf. Process. Lett. (IPL)
(2004) Contentment in graph theory: covering graphs with cliques
Indigationes Math.
(1977)- et al.
Error and attack tolerance in complex networks
Nature
(2000) - et al.
Network robustness and fragility: percolation on random graphs
Phys. Rev. Lett.
(2000) - et al.
Resilience of the internet to random breakdown
Phys. Rev. Lett.
(2000) - et al.
Breakdown of the internet under intentional attack
Phys. Rev. Lett.
(2001)
Cascade-based attacks on complex networks
Phys. Rev. E
Epidemics and percolation in small-worlds networks
Phys. Rev. E
The spread of epidemic disease on networks
Phys. Rev. E
Epidemic spreading in scale-free networks
Phys. Rev. Lett.
Path finding strategies in scale-free networks
Phys. Rev. E
Diameter of the world wide web
Nature
The small-world of human language
Collective dynamics of small-world networks
Nature
Scientific collaboration networks: I. Network construction and fundamental results
Phys. Rev. E
Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality
Phys. Rev. E
Random graph models of social networks
Proc. Natl. Acad. Sci. USA
The large-scale organization of metabolic networks
Nature
Statistical mechanics of complex networks
Rev. Mod. Phys.
Evolution of networks
Adv. Phys.
The structure and function of complex networks
SIAM Rev.
The small world problem
Psychol. Today
Cited by (193)
A Laplacian regularized graph neural network for predictive modeling of multiple chronic conditions
2024, Computer Methods and Programs in BiomedicineEpidemic spreading on higher-order networks
2024, Physics ReportsCLBP Texture Descriptor in Multipartite Complex Network Configuration for Music Genre Classification
2023, Procedia Computer ScienceCentralized and decentralized algorithms for two-to-one matching problem in ridehailing systems
2023, EURO Journal on Transportation and LogisticsBipartite network embedding with Symmetric Neighborhood Convolution
2022, Expert Systems with ApplicationsOn local weak limit and subgraph counts for sparse random graphs
2022, Journal of Applied Probability