82 citations · 146 across the 19 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2018
Correlation between clustering and degree in affiliation networks
Mindaugas Bloznelis, Justinas Petuchovas
We are interested in the probability that two randomly selected neighbors of a random vertex of degree (at least) are adjacent. We evaluate this probability for a power law ran…
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…