M. Bloznelis

activity

20092026

most citedDegree and clustering coefficient in sparse random intersection graphs

82 citations · 146 across the 19 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

On the strength of connectedness of unions of random graphs

Mindaugas Bloznelis

Let $G_{1}, \dots, G_{m}$ be independent identically distributed random subgraphs of the complete graph $K_{n}$ . We analyse the threshold behaviour of the strength of connectedness…

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 $n$ network's nodes (actors) selects an attribute set from a given collection of $m$ attributes and two no…

math.CO2013

Large cliques in sparse random intersection graphs

Mindaugas Bloznelis, Valentas Kurauskas

Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_…