Component evolution in random intersection graphs

zbMATH Open1114.05093MaRDI QIDQ870077FDOQ870077

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

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)

Cited In (20)

• The number of triangles in random intersection graphs
• Degree distribution of an inhomogeneous random intersection graph
• Efficiently covering complex networks with cliques of similar vertices
• Title not available (Why is that?)
• Poisson Approximation of the Number of Cliques in Random Intersection Graphs
• Central limit theorem for the largest component of random intersection graph
• Constructions of independent sets in random intersection graphs
• Component evolution in a secure wireless sensor network
• Random subcube intersection graphs. I: Cliques and covering
• Evolution of high-order connected components in random hypergraphs
• An elementary approach to component sizes in critical random graphs
• The structure of an evolving random bipartite graph
• Epidemics on Random Graphs with Tunable Clustering
• Building a random network with a given expected giant component
• Size of the largest component in a critical graph
• Collapse of random triangular groups: a closer look
• The largest component in critical random intersection graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• The chromatic number of random intersection graphs
• On the isolated vertices and connectivity in random intersection graphs

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)