pith. sign in

arxiv: 1105.3347 · v1 · pith:C5TTOXBMnew · submitted 2011-05-17 · ⚛️ physics.soc-ph · cs.SI

Generating Scale-free Networks with Adjustable Clustering Coefficient Via Random Walks

classification ⚛️ physics.soc-ph cs.SI
keywords clusteringadjustablealgorithmcoefficientgeneratingnetworksrandomscale-free
0
0 comments X
read the original abstract

This paper presents an algorithm for generating scale-free networks with adjustable clustering coefficient. The algorithm is based on a random walk procedure combined with a triangle generation scheme which takes into account genetic factors; this way, preferential attachment and clustering control are implemented using only local information. Simulations are presented which support the validity of the scheme, characterizing its tuning capabilities.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.