Mindaugas Bloznelis

activity

20102025

collaborators

Showing math.PRShow all

4 papers · 1 filter

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…

math.PR2023

Connectivity threshold for superpositions of Bernoulli random graphs. II

Mindaugas Bloznelis, Dominykas Marma, Rimantas Vaicekauskas

Let $G_{1}, \dots, G_{m}$ be independent Bernoulli random subgraphs of the complete graph $K_{n}$ having variable sizes $X_{1}, \dots, X_{m} \in {0, 1, 2, \dots}$ and densities $Q_1,\dots…

math.PR2010

The largest component in an inhomogeneous random intersection graph with clustering

Mindaugas Bloznelis

Given b>0, integers n, m=bn and a probability measure Q on {0, 1,..., m}, consider the random intersection graph on the vertex set [n]={1, ..., n}, where i and j are declared adjac…