82 citations · 146 across the 19 of their papers we have counts for
26 papers
On the strength of connectedness of unions of random graphs
Mindaugas Bloznelis
Let be independent identically distributed random subgraphs of the complete graph . We analyse the threshold behaviour of the strength of connectedness…
k-connectivity threshold for superpositions of Bernoulli random graphs
Daumilas Ardickas, Mindaugas Bloznelis, Rimantas Vaicekauskas
Let be independent identically distributed Bernoulli random subgraphs of the complete graph having vertex sets of random sizes $X_1,\dots, X_m\in \{0,…
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…
Connectivity threshold for superpositions of Bernoulli random graphs. II
Mindaugas Bloznelis, Dominykas Marma, Rimantas Vaicekauskas
Let be independent Bernoulli random subgraphs of the complete graph having variable sizes and densities $Q_1,\dots…
Connectivity threshold for superpositions of Bernoulli random graphs
Daumilas Ardickas, Mindaugas Bloznelis
Let be independent Bernoulli random subgraphs of the complete graph having variable sizes and densities $q_1,\dots, q_m\in [0,…
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs
Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä
The clustering property of complex networks indicates the abundance of small dense subgraphs in otherwise sparse networks. For a community-affiliation network defined by a superpos…