Related Experiment Video
Updated: Jan 19, 2026

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
Published on: October 19, 2021
Scaling exponents and clustering coefficients of a growing random network
1Max-Planck-Institute of Colloids and Interfaces, Potsdam 14424, Germany.
Abstract:
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidding self-connection and multiple links of the same direction between any two nodes. Scaling exponents in the range of 1-2 are obtained through Monte Carlo simulations and various clustering coefficients are calculated, one of which, C(out), is of the order of 10(-1), indicating that the network resembles a small world. The out-degree distribution has an exponential cutoff for large out degree.
More Related Videos
09:49Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
Published on: September 25, 2021
12:27Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
Related Concept Videos
Exponential Growth
Exponents
Exponential Equations with Logarithms: Problem Solving
Exponential Equations for Modeling Growth
Population Growth
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...