82 citations · 146 across the 19 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.PR2013★ 82 cited
Degree and clustering coefficient in sparse random intersection graphs
Mindaugas Bloznelis
We establish asymptotic vertex degree distribution and examine its relation to the clustering coefficient in two popular random intersection graph models of Godehardt and Jaworski…
math.CO2013
Large cliques in sparse random intersection graphs
Mindaugas Bloznelis, Valentas Kurauskas
Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_…
math.PR2013
Random intersection graph process
Mindaugas Bloznelis, Michal Karonski
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clu…