# A model for generating tunable clustering coefficients independent of the number of nodes in scale free and random networks

Source: [A model for generating tunable clustering coefficients independent of the number of nodes in scale free and random networks](<https://www.sota2.com/research/paper/68fa2ccf1e209131ce8538fd>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T15:35:06.429Z

Authors: Vijay K Samalam

Published: 2013-11-25T18:41:15.000Z

## Abstract

Probabilistic networks display a wide range of high average clustering coefficients independent of the number of nodes in the network. In particular, the local clustering coefficient decreases with the degree of the subtending node in a complicated manner not explained by any current models. While a number of hypotheses have been proposed to explain some of these observed properties, there are no solvable models that explain them all. We propose a novel growth model for both random and scale free networks that is capable of predicting both tunable clustering coefficients independent of the network size, and the inverse relationship between the local clustering coefficient and node degree observed in most networks.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1311.6401>)

[PDF](<https://arxiv.org/pdf/1311.6401.pdf>)
