Network Null Model based on Maximal Entropy and the Rich-Club

TL;DR

This paper introduces a maximum entropy-based null model for networks that preserves rich-club and degree sequence constraints, accurately capturing network assortativity.

Contribution

The authors develop a novel null model combining maximum entropy with rich-club and degree constraints, improving network property approximation.

Findings

The null model effectively reproduces the network's assortative properties.

The probability of link sharing between nodes is described by a simple function.

The model closely matches the original network's structural features.

Abstract

We present a method to construct a network null-model based on the maximum entropy principle and where the restrictions that the rich-club and the degree sequence impose are conserved. We show that the probability that two nodes share a link can be described with a simple probability function. The null-model closely approximates the assortative properties of the network.