Component evolution in random intersection graphs

MaRDI QIDQ870077zbMATH OpenFDO

Authors Michael Behrisch

Publication date 12 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127570, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r17.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

clusteringgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Review text

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.

Recommendations

• Component evolution in general random intersection graphs
• Component evolution in general random intersection graphs
• A note on the component structure in random intersection graphs with tunable clustering
• The largest component in critical random intersection graphs
• Central limit theorem for the largest component of random intersection graph

Cited in

(28)

• A note on the component structure in random intersection graphs with tunable clustering
• The largest component in critical random intersection graphs
• Central limit theorem for the largest component of random intersection graph
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Size of the largest component in a critical graph
• Efficiently covering complex networks with cliques of similar vertices
• Constructions of independent sets in random intersection graphs
• The structure of an evolving random bipartite graph
• Component evolution in general random intersection graphs
• Random subcube intersection graphs. I: Cliques and covering
• Evolution of high-order connected components in random hypergraphs
• Epidemics on Random Graphs with Tunable Clustering
• Degree distribution of an inhomogeneous random intersection graph
• Poisson approximation of the number of cliques in random intersection graphs
• Random intersection graphs with communities
• An elementary approach to component sizes in critical random graphs
• Component evolution in a secure wireless sensor network
• The chromatic number of random intersection graphs
• Component evolution in general random intersection graphs
• On the isolated vertices and connectivity in random intersection graphs
• Collapse of random triangular groups: a closer look.
• Phase transition in random intersection graphs with communities
• The number of triangles in random intersection graphs
• scientific article; zbMATH DE number 7731163 (Why is no real title available?)
• Building a random network with a given expected giant component
• Large random intersection graphs inside the critical window and triangle counts
• Near-critical bipartite configuration models and their associated intersection graphs
• The largest component in an inhomogeneous random intersection graph with clustering

This page was built for publication: Component evolution in random intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870077)