3 citations · 10 across the 25 of their papers we have counts for
5 papers · 2 filters
Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
Sahar Diskin, Joshua Erde, Mihyun Kang +1
Given a graph and , the random subgraph is obtained by retaining each edge of independently with probability . We show that for every , there exis…
Long cycles in percolated expanders
Maurício Collares, Sahar Diskin, Joshua Erde +1
Given a graph and probability , we form the random subgraph by retaining each edge of independently with probability . Given and constants $0<c…
Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
Maurício Collares, Joshua Erde, Anna Geisler +1
Majority bootstrap percolation is a monotone cellular automaton that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new v…
The evolution of the permutahedron
Maurício Collares, Joseph Doolittle, Joshua Erde
In their seminal paper introducing the theory of random graphs, Erdős and Rényi considered the evolution of the structure of a random subgraph of as the density increases fro…
Matchings in the hypercube with specified edges
Joshua Erde
Given a matching in the hypercube , the \emph{profile} of is the vector such that contains edges whose en…