82 citations · 146 across the 19 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.PR2019★ 2 cited
Clustering and percolation on superpositions of Bernoulli random graphs
Mindaugas Bloznelis, Lasse Leskelä
A simple but powerful network model with nodes and partly overlapping layers is generated as an overlay of independent random graphs with variable sizes and…
math.CO2019★ 1 cited
The cover time of a sparse random intersection graph
Mindaugas Bloznelis, Jerzy Jaworski, Katarzyna Rybarczyk
Many known networks have structure of affiliation networks, where each of network's nodes (actors) selects an attribute set from a given collection of attributes and two no…
math.PR2019
A note on the vertex degree distribution of random intersection graphs
Mindaugas Bloznelis
We establish the asymptotic degree distribution of the typical vertex of inhomogeneous and passive random intersection graphs under the minimal moment conditions.