Peleg Michaeli @ Carnegie Mellon University
Department of Mathematical Sciences
Carnegie Mellon University
Pittsburgh, PA 15213
Wean Hall 7126
I am currently a Postdoctoral Associate at CMU, working in the fields of
combinatorics and probability.
I completed my PhD at Tel Aviv University under the joint supervision of
Prof. Michael Krivelevich
and Prof. Asaf Nachmias.
Before that, I completed my MSc at Tel Aviv University under the supervision of
Prof. Michael Krivelevich.
My research interests include random trees, random graphs, random walks on
graphs and extremal graph theory.
Erdős number is
Curriculum Vitae available here.
Discrepancies of spanning trees and Hamilton cycles,
Spanning trees at the connectivity threshold,
Colour-biased Hamilton cycles in random graphs.
To appear in "Random Structures and Algorithms".
The diameter of uniform spanning trees in high dimensions,
Probability Theory and Related Fields 179 (2021), no.1–2, 261–294.
Greedy maximal independent sets via local limits,
31th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms (AofA 2020),
Peleg Michaeli and
Thresholds in Random Motif Graphs,
Approximation, Randomization, and Combinatorial Optimization.
Algorithms and Techniques (APPROX/RANDOM 2019), pp. 66:1–66:19.
Small subgraphs in the trace of a random walk,
Electronic Journal of Combinatorics 24
no. 1, Paper 28.
On the trace of random walks on random graphs,
Proceedings of the London Mathematical Society.
Third Series 116
no. 4, 847-877.
Matrix Algebra with Applications
Hwankyu Song, Noah Josef About El Wafa