In the case of hierarchical networks, clustering as a function of node degree also follows a power-law, C ( k ) = k − 1 . {\displaystyle C(k)=k^{-1}.\,} This result was obtained analytically by Dorogovtsev, Goltsev and Mendes.
U slučaju hijerarhijskih mreža, grupisanje u funkciji stepena čvora takođe prati power-law C ( k ) = k − 1 . {\displaystyle C(k)=k^{-1}.\,} Ovo rezultat su analitički dobili Dorogovtsev, Goltsev i Mendes.