45 citations · 46 across the 4 of their papers we have counts for
4 papers
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…
Assortativity and clustering of sparse random intersection graphs
Mindaugas Bloznelis, Jerzy Jaworski, Valentas Kurauskas
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptoti…
Birth of a strongly connected giant in an inhomogeneous random digraph
M. Bloznelis, F. Götze, J. Jaworski
We present and investigate a general model for inhomogeneous random digraphs with labeled vertices, where the arcs are generated independently, and the probability of inserting an…
A new random mapping model
Jennie C. Hansen, Jerzy Jaworski
We introduce a new random mapping model, , which maps the set into itself.The random mapping is constructed using a collection of excha…