Peleg Michaeli

Peleg Michaeli
Department of Mathematical Sciences
Mellon College of Science
Carnegie Mellon University
Pittsburgh, PA 15213
E-mail: pelegm@cmu.edu
Office: Wean Hall 7126

About

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. My Erdős number is 2.

Curriculum Vitae available here.

Publications

• Tarun Krishna, Peleg Michaeli, Michail Sarantis, Fenglin Wang and Yiqing Wang Discrepancies of subtrees, preprint.
• Alan Frieze and Peleg Michaeli, Karp's patching algorithm on random perturbations of dense digraphs, preprint.
• Alan Frieze, Michael Krivelevich and Peleg Michaeli, Fast construction on a restricted budget, preprint.
• Lior Gishboliner, Michael Krivelevich and Peleg Michaeli, Oriented discrepancy of Hamilton cycles, to appear in Journal of Graph Theory.
• Lior Gishboliner, Michael Krivelevich and Peleg Michaeli, Discrepancies of spanning trees and Hamilton cycles, Journal of Combinatorial Theory. Series B 154 (2022), 262–291. MR4374842
• Yahav Alon, Michael Krivelevich and Peleg Michaeli, Spanning trees at the connectivity threshold, preprint.
• Lior Gishboliner, Michael Krivelevich and Peleg Michaeli, Colour-biased Hamilton cycles in random graphs. Random Structures & Algorithms 60 (2022), no. 3, 289–307. MR4388697
• Peleg Michaeli, Asaf Nachmias and Matan Shalev, The diameter of uniform spanning trees in high dimensions, Probability Theory and Related Fields 179 (2021), no.1–2, 261–294. Zbl 07329437, MR4221658
• Michael Anastos, Peleg Michaeli and Samantha Petti, Thresholds in Random Motif Graphs, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), pp. 66:1–66:19. MR4012716
• Michael Krivelevich, Tamás Mészáros, Peleg Michaeli and Clara Shikhelman, Greedy maximal independent sets via local limits, 31th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020), pp. 20:1-20:19.
• Michael Krivelevich and Peleg Michaeli, Small subgraphs in the trace of a random walk, Electronic Journal of Combinatorics 24 (2017), no. 1, Paper 28. Zbl 1355.05232, MR3625905
• Alan Frieze, Michael Krivelevich, Peleg Michaeli and Ron Peled, On the trace of random walks on random graphs, Proceedings of the London Mathematical Society. Third Series 116 (2018), no. 4, 847-877. Zbl 1386.05181, MR3789834

Coauthors

Teaching

• Matrix Algebra with Applications 21240 Spring 2023 TAs: Ryan Duan, Michael Sarantis
• Combinatorics 21301 Fall 2022 TA: Anish Sevekari
• Matrix Algebra with Applications 21240 Spring 2022 TAs: Wendy Li, Michael Sarantis
• Matrix Algebra with Applications 21240 Fall 2021 TAs: Hwankyu Song, Noah Josef Abou El Wafa

Links

• arXiv: [math] [math.CO] [math.PR] [a/michaeli_p_1]
• MathSciNet [MR Author ID: 1203818]
• zbMATH [ai:michaeli.peleg]
• dblp [196/4536]
• ORCID [0000-0002-2695-4609]
• Google Scholar [My profile]
• Semantic Scholar [39607438]
• publons [ResearcherID J-7862-2015]
• Mathematics Genealogy Project [282811]
• Mathematical Subject Classification
• Journal ranking: InCites, SJR
• Israel Mathematical Union (IMU)
• MathOverflow, Mathematics Stack Exchange
• PKP, The Cost of Knowledge