M. Bloznelis

activity

20242026

collaborators

3 papers

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.PR2025

k-connectivity threshold for superpositions of Bernoulli random graphs

Daumilas Ardickas, Mindaugas Bloznelis, Rimantas Vaicekauskas

Let $G_{1}, \dots, G_{m}$ be independent identically distributed Bernoulli random subgraphs of the complete graph $K_{n}$ having vertex sets of random sizes $X_1,\dots, X_m\in \{0,…

math.PR2024

Two models of sparse and clustered dynamic networks

Mindaugas Bloznelis, Dominykas Marma

We present two models of sparse dynamic networks that display transitivity - the tendency for vertices sharing a common neighbour to be neighbours of one another. Our first network…