Change search
ReferencesLink to record
Permanent link

Direct link
Random intersection graphs with tunable degree distribution and clustering
Stockholm University, Faculty of Science, Department of Mathematics.
2009 (English)In: Probability in the engineering and informational sciences (Print), ISSN 0269-9648, E-ISSN 1469-8951, Vol. 23, no 4, 661-674 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2009. Vol. 23, no 4, 661-674 p.
National Category
URN: urn:nbn:se:su:diva-36101DOI: 10.1017/S0269964809990064ISI: 000269764600007OAI: diva2:288756
Available from: 2010-01-21 Created: 2010-01-21 Last updated: 2011-04-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Deijfen, Maria
By organisation
Department of Mathematics
In the same journal
Probability in the engineering and informational sciences (Print)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 12 hits
ReferencesLink to record
Permanent link

Direct link