Component evolution in random intersection graphs (Q870077): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 15:26, 30 January 2024

scientific article
Language Label Description Also known as
English
Component evolution in random intersection graphs
scientific article

    Statements

    Component evolution in random intersection graphs (English)
    0 references
    0 references
    12 March 2007
    0 references
    Summary: We study the evolution of the order of the largest component in the random intersection graph model which reflects some clustering properties of real-world networks. We show that for appropriate choice of the parameters random intersection graphs differ from \(G_{n,p}\) in that neither the so-called giant component, appearing when the expected vertex degree gets larger than one, has linear order nor is the second largest of logarithmic order. We also describe a test of our result on a protein similarity network.
    0 references
    clustering
    0 references
    giant component
    0 references

    Identifiers