Daumilas Ardickas

collaborators

2 papers

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

Connectivity threshold for superpositions of Bernoulli random graphs

Daumilas Ardickas, Mindaugas Bloznelis

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 [n]$ and densities $q_1,\dots, q_m\in [0,…