Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations. - Mindaugas Bloznelis (Comb. Probab. Comput., 2005)

Component evolution in a secure wireless sensor network. - Mindaugas Bloznelis; Jerzy Jaworski; Katarzyna Rybarczyk (Networks, 2009)

The Largest Component in an Inhomogeneous Random Intersection Graph with Clustering. - Mindaugas Bloznelis (Electron. J. Comb., 2010)

A random intersection digraph: Indegree and outdegree distributions. - Mindaugas Bloznelis (Discret. Math., 2010)

Component Evolution in General Random Intersection Graphs. - Mindaugas Bloznelis (SIAM J. Discret. Math., 2010)

Clustering function: a measure of social influence - Mindaugas Bloznelis; Valentas Kurauskas (CoRR, 2012)

Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph. - Mindaugas Bloznelis; Friedrich Götze; Jerzy Jaworski (J. Appl. Probab., 2012)

Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs. - Mindaugas Bloznelis; Erhard Godehardt; Jerzy Jaworski; Valentas Kurauskas; Katarzyna Rybarczyk (ECDA, 2013)

Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs. - Mindaugas Bloznelis; Erhard Godehardt; Jerzy Jaworski; Valentas Kurauskas; Katarzyna Rybarczyk (ECDA, 2013)

Degree Distribution of an Inhomogeneous Random Intersection Graph. - Mindaugas Bloznelis; Julius Damarackas (Electron. J. Comb., 2013)

k-connectivity of uniform s-intersection graphs. - Mindaugas Bloznelis; Katarzyna Rybarczyk (Discret. Math., 2014)

Random Intersection Graph Process. - Mindaugas Bloznelis; Michal Karonski (Internet Math., 2015)

Diclique Clustering in a Directed Random Graph. - Mindaugas Bloznelis; Lasse Leskelä (WAW, 2016)

Clustering function: another view on clustering coefficient. - Mindaugas Bloznelis; Valentas Kurauskas (J. Complex Networks, 2016)

Correlation Between Clustering and Degree in Affiliation Networks. - Mindaugas Bloznelis; Justinas Petuchovas (WAW, 2017)

Large Cliques in Sparse Random Intersection Graphs. - Mindaugas Bloznelis; Valentas Kurauskas (Electron. J. Comb., 2017)

Degree-degree distribution in a power law random intersection graph with clustering. - Mindaugas Bloznelis (Internet Math., 2017)

The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs. - Mindaugas Bloznelis; Jerzy Jaworski (WAW, 2018)

Clustering Coefficient of a Preferred Attachment Affiliation Network. - Daumilas Ardickas; Mindaugas Bloznelis (WAW, 2020)

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions. - Mindaugas Bloznelis; Joona Karjalainen; Lasse Leskelä (WAW, 2020)

A Note on the Conductance of the Binomial Random Intersection Graph. - Katarzyna Rybarczyk; Mindaugas Bloznelis; Jerzy Jaworski (WAW, 2020)

The Cover Time of a Random Walk in Affiliation Networks. - Mindaugas Bloznelis; Jerzy Jaworski; Katarzyna Rybarczyk (IEEE Trans. Inf. Theory, 2022)

Clustering and percolation on superpositions of Bernoulli random graphs. - Mindaugas Bloznelis; Lasse Leskelä (Random Struct. Algorithms, 2023)

Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs. - Mindaugas Bloznelis; Joona Karjalainen; Lasse Leskelä (J. Appl. Probab., 2024)

k-Connectivity Threshold for Superpositions of Bernoulli Random Graphs. - Daumilas Ardickas; Mindaugas Bloznelis; Rimantas Vaicekauskas (WAW, 2025)

Two models of sparse and clustered dynamic networks. - Mindaugas Bloznelis; Dominykas Marma (J. Complex Networks, 2025)