Configuration model

The configuration model is a widely used and versatile model for generating networks with a given degree sequence, or degree distribution. In particular, the erased version, where self-loops are removed and multiple edges between nodes are merged into one edge, is often as a null model for analysis of complex networks. I am mainly interested in analyzing the behavior of the number of removed edges in the erased configuration model and degree-degree correlations in the general model.

I am interested in the following research objectives:

• Prove a limit theorem for the number of removed edges in the erased configuration model
• Prove a limit theorem for degree-degree correlation measures in the general configuration model
• Understand the relation between the erased configuration model and the hypersoft configuration model ([pdf])

Related papers:

1. Limit theorems for assortativity and clustering in the configuration model with scale-free degrees [arxiv]
2. Typical distances in the directed configuration model [pdf] [arxiv]
3. Upper bounds for number of removed edges in the Erased Configuration Model [pdf] [arxiv]