The phase transition in random graphs: A simple proof

@article{Krivelevich2013ThePT,
title={The phase transition in random graphs: A simple proof},
author={Michael Krivelevich and Benny Sudakov},
journal={Random Structures \& Algorithms},
year={2013},
volume={43}
}
• Published 31 January 2012
• Mathematics
• Random Structures & Algorithms
The classical result of Erdős and Rényi asserts that the random graph G(n,p) experiences sharp phase transition around \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath}\pagestyle{empty}\begin{document}\begin{align*}p=\frac{1}{n}\end{align*} \end{document} – for any ε > 0 and \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath}\pagestyle{empty}\begin{document}\begin{align*}p=\frac{1-\epsilon}{n}\end{align*} \end{document}, all connected components of G(n,p) are…
113 Citations

Sandwiching dense random regular graphs between binomial random graphs

• Art
Probability Theory and Related Fields
• 2022
Kim and Vu made the following conjecture (Advances in Mathematics, 2004): if d≫logn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb}

The phase transition in the multi-type binomial random graph $G(\mathbf{n},P)$

• Mathematics, Computer Science
• 2014
We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$

Short proofs for long induced paths

• Mathematics, Computer Science
Comb. Probab. Comput.
• 2022
A modification of the Depth first search algorithm, suited for finding long induced paths, is presented, and the induced size-Ramsey number of paths satisfies, giving an explicit constant in the linear bound.

On Coloring Random Subgraphs of a Fixed Graph

It is shown that for any graph $G$ with chromatic number k = \chi(G) and independence number O(n/k) it holds that $\mathbb{E}[G_{1/2})] \geq \Omega \left( k/\log(k) \right)$, which gives a positive answer to the question of Bukh for a large family of graphs.

The Phase Transition in Multitype Binomial Random Graphs

• Mathematics, Computer Science
SIAM J. Discret. Math.
• 2015
We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$

Ramsey goodness of trees in random graphs

• Mathematics
Random Structures &amp; Algorithms
• 2022
We say that a graph $G$ is Ramsey for $H_1$ versus $H_2$, and write $G \to (H_1,H_2)$, if every red-blue colouring of the edges of $G$ contains either a red copy of $H_1$ or a blue copy of $H_2$. In

The Phase Transition in Site Percolation on Pseudo-Random Graphs

The existence of the phase transition in site percolation on pseudo-random $d$-regular graphs is established and typically $R$ contains a connected component of size at least $\frac{\epsilon n}{d}$ and a path of length proportional to the eigenvalue ratio.

Sandwiching random regular graphs between binomial random graphs

• Mathematics, Computer Science
SODA
• 2020

Largest Components in Random Hypergraphs

• Mathematics
Combinatorics, Probability and Computing
• 2018
It is shown that the existence of a j-tuple-connected component containing Θ(nj) j-sets undergoes a phase transition and the threshold occurs at edge probability, which controls the structure of the component grown in the search process.

References

SHOWING 1-10 OF 18 REFERENCES

The Transitive Closure of a Random Digraph

• R. Karp
• Mathematics
Random Struct. Algorithms
• 1990
It is shown that, when n is large and np is equal to a constant c greater than 1, it is very likely that all but one of the strong components are very small, and that the unique large strong component contains about Θ2n vertices, where Θ is the unique root in [0, 1] of the equation.

On the evolution of random graphs

• Mathematics
• 1984
(n) k edges have equal probabilities to be chosen as the next one . We shall 2 study the "evolution" of such a random graph if N is increased . In this investigation we endeavour to find what is the

Long cycles in subgraphs of (pseudo)random directed graphs

• Mathematics
J. Graph Theory
• 2012
This work studies the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles by finding a constant c = c(γ) such that the following holds.

The emergence of a giant component in random subgraphs of pseudo‐random graphs

• Mathematics
Random Struct. Algorithms
• 2004
It is shown that if $\alpha 1$ then G_p contains a unique giant component of size $\Omega(n)$, with all other components of size $O(\log n)$.

Pseudo-random Graphs

• Computer Science
• 2006
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake,

Percolation Beyond $Z^d$, Many Questions And a Few Answers

• Mathematics
• 1996
A comprehensive study of percolation in a more general context than the usual $Z^d$ setting is proposed, with particular focus on Cayley graphs, almost transitive graphs, and planar graphs. Results

The longest path in a random graph

• Mathematics
Comb.
• 1981
A random graph with (1+ε)n/2 edges contains a path of lengthcn. A random directed graph with (1+ε)n edges contains a directed path of lengthcn. This settles a conjecture of Erdõs.

Random graphs

• A. Frieze
• Mathematics, Computer Science
SODA '06
• 2006
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.