activity
20102026
most citedAssortativity and clustering of sparse random intersection graphs

45 citations · 55 across the 13 of their papers we have counts for

collaborators
Showing math.PRShow all

5 papers · 1 filter

math.PR2026

An asymptotically optimal bound for the concentration function of a sum of independent integer random variables

Valentas Kurauskas

For a random variable define . Let be independent integer random variables. Suppose …

math.PR2023

Anticoncentration of random vectors via the strong perfect graph theorem

Tomas Juškevičius, Valentas Kurauskas

In this paper we give anticoncentration bounds for sums of independent random vectors in finite-dimensional vector spaces. In particular, we asymptotically establish a conjecture o…

math.PR2019★ 1 cited

On Littlewood-Offord theory for arbitrary distributions

Tomas Juškevičius, Valentas Kurauskas

Let be independent identically distributed random vectors in . We consider upper bounds on under various…

math.PR2015★ 1 cited

On local weak limit and subgraph counts for sparse random graphs

Valentas Kurauskas

We use an inequality of Sidorenko to show a general relation between local and global subgraph counts and degree moments for locally weakly convergent sequences of sparse random gr…

math.PR2012★ 45 cited

Assortativity and clustering of sparse random intersection graphs

Mindaugas Bloznelis, Jerzy Jaworski, Valentas Kurauskas

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptoti…