skip to content

Poisson approximation of the number of triangles in random intersection graphs

Presented by: 
D Stark [QMUL]
Wednesday 25th June 2008 - 11:40 to 12:20
Center for Mathematical Sciences

An intersection graph is constructed from a set of vertices and an auxiliary set of objects by assigning subsets of the objects to the vertices and connecting two vertices if their object sets are not disjoint. In a random intersection graph G(n,m,p) there are n vertices, m objects and each object is in the object set of each vertex independently and with probability p. We use Stein's method to approximate the distribution of triangles in G(n,m,p) by a Poisson distribution.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons