On computation of clustering coefficient in a class of random networks
Statistics Theory
2012-09-03 v1 Statistics Theory
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.
Keywords
Cite
@article{arxiv.1208.6581,
title = {On computation of clustering coefficient in a class of random networks},
author = {Michal Demetrian and Martin Nehez},
journal= {arXiv preprint arXiv:1208.6581},
year = {2012}
}