Julien Portier

collaborators

2 papers

math.CO2024

Packing and finding paths in sparse random graphs

Vesna Iršič, Julien Portier, Leo Versteegen

Let $G \sim G (n, p)$ be a (hidden) Erdős-Rényi random graph with $p = (1 + ε) / n$ for some fixed constant $ε > 0$ . Ferber, Krivelevich, Sudakov, and Vieira showed tha…

math.CO2023

Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem

Lawrence Hollom, Julien Portier

In this paper we prove that $P (∣ X ∣ \geq Var (X)) \geq 7/32$ for every finite Rademacher sum $X$ , confirming a conjecture by Hitczenko and Kwapie{ń} from 1994,…