Sahar Diskin

collaborators

13 papers

math.PR2026

Diameter and mixing time of the giant component in the percolated hypercube

Michael Anastos, Sahar Diskin, Lyuben Lichev +1

We consider bond percolation on the $d$ -dimensional binary hypercube with $p = c / d$ for fixed $c > 1$ . We prove that the typical diameter of the giant component $L_{1}$ is of order $Î(d…

math.CO2026

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes

Micha Christoph, Sahar Diskin, Lyuben Lichev +1

We study the edge-expansion of the graph of a random $0/1$ polytope $P_{p}^{d}$ , defined as the convex hull of a random subset of the points in ${0, 1}^{d}$ where every point is retaine…

math.CO2026

Supercritical Site Percolation on Regular Graphs

Sahar Diskin, Michael Krivelevich, Itay Markbreit

We consider site (vertex) percolation on $d$ -regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergen…

math.PR2026

Supercritical sharpness of percolation

Sahar Diskin, Philip Easo, Ritvik Ramanan Radhakrishnan +2

We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentiall…

math.CO2025

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree

Sahar Diskin, Michael Krivelevich

We provide sufficient conditions for a regular graph $G$ of growing degree $d$ , guaranteeing a phase transition in its random subgraph $G_{p}$ similar to that of $G (n, p)$ when $p\cdo…

math.CO2025

Saturation in Random Hypergraphs

Sahar Diskin, Ilay Hoshen, DÃ¡niel KorÃ¡ndi +2

Let $K_{n}^{r}$ be the complete $r$ -uniform hypergraph on $n$ vertices, that is, the hypergraph whose vertex set is $[n] := {1, 2, ..., n}$ and whose edge set is $(r [ n ])$ . We form…