45 citations · 55 across the 13 of their papers we have counts for
14 papers
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 …
Rearrangements of distributions on integers that minimize variance
Aistis Atminas, Valentas Kurauskas
Which permutations of a probability distribution on integers minimize variance? Let be a random variable on a set of integers such that $\mathbb{P}(X_i =…
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…
A note on estimating global subgraph counts by sampling
Svante Janson, Valentas Kurauskas
We give a simple proof of a generalization of an inequality for homomorphism counts by Sidorenko (1994). A special case of our inequality says that if denotes the degree of a…
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…
Symmetric road interchanges
Valentas Kurauskas, Ugnė Šiurienė
A road interchange where roads meet and in which the drivers are not allowed to change lanes can be modelled as an embedding of a 2-coloured (hence bipartite) multigraph wi…
On the genus of the complete tripartite graph
Valentas Kurauskas
For even we prove that the genus of the complete tripartite graph is . This is the least number of bridges needed to build a complete $…
Clustering coefficient of random intersection graphs with infinite degree variance
Mindaugas Bloznelis, Valentas Kurauskas
For a random intersection graph with a power law degree sequence having a finite mean and an infinite variance we show that the global clustering coefficient admits a tunable asymp…
On graphs containing few disjoint excluded minors. Asymptotic number and structure of graphs containing few disjoint minors K4
Valentas Kurauskas
Let be a minor-closed class of graphs with a set of minimal excluded minors. We study (a) the asymptotic number of graphs without di…
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…
Large cliques in sparse random intersection graphs
Mindaugas Bloznelis, Valentas Kurauskas
Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_…
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…
Clustering function: a measure of social influence
Mindaugas Bloznelis, Valentas Kurauskas
A commonly used characteristic of statistical dependence of adjacency relations in real networks, the clustering coefficient, evaluates chances that two neighbours of a given verte…
Random graphs with few disjoint cycles
Valentas Kurauskas, Colin McDiarmid
The classical Erdős-Pósa theorem states that for each positive integer k there is an f(k) such that, in each graph G which does not have k+1 disjoint cycles, there is a blocker of…