On computation of clustering coefficient in a class of random networks
classification
🧮 math.ST
stat.TH
keywords
networksadditionalclusteringcoefficientmetricrandomstructuresbackground
read the original abstract
The random networks enriched with additional structures as metric and group-symmetry in background metric space are investigated. The important quantities like he clustering coefficient as well as the mean degree of separation in such networks are effectively computed with help of additional structures. Representative models are discussed in details.
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.