Nie jesteś zalogowany |
Clustering properties of random intersection graphs
- Prelegent(ci)
- Mindaugas Bloznelis
- Afiliacja
- Vilnius University
- Termin
- 18 kwietnia 2013 12:15
- Pokój
- p. 3180
- Seminarium
- Seminarium Zakładu Rachunku Prawdopodobieństwa
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.
