Sahar Diskin

activity

20212026

most citedPercolation on Irregular High-dimensional Product Graphs

3 citations · 6 across the 26 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

Climbing up a random subgraph of the hypercube

Michael Anastos, Sahar Diskin, Dor Elboim +1

Let $Q^{d}$ be the $d$ -dimensional binary hypercube. We say that $P = {v_{1}, \dots, v_{k}}$ is an increasing path of length $k - 1$ in $Q^{d}$ , if for every $i \in [k - 1]$ the edge $v_iv_{i+1…

math.CO2023

Percolation through Isoperimetry

Sahar Diskin, Joshua Erde, Mihyun Kang +1

We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$ , under which the random subgraph $G_{p}$ typically undergoes a phase tr…

math.PR2023

Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs

Sahar Diskin, Joshua Erde, Mihyun Kang +1

It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these…

math.CO2023

A Jump of the Saturation Number in Random Graphs?

Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii

For graphs $G$ and $F$ , the saturation number $sat (G, F)$ is the minimum number of edges in an inclusion-maximal $F$ -free subgraph of $G$ . In 2017, Korándi and Sudakov init…