Aleksa Milojević

activity

20242026

collaborators

16 papers

math.PR2026

Distinguishability threshold for random geometric graphs

Zach Hunter, Aleksa MilojeviÄ, Benny Sudakov

The spherical random geometric graph $G (n, d, p)$ is obtained by sampling $n$ independent points uniformly on the unit sphere $S^{d - 1} \subseteq R^{d}$ and joining pair…

math.CO2026

Nearly tight bounds for induced subdivisions

Zach Hunter, Aleksa MilojeviÄ, Patryk Morawski +1

Subdivisions of complete graphs play a central role in combinatorics, having deep connections to structural, extremal, and topological aspects of graph theory. A celebrated conject…

math.PR2026

On the Probability a Weighted Bernoulli Sum Exceeds Its Mean

Aleksa Milojevic, Benny Sudakov

Let $w_{1}, \dots, w_{m}$ be positive real weights whose sum is $1$ , and let $v_{1}, \dots, v_{m}$ be i.i.d. Bernoulli $(p)$ random variables. If we let $X = \sum_{i = 1}^{m} w_{i} v_{i}$ , then we co…

math.CO2026

Gaussian random graphs and Ramsey numbers

Zach Hunter, Aleksa MilojeviÄ, Benny Sudakov

We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction bas…

cs.CC2026

Communication Complexity of Disjointness under Product Distributions

Zach Hunter, Aleksa MilojeviÄ, Benny Sudakov +1

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of B…

math.CO2026

Universality for transversal Hamilton cycles in random graphs

Micha Christoph, Anders Martinsson, Aleksa MilojeviÄ

A tuple $(G_{1}, \dots, G_{n})$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $I ¨ : [n] \to [n]$ there exists a Hamilton cycle whose $i$ -th…