Degree-degree distribution in a power law random intersection graph with clustering

Abstract: The bivariate distribution of degrees of adjacent vertices (degree-degree distribution) is an important network characteristic defining the statistical dependencies between degrees of adjacent vertices. We show the asymptotic degree-degree distribution of a sparse inhomogeneous random intersection graph and discuss its relation to the clustering and power law properties of the graph.