R. Berkowitz

activity

20162026

most citedA Local Limit Theorem for Cliques in G(n,p)

5 citations · 13 across the 7 of their papers we have counts for

collaborators

9 papers

math.PR2026

Anti-concentration with respect to random permutations

Aaron Berger, Ross Berkowitz, Pat Devlin +1

Classical anti-concentration results focus on the random sum $S := \sum_{i = 1}^{n} ξ_{i} v_{i}$ , where $ξ_{i}$ are independent random variables and $v_{i}$ are real numbers. In this paper, w…

math.PR2020

Central Limit Theorem for Majority Dynamics: Bribing Three Voters Suffices

Ross Berkowitz, Pat Devlin

Given a graph $G$ and some initial labelling $σ : V (G) \to {R e d, B l u e}$ of its vertices, the \textit{majority dynamics model} is the deterministic process where at each stage, eve…

math.CO2019★ 2 cited

Number of arithmetic progressions in dense random subsets of $Z / n Z$

Ross Berkowitz, Ashwin Sah, Mehtaab Sawhney

We examine the behavior of the number of $k$ -term arithmetic progressions in a random subset of $Z / n Z$ . We prove that if a set is chosen by including each element…

math.CO2019

Connected-Intersecting Families of Graphs

Aaron Berger, Ross Berkowitz, Pat Devlin +4

For a graph property $P$ and a common vertex set $V = {1, 2, \dots, n}$ , a family of graphs on $V$ is \emph{ $P$ -intersecting} iff $G \cap H$ satisfies $\math…

math.CO2018★ 5 cited

A Local Limit Theorem for Cliques in G(n,p)

Ross Berkowitz

We prove a local limit theorem the number of $r$ -cliques in $G (n, p)$ for $p \in (0, 1)$ and $r \geq 3$ fixed constants. Our bounds hold in both the $ℓ^{\infty}$ and $ℓ^{1}$ metric. Th…

math.CO2018★ 2 cited

Expected Chromatic Number of Random Subgraphs

Ross Berkowitz, Pat Devlin, Catherine Lee +2

Given a graph $G$ and $p \in [0, 1]$ , let $G_{p}$ denote the random subgraph of $G$ obtained by keeping each edge independently with probability $p$ . Alon, Krivelevich, and Sudokov pr…