33 citations · 133 across the 43 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.PR2013★ 5 cited
The power of 2 choices over preferential attachment
Yury Malyshkin, Elliot Paquette
We introduce a new type of preferential attachment tree that includes choices in its evolution, like with Achlioptas processes. At each step in the growth of the graph, a new verte…
math.AT2013
The threshold for integer homology in random d-complexes
Christopher Hoffman, Matthew Kahle, Elliot Paquette
Let Y ~ Y_d(n,p) denote the Bernoulli random d-dimensional simplicial complex. We answer a question of Linial and Meshulam from 2003, showing that the threshold for vanishing of ho…
math.PR2013★ 1 cited
Quantitative Small Subgraph Conditioning
Tobias Johnson, Elliot Paquette
We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for ra…