Cycle lengths in sparse random graphs
Yahav Alon, Michael Krivelevich, Eyal Lubetzky

TL;DR
This paper investigates the distribution of cycle lengths in sparse random graphs, deriving explicit probabilities for the presence of entire ranges of cycle lengths in various models, including regular, Erdős–Rényi, and directed graphs.
Contribution
It provides explicit limiting probabilities for the occurrence of large cycle ranges in different sparse random graph models, extending classical results.
Findings
Probability of full cycle range in regular graphs approaches 1 as range length increases.
Analogous results hold for Erdős–Rényi graphs with fixed average degree.
Identification of cycle length intervals in supercritical regimes.
Abstract
We study the set of lengths of all cycles that appear in a random -regular on vertices for a fixed , as well as in Erd\H{o}s--R\'enyi random graphs on vertices with a fixed average degree . Fundamental results on the distribution of cycle counts in these models were established in the 1980's and early 1990's, with a focus on the extreme lengths: cycles of fixed length, and cycles of length linear in . Here we derive, for a random -regular graph, the limiting probability that simultaneously contains the entire range for , as an explicit expression which goes to as . For the random graph with , where for some absolute constant , we show the analogous result for the range…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
