Random intersection graph process

2013/01/23 by Bloznelis, Mindaugas, Karonski, Michal
#05C07 #05C80 #05C82 #Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR) #Statistics Theory (math.ST)

paper · doi:10.48550/arxiv.1301.5579

Abstract

We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients.

Related

• Correlation between clustering and degree in affiliation networks
• Degree-degree distribution in a power law random intersection graph with clustering
• Dynamic random intersection graph: Dynamic local convergence and giant structure
• Clustering coefficient of random intersection graphs with infinite degree variance
• The cover time of a sparse random intersection graph