29 citations · 82 across the 23 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2017★ 1 cited
Moment-based parameter estimation in binomial random intersection graph models
Joona Karjalainen, Lasse Leskelä
Binomial random intersection graphs can be used as parsimonious statistical models of large and sparse networks, with one parameter for the average degree and another for transitiv…
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…
cs.SI2015
The impact of degree variability on connectivity properties of large networks
Lasse Leskelä, Hoa Ngo
The goal of is to study how increased variability in the degree distribution impacts the global connectivity properties of a large network. We approach this question by modeling th…