329 citations · 1.9k across the 63 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
cond-mat.dis-nn2002★ 80 cited
Higher order clustering coefficients in Barabasi-Albert networks
Agata Fronczak, Janusz A. Holyst, Maciej Jedynak +1
Higher order clustering coefficients are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours…
cond-mat.dis-nn2002★ 329 cited
Average path length in random networks
Agata Fronczak, Piotr Fronczak, Janusz A. Holyst
Analytic solution for the average path length in a large class of random graphs is found. We apply the approach to classical random graphs of Erdös and Rényi (ER) and to scale-free…