Peleg Michaeli

Peleg Michaeli
Mathematical Institute
University of Oxford
Oxford, UK
E-mail: peleg.michaeli@maths.ox.ac.uk
Office: Andrew Wiles Building, N3.03

About

I am currently a Postdoctoral Research Associate in the Combinatorics group at the University of Oxford, supervised by Peter Keevash. My research interests are in extremal and probabilitic combinatorics, as well as in discrete probability. Previously, I served as a Postdoctoral Associate at Carnegie Mellon University. I completed my PhD at Tel Aviv University under the joint supervision of Michael Krivelevich and Asaf Nachmias. Prior to that, I earned my MSc at Tel Aviv University, also under the supervision of Michael Krivelevich. My Erdős number is 2.

Curriculum Vitae available here.

Publications

Preprints

• Rigid partitions: from high connectivity to random graphs, with Michael Krivelevich and Alan Lew (2023).
• Karp's patching algorithm on random perturbations of dense digraphs, with Alan Frieze (2022).
• Fast construction on a restricted budget, with Alan Frieze and Michael Krivelevich (2022).

Accepted

• Discrepancies of subtrees, with Tarun Krishna, Michail Sarantis, Fenglin Wang and Yiqing Wang (2023).
  Accepted for publication in "Graphs and Combinatorial Optimization: from Theory to Applications".

Journal papers

• Oriented discrepancy of Hamilton cycles, with Lior Gishboliner and Michael Krivelevich, JGT (2023).
  [arXiv:2203.07148 | Zbl 1522.05261 | MR4606422]
• Discrepancies of spanning trees and Hamilton cycles, with Lior Gishboliner and Michael Krivelevich, JCTB (2022).
  [arXiv:2012.05155 | Zbl 1483.05088 | MR4374842]
• Spanning trees at the connectivity threshold, with Yahav Alon and Michael Krivelevich, SIDMA (2022).
  [arXiv:2010.15519 | Zbl 1493.0517 | MR4450290]
• Color-biased Hamilton cycles in random graphs, with Lior Gishboliner and Michael Krivelevich, RSA (2022).
  [arXiv:2007.12111 | Zbl 1522.05262 | MR4388697]
• The diameter of uniform spanning trees in high dimensions, with Asaf Nachmias and Matan Shalev, PTRF (2021).
  [arXiv:1911.12319 | Zbl 1460.05057 | MR4221658]
• Greedy maximal independent sets via local limits, with Michael Krivelevich, Tamás Mészáros and Clara Shikhelman, RSA (2023+).
  [arXiv:1907.07216]
• Small subgraphs in the trace of a random walk, with Michael Krivelevich, E-JC (2017).
  [arXiv:1605.04585 | Zbl 1355.05232 | MR3625905]
• On the trace of random walks on random graphs, with Alan Frieze, Michael Krivelevich and Ron Peled, PLMS (2019).
  [arXiv:1508.07355 | Zbl 1386.05181 | MR3789834]

Conference papers

• Thresholds in random motif graphs, with Michael Anastos and Samantha Petti, APPROX/RANDOM 2019.
  [arXiv:1907.12043 | Zbl 2052187 | MR4012716]
• Greedy maximal independent sets via local limits (extended abstract), with Michael Krivelevich, Tamás Mészáros and Clara Shikhelman, AofA 2020.
  [arXiv:1907.07216 | Zbl 07651059 | MR4116413]

Coauthors

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]
• Mathematical Subject Classification
• Journal ranking: InCites, SJR
• Israel Mathematical Union (IMU)
• MathOverflow, Mathematics Stack Exchange
• PKP, The Cost of Knowledge