Bipartite Graphs as Models of Complex Networks
We propose here the first model which achieves the following challenges: it produces graphs which have the three main wanted properties (clustering, degree distribution, average distance), it is based on some real-world observations, and it is sufficiently simple to make it possible to prove its main properties. This model consists in sampling a random bipartite graph with prescribed degree distribution. Indeed, we show that any can be viewed as a bipartite graph with some specific characteristics, and that its main properties can be viewed as consequences of this underlying structure.
Unable to display preview. Download preview PDF.
- 1.Abello, J., Pardalos, P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: External Memory Algorithms. AMS-DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50 (1999)Google Scholar
- 4.Source code for the random bipartite graph generator, http://www.liafa.jussieu.fr/~guillaume/programs/
- 6.Ferrer, R., Solé, R.V.: The small-world of human language. Proceedings of the Royal Society of London B268, 2261–2265 (2001)Google Scholar
- 8.Govindan, R., Tangmunarunkit, H.: Heuristics for internet map discovery. In: IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, pp. 1371–1380. IEEE, Los Alamitos (2000)Google Scholar
- 10.Lu, L.: The diameter of random massive graphs. In: ACM-SIAM (ed.) 12th Ann. Symp. on Discrete Algorithms (SODA), pp. 912–921 (2001)Google Scholar
- 12.Newman, M.E.J.: Scientific collaboration networks: I. Network construction and fundamental results. Phys. Rev. E 64 (2001)Google Scholar
- 16.Bible Today New International Version, http://www.tniv.info/bible/