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 2025Show all

6 papers · 1 filter

math.PR2025

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)…

math.CO2025

Cycle lengths in the percolated hypercube

Michael Anastos, Sahar Diskin, Joshua Erde +3

Let be the random subgraph of the -dimensional binary hypercube obtained after edge-percolation with probability . It was shown recently by the authors that, for ever…

math.CO2025

A large hole in pseudo-random graphs

Sahar Diskin, Michael Krivelevich, Itay Markbreit +1

We show that there exist constants such that if is an -graph with , then contains an induced cycle of length at least . We further d…

math.CO2025

Spanning trees of bounded degree in random geometric graphs

Michael Anastos, Sahar Diskin, Dawid Ignasiak +2

We determine the sharp threshold for the containment of all -vertex trees of bounded degree in random geometric graphs with vertices. This provides a geometric counterpart o…

math.CO2025

Nearly spanning cycle in the percolated hypercube

Michael Anastos, Sahar Diskin, Joshua Erde +3

Let be the -dimensional binary hypercube. We form a random subgraph by retaining each edge of independently with probability . We show that,…

math.CO2025

Universality of the matching number in percolated regular graphs

Sahar Diskin, Mihyun Kang, Lyuben Lichev

Fix a sequence of -regular graphs and denote by the graph obtained from after edge-percolation with probability , for a constant…