3 citations · 6 across the 26 of their papers we have counts for
5 papers · 1 filter
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 decays exponentiall…
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 -dimensional binary hypercube with for fixed . We prove that the typical diameter of the giant component is of order $Θ(d)…
Hitting time of connectedness in the random hypercube process
Sahar Diskin, Michael Krivelevich
We present a short and self-contained proof of a classical result due to Bollobás (1990): in the random hypercube process, with high probability the hitting time of connectedness e…
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…
Supercritical Site Percolation on the Hypercube: Small Components are Small
Sahar Diskin, Michael Krivelevich
We consider supercritical site percolation on the -dimensional hypercube . We show that typically all components in the percolated hypercube, besides the giant, are of size…