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

TL;DR

This paper derives the asymptotic degree-degree distribution in a sparse inhomogeneous power law random intersection graph, highlighting its relation to clustering and degree dependencies.

Contribution

It provides the first analytical characterization of degree-degree distribution in such graphs, linking it to clustering and power law features.

Findings

Asymptotic degree-degree distribution derived for the model

Shows relation between degree dependencies and clustering

Highlights power law behavior in the degree distribution

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.