5 citations · 32 across the 42 of their papers we have counts for
52 papers
Optimally building spanning graphs in semirandom graph processes
Michael Anastos, Maurício Collares, Joshua Erde +3
The semirandom graph process constructs a graph in a series of rounds, starting with the empty graph on vertices. In each round, a player is offered a vertex chosen uni…
Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
Maurício Collares, Joshua Erde, Anna Geisler +1
Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their ne…
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…
A short proof of a central limit theorem for the order of the giant component and -core
Michael Anastos, Joshua Erde, Mihyun Kang +1
In this note we outline a new and simple approach to proving central limit theorems for various 'global' graph parameters which have robust 'local' approximations, using the Efron-…
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,…
Counting independent sets in expanding bipartite regular graphs
Maurício Collares, Joshua Erde, Anna Geisler +1
In this paper we provide an asymptotic expansion for the number of independent sets in a general class of regular, bipartite graphs satisfying some vertex-expansion properties, ext…