J. Sahasrabudhe

activity

20112026

most citedCentral limit theorems and the geometry of polynomials

16 citations · 33 across the 22 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.NT2018★ 1 cited

On the Erdős Covering Problem: the density of the uncovered set

Paul Balister, Béla Bollobás, Robert Morris +2

Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and nume…

math.PR2018

Central limit theorems from the roots of probability generating functions

Marcus Michelen, Julian Sahasrabudhe

For each $n$ , let $X_{n} \in {0, \dots, n}$ be a random variable with mean $μ_{n}$ , standard deviation $σ_{n}$ , and let \[ P_n(z) = \sum_{k=0}^n \mathbb{P}( X_n = k) z^k ,\] be its prob…

math.CO2018

Dense Subgraphs in Random Graphs

Paul Balister, Béla Bollobás, Julian Sahasrabudhe +1

For a constant $γ \in [0, 1]$ and a graph $G$ , let $ω_{γ} (G)$ be the largest integer $k$ for which there exists a $k$ -vertex subgraph of $G$ with at least $γ (2 k)$ edges. We show…