Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient

摘要

Commonly used techniques for the random generation of graphs such as those of Erdos & Renyi and Barabasi & Albert have two disadvantages, namely their lack of bias with respect to history of the evolution of the graph, and their incapability to produce families of graphs with non-vanishing prescribed clustering coefficient. In this work we propose a model for the genesis of graphs that tackles these two issues. When translated into random generation procedures it generalizes the above mentioned procedures. When just seen as composition schemes for graphs they generalize the perfect elimination schemes of chordal graphs. The model itera-tively adds so-called contexts that introduce an explicit dependency to the previous evolution of the graph. Thereby they reflect a historical bias during this evolution that goes beyond the simple degree constraint of preference edge attachment. Fixing certain simple statical quantities during the genesis leads to families of random graphs with a clustering coefficient that can be bounded away from zero.