You are not logged in | Log in

Clustering properties of random intersection graphs

Speaker(s)
Mindaugas Bloznelis
Affiliation
Vilnius University
Date
April 18, 2013, 12:15 p.m.
Room
room 3180
Seminar
Seminar of Probability Group

In my talk I shall briefly introduce random intersection graphs. Then I shall discuss two questions: how the clustering coefficient is related to the vertex degree; how the clustering coefficient is related and to the size of the largest clique in random intersection graphs.