Random intersection graphs are defined in terms of intersections of random sets. These intersections define the edges in the graph. These are applied to web server accesses for a number of users, allowing us to detect groups of users that are accessing more servers in common that would be expected under the random assumption. Methods for estimating the parameters of the graph and methods using graph invariants to learn about web usage will be discussed.