• search hit 39 of 111
Back to Result List

Component evolution in random intersection graphs

Please always quote using this URN:urn:nbn:de:0296-matheon-2469
  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Michael Behrisch
URN:urn:nbn:de:0296-matheon-2469
Referee:Hans Jürgen Prömel
Document Type:Preprint, Research Center Matheon
Language:English
Date of first Publication:2005/05/14
Release Date:2005/07/04
Institute:Humboldt-Universität zu Berlin
Preprint Number:249
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.