A phase transition in Erdos-Barak random graphs

Abstract

We study monotone paths in Erdos-R\'enyi random graphs on numbered vertices. Benjamini & Tzalik established a phase transition at p = nn for this model. We refine the critical value to p = n - n n and identify the critical window of order (1/n).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…