82 citations · 146 across the 19 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.SI2016★ 2 cited
Diclique clustering in a directed random graph
Mindaugas Bloznelis, Lasse Leskelä
We discuss a notion of clustering for directed graphs, which describes how likely two followers of a node are to follow a common target. The associated network motifs, called dicli…
physics.soc-ph2016
Clustering coefficient of random intersection graphs with infinite degree variance
Mindaugas Bloznelis, Valentas Kurauskas
For a random intersection graph with a power law degree sequence having a finite mean and an infinite variance we show that the global clustering coefficient admits a tunable asymp…