Go to DBLP homepageSelected Combinatorial Problems Through the Prism of Random Intersection Graphs Models
Abstract: We discuss a simple, yet general family of models, namely Random Intersection Graphs (RIGs), initially introduced by Karoński et al. [4] and Singer-Cohen [10]. In such models there is a universe \(\mathcal{M}\) of labels and each one of n vertices selects a random subset of \(\mathcal{M}\). Two vertices are connected if and only if their corresponding subsets of labels intersect. A formal definition is given below:
Loading