The largest component in an inhomogeneous random intersection graph with clustering

zbMATH Open1193.05144arXiv1002.4649MaRDI QIDQ986718FDOQ986718

Authors: Mindaugas Bloznelis 

Publication date: 12 August 2010

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

Abstract: Given b>0, integers n, m=bn and a probability measure Q on {0, 1,..., m}, consider the random intersection graph on the vertex set [n]={1, ..., n}, where i and j are declared adjacent whenever S(i) and S(j) intersect. Here S(1), ..., S(n) denote iid random subsets of [m] such that P(|S(i)|=k)=Q(k). For sparse random intersection graphs we establish a first order asymptotic for the order of the largest connected component N=n(1-Q(0))g+o(n) in probability. Here g is an average of nonextinction probabilities of a related multi-type Poisson branching process.

Full work available at URL: https://arxiv.org/abs/1002.4649

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

Recommendations

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cited In (10)

• On local weak limit and subgraph counts for sparse random graphs
• Degree distribution of an inhomogeneous random intersection graph
• Phase transition in random intersection graphs with communities
• Degree and clustering coefficient in sparse random intersection graphs
• Central limit theorem for the largest component of random intersection graph
• Clustering Coefficients of Random Intersection Graphs
• A note on the component structure in random intersection graphs with tunable clustering
• Component evolution in general random intersection graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Clustering and percolation on superpositions of Bernoulli random graphs

This page was built for publication: The largest component in an inhomogeneous random intersection graph with clustering

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