Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A model for generating tunable clustering coefficients independent of the number of nodes in scale free and random networks (1311.6401v1)

Published 25 Nov 2013 in physics.soc-ph and cs.SI

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (1)
  1. Vijay K Samalam (2 papers)
Citations (1)

Summary

We haven't generated a summary for this paper yet.