SwePub
Sök i LIBRIS databas

  Extended search

L773:0269 8951
 

Search: L773:0269 8951 > Random intersection...

Random intersection graphs with tunable degree distribution and clustering

Deijfen, Maria, 1975- (author)
Stockholms universitet,Matematiska institutionen
Kets, Willemien (author)
 (creator_code:org_t)
2009
2009
English.
In: Probability in the engineering and informational sciences (Print). - 0269-9648 .- 1469-8951. ; 23:4, s. 661-674
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • 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.

Subject headings

NATURVETENSKAP  -- Matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics (hsv//eng)

Keyword

MATHEMATICS
MATEMATIK

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

Find more in SwePub

By the author/editor
Deijfen, Maria, ...
Kets, Willemien
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
Articles in the publication
Probability in t ...
By the university
Stockholm University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view