7 citations · 14 across the 15 of their papers we have counts for
3 papers · 1 filter
The diameter of uniform spanning trees in high dimensions
Peleg Michaeli, Asaf Nachmias, Matan Shalev
We show that the diameter of a uniformly drawn spanning tree of a connected graph on vertices which satisfies certain high-dimensionality conditions typically grows like $Θ(\sq…
Thresholds in random motif graphs
Michael Anastos, Peleg Michaeli, Samantha Petti
We introduce a natural generalization of the Erdős-Rényi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H…
Greedy maximal independent sets via local limits
Michael Krivelevich, Tamás Mészáros, Peleg Michaeli +1
The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the c…