Skip to main content


  • Maria Deijfen (a1) and Willemien Kets (a2)

A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this article a model is developed in which each vertex is given a random weight and vertices with larger weights are more likely to be assigned large subsets. The distribution of the degree of a given vertex is characterized and is shown to depend on the weight of the vertex. In particular, if the weight distribution is a power law, the degree distribution will be as well. Furthermore, an asymptotic expression for the clustering in the graph is derived. By tuning the parameters of the model, it is possible to generate a graph with arbitrary clustering, expected degree, and—in the power-law case—tail exponent.

Hide All
1.Bollobás, B., Janson, S. & Riordan, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures & Algorithms 31: 3122.
2.Britton, T., Deijfen, M., Lagerås, A. & Lindholm, M. (2008). Epidemics on random graphs with tunable clustering. Journal of Applied Probability 45: 743756.
3.Britton, T., Deijfen, M., & Martin-Löf, A. (2006). Generating simple random graphs with prescribed degree distribution. Journal of Statistical Physics 124: 13771397.
4.Chung, F. & Lu, L. (2002). Connected components in random graphs with given degree sequences. Annals of Combinatorics 6: 125145.
5.Chung, F. & Lu, L (2002). The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences, USA 99: 15,87915,882.
6.Deijfen, M., van den Esker, H., van den Hofstad, R., & Hooghiemstra, G. (2009). A preferential attachment model with random initial degrees. Arkiv för Matematik 47: 4172.
7.Dorogovtsev, S. & Mendes, J. (2003). Evolution of networks, from biological nets to the Internet and WWW. Oxford: Oxford University Press.
8.Fill, J., Scheinerman, E. & Singer-Cohen, K. (2000). Random intersection graphs when m = ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Structures & Algorithms 16: 156176.
9.Godehardt, E. & Jaworski, J. (2002). Two models of random intersection graphs for classification. In Schwaiger, M. & Opitz, O. (eds.) Exploratory data analysis in empirical research. New York: Springer, pp. 6781.
10.Jaworski, J., Karoński, M., & Stark, D. (2006). The degree of a typical vertex in generalized random intersection graph models. Discrete Mathematics 306: 21522165.
11.Karoński, M., Scheinerman, E., & Singer-Cohen, K. (1999). On random intersection graphs: The subgraphs problem. Combinatorics, Probability & Computing 8: 131159.
12.Molloy, M., & Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures & Algorithms 6: 161179.
13.Molloy, M., & Reed, B. (1998). The size of the giant component of a random graph with a given degree sequence. Combinatorics, Probability & Computing 7: 295305.
14.Newman, M. E. J. (2003). Properties of highly clustered networks. Physical Review E 68: 026121.
15.Newman, M. E. J. & Park, J. (2003). Why social networks are different from other types of networks. Physical Review E 68: 036122.
16.Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2002). Random graphs with arbitrary degree distributions and their applications. Physical Review E 64: 026118.
17.Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature 435: 814818.
18.Singer, K. (1995). Random intersection graphs, Ph.D. thesis, Johns Hopkins University. Baltimore, MD.
19.Stark, D. (2004). The vertex degree distribution of random intersection graphs. Random Structures & Algorithms 24: 249258.
20.Yao, X., Zhang, C., Chen, J., & Li, Y. (2005). On the scale-free intersection graphs. Lecture Notes in Computer Science No. 3481. Berlin: Springer, pp. 12171224.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Probability in the Engineering and Informational Sciences
  • ISSN: 0269-9648
  • EISSN: 1469-8951
  • URL: /core/journals/probability-in-the-engineering-and-informational-sciences
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 28 *
Loading metrics...

Abstract views

Total abstract views: 229 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 16th August 2018. This data will be updated every 24 hours.