Papers
Topics
Authors
Recent
Search
2000 character limit reached

Twin-width of random graphs

Published 15 Dec 2022 in math.CO and cs.DM | (2212.07880v2)

Abstract: We investigate the twin-width of the Erd\H{o}s-R\'enyi random graph G(n,p)G(n,p). We unveil a surprising behavior of this parameter by showing the existence of a constant p∗≈0.4p^*\approx 0.4 such that with high probability, when p∗≤p≤1−p∗p^*\le p\le 1-p^*, the twin-width is asymptotically $2p(1-p)n$, whereas, when 0<p<p∗0<p<p^* or 1>p>1−p∗1>p>1-p^*, the twin-width is significantly higher than $2p(1-p)n$. In addition, we show that the twin-width of G(n,1/2)G(n,1/2) is concentrated around n/2−3nlog⁡n/2n/2 - \sqrt{3n \log n}/2 within an interval of length o(nlog⁡n)o(\sqrt{n\log n}). For the sparse random graph, we show that with high probability, the twin-width of G(n,p)G(n,p) is Θ(np)\Theta(n\sqrt{p}) when (726ln⁡n)/n≤p≤1/2(726\ln n)/n\leq p\leq1/2.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.