default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMindaugas Bloznelis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs. J. Appl. Probab. 61(2): 401-419 (2024)- 2023
- [j14]Mindaugas Bloznelis, Lasse Leskelä:
Clustering and percolation on superpositions of Bernoulli random graphs. Random Struct. Algorithms 63(2): 283-342 (2023) - 2022
- [j13]Mindaugas Bloznelis, Jerzy Jaworski
, Katarzyna Rybarczyk:
The Cover Time of a Random Walk in Affiliation Networks. IEEE Trans. Inf. Theory 68(9): 6134-6150 (2022) - 2021
- [i5]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs. CoRR abs/2107.02683 (2021) - 2020
- [c10]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions. WAW 2020: 68-81 - [c9]Daumilas Ardickas, Mindaugas Bloznelis:
Clustering Coefficient of a Preferred Attachment Affiliation Network. WAW 2020: 82-95 - [c8]Katarzyna Rybarczyk, Mindaugas Bloznelis, Jerzy Jaworski:
A Note on the Conductance of the Binomial Random Intersection Graph. WAW 2020: 124-134 - [i4]Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä:
Assortativity and bidegree distributions on Bernoulli random graph superpositions. CoRR abs/2002.11809 (2020)
2010 – 2019
- 2018
- [c7]Mindaugas Bloznelis, Jerzy Jaworski:
The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs. WAW 2018: 16-29 - [i3]Mindaugas Bloznelis, Justinas Petuchovas:
Correlation between clustering and degree in affiliation networks. CoRR abs/1801.01521 (2018) - 2017
- [j12]Mindaugas Bloznelis, Valentas Kurauskas:
Large Cliques in Sparse Random Intersection Graphs. Electron. J. Comb. 24(2): 2 (2017) - [j11]Mindaugas Bloznelis:
Degree-degree distribution in a power law random intersection graph with clustering. Internet Math. 2017 (2017) - [c6]Mindaugas Bloznelis, Justinas Petuchovas:
Correlation Between Clustering and Degree in Affiliation Networks. WAW 2017: 90-104 - 2016
- [j10]Mindaugas Bloznelis, Valentas Kurauskas:
Clustering function: another view on clustering coefficient. J. Complex Networks 4(1): 61-86 (2016) - [c5]Mindaugas Bloznelis, Lasse Leskelä:
Diclique Clustering in a Directed Random Graph. WAW 2016: 22-33 - [i2]Mindaugas Bloznelis, Lasse Leskelä:
Diclique clustering in a directed random graph. CoRR abs/1607.02278 (2016) - 2015
- [j9]Mindaugas Bloznelis, Michal Karonski:
Random Intersection Graph Process. Internet Math. 11(4-5): 385-402 (2015) - [c4]Mindaugas Bloznelis:
Degree-Degree Distribution in a Power Law Random Intersection Graph with Clustering. WAW 2015: 42-53 - 2014
- [j8]Mindaugas Bloznelis, Katarzyna Rybarczyk:
k-connectivity of uniform s-intersection graphs. Discret. Math. 333: 94-100 (2014) - 2013
- [j7]Mindaugas Bloznelis, Julius Damarackas:
Degree Distribution of an Inhomogeneous Random Intersection Graph. Electron. J. Comb. 20(3): 3 (2013) - [c3]Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, Katarzyna Rybarczyk:
Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs. ECDA 2013: 69-78 - [c2]Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, Katarzyna Rybarczyk:
Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs. ECDA 2013: 79-88 - [c1]Mindaugas Bloznelis, Michal Karonski:
Random Intersection Graph Process. WAW 2013: 93-105 - 2012
- [j6]Mindaugas Bloznelis, Friedrich Götze, Jerzy Jaworski:
Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph. J. Appl. Probab. 49(3): 601-611 (2012) - [i1]Mindaugas Bloznelis, Valentas Kurauskas:
Clustering function: a measure of social influence. CoRR abs/1207.4941 (2012) - 2010
- [j5]Mindaugas Bloznelis:
The Largest Component in an Inhomogeneous Random Intersection Graph with Clustering. Electron. J. Comb. 17(1) (2010) - [j4]Mindaugas Bloznelis:
A random intersection digraph: Indegree and outdegree distributions. Discret. Math. 310(19): 2560-2566 (2010) - [j3]Mindaugas Bloznelis:
Component Evolution in General Random Intersection Graphs. SIAM J. Discret. Math. 24(2): 639-654 (2010)
2000 – 2009
- 2009
- [j2]Mindaugas Bloznelis, Jerzy Jaworski, Katarzyna Rybarczyk:
Component evolution in a secure wireless sensor network. Networks 53(1): 19-26 (2009) - 2005
- [j1]Mindaugas Bloznelis:
Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations. Comb. Probab. Comput. 14(3): 249-268 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
