TY - GEN A1 - Behrisch, Michael T1 - Component evolution in random intersection graphs N2 - We study the evolution of the size of the largest and the second largest component in the random intersection graph model which is suited to re ect the transitivity (or clustering property) visible in real-world networks. We show that certain random intersection graphs differ from Gn;p in that they have only a polynomial jump in the evolution of the size of the largest component. On the other hand the moment for the jump is still at the point where the expected vertex degree becomes 1 which is similar to Gn;p. We also describe a test of our result on a protein network. Y1 - 2005 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/246 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-2469 ER -